Chord: a scalable peer-to-peer lookup protocol for internet applications

Stoica, Ion; Morris, Robert; Liben-Nowell, David; Karger, David R.; Kaashoek, M. Frans; Dabek, Frank; Balakrishnan, Hari

doi:10.1109/tnet.2002.808407

Cited by 5,314 publications

(6,992 citation statements)

References 14 publications

Supporting

Mentioning

6,702

Contrasting

Unclassified

121

Order By: Relevance

“…Chord [15] is based on the idea of mapping both peer (mesh router) IDs and resource IDs (keys) into the same ID space, namely the unit ring [0,1]. Each key resides on the peer with the smallest ID larger than the key (see Figure 1), i.e., peer p manages keys comprised between its own ID and the ID of the predecessor of p in the unit ring (denoted range(p)).…”

Section: Basic Chord Operationsmentioning

confidence: 99%

“…Recently, we have proposed MESHCHORD [3], a specialization for mesh networks of the well-known Chord algorithm [15], which exploits i) the availability of a wireless infrastructure and ii) the I-hop broadcast nature of wireless communications, to realize a) location-aware ID assignment to nodes, and b) implementation of a cross-layering technique that bridges the MAC to the middleware layer.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Evaluating load balancing in peer-to-peer resource sharing algorithms for wireless mesh networks

Canali

Renda

Santi

2008

2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems

View full text Add to dashboard Cite

Section: Basic Chord Operationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Evaluating load balancing in peer-to-peer resource sharing algorithms for wireless mesh networks

Canali

Renda

Santi

2008

2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems

View full text Add to dashboard Cite

“…Overlay networks such as the Content Addressable Network (CAN), 2 Chord, 3 Pastry, 4 and Viceroy 5 create a virtual topology on top of the physical topology. In this sense, TTL-based P2P networks are also a type of overlay, but we use the term here to refer only to networks that create virtual topologies based on node-content attributes.…”

Section: Overlay Networkmentioning

confidence: 99%

“…As long as the initial network is stable, researchers have found that the system maintains O(log N) lookup times even with 50 percent probability of node failure. 3 Finally, Chord stores multiple key-value pairs in each node, automatically balancing the node load as new network entrants arrive.…”

Section: Example Overlay Networkmentioning

confidence: 99%

Overlay networks a scalable alternative for p2p

Doval¹,

O’Mahony²

2003

IEEE Internet Comput.

View full text Add to dashboard Cite

“…Structured P2P networks (e.g., Chord [2], CAN [3], * This work was performed while the author was at Institut EURECOM.…”

Section: Introduction a Motivationsmentioning

confidence: 99%

Efficient search in unstructured peer‐to‐peer networks

Cholvi

Felber

Biersack

2004

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Abstract-The huge popularity of recent peer-to-peer (P2P) file sharing systems has been mainly driven by the scalability of their architectures and the flexibility of their search facilities. Such systems are usually designed as unstructured P2P networks, because they impose few constraints on topology and data placement and support highly versatile search mechanisms. A major limitation of unstructured P2P networks lies, however, in the inefficiency of their search algorithms, which are usually based on simple flooding schemes.In this paper, we propose novel mechanisms for improving search efficiency in unstructured P2P networks. Unlike other approaches, we do not rely on specialized search algorithms; instead, the peers perform local dynamic topology adaptations, based on the query traffic patterns, in order to spontaneously create communities of peers that share similar interests. The basic premise of such semantic communities is that file requests have a high probability of being fulfilled within the community they originate from, therefore increasing the search efficiency. We propose further extensions to balance the load among the peers and reduce the query traffic. Extensive simulations under realistic operating conditions substantiate that our techniques significantly improve the search efficiency and reduce the network load. I. INTRODUCTION A. MotivationsThe last few years have witnessed the appearance of a growing number of peer-to-peer (P2P) file sharing systems. Such systems make it possible to harness the resources of large populations of networked computers in a cost-effective manner, and are characterized by their high scalability.P2P file sharing systems mainly differ by their search facilities. The first hugely successful P2P data exchange system, Napster [1], incorporates a centralized search facility that keeps track of files and peer nodes; queries are executed by the central server, while the resource-demanding file transfers are performed using P2P communication. This hybrid architecture offers powerful and responsive query processing, while still scaling well to large peer populations. The central server needs, however, to be properly dimensioned to support the user query load. In addition, it constitutes a single point of failure and can easily be brought down in the face of a legal challenge, as was the case for Napster. Consequently, most recent P2P file sharing systems have adopted more decentralized architectures.Roughly speaking, the P2P networks that do not rely on a centralized directory can be classified as either structured or unstructured. Structured P2P networks (e.g., Chord [2], CAN [3],

show abstract

Chord: a scalable peer-to-peer lookup protocol for internet applications

Cited by 5,314 publications

References 14 publications

Evaluating load balancing in peer-to-peer resource sharing algorithms for wireless mesh networks

Evaluating load balancing in peer-to-peer resource sharing algorithms for wireless mesh networks

Overlay networks a scalable alternative for p2p

Efficient search in unstructured peer‐to‐peer networks

Contact Info

Product

Resources

About