48 search results - page 3 / 10 » A Simple Approximation to Minimum-Delay Routing |
TON
2008
13 years 8 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
MOBIHOC
2010
ACM
13 years 6 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
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...
ICDE
2011
IEEE
13 years 7 days ago
2011
IEEE
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...