Handling Very Large Numbers of Messages in Distributed Hash Tables
2009 (English)In: Proceedings of The First International Conference on COMmunication Systems and NETworkS (COMSNETS), IEEE conference proceedings, 2009, -9 p.Conference paper (Refereed)
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.
IdentifiersURN: urn:nbn:se:kth:diva-147091DOI: 10.1109/COMSNETS.2009.4808887ISBN: 978-1-4244-2912-7OAI: oai:DiVA.org:kth-147091DiVA: diva2:727648
The First International Conference on COMmunication Systems and NETworkS (COMSNETS)5-10 Jan. 2009 Bangalore
QC 201407072014-06-232014-06-232014-07-07Bibliographically approved