92 search results - page 9 / 19 » Restricted Shortest Path Routing with Concave Costs |
ICDCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
SIGCOMM
1989
ACM
13 years 11 months ago
1989
ACM
The ARPANBT routing metric wasrevised in July 1987,resulting in substantial performance improvements, especially in terms of user delay and effective network capacity. These revis...
HICSS
2003
IEEE
14 years 25 days ago
2003
IEEE
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...