具有重配置延迟的速率自适应网络中的持久性感知流量工程

Shih-Hao Tseng
{"title":"具有重配置延迟的速率自适应网络中的持久性感知流量工程","authors":"Shih-Hao Tseng","doi":"10.1109/ICNP.2019.8888098","DOIUrl":null,"url":null,"abstract":"Expensive optical fibers provide connectivity for wide-area networks. Nowadays, the fibers are operated in a much conservative manner. By adaptively reconfiguring the fibers to exploit its signal quality, a recent proposal demonstrates a significant increase of optical link capacity. Such a reconfiguration currently accompanies a non-ignorable delay, during which the reconfigured link is not accessible, and the mentioned approach trades off the final throughput with the induced churn during the transition. This scheme can result in high traffic disturbance during the reconfiguration.To overcome the drawback of the simple churn-based update, we study the rate adaptation planning (RAP) problem under reconfiguration delay. We propose a multiple step planning with perseverance constraints. This approach leads to a smoother transition, but the optimal plan is shown NP-hard without constant factor approximation (unless P= NP). Therefore, we develop an efficient LP-based heuristic algorithm. Extensive simulations show that the algorithm gives 40 -50% higher throughput than the no-adaptive-link case. Also, the transition is much smoother: the resulting traffic fluctuation is only 40 -50% of the existing churn-based approach.","PeriodicalId":385397,"journal":{"name":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Perseverance-Aware Traffic Engineering in Rate-Adaptive Networks with Reconfiguration Delay\",\"authors\":\"Shih-Hao Tseng\",\"doi\":\"10.1109/ICNP.2019.8888098\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Expensive optical fibers provide connectivity for wide-area networks. Nowadays, the fibers are operated in a much conservative manner. By adaptively reconfiguring the fibers to exploit its signal quality, a recent proposal demonstrates a significant increase of optical link capacity. Such a reconfiguration currently accompanies a non-ignorable delay, during which the reconfigured link is not accessible, and the mentioned approach trades off the final throughput with the induced churn during the transition. This scheme can result in high traffic disturbance during the reconfiguration.To overcome the drawback of the simple churn-based update, we study the rate adaptation planning (RAP) problem under reconfiguration delay. We propose a multiple step planning with perseverance constraints. This approach leads to a smoother transition, but the optimal plan is shown NP-hard without constant factor approximation (unless P= NP). Therefore, we develop an efficient LP-based heuristic algorithm. Extensive simulations show that the algorithm gives 40 -50% higher throughput than the no-adaptive-link case. Also, the transition is much smoother: the resulting traffic fluctuation is only 40 -50% of the existing churn-based approach.\",\"PeriodicalId\":385397,\"journal\":{\"name\":\"2019 IEEE 27th International Conference on Network Protocols (ICNP)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 27th International Conference on Network Protocols (ICNP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNP.2019.8888098\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 27th International Conference on Network Protocols (ICNP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2019.8888098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

昂贵的光纤为广域网提供连接。现在,纤维的操作方式非常保守。通过自适应地重新配置光纤以利用其信号质量,最近的一项提议表明了光链路容量的显着增加。这样的重新配置目前伴随着一个不可忽视的延迟,在此期间,重新配置的链路不可访问,并且上述方法在转换过程中权衡了最终吞吐量和引起的混乱。该方案在重构过程中会造成较大的流量干扰。为了克服简单的基于循环更新的缺点,研究了重构延迟下的速率自适应规划问题。我们提出了一个具有毅力约束的多步骤规划。这种方法导致更平滑的过渡,但在没有常数因子近似(除非P= NP)的情况下,最优计划显示为NP-hard。因此,我们开发了一种高效的基于lp的启发式算法。大量的仿真表明,该算法比无自适应链路情况下的吞吐量提高40 -50%。而且,转换更加平滑:产生的流量波动仅为现有基于用户流失率的方法的40 -50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Perseverance-Aware Traffic Engineering in Rate-Adaptive Networks with Reconfiguration Delay
Expensive optical fibers provide connectivity for wide-area networks. Nowadays, the fibers are operated in a much conservative manner. By adaptively reconfiguring the fibers to exploit its signal quality, a recent proposal demonstrates a significant increase of optical link capacity. Such a reconfiguration currently accompanies a non-ignorable delay, during which the reconfigured link is not accessible, and the mentioned approach trades off the final throughput with the induced churn during the transition. This scheme can result in high traffic disturbance during the reconfiguration.To overcome the drawback of the simple churn-based update, we study the rate adaptation planning (RAP) problem under reconfiguration delay. We propose a multiple step planning with perseverance constraints. This approach leads to a smoother transition, but the optimal plan is shown NP-hard without constant factor approximation (unless P= NP). Therefore, we develop an efficient LP-based heuristic algorithm. Extensive simulations show that the algorithm gives 40 -50% higher throughput than the no-adaptive-link case. Also, the transition is much smoother: the resulting traffic fluctuation is only 40 -50% of the existing churn-based approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信