A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Looking up data in P2P systems
Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
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
Grapes: Topology-Based Hierarchical Virtual Network for Peer-to-Peer Lookup Services
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
An Efficient Clustered Architecture for P2P Networks
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Jelly: A Dynamic Hierarchical P2P Overlay Network with Load Balance and Locality
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
A Hierarchical Projection Pursuit Clustering Algorithm
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
ICN: Interest-Based Clustering Network
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 07
The Essence of P2P: A Reference Architecture for Overlay Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Efficient Content Location Based On Interest-Cluster in Peer-to-Peer System
ICEBE '05 Proceedings of the IEEE International Conference on e-Business Engineering
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
Peer-to-Peer Systems and Applications (Lecture Notes in Computer Science)
Node clustering in the P2P environment
ICNICONSMCL '06 Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies
Cycloid: a constant-degree and lookup-efficient P2P overlay network
Performance Evaluation - P2P computing systems
Cost-Based Analysis of Hierarchical DHT Design
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
CISS: An efficient object clustering framework for DHT-based peer-to-peer applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
On hierarchical DHT systems - An analytical approach for optimal designs
Computer Communications
Routing Performance in a Hierarchical DHT-based Overlay Network
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
On the self-organization of a hybrid peer-to-peer system
Journal of Network and Computer Applications
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications
International Journal of Communication Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
It is well known that Peer-to-Peer systems are generally featured with high flexibility and scalability, enabling dynamic resources localization and mutualization, and allowing the nodes to freely join and leave. But in some special environments such as mobile P2P networks, routing optimization, resources reliability and availability are critical concerns. To deal with these issues, we propose a novel architecture, termed hierarchical Peer-to-Peer model or HPM for short, based on Chord for improving P2P network performance in the presence of such additional requirements as fault tolerance and self organization. Specifically, HPM is composed of a set of hierarchical rings, each of which consists of the nodes that are both physically and logically close to each other or we say they have physical proximity, supporting inter and intra routing mechanisms. We show that the cost of lookup for HPM is O(@?"i"="1^4log"2(n"i)), where n"i represents the number of nodes on ring level i (with the maximum of 256 nodes in each ring in the case of four levels). Each node maintains a routing table with only 2xO(log"2(n"i)) entries, greatly facilitating HPM to work in resource-limited terminals such as mobile phones or PDA. In particular, when HPM is combined with a broadcast mechanism, the lookup process can be significantly improved (four hops). Our simulations and comparative studies demonstrate that HPM can achieve satisfactory P2P performance with rapid convergence thanks to the cost-optimal lookup algorithm.