Twins: 2-hop Structured Overlay with High Scalability

Abstract

How to build an efficient P2P overlay network on a large-scale system is still in the air. Pastry-like p2p overlays have low maintenance costs because of their log(N)-sized routing tables. However their lookup efficiency is quite low. One-hop overlays, although having high routing efficiency, can not . scale to large systems because of its high maintenance cost. In this paper, we present a novel structured overlay network, Twins. Routing in Twins can be accomplished in 2 hops in very high probability. With a report-based multicast maintenance algorithm, the overlay network consumes very low maintenance cost in presence of large-scale and highly dynamic network environments. The experimental results indicate that, when the system running over a network of 5,000,000 peers, each peer consumes only 6 messages per second for maintenance, and the routing latency is only 2 hops in a very high probability of 0.99. © Springer-Verlag 2004.