Marcel Waldvogel
Roberto Rinaldi
Abstract
Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and "wonder drug" to achieve resilience. Current widely-used P2P networks rely on central directory servers or massive message flooding, clearly not scalable solutions. Distributed Hash Tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. We introduce Mithos, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing. Unlike other schemes, it also efficiently provides locality-aware connectivity, thereby ensuring that a message reaches its destination with minimal overhead. Mithos provides for highly efficient forwarding, making it suitable for use in high-throughput applications. Paired with its ability to have addresses directly mapped into a subspace of the IPv6 address space, it provides a potential candidate for native deployment. Additionally, Mithos can be used to support third-party triangulation to quickly select a close-by replica of data or services.
- Vince Fuller, Tony Li, Jessica Yu, and Kannan Varadhan. Classless Inter-Domain Routing (CIDR): An address assignment and aggregation strategy. Internet RFC 1519, September 1993.]] Google Scholar
Digital Library
- Mikael Degermark, Andrej Brodnik, Svante Carlsson, and Stephen Pink. Small forwarding tables for fast routing lookups. In Proceedings of ACM SIGCOMM, pages 3--14, September 1997.]] Google ScholarDigital Library
- Marcel Waldvogel, George Varghese, Jon Turner, and Bernhard Plattner. Scalable high speed IP routing table lookups. In Proceedings of ACM SIGCOMM, pages 25--36, September 1997.]] Google ScholarDigital Library
- Butler Lampson, V. Srinivasan, and George Varghese. IP lookups using multiway and multicolumn search. In Proceedings of IEEE INFOCOM, San Francisco, 1998.]]Google ScholarCross Ref
- E. C. Rosen, A. Viswanathan, and R. Callon. Multiprotocol label switching architecture. RFC 3031, Internet Engineering Task Force, January 2001.]] Google ScholarDigital Library
- Paul Francis, Sugih Jamin, Vern Paxson, Lixia Zhang, Daniel F. Gryniewicz, and Yixin Jin. An architecture for a global Internet host distance estimation service. In Proceedings of IEEE INFOCOM, pages 210--217, New York, NY, USA, March 1999.]]Google ScholarCross Ref
- T. S. Eugene Ng and Hui Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of IEEE INFOCOM, pages 170--179, New York, NY, USA, June 2002.]]Google Scholar
- Stefan Savage et al. Detour: A case for informed Internet routing and transport. IEEE Micro, 19(1):50--59, January 1999.]] Google ScholarDigital Library
- Sally Floyd, Van Jacobson, Steve McCanne, Lixia Zhang, and Ching-Gung Liu. A reliable multicast framework for light-weight sessions and application level framing. In Proceedings of ACM SIGCOMM, pages 342--356, September 1995.]] Google ScholarDigital Library
- Stephen Deering and David R. Cheriton. Multicast routing in datagram internetworks and extended LANs. ACM Transactions on Computer Systems, 8(2):85--110, May 1990.]] Google ScholarDigital Library
- Sylvia Ratnasamy, Scott Shenker, and Ion Stoica. Routing algorithms for DHTs: Some open questions. In Proceedings of First International Workshop on Peer-to-Peer Systems (IPTPS), 2002.]] Google ScholarDigital Library
- Brad Karp and H. T. Kung. GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of MobiCom, pages 243--254, August 2000.]] Google ScholarDigital Library
- Roberto Rinaldi. Routing and data location in overlay peer-to-peer networks. Diploma thesis, Institut Eurécom and Università degli Studi di Milano, June 2002. Also available as IBM Research Report RZ-3433.]]Google Scholar
- Roberto Rinaldi and Marcel Waldvogel. Routing and data location in overlay peer-to-peer networks. Research Report RZ-3433, IBM, July 2002.]]Google Scholar
- Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, September 2001.]] Google ScholarDigital Library
- Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of ACM SIGCOMM 2001, pages 149--160, San Diego, CA, USA, August 2001.]] Google ScholarDigital Library
- Anthony Rowstron and Peter Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329--350, Heidelberg, Germany, November 2001.]] Google ScholarDigital Library
- Ben Y. Zhao, John Kubiatowicz, and Anthony Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, April 2001.]] Google ScholarDigital Library
- Miguel Castro, Peter Druschel, Y. Charlie Hu, and Antony Rowstron. Exploiting network proximity in distributed hash tables. In Ozalp Babaoglu, Ken Birman, and Keith Marzullo, editors, International Workshop on Future Directions in Distributed Computing (FuDiCo), pages 52--55, June 2002.]]Google Scholar
- Sylvia Ratnasamy, Mark Handley, Richard Karp, and Scott Shenker. Topologically-aware overlay construction and server selection. In Proceedings of INFOCOM, June 2002.]]Google ScholarCross Ref
- Greg N. Frederickson. Searching intervals and compact routing tables. Algorithmica, 15(5):448--466, May 1996.]]Google ScholarDigital Library
- Robert Hinden and Stephen Deering. IP version 6 addressing architecture. Internet RFC 2373, 1998.]] Google ScholarDigital Library
Index Terms
- Efficient topology-aware overlay network
Recommendations
Scalable multicasting with network-aware geometric overlay
It is crucial to design an efficient network-aware overlay network to enable multicast service to adjust under the dynamic underlying network conditions and node churn in a scalable manner without extensive network measurements. We propose an accurate ...
A construction of locality-aware overlay network: mOverlay and its performance
There are many research interests in peer-to-peer (P2P) overlay architectures. Most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. Structured overlay networks based on ...
Comments