WDM疏导网络中的在线组播路由

A. Vishwanath, W. Liang
{"title":"WDM疏导网络中的在线组播路由","authors":"A. Vishwanath, W. Liang","doi":"10.1109/ICCCN.2005.1523861","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On-line multicast routing in WDM grooming networks\",\"authors\":\"A. Vishwanath, W. Liang\",\"doi\":\"10.1109/ICCCN.2005.1523861\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.\",\"PeriodicalId\":379037,\"journal\":{\"name\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2005.1523861\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

研究了无波长转换能力的WDM光网状网络中在线组播路由问题。在这种网络中,通过将波长划分为多个时隙并在该波长上复用流量,可以提供具有部分波长容量需求的连接请求。针对这一问题,提出了一种在线组播流量疏导算法。目标是将具有亚波长容量需求的多播请求有效地路由到高容量波长上,同时平衡网络中链路的负载。为此,我们提出了一个成本函数,它不仅鼓励将新请求引导到现有流量正在使用的波长上,而且还通过智能地增加链路上使用波长的成本来执行负载平衡。在典型网格网络上的实验结果表明,该算法优于现有的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On-line multicast routing in WDM grooming networks
This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same time. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信