גיל אינציגר

אקדמי בכיר

Shades

Expediting Kademlia's lookup process

Gil Einziger, Roy Friedman, Yoav Kantor

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.

שפת פרסום אנגלית
דפים 37-50
כתב עת Computer Networks
כרך 99
סטטוס פרסום פורסם - 22.04.2016

Keywords

Caching
Kademlia
Lookup process
Peer-to-peer

ASJC Scopus subject areas

Computer Networks and Communications
גישה למסמך
10.1016/j.comnet.2016.01.014
קבצים וקישורים אחרים
Link to publication in Scopus