Kaleidoscope: Adding colors to Kademlia

Author

Einziger, Gil ; Friedman, R. ; Kibbar, Eyal

Author_Institution

Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel

fYear

2013

fDate

9-11 Sept. 2013

Firstpage

1

Lastpage

10

Abstract

Kademlia is considered to be one of the most effective key based routing protocols. It is nowadays implemented in many file sharing peer-to-peer networks such as BitTorrent, KAD, and Gnutella. This paper introduces Kaleidoscope, a novel routing/caching scheme designed to significantly reduce the cost of lookup operations in Kademlia by using a color-based distributed cache. Moreover, Kaleidoscope greatly improves load balancing among the nodes and reduces the well documented hot spots problem. The paper also includes an extensive performance study demonstrating the benefits of Kaleidoscope.

Keywords

cache storage; peer-to-peer computing; resource allocation; routing protocols; table lookup; BitTorrent; Gnutella; KAD; Kademlia; Kaleidoscope; color-based distributed cache; file sharing peer-to-peer networks; hot spots problem; key based routing protocols; load balancing; lookup operations; routing/caching scheme; Color; Conferences; Measurement; Peer-to-peer computing; Routing; Routing protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

Peer-to-Peer Computing (P2P), 2013 IEEE Thirteenth International Conference on

Conference_Location

Trento

Type

conf

DOI

10.1109/P2P.2013.6688703

Filename

6688703