Abstract
Many emerging applications of peer-to-peer networking will benefit from new, more appropriate communication primitives at the transport level. This paper presents the design and preliminary implementation of two variants of a novel primitive termed ncast. Unlike conventional multiway communications, the ncast primitives are not based on identity; their semantics specify the number of message deliveries in a given collaborative peer group. Both variants provide a means for fulfilling message delivery quotas in a peer-to-peer network, but they differ in the strength of the semantics they provide. A description of this operation and its semantics is followed by examples and implementation outlines. The paper concludes with a brief discussion of issues relating to the utility of such primitives in collaborative peer group networks.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, New York (1998)
Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed Object Location in a Dynamic Network. In: Proc. of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, August 2002, pp. 41–52 (2002)
Oram, A. (ed.): Peer-to-peer: Harnessing the Power of Disruptive Technologies, March 2001. O’Reilly, Sebastopol (2001)
Pascoe, J.S., Sunderam, V.S., Loader, R.J.: The Design and Semantic Verification of an ncast Algorithm for Peer-to-Peer Networks. Technical Report 030101, Emory University, Dpt. of Math & Computer Science (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network. In: Proc. ACM SIGCOMM, San Diego, CA, August 2001, ACM Press, New York (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November 2001, pp. 329–350. ACM Press, New York (2001)
Stoica, I., et al.: Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. In: Proc. ACM SIGCOMM, San Diego, CA, August 2001, pp. 149–160. ACM Press, New York (2001)
Sun Microsystems. JXTA Resolver. World Wide Web (October 2002), Available from http://java.sun.com/features/2002/10/jxta_res.html
Sunderam, V.S., Pascoe, J.S., Loader, R.J.: Towards a Framework for Collaborative Peer Groups. In: Proc. IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID), Tokyo, Japan (May 2003)
The ns team. The Network Simulator (ns2) (2002), Homepage Available at http://www.isi.edu/nsnam/ns/
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report UCB/CSD-01- 1141, University of California at Berkeley (April 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pascoe, J., Sunderam, V. (2004). The ncast Primitive for Peer-to-Peer Networks. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_137
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_137
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive