Shades: Expediting Kademlia's lookup process

Gil Einziger; Roy Friedman; Yoav Kantor

doi:10.1016/j.comnet.2016.01.014

Shades: Expediting Kademlia's lookup process

Gil Einziger, Roy Friedman, Yoav Kantor

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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 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 language	English
Pages (from-to)	37-50
Number of pages	14
Journal	Computer Networks
Volume	99
DOIs	https://doi.org/10.1016/j.comnet.2016.01.014
State	Published - 22 Apr 2016
Externally published	Yes

Keywords

Caching
Kademlia
Lookup process
Peer-to-peer

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1016/j.comnet.2016.01.014

Cite this

@article{86b1458631b44f11afba285f15510ed3,

title = "Shades: Expediting Kademlia's lookup process",

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

keywords = "Caching, Kademlia, Lookup process, Peer-to-peer",

author = "Gil Einziger and Roy Friedman and Yoav Kantor",

year = "2016",

month = apr,

day = "22",

doi = "10.1016/j.comnet.2016.01.014",

language = "English",

volume = "99",

pages = "37--50",

journal = "Computer Networks",

issn = "1389-1286",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Shades

T2 - Expediting Kademlia's lookup process

AU - Einziger, Gil

AU - Friedman, Roy

AU - Kantor, Yoav

PY - 2016/4/22

Y1 - 2016/4/22

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

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

KW - Caching

KW - Kademlia

KW - Lookup process

KW - Peer-to-peer

UR - https://www.scopus.com/pages/publications/84959562078

U2 - 10.1016/j.comnet.2016.01.014

DO - 10.1016/j.comnet.2016.01.014

M3 - Article

AN - SCOPUS:84959562078

SN - 1389-1286

VL - 99

SP - 37

EP - 50

JO - Computer Networks

JF - Computer Networks

ER -

Shades: Expediting Kademlia's lookup process

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this