A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Brocade: Landmark Routing on Overlay Networks
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
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.98 |
We introduce an auxiliary coarse-grained routing layer (an expressway) on Chord, a DHT based structured peer-to-peer system. With the assumption that nodes in the system have different resource capacities such as storages and bandwidths, powerful (high connectivity and bandwidth) nodes can join the expressway to perform fast routing. We design the logical structure of an expressway overlay. We focus on the design and analysis of the logical structure of the expressway overlay that is parameterized by a characteristic called the forwarding power p. Expressway nodes maintain more routing entries that can forward requests with a longer per hop distance than the underlying system. The expressway defers the ''last mile'' fine-grained routing to the underlying system. We also propose an event-based notification for membership and routing entry management on the expressway. Our initial experimental results of an expressway with a forwarding power of 4 show that the average logical path length of the system when over 20% of nodes join the expressway is about the same as when every node joins the expressway. The theoretical analysis shows that the logical routing path lengths of the system improve up to 1-2(p-1p)log"p2. The system requires O(log^2r) messages to update all expressway routing entries when a node joins or leaves the system, where r is the number of expressway nodes.