Scheduled multicast overlay for bandwidth-intensive applications

Timothy Entel, A. Gadkar, V. Vokkarane
{"title":"Scheduled multicast overlay for bandwidth-intensive applications","authors":"Timothy Entel, A. Gadkar, V. Vokkarane","doi":"10.1109/ONDM.2012.6210278","DOIUrl":null,"url":null,"abstract":"In this paper we investigate the multicast advance reservation problem in wavelength division multiplexed (WDM) optical networks. Under the advance reservation traffic model (also know as scheduled traffic), connection requests specify their start time to be some time in the future and also specify their holding times. Traditionally, in WDM networks, the multicasting functionality is supported by assuming that the optical cross connects are multicast capable i.e., they are capable of switching an incoming signal to multiple output interfaces. To support the multicasting functionality in a multicast incapable (MI) network, one can use a naive approach of creating a virtual topology consisting of wavelength routes (lighpaths) from the multicast source to each destination of the multicast session. This approach tends to consume a lot of network bandwidth and may become unacceptable as the number of the multicast sessions increase. We refer to this approach of provisioning the multicast requests as Multicast via WDM Unicast (MVWU) approach. To efficiently provision the users' scheduled multicast requests in a MI network, we propose two overlay solutions: Drop at Member Node (DAMN) and Drop at Any Node (DAAN). In these solutions, we achieve multicasting by creating a set of lightpath routes (possibly multiple hops) in the overlay layer. We consider a static set of scheduled multicast requests and present integer linear programs (ILPs) to solve the DAMN and DAAN problems, with a goal to minimize the total number of wavelengths required to service the request set. We also present an efficient heuristic and compare its performance to the ILP for a small network, and evaluate its performance for large-scale networks. Moreover, we also present an ILP to solve the naive MVWU approach and compare its performance to the DAMN and DAAN.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ONDM.2012.6210278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

In this paper we investigate the multicast advance reservation problem in wavelength division multiplexed (WDM) optical networks. Under the advance reservation traffic model (also know as scheduled traffic), connection requests specify their start time to be some time in the future and also specify their holding times. Traditionally, in WDM networks, the multicasting functionality is supported by assuming that the optical cross connects are multicast capable i.e., they are capable of switching an incoming signal to multiple output interfaces. To support the multicasting functionality in a multicast incapable (MI) network, one can use a naive approach of creating a virtual topology consisting of wavelength routes (lighpaths) from the multicast source to each destination of the multicast session. This approach tends to consume a lot of network bandwidth and may become unacceptable as the number of the multicast sessions increase. We refer to this approach of provisioning the multicast requests as Multicast via WDM Unicast (MVWU) approach. To efficiently provision the users' scheduled multicast requests in a MI network, we propose two overlay solutions: Drop at Member Node (DAMN) and Drop at Any Node (DAAN). In these solutions, we achieve multicasting by creating a set of lightpath routes (possibly multiple hops) in the overlay layer. We consider a static set of scheduled multicast requests and present integer linear programs (ILPs) to solve the DAMN and DAAN problems, with a goal to minimize the total number of wavelengths required to service the request set. We also present an efficient heuristic and compare its performance to the ILP for a small network, and evaluate its performance for large-scale networks. Moreover, we also present an ILP to solve the naive MVWU approach and compare its performance to the DAMN and DAAN.
用于带宽密集型应用的计划多播覆盖
研究了波分复用(WDM)光网络中的组播提前预约问题。在提前预约流量模型(也称为计划流量)下,连接请求将其开始时间指定为未来的某个时间,并指定其保持时间。传统上,在WDM网络中,通过假设光交叉连接具有组播能力来支持组播功能,即它们能够将输入信号切换到多个输出接口。为了在无组播能力(MI)网络中支持组播功能,可以使用一种简单的方法,即创建一个由从组播源到组播会话的每个目的地的波长路由(光路)组成的虚拟拓扑。这种方法往往会消耗大量的网络带宽,并且随着多播会话数量的增加可能变得不可接受。我们将这种提供组播请求的方法称为WDM单播组播(MVWU)方法。为了有效地在MI网络中提供用户预定的多播请求,我们提出了两种覆盖方案:在成员节点(DAMN)丢弃和在任何节点(DAAN)丢弃。在这些解决方案中,我们通过在覆盖层中创建一组光路路由(可能是多跳)来实现多播。我们考虑了一组静态的计划多播请求,并提出了整数线性程序(ILPs)来解决DAMN和DAAN问题,目标是最小化服务请求集所需的波长总数。我们还提出了一种有效的启发式算法,并将其与小型网络的ILP性能进行了比较,并评估了其在大规模网络中的性能。此外,我们还提出了一种ILP来解决朴素的MVWU方法,并将其性能与DAMN和DAAN进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信