N. Bambos, S. Gitzenis, R. A. Miura-Ko, O. Gerstel, L. Paraschis
{"title":"A service risk-management approach to capacity protection in optical networks","authors":"N. Bambos, S. Gitzenis, R. A. Miura-Ko, O. Gerstel, L. Paraschis","doi":"10.1109/LANMAN.2004.1338404","DOIUrl":null,"url":null,"abstract":"We introduce a probabilistic framework, based on service risk mitigation and disruption management, for the problem of capacity protection in optical networks. This contrasts the established deterministic approach of designing the protection network to guarantee no service disruption for up to M failures. We present the novel problem formulation and establish a framework for optimal network design in this extended abstract, while leaving the detailed optimization results and algorithms for the full paper (N. Bambos et al., 2003).","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LANMAN.2004.1338404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
We introduce a probabilistic framework, based on service risk mitigation and disruption management, for the problem of capacity protection in optical networks. This contrasts the established deterministic approach of designing the protection network to guarantee no service disruption for up to M failures. We present the novel problem formulation and establish a framework for optimal network design in this extended abstract, while leaving the detailed optimization results and algorithms for the full paper (N. Bambos et al., 2003).