Skip to main content
Erschienen in: Peer-to-Peer Networking and Applications 3/2011

01.09.2011

Fuzzynet: Ringless routing in a ring-like structured overlay

verfasst von: Sarunas Girdzijauskas, Wojciech Galuba, Vasilios Darlagiannis, Anwitaman Datta, Karl Aberer

Erschienen in: Peer-to-Peer Networking and Applications | Ausgabe 3/2011

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guarantees, each node needs to eagerly maintain its immediate neighboring links - the ring invariant. However, the ring maintenance is an expensive task and it may not even be possible to maintain the ring invariant continuously under high churn, particularly as the network size grows. Furthermore, routing anomalies in the network, peers behind firewalls and Network Address Translators (NATs) create non-transitivity effects, which inevitably lead to the violation of the ring invariant. We argue that reliance on the ring structure is a serious impediment for real life deployment and scalability of structured overlays. In this paper we propose an overlay called Fuzzynet, which does not rely on the ring invariant, yet has all the functionalities of structured overlays. Fuzzynet takes the idea of lazy overlay maintenance further by dropping any explicit connectivity and data maintenance requirement, relying merely on the actions performed when new Fuzzynet peers join the network. We show that with sufficient amount of neighbors (O(log N), comparable to traditional structured over-lays), even under high churn, data can be retrieved in Fuzzynet w.h.p. We validate our novel design principles by simulations as well as PlanetLab experiments and compare them with ring based overlays.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
We can generalize the ring to a “kleinbergian” lattice [21] or any other exact, peer key-dependent structure like hypercubes [35], butterfly networks [27], etc.
 
