279 search results - page 17 / 56 » Reduction approaches for robust shortest path problems |
101
click to vote
TON
2010
14 years 8 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
82
Voted
ISCC
2005
IEEE
15 years 3 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
92
Voted
EOR
2007
14 years 9 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
106
Voted
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
ISCC
2003
IEEE
15 years 2 months ago
2003
IEEE
Multiple Description (MD) and Layered Coding (LC) are two source-coding approaches proposed for adaptive and robust video streaming over lossy networks. Both streaming methods aim...