Solution for the broadcasting in the Kademlia peer-to-peer overlay |
| |
| Authors: | Zoltán Czirkos Gábor Hosszú |
| |
| Affiliation: | 1. NICTA, Australia;2. Australian National University, Australia;3. Ecole Polytechnique Federale de Lausanne, Switzerland;1. Karlstad University, Computer Science Department, Universitetsgatan 2, 65 188 Karlstad, Sweden;2. Stanford University, Stanford, CA 94305, USA;3. Telekom Innovation Laboratories, Ernst-Reuter-Platz 7, 10587 Berlin, Germany;1. Department of Computing, Curtin University of Technology, Perth, WA, Australia;2. University of Wollongong, Northfields Ave., Wollongong, NSW, Australia;1. Telefonica Research, Plaza de Ernest Lluch i Martín, 5, floor 15, 08019 Barcelona, Spain;2. Budapest University of Technology and Economics, Department of Telecommunications and Media Informatics, 2 Magyar tudósok körútja, Budapest, H-1117, Hungary;3. Norwegian University of Science and Technology, Department of Telematics, O.S. Bragstads plass 2a, N-7491 Trondheim, Norway;4. Hungarian Academy of Science (MTA) Information System Research Group, Széchenyi István tér 9., 1051 Budapest, Hungary;5. MTA-BME Future Internet Research Group, Széchenyi István tér 9., 1051 Budapest, Hungary;6. Inter-University Centre for Telecommunications and Informatics, Kassai út 26., 4028 Debrecen, Hungary |
| |
| Abstract: | Structured peer-to-peer networks are capable of fast and efficient lookup operations as a distributed hash table. The topology of these networks makes it possible to send broadcast messages among nodes, either for the purpose of providing a complex query service for participants, or to disseminate information valuable for all nodes. In this article a broadcast algorithm for the Kademlia XOR topology is presented. The algorithm, which was developed specifically for Kademlia, uses replication mechanisms similar to that of the storage and retrieval service of this overlay topology. This allows for increased reliability and speed of the broadcast, and also efficient operation, as the routing table for lookups are already available and can be used. An analytical model is presented, which can be used to calculate the required level of replication for any desired reliability at runtime, and is validated with simulation as well. |
| |
| Keywords: | Peer-to-peer Distributed hash table Kademlia Broadcast |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