Literatur
1.
Zurück zum Zitat Aberer K (2001) P-Grid: a self-organizing access structure for P2P information systems. In: Proceedings of the Sixth International Conference on Cooperative Information Systems (CoopIS) Aberer K (2001) P-Grid: a self-organizing access structure for P2P information systems. In: Proceedings of the Sixth International Conference on Cooperative Information Systems (CoopIS)
2.
Zurück zum Zitat Angluin D, Aspnes J, Chen J, Wu Y, Yin Y (2005) Fast construction of overlay networks. In: In 17th ACM Symposium on Parallelism in Algorithms and Architectures(SPAA 2005),Las Vegas, NV, USA Angluin D, Aspnes J, Chen J, Wu Y, Yin Y (2005) Fast construction of overlay networks. In: In 17th ACM Symposium on Parallelism in Algorithms and Architectures(SPAA 2005),Las Vegas, NV, USA
3.
Zurück zum Zitat Aspnes J, Kirsch J, Krishnamurthy A (2004) Load balancing and locality in range-queriable data structures. In: PODC2004 Aspnes J, Kirsch J, Krishnamurthy A (2004) Load balancing and locality in range-queriable data structures. In: PODC2004
4.
Zurück zum Zitat Aspnes J, Shah G (2003) Skip graphs. In: SODA Aspnes J, Shah G (2003) Skip graphs. In: SODA
5.
Zurück zum Zitat Bhagwan R, Tati K, Cheng Y, Savage S, Voelker GM (2004) Total recall: system support for automated availability management. In: The ACM/USENIX Symposium on Networked Systems Design and Implementation Bhagwan R, Tati K, Cheng Y, Savage S, Voelker GM (2004) Total recall: system support for automated availability management. In: The ACM/USENIX Symposium on Networked Systems Design and Implementation
6.
Zurück zum Zitat Bharambe A, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. In: ACM SIGCOMM, Portland, USA Bharambe A, Agrawal M, Seshan S (2004) Mercury: supporting scalable multi-attribute range queries. In: ACM SIGCOMM, Portland, USA
7.
Zurück zum Zitat Clarke I, Sandberg O, Wiley B, Hong TW (2001) Freenet: a distributed anonymous information storage and retrieval system. In: Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability Clarke I, Sandberg O, Wiley B, Hong TW (2001) Freenet: a distributed anonymous information storage and retrieval system. In: Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability
8.
Zurück zum Zitat Datta A, Hauswirth M, Aberer K (2003) Updates in highly unreliable, Replicated peer-to-peer systems. In: Proceedings of the 23rd International Conference on Distributed Computing Systems Datta A, Hauswirth M, Aberer K (2003) Updates in highly unreliable, Replicated peer-to-peer systems. In: Proceedings of the 23rd International Conference on Distributed Computing Systems
9.
Zurück zum Zitat Freedman MJ, Lakshminarayanan K, Rhea S, Stoica I (2005) Non-transitive connectivity and dhts. In: WORLDS’05: Proceedings of the 2nd conference on Real, Large Distributed Systems, pp. 10-10. USENIX Association, Berkeley, CA, USA Freedman MJ, Lakshminarayanan K, Rhea S, Stoica I (2005) Non-transitive connectivity and dhts. In: WORLDS’05: Proceedings of the 2nd conference on Real, Large Distributed Systems, pp. 10-10. USENIX Association, Berkeley, CA, USA
10.
Zurück zum Zitat Galuba W, Aberer K (2007) Generic emergent overlays in arbitrary peer identifier spaces. In: 2nd International Workshop on Self-Organizing Systems (IWSOS 2007), vol. 4725, pp. 88–102 Galuba W, Aberer K (2007) Generic emergent overlays in arbitrary peer identifier spaces. In: 2nd International Workshop on Self-Organizing Systems (IWSOS 2007), vol. 4725, pp. 88–102
11.
Zurück zum Zitat Ganesan E, Pradhan DK (2003) Wormhole routing in De Bruijn Networks and Hyper-DeBruijn Networks. In: ISCAS Ganesan E, Pradhan DK (2003) Wormhole routing in De Bruijn Networks and Hyper-DeBruijn Networks. In: ISCAS
12.
Zurück zum Zitat Ganesan P, Bawa M, Garcia-Molina H (2004) Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB Ganesan P, Bawa M, Garcia-Molina H (2004) Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB
13.
Zurück zum Zitat Ganesan P, Sun Q, Garcia-Molina H (2003) Yappers: a peer-to-peer lookup service over arbitrary topology. In: INFOCOM’03, San Francisco, USA Ganesan P, Sun Q, Garcia-Molina H (2003) Yappers: a peer-to-peer lookup service over arbitrary topology. In: INFOCOM’03, San Francisco, USA
14.
Zurück zum Zitat Girdzijauskas S, Datta A, Aberer K (2005) On small world graphs in non-uniformly distributed key spaces. In: NetDB2005, Tokyo, Japan Girdzijauskas S, Datta A, Aberer K (2005) On small world graphs in non-uniformly distributed key spaces. In: NetDB2005, Tokyo, Japan
15.
Zurück zum Zitat Girdzijauskas S, Datta A, Aberer K (2006) Oscar: small-world overlay for realistic key distributions. In: DBISP2P 2006, Seoul, Korea Girdzijauskas S, Datta A, Aberer K (2006) Oscar: small-world overlay for realistic key distributions. In: DBISP2P 2006, Seoul, Korea
17.
Zurück zum Zitat Girdzijauskas S, Datta A, Aberer K (2010) Structured overlay for heterogeneous environments: design and evaluation of Oscar. ACM Transactions on Autonomous and Adaptive Systems (TAAS), vol. 5, February Girdzijauskas S, Datta A, Aberer K (2010) Structured overlay for heterogeneous environments: design and evaluation of Oscar. ACM Transactions on Autonomous and Adaptive Systems (TAAS), vol. 5, February
18.
Zurück zum Zitat Guha S, Daswani N, Jain R (2006) An experimental study of the skype peer-to-peer voip system. In: Proceedings of The 5th International Workshop on Peer-to-Peer Systems (IPTPS 06) Guha S, Daswani N, Jain R (2006) An experimental study of the skype peer-to-peer voip system. In: Proceedings of The 5th International Workshop on Peer-to-Peer Systems (IPTPS 06)
19.
Zurück zum Zitat Harvey NJA, Jones BM, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties. In: USITS’03, Seattle, WA (March 2003) Harvey NJA, Jones BM, Saroiu S, Theimer M, Wolman A (2003) Skipnet: a scalable overlay network with practical locality properties. In: USITS’03, Seattle, WA (March 2003)
21.
Zurück zum Zitat Kleinberg J (2000) The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing Kleinberg J (2000) The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing
22.
Zurück zum Zitat Klemm F, Girdzijauskas S, Le Boudec JY, Aberer K (2007) On routing in distributed hash tables. In: The Seventh IEEE International Conference on Peer-to-Peer Computing. URL http://www.p2p2007.org Klemm F, Girdzijauskas S, Le Boudec JY, Aberer K (2007) On routing in distributed hash tables. In: The Seventh IEEE International Conference on Peer-to-Peer Computing. URL http://​www.​p2p2007.​org
23.
Zurück zum Zitat Kong J, Roychowdhury V (2007) Price of structured routing and its mitigation in p2p systems under churn. In: P2P’07, Galway, Ireland Kong J, Roychowdhury V (2007) Price of structured routing and its mitigation in p2p systems under churn. In: P2P’07, Galway, Ireland
25.
Zurück zum Zitat Li X, Misra J, Plaxton G (2004) Active and concurrent topology maintenance. In: In the 18th Annual Conference on Distributed Computing (DISC) Li X, Misra J, Plaxton G (2004) Active and concurrent topology maintenance. In: In the 18th Annual Conference on Distributed Computing (DISC)
26.
Zurück zum Zitat Liben-Nowell D, Balakrishnan H, Karger DR (2002) Analysis of the evolution of peer-to-peer systems. In: PODC2002, New York, USA Liben-Nowell D, Balakrishnan H, Karger DR (2002) Analysis of the evolution of peer-to-peer systems. In: PODC2002, New York, USA
27.
Zurück zum Zitat Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing
28.
Zurück zum Zitat Manku GS, Bawa M, Raghavan P (2003) Symphony: distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems, USITS Manku GS, Bawa M, Raghavan P (2003) Symphony: distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems, USITS
30.
Zurück zum Zitat Mislove A, Post A, Haeberlen A, Druschel P (2006) Experiences in building and operating epost, a reliable peer-to-peer application. In: EuroSys ‘06: Proceedings of the ACM SIGOPS/EuroSys European Conference on Computer Systems 2006, pp. 147–159. ACM, New York, NY, USA. http://doi.acm.org/10.1145/1217935.1217950 Mislove A, Post A, Haeberlen A, Druschel P (2006) Experiences in building and operating epost, a reliable peer-to-peer application. In: EuroSys ‘06: Proceedings of the ACM SIGOPS/EuroSys European Conference on Computer Systems 2006, pp. 147–159. ACM, New York, NY, USA. http://​doi.​acm.​org/​10.​1145/​1217935.​1217950
32.
Zurück zum Zitat Rhea S, Geels D, Roscoe T, Kubiatowicz J (2003) Handling Churn in a DHT. Tech. Rep. Technical Report UCB//CSD-03-1299. The University of California, Berkeley, Univ. Paris-Sud Rhea S, Geels D, Roscoe T, Kubiatowicz J (2003) Handling Churn in a DHT. Tech. Rep. Technical Report UCB//CSD-03-1299. The University of California, Berkeley, Univ. Paris-Sud
33.
Zurück zum Zitat Rhea S, Godfrey B, Karp B, Kubiatowicz J, Ratnasamy S, Shenker S, Stoica I, Yu H (2005) Opendht: a public dht service and its uses. In: SIGCOMM ‘05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 73–84. ACM, New York, NY, USA. http://doi.acm.org/10.1145/1080091.1080102 Rhea S, Godfrey B, Karp B, Kubiatowicz J, Ratnasamy S, Shenker S, Stoica I, Yu H (2005) Opendht: a public dht service and its uses. In: SIGCOMM ‘05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 73–84. ACM, New York, NY, USA. http://​doi.​acm.​org/​10.​1145/​1080091.​1080102
34.
Zurück zum Zitat Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer- to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middle- ware), Heidelberg, Germany Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale peer- to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middle- ware), Heidelberg, Germany
35.
Zurück zum Zitat Schlosser M, Sintek M, Decker S, Nejdl W. (2002) Hypercup - hypercubes, ontologies and efficient search on p2p networks. In: Workshop on Agents and P2P Computing, 2002 Schlosser M, Sintek M, Decker S, Nejdl W. (2002) Hypercup - hypercubes, ontologies and efficient search on p2p networks. In: Workshop on Agents and P2P Computing, 2002
36.
Zurück zum Zitat Shaker A, Reeves DS (2005) Self-stabilizing structured ring topology p2p systems. In: Fifth IEEE International Conference on Peer-to-Peer Computing (P2P’05) Shaker A, Reeves DS (2005) Self-stabilizing structured ring topology p2p systems. In: Fifth IEEE International Conference on Peer-to-Peer Computing (P2P’05)
37.
Zurück zum Zitat Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM
38.
Zurück zum Zitat Terpstra WW, Leng C, Buchmann AP (2007) Bubblestorm: resilient, probabilistic, and exhaustive peer- to-peer search. In: SIGCOMM’07, Kyoto, Japan Terpstra WW, Leng C, Buchmann AP (2007) Bubblestorm: resilient, probabilistic, and exhaustive peer- to-peer search. In: SIGCOMM’07, Kyoto, Japan
39.
Zurück zum Zitat Wang W, Chang H, Zeitoun A, Jamin S (2004) Characterizing guarded hosts in peer-to-peer file sharing systems. In: In Proceedings of IEEE Global Communications Conference, Global Internet and Next Generation Networks Wang W, Chang H, Zeitoun A, Jamin S (2004) Characterizing guarded hosts in peer-to-peer file sharing systems. In: In Proceedings of IEEE Global Communications Conference, Global Internet and Next Generation Networks
Metadaten
Titel
Fuzzynet: Ringless routing in a ring-like structured overlay
verfasst von
Sarunas Girdzijauskas
Wojciech Galuba
Vasilios Darlagiannis
Anwitaman Datta
Karl Aberer
Publikationsdatum
01.09.2011
Verlag
Springer US
Erschienen in
Peer-to-Peer Networking and Applications / Ausgabe 3/2011
Print ISSN: 1936-6442
Elektronische ISSN: 1936-6450
DOI
https://doi.org/10.1007/s12083-010-0081-3

Weitere Artikel der Ausgabe 3/2011

Peer-to-Peer Networking and Applications 3/2011 Zur Ausgabe