Publication

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

Publications associées (41)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

GosSkip: a Gossip-based Structured Overlay Network for Efficient Content-based Filtering

Rachid Guerraoui, Anne-Marie Kermarrec, Sidath Handurukande

It is appealing to implement publish/subscribe systems in a peer to peer (P2P) manner to circumvent the scalability issues of broker-based (semi-decentralized) systems and simplify the deployment. While existing P2P generic infrastructures provide a scalab ...

2004

Principles of Query-Adaptive Optimal Replication in DHTs

Karl Aberer, Anwitaman Datta, Wolfgang Nejdl

This paper focuses on replication in DHT based structured overlay networks, and presents a theoretical framework for optimal replication in such networks with respect to query frequency. In particular, we determine the optimal replication factor for query- ...

2004

On de Bruijn Routing in Distributed Hash Tables: There and Back Again

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

We show in this paper that de Bruijn networks, despite providing efficient search while using constant routing table size, as well as simplicity of the understanding and implementation of such networks, are unsuitable where key distribution will be uneven, ...

2004

Scalability in adaptive multi-metric overlays

Dejan Kostic

Increasing application requirements have placed heavy emphasis on building overlay networks to efficiently deliver data to multiple receivers. A key performance challenge is simultaneously achieving adaptivity to changing network conditions and scalability ...

IEEE Comput. Soc2004

Handling Identity in Peer-to-Peer Systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Due to the limited number of available IP addresses most computers on the Internet use dynamic IP addresses which causes problems for applications that have to maintain rout-ing tables, for example, peer-to-peer systems. To overcome this we propose unique ...

2003

Using Random Subsets to Build Scalable Network Services

Dejan Kostic

In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participants. Key to this approach is ensuring that membership in the subset changes per ...

2003

The Performance of Measurement-Based Overlay Networks

Sonja Buchegger, Paolo Scotton

The literature contains propositions for the use of overlay networks to supplement the normal IP routing functions with higher-level information in order to improve aspects of network behavior. We consider the use of such an overlay to optimize the end-to- ...

2002

Load Balancing in Data Networks

Load balancing apparatus for a data communications network comprises hash logic for computing a hash function on incoming data packets. A threshold detector is connected to the hash logic for triggering, in response to utilization of the downstream objects ...

2002

Scalable routing protocols with applications to mobility

Ljubica Blazevic

In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...

EPFL2002

Self Organized Terminode Routing

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage ...

2002