Abstract
We investigate the search cost in terms of number of messages generated for routing queries in tree-based P2P structured systems including binary and k-ary tree structures with different arities and different degrees of imbalance in the tree shape. This work is motivated by the fact that k-ary balanced tree access structures can greatly reduce the number of hops for searching compared to the binary trees. We study to what extent the same fact is true when the tree-like structures for access in P2P environments are unbalanced. Another important issue related to P2P environments is how to build these structures in a self-organizing way. We propose a mechanism for constructing k-ary tree based decentralized access structure in a self-organizing way and based on local interactions only. The ability to search efficiently also on unbalanced k-ary trees opens interesting opportunities for load balancing as has been shown in earlier work on P-Grid, our approach to structured P2P systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aberer, K.: P-Grid: A Self-organizing Access Structure for P2P Information Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, Springer, Heidelberg (2001)
Aberer, K.: Efficient Search in Unbalanced, Randomized Peer-To-Peer Search Trees. Techical Report IC/2002/79, Ecole Polytechnique Fédérale de Lausanne, EPFL (2002), http://www.p-grid.org/Papers/TR-IC-2002-79.pdf
Aberer, K.: Scalable Data Access in P2P Systems Using Unbalanced Search Trees. In: Workshop on Distributed Data and Structures (WDAS 2002), Paris, France (2002)
Aberer, K., Datta, A., Hauswirth, M.: The Quest for Balncing Peer Load in Structured Peer-to-Peer Systems. Technical Report IC/2003/32, Ecole Polytechnique Fédérale de Lausanne (EPFL) (2003), http://www.p-grid.org/Papers/TRIC-2003-32.pdf
Aberer, K., Hauswirth, M., Punceva, M., Schmidt, R.: Improving Data Access in P2P Systems. IEEE Internet Computing 6(1) (January/February 2002)
Alima, L.O., El-Ansary, S., Brand, P., Haridi, S.: A Framework for Peer-to-Peer Lookup Services Based on k-ary Search. SICS Technical Report T2002-06 (2002), http://www.sics.se/~seif/Publications/SICS-T–2002-06–SE.pdf
Clarke, I., Sandberg, O., Wiley, B., Hong, W.T.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, Springer, Heidelberg (2001) http://freenetproject.org/cgibin/twiki/view/Main/ICSI
Clip2. The Gnutella Protocol Specification v0.4. Document Revision 1.2 (June 2001), http://www9.limewire.com/developer/gnutellaprotocol0.4.pdf
Dabek, F., Brunskill, E., Kaashoek, F.M., Karger, D., Morris, R., Stoica, I., Balakrishnan, H.: Building Peer-to-Peer Systems with Chord, a Distributed LookupService. In: Eighth Workshop on Hot Topics in Operating Systems, HotOS (2001)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication In Unstructured Peer-to-Peer Networks. In: International Conference on Supercomputing (2002) (2002)
Maymounkov, P., Mazieres, P.: Kademlia: a Peer-to-Peer Information System based on XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network.In: ACM SIGCOMM (2001)
Rhea, S., Wells, C., Eaton, P., Geels, D., Zhao, B., Wearherspoon, H., Kubiatowitcz, J.: Maintenance-Free Global Data Storage. IEEE Inetrenet Computing 5(5) (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: ACM INternational Conference on Distributed Systems Platforms, Middleware (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
Punceva, M., Aberer, K. (2004). Efficient Search in Structured Peer-to-Peer Systems: Binary v.s. K-Ary Unbalanced Tree Structures. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24629-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20968-3
Online ISBN: 978-3-540-24629-9
eBook Packages: Springer Book Archive