WDM环网中组播会话的疏导

H. Madhyastha, N. Srinivas, G. Chowdhary, C. Murthy
{"title":"WDM环网中组播会话的疏导","authors":"H. Madhyastha, N. Srinivas, G. Chowdhary, C. Murthy","doi":"10.1117/12.533147","DOIUrl":null,"url":null,"abstract":"In this paper, we address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands. We consider this problem in the scenario of WDM ring networks. In order to support multicasting, individual nodes need to have the capability to duplicate traffic. We consider two different node architectures which perform the duplication in optical and electronic domain, respectively. As traffic duplication at the electronic level is much more expensive than the optical alternative, we study the problem of assigning routes and wavelengths to the multicast sessions so as to minimize electronic copying. The solution to this problem can be divided into three phases -- (1) routing of multicast sessions, (2) construction of circles by grouping non-overlapping arcs and (3) grouping these circles onto wavelengths. We propose a heuristic algorithm which implements the routing as well as circle construction phases simultaneously and then groups the circles. We present extensive simulation results to show that our approach leads to much lesser equipment cost than that obtained by routing each multicast session along its minimum spanning tree and then using the best known heuristic for circle construction.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Grooming of multicast sessions in WDM ring networks\",\"authors\":\"H. Madhyastha, N. Srinivas, G. Chowdhary, C. Murthy\",\"doi\":\"10.1117/12.533147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands. We consider this problem in the scenario of WDM ring networks. In order to support multicasting, individual nodes need to have the capability to duplicate traffic. We consider two different node architectures which perform the duplication in optical and electronic domain, respectively. As traffic duplication at the electronic level is much more expensive than the optical alternative, we study the problem of assigning routes and wavelengths to the multicast sessions so as to minimize electronic copying. The solution to this problem can be divided into three phases -- (1) routing of multicast sessions, (2) construction of circles by grouping non-overlapping arcs and (3) grouping these circles onto wavelengths. We propose a heuristic algorithm which implements the routing as well as circle construction phases simultaneously and then groups the circles. We present extensive simulation results to show that our approach leads to much lesser equipment cost than that obtained by routing each multicast session along its minimum spanning tree and then using the best known heuristic for circle construction.\",\"PeriodicalId\":187370,\"journal\":{\"name\":\"OptiComm: Optical Networking and Communications Conference\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"OptiComm: Optical Networking and Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.533147\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"OptiComm: Optical Networking and Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.533147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

本文研究了具有亚波长业务需求的组播会话的路由和波长分配问题。我们在WDM环网场景中考虑这个问题。为了支持多播,各个节点需要具有复制流量的能力。我们考虑了两种不同的节点结构,分别在光学和电子领域进行复制。由于电子级的通信复制比光学级的通信复制要昂贵得多,我们研究了为多播会话分配路由和波长的问题,以尽量减少电子复制。这个问题的解决方案可以分为三个阶段——(1)多播会话的路由,(2)通过分组不重叠的弧来构建圆,(3)将这些圆分组到波长上。提出了一种启发式算法,该算法同时实现了路由和圆构建两个阶段,然后对圆进行分组。我们提供了大量的仿真结果,表明我们的方法比沿着最小生成树路由每个多播会话然后使用最著名的启发式方法进行圈构建所获得的设备成本要低得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Grooming of multicast sessions in WDM ring networks
In this paper, we address the problem of routing and wavelength assignment of multicast sessions with subwavelength traffic demands. We consider this problem in the scenario of WDM ring networks. In order to support multicasting, individual nodes need to have the capability to duplicate traffic. We consider two different node architectures which perform the duplication in optical and electronic domain, respectively. As traffic duplication at the electronic level is much more expensive than the optical alternative, we study the problem of assigning routes and wavelengths to the multicast sessions so as to minimize electronic copying. The solution to this problem can be divided into three phases -- (1) routing of multicast sessions, (2) construction of circles by grouping non-overlapping arcs and (3) grouping these circles onto wavelengths. We propose a heuristic algorithm which implements the routing as well as circle construction phases simultaneously and then groups the circles. We present extensive simulation results to show that our approach leads to much lesser equipment cost than that obtained by routing each multicast session along its minimum spanning tree and then using the best known heuristic for circle construction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信