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
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Hybrid overlay structure based on random walks
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
ERASP: an efficient and robust adaptive superpeer overlay network
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Hi-index | 0.00 |
Peer-to-peer networks can be divided into structured and unstructured based on their overlay topologies. In reality, unstructured p2p networks with superpeers have proved their capacities to support millions of users simultaneously. However, applications deployed on this kind of overlay networks, such as file-sharing, require flooding or gossip-based message routing, which puts more overhead on underlying networks and provides no guarantee on resource discovery. In this paper we propose an overlay adaptation protocol which allows structured superpeer overlay construction from unstructured p2p overlay networks with the potential to leverage the advantages of structured p2p overlay networks such as efficiency, scalability and guaranteed look-up services. The simulation result shows that our protocol can build the structured superpeer overlay with efficiency and scalability.