Wavelength rerouting for on-line multicast in WDM networks

Y. Wan, W. Liang
{"title":"Wavelength rerouting for on-line multicast in WDM networks","authors":"Y. Wan, W. Liang","doi":"10.1109/LCN.2004.137","DOIUrl":null,"url":null,"abstract":"We consider wavelength rerouting for on-line multicast in all-optical wavelength division multiplexing (WDM) networks where the multicast requests arrive and depart randomly. One limitation of such networks is the wavelength continuity constraint, imposed by the all-optical cross-connect switches, that requires the same wavelength be used on all the links in a multicast tree. With random arrivals and departures of multicast requests, it happens quite often that a new multicast request has to be blocked due to the fact that there are not enough available resources (e.g., wavelengths) to realize the request. Wavelength rerouting, a viable and cost-effective method, has been proposed to improve the blocking probability; it rearranges the wavelengths on certain existing multicast routes to free a wavelength continuous route for the new request. We study the wavelength rerouting problem for on-line multicast in both undirected and directed WDM networks with an objective to minimize the disruption incurred to the existing multicast services, or equivalently, to minimize the number of existing multicast routes to be wavelength-rerouted. We first show that the problem is not only NP-hard but also hard to approximate. We then devise approximation algorithms for it with provable approximation guarantees.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"29th Annual IEEE International Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2004.137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We consider wavelength rerouting for on-line multicast in all-optical wavelength division multiplexing (WDM) networks where the multicast requests arrive and depart randomly. One limitation of such networks is the wavelength continuity constraint, imposed by the all-optical cross-connect switches, that requires the same wavelength be used on all the links in a multicast tree. With random arrivals and departures of multicast requests, it happens quite often that a new multicast request has to be blocked due to the fact that there are not enough available resources (e.g., wavelengths) to realize the request. Wavelength rerouting, a viable and cost-effective method, has been proposed to improve the blocking probability; it rearranges the wavelengths on certain existing multicast routes to free a wavelength continuous route for the new request. We study the wavelength rerouting problem for on-line multicast in both undirected and directed WDM networks with an objective to minimize the disruption incurred to the existing multicast services, or equivalently, to minimize the number of existing multicast routes to be wavelength-rerouted. We first show that the problem is not only NP-hard but also hard to approximate. We then devise approximation algorithms for it with provable approximation guarantees.
WDM网络中在线组播的波长重路由
在全光波分复用(WDM)网络中,考虑了在线组播请求随机到达和离开的波长重路由问题。这种网络的一个限制是波长连续性约束,这是由全光交叉连接交换机施加的,它要求在多播树中的所有链路上使用相同的波长。由于多播请求的随机到达和离开,由于没有足够的可用资源(例如,波长)来实现请求,新的多播请求经常会被阻塞。波长重路由是一种可行且经济的方法,可以提高阻塞概率;它重新安排某些现有多播路由上的波长,为新请求释放波长连续路由。我们研究了在无向和有向WDM网络中在线组播的波长重路由问题,目的是尽量减少对现有组播业务的干扰,或者等效地,尽量减少需要波长重路由的现有组播路由的数量。我们首先证明了这个问题不仅是np困难的,而且难以近似。然后,我们设计了具有可证明的近似保证的近似算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信