Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

نویسندگان

  • Petar Maymounkov
  • David Mazières
چکیده

We describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment. Our system routes queries and locates nodes using a novel XOR-based metric topology that simplifies the algorithm and facilitates our proof. The topology has the property that every message exchanged conveys or reinforces useful contact information. The system exploits this information to send parallel, asynchronous query messages that tolerate node failures without imposing timeout delays on users.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation of the Impact of Packet Errors on the Kademlia Peer-to-Peer Routing

Tactical radio communication is crucial for command and control. The progress in C2 software demands higher and higher transmission rates, more employed radios and higher robustness. Interconnectivity between various participants of a tactical network is achieved by increased usage of the Internet Protocol. Structured overlay networks, so called peer-to-peer networks can help to increase the re...

متن کامل

Specifying and Analyzing the Kademlia Protocol in Maude

Kademlia is a peer-to-peer distributed hash table (DHT) currently used in the P2P eDonkey file sharing network. Kademlia offers a number of desirable features that result from the use of a notion of distance between objects based on the bitwise exclusive or of the n-bit quantities that represent both nodes and files. Nodes keep information about files close or near to them in the key space and ...

متن کامل

A formal speci cation of the Kademlia distributed hash table

Kademlia is a peer-to-peer distributed hash table (DHT) currently used in the P2P eDonkey le sharing network. The most popular clients used to connect to the Kad network are eMule, aMule and BitTorrent. As other DHT, Kademlia look-up algorithm takes logn steps, which can be reduced to log2b n by increasing the node's routing table size. It also o ers a number of desirable features not o ered by...

متن کامل

Measuring Large Overlay Networks - The Overnet Example

Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create global scale overlay networks on top of which various applications can be built. Although filesharing still is the most prominent example, other applications are well conceivable. In order to rationally design such appl...

متن کامل

The Viewpoints of Alborz University of Medical Sciences’ Faculty Members on Open Peer Review of Journal Articles

Background and Aim: The open peer review process, which is one of the peer-reviewed methods in journals, has been accepted in scientific forums. The aim of this study was to investigate the points of view of university faculty members about the open peer review process of journal articles. Materials and Methods: The study used a descriptive survey. The sample size was calculated using the Coch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002