Abstract
This paper introduces Teaq, a new peer-to-peer programming model and implementation that places processes into a self-healing, ordered spanning tree, across which distributed object queries are routed. The programmer has control over where in the tree their process resides, how their queries are routed through the tree, and how result objects are generated and passed back to the query initiator. Default implementations are provided that the programmer may specialise. This paper introduces the two main algorithms for maintaining the tree and routing queries. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Evans, H., & Dickman, P. (2002). Peer-to-peer programming with teaq. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2376 LNCS, pp. 289–294). Springer Verlag. https://doi.org/10.1007/3-540-45745-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
