DocumentCode
2845557
Title
A computational study for demand-wise shared protection
Author
Gruber, C.G. ; Koster, A.M.C.A. ; Orlowski, S. ; Wessäly, R. ; Zymolka, A.
Author_Institution
Inst. of Commun. Networks, Munich Univ. of Technol., Germany
fYear
2005
fDate
16-19 Oct. 2005
Abstract
In this paper, we compare the new resilience mechanism demand-wise shared protection (DSP) with dedicated and shared path protection. The computational study on five realistic network planning scenarios reveals that that the best solutions for DSP are on average 15% percent better than the corresponding 1+1 dedicated path protection solutions, and only 15% percent worse than shared path protection.
Keywords
integer programming; linear programming; telecommunication network planning; telecommunication network reliability; telecommunication network routing; computational study; dedicated path protection solution; demand-wise shared protection; integer linear programming; network design; network planning; resilience mechanism; shared path protection; Bandwidth; Communication networks; Computer networks; Cost function; Digital signal processing; Electronic mail; Integer linear programming; Path planning; Protection; Resilience;
fLanguage
English
Publisher
ieee
Conference_Titel
Design of Reliable Communication Networks, 2005. (DRCN 2005). Proceedings.5th International Workshop on
Print_ISBN
0-7803-9439-9
Type
conf
DOI
10.1109/DRCN.2005.1563902
Filename
1563902
Link To Document