Title :
Algorithms for finding an optimal set of short disjoint paths in a communication network
Abstract :
The motives for seeking a set of short disjoint paths in a communication network are explained. A sequentially constructed optimal set is defined. Three efficient algorithms, one that constructs an optimal set and two that construct approximations, are presented. One of the latter algorithms not only constructs a larger set of short disjoint paths than an iterated version of the standard Dijkstra algorithm, but also offers a major reduction in computation time for large networks
Keywords :
Communication networks; Costs; Delay effects; Graph theory; Intelligent networks; Length measurement; Mathematical model; Modems; Relays; Routing;
Conference_Titel :
Military Communications Conference, 1991. MILCOM '91, Conference Record, Military Communications in a Changing World., IEEE
Conference_Location :
McLean, VA
Print_ISBN :
0-87942-691-8
DOI :
10.1109/MILCOM.1991.258192