{"_id":"yazxzT9SYm4EPb8S4","bibbaseid":"maymounkov-mazires-kademliaapeertopeerinformationsystembasedonthexormetric-2002","downloads":0,"creationDate":"2018-07-03T04:50:29.545Z","title":"Kademlia: A Peer-to-peer Information System Based on the XOR Metric","author_short":["Maymounkov, P.","Mazières, D."],"year":2002,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Kademlia: A Peer-to-peer Information System Based on the XOR Metric","booktitle":"IPTPS \\textquoteright01 - Revised Papers from the First International Workshop on Peer-to-Peer System","series":"Lecture Notes in Computer Science","volume":"2429","year":"2002","month":"03/2001","pages":"53\\textendash65","publisher":"Springer-Verlag","organization":"Springer-Verlag","address":"Cambridge, MA, USA","abstract":"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.","keywords":"distributed hash table, fault-tolerance, Kademlia, P2P","isbn":"3-540-44179-4","doi":"10.1007/3-540-45748-8_5","url":"http://www.springerlink.com/content/2ekx2a76ptwd24qt/","author":[{"firstnames":["Petar"],"propositions":[],"lastnames":["Maymounkov"],"suffixes":[]},{"firstnames":["David"],"propositions":[],"lastnames":["Mazières"],"suffixes":[]}],"bibtex":"@conference {Maymounkov02kademlia:a,\n\ttitle = {Kademlia: A Peer-to-peer Information System Based on the XOR Metric},\n\tbooktitle = {IPTPS {\\textquoteright}01 - Revised Papers from the First International Workshop on Peer-to-Peer System},\n\tseries = {Lecture Notes in Computer Science},\n\tvolume = {2429},\n\tyear = {2002},\n\tmonth = {03/2001},\n\tpages = {53{\\textendash}65},\n\tpublisher = {Springer-Verlag},\n\torganization = {Springer-Verlag},\n\taddress = {Cambridge, MA, USA},\n\tabstract = {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.},\n\tkeywords = {distributed hash table, fault-tolerance, Kademlia, P2P},\n\tisbn = {3-540-44179-4},\n\tdoi = {10.1007/3-540-45748-8_5},\n\turl = {http://www.springerlink.com/content/2ekx2a76ptwd24qt/},\n\tauthor = {Petar Maymounkov and David Mazi{\\`e}res}\n}\n","author_short":["Maymounkov, P.","Mazières, D."],"key":"Maymounkov02kademlia:a","id":"Maymounkov02kademlia:a","bibbaseid":"maymounkov-mazires-kademliaapeertopeerinformationsystembasedonthexormetric-2002","role":"author","urls":{"Paper":"http://www.springerlink.com/content/2ekx2a76ptwd24qt/"},"keyword":["distributed hash table","fault-tolerance","Kademlia","P2P"],"downloads":0},"search_terms":["kademlia","peer","peer","information","system","based","xor","metric","maymounkov","mazières"],"keywords":["distributed hash table","fault-tolerance","kademlia","p2p"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}