Sciweavers

2343 search results - page 209 / 469
» The Locomotive Routing Problem
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 12 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
SIROCCO
2008
15 years 8 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
JNW
2008
117views more  JNW 2008»
15 years 6 months ago
An Intelligent Multicast Ad-hoc On demand Distance Vector Protocol for MANETs
-Recently multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication. This includes application such as multipoint data disseminat...
E. Baburaj, V. Vasudevan
INFOCOM
2011
IEEE
14 years 10 months ago
There's something about MRAI: Timing diversity can exponentially worsen BGP convergence
—To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer setting...
Alex Fabrikant, Umar Syed, Jennifer Rexford
ICALP
2003
Springer
15 years 11 months ago
Anycasting in Adversarial Systems: Routing and Admission Control
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
Baruch Awerbuch, André Brinkmann, Christian...