DocumentCode :
2989892
Title :
Reduced information scenario for Shared Segment Protection
Author :
Tapolcai, Janos ; Heszberger, Zalan ; Retvari, Gabor ; Biro, Jozsef
Author_Institution :
Dept. of Telecommun. & Media Inf., Budapest Univ. of Technol. & Econ., Budapest, Hungary
fYear :
2013
fDate :
2-5 Dec. 2013
Firstpage :
589
Lastpage :
594
Abstract :
This paper introduces a new implementation of Shared Segment Protection (SSP) in mesh communication networks, in which a novel Integer Linear Program (ILP) is proposed under a reduced amount of routing information. In particular, the scheme of Distributed Partial Information Management with Sufficient and Aggregated Information (DPIM-SAM) [1] will be adopted for trading the optimality with the reduction on the computation time. We will verify the ILP formulation by comparing its result with the cases of SSP and Path Shared Protection under the complete routing information scenario (SCI) in terms of performance and computation time.
Keywords :
integer programming; linear programming; telecommunication network routing; telecommunication security; DPIM-SAM; ILP; SCI; SSP; complete routing information scenario; distributed partial information management; integer linear program; mesh communication network; path shared protection; reduced information scenario; shared segment protection; sufficient and aggregated information; Bandwidth; Complexity theory; Conferences; Network topology; Optical fiber networks; Resource management; Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cognitive Infocommunications (CogInfoCom), 2013 IEEE 4th International Conference on
Conference_Location :
Budapest
Print_ISBN :
978-1-4799-1543-9
Type :
conf
DOI :
10.1109/CogInfoCom.2013.6719171
Filename :
6719171
Link To Document :
بازگشت