Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Handling Very Large Numbers of Messages in Distributed Hash Tables
EPFL.ORCID iD: 0000-0002-1256-1070
2009 (English)In: Proceedings of The First International Conference on COMmunication Systems and NETworkS (COMSNETS), IEEE conference proceedings, 2009, -9 p.Conference paper, Published paper (Refereed)
Abstract [en]

The principal service of distributed hash tables (DHTs) is route(id, data), which sends data to a peer responsible for id, using typically O(log(# of peers)) overlay hops. Certain applications like peer-to-peer information retrieval generate billions of small messages that are concurrently inserted into a DHT. These applications can generate messages faster than the DHT can process them. To support such demanding applications, a DHT needs a congestion control mechanism to efficiently handle high loads of messages. In this paper we provide an extended study on congestion control for DHTs: we present a theoretical analysis that demonstrates that congestion control for DHTs is absolutely necessary for applications that provide elastic traffic. We then present a new congestion control algorithm for DHTs. We provide extensive live evaluations in a ModelNet cluster and the PlanetLab test bed, which show that our algorithm is nearly loss-free, fair, and provides low lookup times and high throughput under cross-load.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2009. -9 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-147091DOI: 10.1109/COMSNETS.2009.4808887ISBN: 978-1-4244-2912-7 (print)OAI: oai:DiVA.org:kth-147091DiVA: diva2:727648
Conference
The First International Conference on COMmunication Systems and NETworkS (COMSNETS)5-10 Jan. 2009 Bangalore
Note

QC 20140707

Available from: 2014-06-23 Created: 2014-06-23 Last updated: 2014-07-07Bibliographically approved

Open Access in DiVA

fulltext(295 kB)26 downloads
File information
File name FULLTEXT01.pdfFile size 295 kBChecksum SHA-512
05cb52e3381663aca0552edb7e5db29e0d1cd489fa69aaffdc553ae7d05b788b18d46bde69de9b2b4d808468ce36a8deb6a2034e4938180e72bd2113063bcef5
Type fulltextMimetype application/pdf

Other links

Publisher's full textIEEEXplore

Authority records BETA

Kostic, Dejan

Search in DiVA

By author/editor
Kostic, Dejan
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 26 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 43 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf