| Conference |
| Type of Publication |
| Load Reduction in the KAD Peer-to-Peer System |
| Title |
|
Ernst W. Biersack
Taoufik En-Najjary
|
| Authors |
| Fifth International Workshop on Databases,
Information Systems and Peer-to-Peer Computing
(DBISP2P), Vienna, Austria, August 2007 |
| Published in |
| Distributed hash tables (DHTs) have been
actively studied in literature and many different proposals have
been made on how to or- ganize peers in a DHT. However, very few
DHTs have been implemented in real systems and deployed on a
large scale. One exception is kad, a DHT based on Kademlia, which
is part of eDonkey2000, a peer-to-peer file sharing system with
several million simultaneous users. In this pa- per, we
investigate the publishing and searching mechanisms in kad. We
designed and implemented Mistral, a content spy that can capture
up to ten million references to published content in several
hours. At first evaluation, we notice that publishing new content
in a kad system is much more expensive than searching and
retrieving existing content. Indeed, measurements show that of
all the Internet traffic generated by kad-based peer-to-peer
networks, 90% is for publishing and 10% for re- trieving existing
files. Moreover, the most published keywords are mean- ingless
stopwords. We propose to add a stopword filtering mechanism to
the searching and publishing procedures of kad-based peer-to-peer
systems. We provide detailed experimental evidence based on
millions of publications of a real-world peer-to-peer system that
shows a consider- able reduction of the load on the peers without
losing efficience in the retrieval and subsequent publishing
operations. |
| Abstract |
| [PDF]
[BIB] [XML] |
| Downloads & Bib-Entries |
