Title :
Algorithms for finding an optimal set of short disjoint paths in a communication network
Author_Institution :
US Army Survivability Manage. Office, Adelphi, MD, USA
fDate :
11/1/1992 12:00:00 AM
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 :
telecommunication network routing; Dijkstra algorithm; communication network; pathfinding algorithms; sequentially constructed optimal set; short disjoint paths; Communication networks; Computer networks; Costs; Delay effects; Graph theory; Intelligent networks; Length measurement; Mathematical model; Modems; Routing;
Journal_Title :
Communications, IEEE Transactions on
