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
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
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
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Reducing Maintenance Overhead in DHT Based Peer-to-Peer Algorithms
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Dynamic Layer Management in Superpeer Architectures
IEEE Transactions on Parallel and Distributed Systems
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.24 |
A lot of research papers discussed Distributed Hash Table (DHT) based p2p systems to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and they will generate heavy information maintenance traffic to keep the efficiency of DHT based p2p systems under churn. In this paper, we suggest a dynamic nodeID based heterogeneity aware p2p system to reduce the overhead by exploiting the heterogeneity of participant nodes efficiently. Unlike the DHT based p2p systems, the nodeID of a node changes on the fly according to its characteristic and each node takes different responsibility in accordance with its nodeID to support p2p systems efficiently. A nodeID is composed of Load-Balanced ID (LBID) which balances the loads of reliable nodes and Load-Free ID (LFID) which reduces the responsibility of normal nodes and eliminates compulsory maintenance overhead. We conduct an event-driven simulation and show that our p2p system reduces data maintenance traffic and makes routing process more efficient and more reliable.