Publication

Congestion Control for Distributed Hash Tables

Karl Aberer, Jean-Yves Le Boudec, Fabius Klemm
2006
Conference Papers

Abstract

Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, we look at congestion control for DHTs. Our goal is to control the flow of lookup requests that are routed in the overlay network. We first show that congestion control is essential for certain applications with high lookup rates. We then present two congestion control mechanisms for DHTs and compare their performances in different network conditions.

Official source

https://infoscience.epfl.ch/entities/publication/8f036cdc-79b6-45bd-8c48-47a1b20b1f09

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Congestion Control for Distributed Hash Tables

Chat with Graph Search

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

Fast and Future: Towards Efficient Forecasting in Video Semantic Segmentation

Oligolithic Cross-task Optimizations across Isolated Workloads