Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Routing Algorithms for DHTs: Some Open Questions
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
A study of the performance potential of DHT-based overlays
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Locality-Aware and Churn-Resilient Load-Balancing Algorithms in Structured Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
Super nodes positioning for P2P IP telephony over wireless ad-hoc networks
Proceedings of the 6th international conference on Mobile and ubiquitous multimedia
Approaching neighbor proximity and load balance for range query in P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Polar: an efficient finding nearest neighbor algorithm for overlay network
Proceedings of the 2nd international conference on Scalable information systems
Optimization driven bandwidth provisioning in service overlay networks
Computer Communications
On the difficulty of finding the nearest peer in p2p systems
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Peer-exchange schemes to handle mismatch in peer-to-peer systems
The Journal of Supercomputing
An adaptive distributed localisation in wireless sensor network
Enterprise Information Systems
A satellite-based architecture for internet P2P applications
QShine 2007 Workshop: Satellite/Terrestrial Interworking
Estimation of network distances using off-line measurements
Computer Communications
A small-world DHT built on generalized network coordinates
Proceedings of the 2010 EDBT/ICDT Workshops
A locality preserving routing overlay using geographic coordinates
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
A cross-layer protocol for cooperative content delivery over mobile ad-hoc networks
International Journal of Communication Networks and Distributed Systems
Combining resource and location awareness in DHTs
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Dynamic zone-balancing of topology-aware peer-to-peer networks
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
HybridNN: An accurate and scalable network location service based on the inframetric model
Future Generation Computer Systems
| Hi-index | 0.00 |
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.