Kaleidoscope: Adding colors to Kademlia

Gil Einziger; Roy Friedman; Eyal Kibbar

doi:https://doi.org/10.1109/P2P.2013.6688703

Kaleidoscope: Adding colors to Kademlia

Gil Einziger, Roy Friedman, Eyal Kibbar

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	American English
Title of host publication	13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings
DOIs	https://doi.org/10.1109/P2P.2013.6688703
State	Published - 1 Jan 2013
Event	13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Trento, Italy Duration: 9 Sep 2013 → 11 Sep 2013

Publication series

Name	13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings

Conference

Conference	13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013
Country/Territory	Italy
City	Trento
Period	9/09/13 → 11/09/13

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

https://doi.org/10.1109/P2P.2013.6688703

Cite this

@inproceedings{0fd7a9e8fd274316a3e8361597799e54,

title = "Kaleidoscope: Adding colors to Kademlia",

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.",

author = "Gil Einziger and Roy Friedman and Eyal Kibbar",

year = "2013",

month = jan,

day = "1",

doi = "https://doi.org/10.1109/P2P.2013.6688703",

language = "American English",

isbn = "9781479905218",

series = "13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings",

booktitle = "13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings",

note = "13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 ; Conference date: 09-09-2013 Through 11-09-2013",

}

Einziger, G , Friedman, R & Kibbar, E 2013, Kaleidoscope: Adding colors to Kademlia. in 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings., 6688703, 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings, 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013, Trento, Italy, 9/09/13. https://doi.org/10.1109/P2P.2013.6688703

Kaleidoscope: Adding colors to Kademlia. / Einziger, Gil ; Friedman, Roy; Kibbar, Eyal.
13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings. 2013. 6688703 (13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Kaleidoscope

T2 - 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013

AU - Einziger, Gil

AU - Friedman, Roy

AU - Kibbar, Eyal

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84893220619&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/P2P.2013.6688703

DO - https://doi.org/10.1109/P2P.2013.6688703

M3 - Conference contribution

SN - 9781479905218

T3 - 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings

BT - 13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013 - Proceedings

Y2 - 9 September 2013 through 11 September 2013

ER -

Kaleidoscope: Adding colors to Kademlia

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this