Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity

Authors:
Yuh-Jzer Joung;Jiaw-Chang Wang
Affiliations:
Department of Information Management, National Taiwan University, Taipei, Taiwan, ROC;Department of Information Management, National Taiwan University, Taipei, Taiwan, ROC
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 19
Cited 12

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
Choosing reputable servents in a P2P network

Proceedings of the 11th international conference on World Wide Web
Viceroy: a scalable and dynamic emulation of the butterfly

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Brocade: Landmark Routing on Overlay Networks

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
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
The Eigentrust algorithm for reputation management in P2P networks

WWW '03 Proceedings of the 12th international conference on World Wide Web
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
Reducing Maintenance Overhead in DHT Based Peer-to-Peer Algorithms

P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Canon in G Major: Designing DHTs with Hierarchical Structure

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities

IEEE Transactions on Knowledge and Data Engineering
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Hybrid overlay structure based on random walks

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Diminished chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A construction of locality-aware overlay network: mOverlay and its performance

IEEE Journal on Selected Areas in Communications

Approaching neighbor proximity and load balance for range query in P2P networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Enabling global multimedia distributed services based on hierarchical DHT overlay networks

International Journal of Internet Protocol Technology
CNP: A Protocol for Reducing Maintenance Cost of Structured P2P

ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
On the self-organization of a hybrid peer-to-peer system

Journal of Network and Computer Applications
Providing KBR service for multiple applications

IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Cooperating with free riders in unstructured P2P networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
CPSCox: A survival analysis model of peer behavior in large scale DHT system

Computer Communications
Tide: An effective and practical design for hierarchical-structured P2P model

Computer Communications
A hierarchical approach to improve performance of unstructured peer-to-peer system

International Journal of Communication Networks and Distributed Systems
A two-layered p2p resource sharing model based on cluster

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part II
HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity

Journal of Network and Computer Applications
Capitalizing on free riders in p2p networks

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Empirical studies have shown that participating nodes in peer-to-peer (P2P) systems are not equivalent. Some nodes, known as ''super peers'', are more powerful and stable than the others. Such heterogeneity has been taken into account in the design of P2P systems in two ways: by employing super peers to serve as index servers for query, and by routing through super peers to speed up query. In this paper, we use super peers to reduce maintenance cost in Chord-a DHT network which, like other DHT-based systems, is often praised for its guaranteed search feature but has relatively higher maintenance overhead than Gnutella-like unstructured P2P networks.