S/G Light-tree: Multicast grooming architecture for improved resource allocation

J. Sierra, L. F. Caro, F. Solano, R. Fabregat, Y. Donoso
{"title":"S/G Light-tree: Multicast grooming architecture for improved resource allocation","authors":"J. Sierra, L. F. Caro, F. Solano, R. Fabregat, Y. Donoso","doi":"10.1109/ONDM.2008.4578419","DOIUrl":null,"url":null,"abstract":"Internet traffic demands are constantly increasing and a considerable amount of this increase is expected to be of multicast type. Optical transport networks (OTN)must be prepared in terms of better resource utilization for accommodating multicast traffic. For this purpose multicast traffic grooming has been considered. Light-trees have been proposed for supporting multicast connections in OTN. Nevertheless when light-trees are used with traffic grooming, resources can be overutilized as traffic can be routed to undesirable destinations in order to avoid optical-electrical-optical (OEO)conversions. In this paper a novel architecture named S/G light-tree for supporting multicast connections is proposed. The architecture allows to eliminate and aggregate traffic in different wavelengths without performing OEO conversions.The architecture uses labels supported by generalized multiprotocol label switching (GMPLS). A heuristic that routes traffic demands using less wavelengths by taking advantage of the proposed architecture is designed as well. Simulation results show that the architecture can minimize the number of used wavelengths and OEO conversions when compared to light-trees.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Optical Network Design and Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ONDM.2008.4578419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Internet traffic demands are constantly increasing and a considerable amount of this increase is expected to be of multicast type. Optical transport networks (OTN)must be prepared in terms of better resource utilization for accommodating multicast traffic. For this purpose multicast traffic grooming has been considered. Light-trees have been proposed for supporting multicast connections in OTN. Nevertheless when light-trees are used with traffic grooming, resources can be overutilized as traffic can be routed to undesirable destinations in order to avoid optical-electrical-optical (OEO)conversions. In this paper a novel architecture named S/G light-tree for supporting multicast connections is proposed. The architecture allows to eliminate and aggregate traffic in different wavelengths without performing OEO conversions.The architecture uses labels supported by generalized multiprotocol label switching (GMPLS). A heuristic that routes traffic demands using less wavelengths by taking advantage of the proposed architecture is designed as well. Simulation results show that the architecture can minimize the number of used wavelengths and OEO conversions when compared to light-trees.
S/G轻树:用于改进资源分配的组播修饰架构
互联网流量需求不断增加,其中相当一部分预计将是多播类型的。光传输网络(OTN)必须从更好地利用资源的角度来准备,以适应多播业务。为此,考虑了组播流量疏导。为了支持OTN中的组播连接,提出了轻树结构。然而,当光树与流量梳理一起使用时,资源可能被过度利用,因为流量可能被路由到不希望的目的地,以避免光-电-光(OEO)转换。本文提出了一种新的支持组播连接的S/G光树结构。该架构允许在不执行OEO转换的情况下消除和聚合不同波长的流量。该架构使用通用多协议标签交换(GMPLS)支持的标签。此外,还设计了一种启发式算法,利用所提出的架构利用较少的波长路由流量需求。仿真结果表明,与光树相比,该结构可以最大限度地减少使用的波长和OEO转换次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信