WDM网络中具有延迟容忍的存活连接动态调度

C. Cavdar, M. Tornatore, F. Buzluca, B. Mukherjee
{"title":"WDM网络中具有延迟容忍的存活连接动态调度","authors":"C. Cavdar, M. Tornatore, F. Buzluca, B. Mukherjee","doi":"10.1109/INFCOMW.2009.5072134","DOIUrl":null,"url":null,"abstract":"In optical wavelength-division multiplexing (WDM) networks, recent technological progress is enabling dynamic optical transport in which leasable circuits (connections) can be set up and released for a specific duration of time, providing large capacity to bandwidth-hungry applications. Set-up times can be flexible or fixed, depending on the type of the application. Since the interruption of a high-speed optical connection could lead to huge loss of data, such connections need to be protected against failures. We study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and particular delay tolerances with shared path protection. The metric of delay tolerance is a measure of customer patience, and it is defined as the time a connection request can be held until it is set up. A connection that cannot be established at the instant of its request could potentially be set up in the remaining duration of its delay tolerance. We show that a reduction of up to 50 percent can be achieved on blocking probability by exploiting delay tolerance in networks without using extra backup capacity. In this study we explore different queuing policies for impatient customers. Different dynamic scheduling algorithms are applied and compared by giving priority to connections according to their arrival rates, delay tolerances and holding times alternatively.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Dynamic Scheduling of Survivable Connections with Delay Tolerance in WDM Networks\",\"authors\":\"C. Cavdar, M. Tornatore, F. Buzluca, B. Mukherjee\",\"doi\":\"10.1109/INFCOMW.2009.5072134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In optical wavelength-division multiplexing (WDM) networks, recent technological progress is enabling dynamic optical transport in which leasable circuits (connections) can be set up and released for a specific duration of time, providing large capacity to bandwidth-hungry applications. Set-up times can be flexible or fixed, depending on the type of the application. Since the interruption of a high-speed optical connection could lead to huge loss of data, such connections need to be protected against failures. We study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and particular delay tolerances with shared path protection. The metric of delay tolerance is a measure of customer patience, and it is defined as the time a connection request can be held until it is set up. A connection that cannot be established at the instant of its request could potentially be set up in the remaining duration of its delay tolerance. We show that a reduction of up to 50 percent can be achieved on blocking probability by exploiting delay tolerance in networks without using extra backup capacity. In this study we explore different queuing policies for impatient customers. Different dynamic scheduling algorithms are applied and compared by giving priority to connections according to their arrival rates, delay tolerances and holding times alternatively.\",\"PeriodicalId\":252414,\"journal\":{\"name\":\"IEEE INFOCOM Workshops 2009\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM Workshops 2009\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2009.5072134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM Workshops 2009","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2009.5072134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

在光波分复用(WDM)网络中,最近的技术进步使动态光传输成为可能,其中可租用的电路(连接)可以在特定的时间内建立和释放,为带宽饥渴的应用提供大容量。根据应用程序的类型,设置时间可以是灵活的或固定的。由于高速光连接的中断可能导致大量数据丢失,因此需要对这种连接进行故障保护。我们研究了在共享路径保护下,具有特定保持时间和特定延迟容限的用户控制连接请求的动态供应问题。延迟容忍度量是对客户耐心的度量,它被定义为连接请求在建立之前可以保持的时间。不能在发出请求时立即建立的连接可能会在其延迟容忍的剩余持续时间内建立。我们表明,在不使用额外备份容量的情况下,通过利用网络中的延迟容限,可以在阻塞概率上减少多达50%。在本研究中,我们探讨了不耐烦顾客的不同排队策略。通过对不同的动态调度算法进行比较,并根据连接的到达率、延迟容限和等待时间来选择优先级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Scheduling of Survivable Connections with Delay Tolerance in WDM Networks
In optical wavelength-division multiplexing (WDM) networks, recent technological progress is enabling dynamic optical transport in which leasable circuits (connections) can be set up and released for a specific duration of time, providing large capacity to bandwidth-hungry applications. Set-up times can be flexible or fixed, depending on the type of the application. Since the interruption of a high-speed optical connection could lead to huge loss of data, such connections need to be protected against failures. We study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and particular delay tolerances with shared path protection. The metric of delay tolerance is a measure of customer patience, and it is defined as the time a connection request can be held until it is set up. A connection that cannot be established at the instant of its request could potentially be set up in the remaining duration of its delay tolerance. We show that a reduction of up to 50 percent can be achieved on blocking probability by exploiting delay tolerance in networks without using extra backup capacity. In this study we explore different queuing policies for impatient customers. Different dynamic scheduling algorithms are applied and compared by giving priority to connections according to their arrival rates, delay tolerances and holding times alternatively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信