Efficient distributed algorithms for computing shortest pairs of maximally disjoint paths in communication networks

• Published in: IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings pp. 1214 - 1219 vol.3
• Main Author: Rutenburg, V.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 1991
• Subjects: Communication networks; Complexity theory; Contracts; Distributed algorithms; Distributed computing; IEL; Intelligent networks; Network topology; Robustness; Routing
• ISBN: 0879426942; 9780879426941
• DOI: 10.1109/INFCOM.1991.147642

Distributed algorithms are presented for finding two maximally disjoint paths of minimum total length from each possible source node to a destination, including both node-disjoint and link-disjoint versions of the algorithm. A synchronous algorithm having communication complexity O( mod E mod log D+ mod mod V mod D) and time complexity O( mod V mod W), where mod V mod and mod E mod denote the number of nodes and links in G, W is the maximum link length, and D is the depth of a shortest-path spanning tree directed toward the destination, is presented. For the important case W=O(1), the time complexity becomes O( mod V mod ). In this case, the asynchronous algorithm obtained by applying Synchronizer alpha of B. Awerbuch (1987) has communication complexity O( mod E mod V mod ) and time complexity O( mod V mod ). Serial, centralized versions of the algorithms with time complexity O( mod E mod + mod V mod log mod V mod ) and space complexity O( mod E mod ) are also presented.< >