DocumentCode
1635922
Title
Supplementing Non-Simple p-Cycles with Preconfigured Lines
Author
Lastine, David ; Somani, Arun K.
Author_Institution
Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA
fYear
2008
Firstpage
5443
Lastpage
5447
Abstract
This paper considers link based protection where backup capacity is preconfigured into various patterns. When the amount of backup capacity available on a link is constrained, the choice of patterns under consideration can determine if a given network is protectable. This paper gives an ILP that can be used in calculating preconfigurations, even when p-Cycles with p-lines or non-simple p-Cycles alone may not be able to. This ILP includes constraints that will cause backup capacity to be distributed in a somewhat even fashion when possible. When considering networks with dynamic traffic, this may offer the advantage of lower blocking probability over schemes that concentrate backup capacity on a few links. The advantage is demonstrated by a simulation of NSFnet comparing blocking probability of a distribution computed by this ILP vs. a Hamiltonian p-Cycle which is a capacity optimal way to protect the network.
Keywords
graph theory; integer programming; linear programming; optical fibre networks; probability; telecommunication network reliability; telecommunication traffic; NSFnet simulation; backup capacity; blocking probability; integer linear programming; network traffic; nonsimple Hamiltonian p-cycle link based protection; Bandwidth; Capacity planning; Communications Society; Computational modeling; Distributed computing; Optical fiber networks; Protection; Switches; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2008. ICC '08. IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-2075-9
Electronic_ISBN
978-1-4244-2075-9
Type
conf
DOI
10.1109/ICC.2008.1020
Filename
4534056
Link To Document