Efficient topology-aware overlay network
- 1 January 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 33 (1) , 101-106
- https://doi.org/10.1145/774763.774779
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.Keywords
This publication has 12 references indexed in Scilit:
- Topologically-aware overlay construction and server selectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- IP lookups using multiway and multicolumn searchPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A scalable content-addressable networkPublished by Association for Computing Machinery (ACM) ,2001
- ChordPublished by Association for Computing Machinery (ACM) ,2001
- GPSRPublished by Association for Computing Machinery (ACM) ,2000
- Detour: informed Internet routing and transportIEEE Micro, 1999
- Small forwarding tables for fast routing lookupsPublished by Association for Computing Machinery (ACM) ,1997
- Searching among intervals and compact routing tablesAlgorithmica, 1996
- A reliable multicast framework for light-weight sessions and application level framingPublished by Association for Computing Machinery (ACM) ,1995
- Multicast routing in datagram internetworks and extended LANsACM Transactions on Computer Systems, 1990