Publication

Self-organized fault-tolerant routing in peer-to-peer overlays

Publications associées (80)

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

Adaptive Load Sharing for Network Processors

Jean-Yves Le Boudec

A novel scheme for processing packets in a router is presented, which provides for load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Inco ...

IEEE2002

Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Devices in mobile ad hoc networks work as network nodes and relay packets originated by other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous ...

2001

Self Organized Terminode Routing - Version 2

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; seco ...

2001

Gridella: A self-organizing P2P system

Karl Aberer, Manfred Hauswirth, Roman Schmidt

This paper describes our Gnutella compatible P2P system Gridella which is based on the P-Grid approach. P-Grid has several advantages over the standard Gnutella infrastructure, for example, that probabilistic estimates can be given for successful search re ...

2001

Adaptive Load Sharing for Network Processors

Jean-Yves Le Boudec

2001

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 such a network is designed with the following objectives. Firstly, it should scale well in terms of the number of nodes and geographical coverage, ...

2000

Self-Organizing Wide-Area Routing

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a Mobile Ad-Hoc wide area network called Terminodes Network. In our solution every node builds its personal view of the network, composed of local and remote views. Large scale routing in the terminode network is achie ...

2000

Self-Organizing Wide-Area Routing

Jean-Yves Le Boudec, Ljubica Blazevic

2000

Opportunities for Bandwidth Adaptation in Microsoft Office Documents

Willy Zwaenepoel

Microsoft Office, the most popular office productivity suite, produces large documents that can result in long download latencies for platforms with limited bandwidth. To reduce latency and improve the user's experience, these documents need to be adapted ...

2000

Online throughput-competitive algorithm for multicast routing and admission control

Monika Henzinger, Ashish Goel

We present the first polylog-competitive online algorithm for the general multicast problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of requests accepted by our algorithm ...

SIAM1998