Abstract
Peer-to-peer (P2P) communication and computing frameworks are important for constructing robust large-scale distributed systems. Overlay network systems use distributed hash-table (DHT) to provide scalable and efficient node search capabilities. However, the DHT-based method has a problem for the maintenance cost of dynamically changing large-scale-network, in which nodes are frequently joining and leaving. This paper proposes a novel technique of P2P communication path management. The proposed technique devises a robust semi-structured overlay network called Ordered Tree with Tuft (OTT for short). OTT provides not only efficient node searching, but also low-cost self-maintenance capabilities for the dynamically changing network. In this method, joining and leaving of a node are managed in O(1) with high probability. Furthermore, the proposed OTT-based technique can find and construct a path shorter than that on the normal ordered tree, by setting up bypass links between remote nodes on OTT.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gnutella: The gnutella protocol specification v0.4 (2000), http://www.gnutella.com/
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: The Workshop on Design Issues in Anonymity and Unobservablity, pp. 46–66 (2000)
web site, http://www.skype.com/
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer Lookup Service for Internet Applications. In: The 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
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, UC Berkeley (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA (2000)
Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)
Baquero, C., Lopes, N.: B+tree on p2p: Providing content indexing over dht overlays. Technical report, Universidade do Minho (2004)
Prakash, A.C.: P-Tree: A P2P Index for Resource Discovery Applications. In: 13th International World Wide Web Conference, pp. 390–391 (May 2004)
Malkhi, D., Naor, M., Ratajzcak, D.: Viceroy: Scalable emulation of butterfly networks for distributed hash tables (2003)
Kaashoek, M.F., Karger, D.R.: Koorde: A Simple Degree-Optimal Distributed Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 323–336. Springer, Heidelberg (2003)
Zhong, G., Amamiya, S., Takahashi, K., Mine, T., Amamiya, M.: The Design and Implementation of KODAMA System. IEICE Transactions INF E85-D, 637–646 (2002)
Song, J., Park, S., Yang, J.: An Adaptive Proximity Route Selection Scheme in DHT-Based Peer to Peer Systems. In: Liew, K.-M., Shen, H., See, S., Cai, W. (eds.) PDCAT 2004. LNCS, vol. 3320, pp. 778–781. Springer, Heidelberg (2004)
Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling Churn in a DHT. In: The 2004 USENIX Technical Conference (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kimura, K., Amamiya, S., Mine, T., Amamiya, M. (2012). A Semi-structured Overlay Network for Large-Scale Peer-to-Peer Systems. In: Beneventano, D., Despotovic, Z., Guerra, F., Joseph, S., Moro, G., de Pinninck, A.P. (eds) Agents and Peer-to-Peer Computing. AP2PC AP2PC 2009 2008. Lecture Notes in Computer Science(), vol 6573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31809-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31809-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31808-5
Online ISBN: 978-3-642-31809-2
eBook Packages: Computer ScienceComputer Science (R0)