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
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
Total recall: system support for automated availability management
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
| Hi-index | 0.00 |
The peer-to-peer systems have become an extremely popular platform for large-scale content sharing A lot of research papers discussed the Distributed Hash Table (DHT) based p2p algorithms to promise that idle resources may be efficiently harvested However, p2p systems are composed of components with extremely heterogeneous availabilities and for nodes which join/leave the system frequently, the system will generate a lot of information maintenance traffic such as routing information update traffic and data copy traffic to keep the efficiency of the DHT based p2p algorithms. In this paper, we suggest the mobile nodeID based p2p algorithm to reduce the overhead by exploiting the heterogeneity of participant nodes efficiently Unlike the DHT based p2p algorithms, the nodeID of a node changes according to its characteristic to support the p2p system efficiency and each nodes takes the different responsibility in accordance with its nodeID We classify nodes into the two types according to the characteristics of nodes : the reliable nodes and the leaf nodes The reliable node which is the more stable and more reliable node acts as the more important role of the routing and the replication The leaf node which joins/leaves very frequently acts as the simple role to minimize the information maintenance traffic The reliable node has the load-balanced ID to balance the loads and the leaf node has the load-free ID to reduce the responsibility. We examine the efficiency of our p2p algorithm via a event driven simulation and show that the information maintenance traffic reduces and the routing process is more efficient.