Title :
An algorithm for designing rings for survivable fiber networks
Author :
Wasem, Ondria J.
Author_Institution :
Bellcore, Red Bank, NJ, USA
fDate :
10/1/1991 12:00:00 AM
Abstract :
The authors present an algorithm for routing fiber around a ring in a network, when the network nodes, links, connectivity, and which offices are to be used on that ring together are known. The algorithm aids automated survivable network planning. The algorithm was programmed in C, and run on a SPARC-station. Under certain conditions, the problem degenerates to the traveling salesman problem, and the ring routing algorithm degenerates to the nearest neighbor method of solving that problem
Keywords :
optical links; reliability; telecommunication networks; telecommunications computing; C program; CAD; SPARC-station; fiber networks; network design; ring network; routing algorithm; survivable network planning; telecommunication network; traveling salesman problem; Algorithm design and analysis; Communication cables; Costs; Optical fiber cables; Optical fiber networks; Optical fiber theory; Routing; SONET; Telecommunication network reliability; Traveling salesman problems;
Journal_Title :
Reliability, IEEE Transactions on
