41 search results - page 1 / 9 » Always acyclic distributed path computation |
109
click to vote
TON
2010
14 years 10 months 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...
IMC
2007
ACM
15 years 1 months ago
2007
ACM
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
INFOCOM
1998
IEEE
15 years 3 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...
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
In this paper, we present a fully distributed process to collect and distribute the minimal connected component (MCC) fault information so that the shortest-path between a source ...