Concept

Link-state routing protocol

Publications associées (140)

Stable routing under the Spanning Tree Protocol

The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we design efficient algorithms to compute polynomial-size integer weights so as t ...

Elsevier2010

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20,000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...

2010

Hydrologisch-hydraulische Modellierung von alpinen Einzugsgebieten mit komplexen Krafwerksanlagen

Anton Schleiss, Martin Peter Bieri

The simulation of run-off in an alpine catchment area equipped with complex hydropower schemes is presented by the help of an especially developed tool, called Routing System, which can combine hydrological modelling and operation of hydraulic elements. Th ...

2010

Ambush avoidance in Vehicle Routing for valuable delivery

Matteo Salani, Gaëtan Duyckaerts, Peter Swartz

In this work we consider route planning for valuable delivery in an urban environment under the threat of ambushes in which a vehicle, starting from a depot, has to serve a set of predetermined destinations during the day. We provide a method to plan for h ...

2009

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

Karl Aberer, Wojciech Galuba, Zoran Despotovic

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

IEEE2009

Circulation of Autonomous Agents in Production and Service Networks

Max-Olivier Hongler, Olivier Gallay

The inherent complexity characterizing the production and/or service networks strongly favors decentralized and self-organizing mechanisms to regulate the flows of matter and information in circulation. This basic observation motivates us to study the flow ...

Elsevier2009

A Parsimonious Model of Mobile Partitioned Networks with Clustering

Matthias Grossglauser

Mobile wireless networks frequently possess, at the same time, both dense and sparse regions of connectivity; for example, due to a heterogeneous node distribution or radio propagation environment. This paper is about modeling both the mobility and the for ...

2009

CHARON: Convergent Hybrid-Replication Approach to Routing in Opportunistic Networks – Efficient Collection Routing for Low-Density Mobile WSNs

Jorge Miguel Dias Almeida Rodrigues Soares

Wireless Sensor Networks (WSNs) have been slowly moving into the mainstream as remote monitoring solutions – especially in hostile, hard-to-reach or otherwise complicated scenarios, where deployment of a traditional network may be unpractical. Some of the ...

2009

THE ACCEPTANCE OF A MULTIMODAL ROUTING SYSTEM

Multimodal Routing Systems allow routing by different modes which is particularly interesting in urban environments. These systems are expected to be an important tool to encourage modal shift. They can only work, however, if people accept and use this tec ...

2009

A Performance Survey on Deflection Routing Techniques for OBS Networks

Sébastien Rumley, Christian Gaumier

In this paper, we present a survey comparing different deflection routing based techniques applied to optical burst switching (OBS) networks. For such study we consider the E-OBS architecture proposed in [1] which is an advantageous solution for OBS networ ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

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