Referenced Items are not available for this document.
This paper studies the survivable routing problem for segment shared protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the integer linear program (ILP) formulation for SSP by additionally considering the constraint on the restoration time for each connection request and the switching/merging capability in each node. Extensive simulation efforts are addressed to investigate the performance impairment by adopting different upper bounds of the two constraints. The computation time and the problem size in the CPLEX solver are analyzed.
Published in:
Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on
Date of Conference: 10-12 May 2004
- Page(s):
- 319 - 325
- ISSN :
- 1087-4089
- Print ISBN:
- 0-7695-2135-5
- INSPEC Accession Number:
- 8032831
- Digital Object Identifier :
- 10.1109/ISPAN.2004.1300499
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
