Title :
A family of algorithms for network reliability problems
Author_Institution :
Vivace Networks Inc., San Jose, CA, USA
Abstract :
This paper presents a family of algorithms for the network reliability problem, all based on constraint generation using a multicommodity flow feasibility condition. An example is solved in detail and computational results are presented.
Keywords :
constraint theory; telecommunication network reliability; telecommunication network routing; telecommunication traffic; constraint generation; multicommodity flow feasibility condition; network reliability; Algorithm design and analysis; Bandwidth; Costs; Emulation; Failure analysis; Integrated circuit interconnections; Lifting equipment; Multiprotocol label switching; Routing; Switching circuits;
Conference_Titel :
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN :
0-7803-7400-2
DOI :
10.1109/ICC.2002.997231
