Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively Paola FLOCCHINI Antonio Mesa ENRIQUES Linda PAGLI Giuseppe PRENCIPE Nicola SANTORO Publication IEICE TRANSACTIONS on Information and Systems Vol.E89-D No.2 pp.700-708 Publication Date: 2006/02/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e89-d.2.700 Print ISSN: 0916-8532 Type of Manuscript: Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking) Category: Network Protocols, Topology and Fault Tolerance Keyword: fault-tolerant routing, point of failure rerouting, shortest path spanning tree, weighted graphs, distributed algorithms, Full Text: PDF(369.9KB)>>
Summary: We consider the problem of computing the optimal swap edges of a shortest-path tree. This problem arises in designing systems that offer point-of-failure shortest-path rerouting service in presence of a single link failure: if the shortest path is not affected by the failed link, then the message will be delivered through that path; otherwise, the system will guarantee that, when the message reaches the node where the failure has occurred, the message will then be re-routed through the shortest detour to its destination. There exist highly efficient serial solutions for the problem, but unfortunately because of the structures they use, there is no known (nor foreseeable) efficient distributed implementation for them. A distributed protocol exists only for finding swap edges, not necessarily optimal ones. We present two simple and efficient distributed algorithms for computing the optimal swap edges of a shortest-path tree. One algorithm uses messages containing a constant amount of information, while the other is tailored for systems that allow long messages. The amount of data transferred by the protocols is the same and depends on the structure of the shortest-path spanning-tree; it is no more, and sometimes significantly less, than the cost of constructing the shortest-path tree. | ||||||||||
| ||||||||||
