Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing
 

Summary: Improving the Throughput of Distributed Hash Tables
Using Congestion-Aware Routing
Fabius Klemm, Jean-Yves Le Boudec, Dejan Kosti´c, Karl Aberer
School of Computer and Communication Sciences
Ecole Polytechnique F´ed´erale de Lausanne (EPFL), Lausanne, Switzerland
Abstract
Advanced applications for Distributed Hash Tables
(DHTs), such as Peer-to-Peer Information Retrieval, require
a DHT to quickly and efficiently process a large number (in
the order of millions) of requests. In this paper we study
mechanisms to optimize the throughput of DHTs. Our goal
is to maximize the number of route operations per peer per
second a DHT can perform (given certain constraints on the
lookup delay). Each peer receives congestion feedback from
the DHT, which it uses to adjust its routing decisions. This
way, peers can avoid routing through slow parts of the over-
lay network and hence increase the rate at which they insert
new messages into the DHT. We provide a numerical analysis
of congestion-aware routing in DHTs and show that consid-
erable improvements in throughput are possible compared to

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences