552 search results - page 98 / 111 » Constrained Shortest Path Computation |
SIGCOMM
1999
ACM
15 years 1 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
SIGMETRICS
2003
ACM
15 years 2 months ago
2003
ACM
Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network – i.e last mile connectivity to users, or access links of s...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
MASS
2010
14 years 7 months ago
2010
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
136
click to vote
Publication
Transportation specialists, urban planners, and public health officials have
been steadfast in encouraging active modes of transportation over the past decades.
Conventional thin...