Peer-to-Peer Programming with Teaq

Authors:
Huw Evans;Peter Dickman
Affiliations:
-;-
Venue:
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Year:
2002

Citing 4
Cited 1

Freenet: a distributed anonymous information storage and retrieval system

International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Algorithms and Theory of Computation Handbook

Algorithms and Theory of Computation Handbook
Peer-to-Peer: Harnessing the Power of Disruptive Technologies

Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg

The pervasiveness of evolution in GRUMPS software

Software—Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

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.