弹性光网络中1+1:1光路业务的路由和频谱分配

Hong Guo, G. Shen, S. Bose
{"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}
引用次数: 3

摘要

本文将具有1+1:1网络保护的弹性光网络的单故障恢复扩展到双故障恢复。研究了路由和频谱分配(RSA)问题,其目标是最小化所使用的最大频率槽数。确定了第二保护光路之间保护容量共享的关键原理。针对1+1:1保护EON的RSA问题,提出了整数线性规划(ILP)模型和基于谱窗平面(SWP)的启发式算法。仿真结果表明,基于swp算法的容量利用率优于最短路径(SP)算法,且效率与ILP模型相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Public scene recognition using mobile phone sensors Mixed signal detection and carrier frequency estimation based on spectral coherent features A queue-length based distributed scheduling for CSMA-driven Wireless Mesh Networks GreenTCAM: A memory- and energy-efficient TCAM-based packet classification Hierarchical traffic engineering based on model predictive control
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1