83 search results - page 9 / 17 » Arc routing problems with time-dependent service costs |
107
click to vote
ICDCS
1999
IEEE
15 years 4 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
WINET
2002
14 years 11 months ago
2002
Abstract. The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an int...
103
click to vote
COMCOM
2006
14 years 11 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
NGC
2000
Springer
15 years 3 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...