• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Kademlia: A Peer-to-peer Information System Based on the XOR Metric (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cs.rice.edu]
  • [www.cs.utexas.edu]
  • [www.comp.nus.edu.sg]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.utexas.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.scs.stanford.edu]
  • [www.cs.uiowa.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [personal.ie.cuhk.edu.hk]
  • [www.cs.utexas.edu]
  • [cs.brown.edu]
  • [www.imit.kth.se]
  • [netgroup.polito.it]
  • [hsn.cse.nsysu.edu.tw]
  • [www.sics.se]
  • [homepage.cs.uiowa.edu]
  • [www.cs.cornell.edu]
  • [www.cs.utexas.edu]
  • [www.itu.dk]
  • [www.cs.cornell.edu]
  • [www.iptps.org]
  • [css.csail.mit.edu]
  • [www.scs.stanford.edu]
  • [read.pudn.com]
  • [www.scs.cs.nyu.edu]
  • [superpeer1.das2.ewi.tudelft.nl]
  • [www.tribler.org]
  • [kayapo.tribler.org]
  • [www.ic.unicamp.br]
  • [disi.unitn.it]
  • [disi.unitn.it]
  • [tams-www.informatik.uni-hamburg.de]
  • [www.ic.unicamp.br]
  • [infinite-source.de]
  • [users.informatik.haw-hamburg.de]
  • [www.buet.ac.bd]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Petar Maymounkov , David Mazières
Citations:834 - 3 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Maymounkov02kademlia:a,
    author = {Petar Maymounkov and David Mazières},
    title = {Kademlia: A Peer-to-peer Information System Based on the XOR Metric},
    year = {2002}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We describe a peer-to-peer system which has 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.

Keyphrases

peer-to-peer information system    xor metric    reinforces useful contact information    node failure    peer-to-peer system    fault-prone environment    novel xor-based metric topology    timeout delay    asynchronous query message    provable consistency   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University