Sciweavers

4 search results - page 1 / 1
» Dynamic route recomputation considered harmful
Sort
View
CCR
2010
88views more  CCR 2010»
13 years 5 months ago
Dynamic route recomputation considered harmful
Matthew Caesar, Martin Casado, Teemu Koponen, Jenn...
ISCAPDCS
2003
13 years 6 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
SECON
2007
IEEE
13 years 11 months ago
Robust Routing and Scheduling in Wireless Mesh Networks
—Joint routing-and-scheduling has been considered in wireless mesh networks for its significant performance improvement. While existing work assumes it, accurate traffic inform...
Wei Wang, Xin Liu, Dilip Krishnaswamy
PODC
2005
ACM
13 years 11 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking