DocumentCode
2438879
Title
A family of algorithms for network reliability problems
Author
Shaio, Jack
Author_Institution
Vivace Networks Inc., San Jose, CA, USA
Volume
4
fYear
2002
fDate
2002
Firstpage
2167
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2002. ICC 2002. IEEE International Conference on
Print_ISBN
0-7803-7400-2
Type
conf
DOI
10.1109/ICC.2002.997231
Filename
997231
Link To Document