Shades: Expediting Kademlia's lookup process

Gil Einziger, Roy Friedman, Yoav Kantor

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


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 Shades, a combined routing/caching scheme that significantly shortens the average lookup process in Kademlia and improves its load handling. The paper also includes an extensive performance study demonstrating the benefits of Shades and compares it to other suggested alternatives using both synthetic workloads and traces from YouTube and Wikipedia.

Original languageEnglish
Title of host publicationEuro-Par 2014
Subtitle of host publicationParallel Processing - 20th International Conference, Proceedings
EditorsFernando Silva, Inês Dutra, Vítor Santos Costa
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783319098722
ISBN (Print)9783319098722
StatePublished - 1 Jan 2014
Externally publishedYes
Event20th International Conference on Parallel Processing, Euro-Par 2014 - Porto, Portugal
Duration: 25 Aug 201429 Aug 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8632 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th International Conference on Parallel Processing, Euro-Par 2014

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Shades: Expediting Kademlia's lookup process'. Together they form a unique fingerprint.

Cite this