{"title":"弹性光网络中1+1:1光路业务的路由和频谱分配","authors":"Hong Guo, G. Shen, S. Bose","doi":"10.1109/ICCNC.2016.7440657","DOIUrl":null,"url":null,"abstract":"This paper extends single failure to dual failure recovery for an elastic optical network (EON) with 1+1:1 network protection. The issue of routing and spectrum assignment (RSA) is studied with objective of minimizing the maximal number of frequency slots (FSs) used. The key principle for protection capacity sharing among second protection lightpaths is identified. An Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed for RSA of 1+1:1 protected EON. Simulation results show that the proposed SWP-based algorithm can achieve better capacity utilization than the shortest-path (SP) algorithm and is almost as efficient as the ILP model.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Routing and spectrum assignment for 1+1:1 lightpath services in elastic optical networks\",\"authors\":\"Hong Guo, G. Shen, S. Bose\",\"doi\":\"10.1109/ICCNC.2016.7440657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper extends single failure to dual failure recovery for an elastic optical network (EON) with 1+1:1 network protection. The issue of routing and spectrum assignment (RSA) is studied with objective of minimizing the maximal number of frequency slots (FSs) used. The key principle for protection capacity sharing among second protection lightpaths is identified. An Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed for RSA of 1+1:1 protected EON. Simulation results show that the proposed SWP-based algorithm can achieve better capacity utilization than the shortest-path (SP) algorithm and is almost as efficient as the ILP model.\",\"PeriodicalId\":308458,\"journal\":{\"name\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2016.7440657\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2016.7440657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Routing and spectrum assignment for 1+1:1 lightpath services in elastic optical networks
This paper extends single failure to dual failure recovery for an elastic optical network (EON) with 1+1:1 network protection. The issue of routing and spectrum assignment (RSA) is studied with objective of minimizing the maximal number of frequency slots (FSs) used. The key principle for protection capacity sharing among second protection lightpaths is identified. An Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed for RSA of 1+1:1 protected EON. Simulation results show that the proposed SWP-based algorithm can achieve better capacity utilization than the shortest-path (SP) algorithm and is almost as efficient as the ILP model.