By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Rutenburg, V. ; SRI Int., Menlo Park, CA, USA

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(|E|log D+||V|D) and time complexity O(|V|W), where |V| and |E| 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(|V|). In this case, the asynchronous algorithm obtained by applying Synchronizer α of B. Awerbuch (1987) has communication complexity O(|E|V|) and time complexity O(|V|). Serial, centralized versions of the algorithms with time complexity O(|E|+|V| log |V|) and space complexity O(|E|) are also presented

Published in:

INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

Date of Conference:

7-11 Apr 1991