Abstract

network utilization continues to grow in the coming years, there will be increased pressure on network operators to use traffic engineering to provision resources more efficiently. One way to do this is to allow backup paths associated with disjoint working paths to share bandwidth. Increasing the amount of sharing will naturally increase the risk that a faded working path will either be unrecovered or forced to use dynamic recovery mechanisms. To examine the tradeoffs between robustness and efficiency and to develop useful performance bounds, we develop theoretical models for (1:1)(n) recovery schemes that are independent of the network's topology and management plane. We confirm our results using simulations of uncorrelated failures in a wide-area optical network with various degrees of resource sharing.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1109/icc.2004.1312786 under the license cc0
https://www.nist.gov/publications/restorability-versus-efficiency-11-protection-schemes-optical-networks,
https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=151119,
https://yonsei.pure.elsevier.com/en/publications/restorability-versus-efficiency-in-11supnsup-protection-schemes-f,
https://academic.microsoft.com/#/detail/2158366928
Back to Top

Document information

Published on 01/01/2004

Volume 2004, 2004
DOI: 10.1109/icc.2004.1312786
Licence: Other

Document Score

0

Views 0
Recommendations 0

Share this document

Keywords

claim authorship

Are you one of the authors of this document?