Sciweavers

44 search results - page 1 / 9
» LSRP: Local Stabilization in Shortest Path Routing
Sort
View
DSN
2003
IEEE
13 years 10 months ago
LSRP: Local Stabilization in Shortest Path Routing
—We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the sta...
Anish Arora, Hongwei Zhang
CONEXT
2005
ACM
13 years 6 months ago
The stability of paths in a dynamic network
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghe...
INFOCOM
2009
IEEE
13 years 11 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
ORL
2010
85views more  ORL 2010»
13 years 3 months ago
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 d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
4OR
2010
148views more  4OR 2010»
13 years 3 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini