390 search results - page 32 / 78 » Computing shortest paths for any number of hops |
114
click to vote
DSN
2004
IEEE
15 years 5 months ago
2004
IEEE
Resiliency to link failures in optical networks is becoming increasingly important due to the increasing data rate in the fiber. Path protection schemes attempt to guarantee a bac...
127
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
117
click to vote
COMGEO
2008
ACM
15 years 2 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
102
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
101
click to vote
MOBIWAC
2006
ACM
15 years 7 months ago
2006
ACM
Some reactive ad hoc protocols allow the discovery and/or storage of multiple paths to the same destination node. The selection of the path to utilize is commonly based on the cri...