Peer-to-Peer Programming with Teaq
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.
KeywordsSpan Tree Query Result Target Process Tree Property Query Event
Unable to display preview. Download preview PDF.
- 1.Mikhail J. Atallah, editor. Algorithms and theory of computation handbook. CRC Press, 2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA, 1999.Google Scholar
- 2.Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hongang. Freenet: A distributed anonymous information storage and retrieval system in designing privacy enhancing technologie. In Hannes Federrath, editor, Designing Privacy Enhancing Technologies, volume 2009 of Lecture Notes in Computer Science, Berkeley, CA, USA, July 2000. Springer-Verlag, Berlin Germany.Google Scholar
- 3.Andy Oram (ed). Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O’Reilly, 2001.Google Scholar
- 4.A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329–350, Heidelberg, Germany, November 2001.Google Scholar
- 5.Stefan Saroiu, P. Krishna Gummadi, and Steven D Gribble. A measurement study of peer-to-peer file sharing systems. Technical report, Department of Computer Science and Engineering, University of Washington, 2002.Google Scholar