552 search results - page 34 / 111 » Constrained Shortest Path Computation |
JNW
2007
13 years 9 months ago
2007
Abstract— We propose a new delay-constrained minimumhop distributed routing algorithm (DCMH) for unicastrouting. DCMH uses a novel path feasibility prediction (PFP) model that is...
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
TON
2008
13 years 9 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...
TON
2002
13 years 9 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
SOFSEM
2009
Springer
14 years 6 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...