Kademlia [16] is one of the most widely used DHTs (Distributed Hash Table) [10] in P2P (peer-to-peer) networks. In this work, we suggest and study a modification to the standard Kademlia network - hereby referred to as m-Kademlia. We study the connectivity of the random graph induced by m-Kademlia and then look at how long it takes to locate a node in this random graph. / Kademlia [16] est l'un des les plus utilisés DHTs (Distributed Hash Tableau) [10] dans les réseaux P2P (peer-to-peer). Dans ce travail, nous proposons et étudions une modification au réseau standard Kademlia - ci-après appelé m-Kademlia. Nous étudions la connectivité du graphe aléatoire induit par m-Kademlia et nous intéressons ensuite à connaître le temps nécessaire pour localiser un noeud donné de ce graphe aléatoire.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.119728 |
| Date | January 2013 |
| Creators | Deshmukh, Omkar |
| Contributors | Luc P Devroye (Internal/Supervisor) |
| Publisher | McGill University |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Format | application/pdf |
| Coverage | Master of Science (School of Computer Science) |
| Rights | All items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated. |
| Relation | Electronically-submitted theses. |
Page generated in 0.0019 seconds