Abstract
In this paper we present and evaluate a novel mechanism, called Hop Level, that creates and maintains long range contacts (LRCs) in overlay networks. The Hop Level mechanism owns the following characteristics: i) lazy creation of the LRCs, ii) support for unbalanced node distribution, iii) support for multidimensional spaces and iv) near-optimal path lenght/node degree trade-off. These characteristics make Hop Level specially suited for overlay networks that support range data queries (as opposed to distributed hash tables that only support exact queries) with one or more dimensions. Furthermore, and unlike previous similar work, Hop Level can handle churn very well, because it postpones creation of the LRCs until it is necessary. In this way, nodes that have short lives do not overload the network with their state update requests.
This work was partially supported by the LaSIGE and by the FCT project INDIQoS POSI/CHS/41473/2001 via POSI and FEDER funds.
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
Abraham, I., Malkhi, D., Dobzinski, O.: Land: stretch (1+_) locality-aware networks for dhts. In: Fifteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp. 550–559 (2004)
Almeroth, K., Ammar, M.: Collecting and modeling the join/leave behavior of multicast group members in the mbone. In: High Performance Distributed Computing (HPDC 1996), Syracuse, NY, USA, August 1996, pp. 209–216 (1996)
Araújo, F., Rodrigues, L.: Geopeer: A location-aware peer-to-peer system. In: The 3rd IEEE International Conference on Network Computing and Applications (NCA 2004), Cambridge, MA, USA, pp. 39–46 (2004)
Aspnes, J., Kirsch, J., Krishnamurthy, A.: Load balancing and locality in rangequeriable data structures. In: Twenty-Third Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2004), St. Johns, Newfoundland, Canada (July 2004)
Bharambe, R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multiattribute range queries. SIGCOMM Comput. Commun. Rev. 34(4), 353–366 (2004)
Harvey, N., Jones, M., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties. In: Fourth USENIX Symposium on Internet Technologies and Systems (USITS 2003), Seattle, WA (March 2003)
Kaashoek, F., Karger, D.: Koorde: A simple degree-optimal distributed hash table (2003)
Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-topeer systems. In: SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 36–43. ACM Press, New York (2004)
Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (2000)
Liebeherr, J., Nahas, M., Si, W.: Application-layer multicasting with Delaunay triangulation overlays. Technical Report CS-2001-26, University of Virginia, Department of Computer Science, 5 (2001)
Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: 4th Usenix Symposium on Internet Technologies and Systems (2003), http://www.usenix.org/events/usits03/
Melamed, R., Keidar, I.: Araneola: A scalable multicast system for dynamic environments. In: The 3rd IEEE International Conference on Network Computing and Applications (NCA 2004), Cambridge, MA, USA, August 2004, pp. 5–14 (2004)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Conference on applications, technologies, architectures, and protocols for computer communications, pp. 161–172. ACM Press, New York (2001)
Guerraoui, R.: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. LNCS, vol. 2218. Springer, Heidelberg (2001)
Saroiu, S., Gummadi, P., Gribble, S.: A measurement study of peer-to-peer file sharing systems. In: Multimedia Computing and Networking (MMCN), San Jose, CA, USA (January 2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: ACM SIGCOMM, San Diego (August 2001)
Xu, Z., Zhang, Z.: Building low-maintenance expressways for p2p systems. Technical Report HPL-2002-41, HP (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Araújo, F., Rodrigues, L. (2005). Long Range Contacts in Overlay Networks. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_126
Download citation
DOI: https://doi.org/10.1007/11549468_126
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)