Survey-based Comparison of Chord Overlay Networks
---
paper_title: One ring to rule them all: service discovery and binding in structured peer-to-peer overlay networks

paper_content:

Self-organizing, structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network.One major problem with these systems is how to bootstrap them. How do you decide which overlay to join? How do you find a contact node in the overlay to join? How do you obtain the code that you should run? Current systems require that each node that participates in a given overlay supports the same set of applications, and that these applications are pre-installed on each node.In this position paper, we sketch the design of an infrastructure that uses a universal overlay to provide a scalable infrastructure to bootstrap multiple service overlays providing different functionality. It provides mechanisms to advertise services and to discover services, contact nodes, and service code.
---
paper_title: Chord: a scalable peer-to-peer lookup protocol for internet applications

paper_content:

A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
---
paper_title: Chord: a scalable peer-to-peer lookup protocol for internet applications

paper_content:

A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
---
paper_title: Chord: a scalable peer-to-peer lookup protocol for internet applications

paper_content:

A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
---
paper_title: Chord: a scalable peer-to-peer lookup protocol for internet applications

paper_content:

A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
---
paper_title: Chord: a scalable peer-to-peer lookup protocol for internet applications

paper_content:

A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
---
paper_title: PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity

paper_content:

Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. A routing efficiency enhancement protocol on top of Chord is illustrated in this paper, which is called PChord. PChord aims to achieve better routing efficiency than Chord by exploiting proximity of the underlying network topology. The simulation shows that PChord has achieved lower RDP per message routing.
---
paper_title: MR-Chord: A scheme for enhancing Chord lookup accuracy and performance in mobile P2P network

paper_content:

In the recent years, Peer-to-Peer (P2P) sharing network has become very popular in the Internet. However, most P2P protocols are designed for traditional wired networks. When deployed in wireless network environment, many challenges are encountered. For instance, the nodes in an unstable wireless network tend to leave or rejoin the P2P network easily. In this case, the routing information in every node must become overdue, which may lead to lookup failures when the nodes retrieve these overdue routing information. In this paper, we propose a modified Chord protocol called MobileRobust-Chord (MR-Chord). MR-Chord is designed with the aim of keeping the Finger Table fresh. To achieve this goal, we have modified the Distributed Hash Table (DHT)-based protocol a Chord Protocol in such a way that the Finger Table is kept updated to provide the necessary lookup services in the P2P network. Simulations studies show that our proposed MR-Chord protocol outperforms the original Chord protocol in the following aspects: (1) increase in the lookup success rate and overlay consistency, (2) reduction of the lookup delay time.
---
paper_title: PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity

paper_content:

Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. A routing efficiency enhancement protocol on top of Chord is illustrated in this paper, which is called PChord. PChord aims to achieve better routing efficiency than Chord by exploiting proximity of the underlying network topology. The simulation shows that PChord has achieved lower RDP per message routing.
---

Title: Survey-based Comparison of Chord Overlay Networks

Section 1: INTRODUCTION
Description 1: Provide an overview of Chord structured P2P overlay networks and their importance, including the role of distributed hash tables (DHTs) and key features like load balance, decentralization, scalability, and availability.

Section 2: The Base Chord Protocol
Description 2: Detail the foundational mechanisms of the Chord protocol, including key lookup, node join operations, and recovery from node failures or departures.

Section 3: Consistent Hashing
Description 3: Explain the consistent hashing technique used by Chord to map keys to nodes, including the use of SHA-1 as a base hash function and the concept of the identifier circle.

Section 4: Scalable Key Location
Description 4: Describe how Chord efficiently locates keys in the network, focusing on the finger table and its role in reducing lookup path lengths.

Section 5: Node Joins
Description 5: Discuss the process and importance of updating successor and predecessor pointers when a new node joins the Chord system, highlighting the stabilization protocol.

Section 6: Node Failure
Description 6: Explain Chord’s approach to handling node failures, including maintaining a successor list and replicating keys to ensure robustness.

Section 7: Related Work
Description 7: Review various studies that have proposed enhancements to the original Chord protocol to improve different aspects such as routing efficiency, security, fault tolerance, lookup accuracy, and performance in mobile P2P networks.

Section 8: Improvement on Chord to Achieve Better Routing Efficiency
Description 8: Outline enhancements for improving Chord’s routing efficiency, such as the PChord protocol, which incorporates proximity routing to reduce Relative Delay Penalty (RDP).

Section 9: Improvement on Chord to Achieve Better Routing Security
Description 9: Describe security enhancements to Chord, particularly the Sechord extension, designed to manage and mitigate routing threats and misrouting attacks.

Section 10: Improvement on Chord to Achieve Better Fault Tolerance
Description 10: Provide details on mechanisms added to Chord to enhance its fault tolerance, such as redundancy and aggressive repair algorithms for handling node failures and broken links.

Section 11: Improvement on Chord to Achieve Better Lookup Accuracy and Performance in Mobile P2P Network
Description 11: Analyze improvements to the Chord protocol aimed at increasing lookup accuracy and performance in mobile P2P networks, emphasizing real-time updates and self-organizing behavior.

Section 12: Building Power Grid Applications using Chord
Description 12: Discuss the application of Chord in power grid management, detailing how its decentralized nature and self-organizing capabilities make it suitable for distributed control and optimization.

Section 13: Improvement on Chord to Achieve Better Load Balancing
Description 13: Examine strategies for enhancing load balancing in Chord, including the WSDBC model and algorithms for node join-in and self-balancing to distribute load evenly across nodes.