具有分割损耗的WDM路径和环中的组播虚拟拓扑

R. Libeskind-Hadas, Jeff Hartline, K. Dresner, Ethan W. Drucker, K. J. Ray
{"title":"具有分割损耗的WDM路径和环中的组播虚拟拓扑","authors":"R. Libeskind-Hadas, Jeff Hartline, K. Dresner, Ethan W. Drucker, K. J. Ray","doi":"10.1109/ICCCN.2002.1043085","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of constructing optimal virtual topologies for multicast communication in optical networks employing wavelength-division multiplexing (WDM). For concreteness, we use the average hop distance as the metric of optimality. WDM networks supporting multicast communication typically employ multicast-capable switches which permit a path entering a switch on an incoming wavelength to be replicated or \"split\" optically to one or more output links. This splitting incurs a power loss which is frequently neglected in existing heuristics and algorithms. In this paper we show that the problem of finding optimal virtual topologies with splitting loss constraints can be solved in polynomial time in directed paths and rings, although the problem is NP-complete for general topologies.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Multicast virtual topologies in WDM paths and rings with splitting loss\",\"authors\":\"R. Libeskind-Hadas, Jeff Hartline, K. Dresner, Ethan W. Drucker, K. J. Ray\",\"doi\":\"10.1109/ICCCN.2002.1043085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of constructing optimal virtual topologies for multicast communication in optical networks employing wavelength-division multiplexing (WDM). For concreteness, we use the average hop distance as the metric of optimality. WDM networks supporting multicast communication typically employ multicast-capable switches which permit a path entering a switch on an incoming wavelength to be replicated or \\\"split\\\" optically to one or more output links. This splitting incurs a power loss which is frequently neglected in existing heuristics and algorithms. In this paper we show that the problem of finding optimal virtual topologies with splitting loss constraints can be solved in polynomial time in directed paths and rings, although the problem is NP-complete for general topologies.\",\"PeriodicalId\":302787,\"journal\":{\"name\":\"Proceedings. Eleventh International Conference on Computer Communications and Networks\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Eleventh International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2002.1043085\",\"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. Eleventh International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2002.1043085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文研究了波分复用(WDM)光网络中多播通信的最优虚拟拓扑构造问题。为了具体化,我们使用平均跳跃距离作为最优性的度量。支持多播通信的WDM网络通常采用具有多播功能的交换机,这种交换机允许在输入波长上进入交换机的路径被复制或“分割”到一个或多个输出链路。这种分割会导致功率损失,这在现有的启发式算法和算法中经常被忽略。在本文中,我们证明了寻找具有分裂损失约束的最优虚拟拓扑的问题可以在多项式时间内在有向路径和环中得到解决,尽管该问题对于一般拓扑是np完全的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multicast virtual topologies in WDM paths and rings with splitting loss
This paper addresses the problem of constructing optimal virtual topologies for multicast communication in optical networks employing wavelength-division multiplexing (WDM). For concreteness, we use the average hop distance as the metric of optimality. WDM networks supporting multicast communication typically employ multicast-capable switches which permit a path entering a switch on an incoming wavelength to be replicated or "split" optically to one or more output links. This splitting incurs a power loss which is frequently neglected in existing heuristics and algorithms. In this paper we show that the problem of finding optimal virtual topologies with splitting loss constraints can be solved in polynomial time in directed paths and rings, although the problem is NP-complete for general topologies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信