425 search results - page 16 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
124
Voted
INFOCOM
1998
IEEE
15 years 6 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
136
Voted
TON
2010
15 years 17 days 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...
123
click to vote
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
121
click to vote
ISCIS
2004
Springer
15 years 7 months ago
2004
Springer
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
129
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...