Grooming of Survivable Multicast Sessions Against Single Link Failures in Sparse Splitting WDM Mesh Networks

N. Sreenath, B. Palanisamy, S. Nadarajan
{"title":"Grooming of Survivable Multicast Sessions Against Single Link Failures in Sparse Splitting WDM Mesh Networks","authors":"N. Sreenath, B. Palanisamy, S. Nadarajan","doi":"10.1109/ADCOM.2006.4289927","DOIUrl":null,"url":null,"abstract":"Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of survivable routing and wavelength assignment of multicast sessions with sub-wavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the optical-electronic-optical (O/E/O) conversion. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom which tries to minimize the resources required for electronic copying. We extend the notion of link disjoint, arc disjoint and path disjoint protection methodologies to groomed multicast sessions in order to protect them from single link failures. The performance of the various protection algorithms is studied and compared through extensive simulation experiments.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Advanced Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2006.4289927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of survivable routing and wavelength assignment of multicast sessions with sub-wavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the optical-electronic-optical (O/E/O) conversion. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom which tries to minimize the resources required for electronic copying. We extend the notion of link disjoint, arc disjoint and path disjoint protection methodologies to groomed multicast sessions in order to protect them from single link failures. The performance of the various protection algorithms is studied and compared through extensive simulation experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
稀疏分割WDM网状网络中针对单链路故障的存活组播会话疏导
在WDM网络中,将具有分数波长带宽的多个会话低成本地引导到单个波长上已成为一个突出问题。本文研究了稀疏分割WDM网络中具有亚波长业务需求的组播会话的生存路由和波长分配问题。我们假设一个稀疏的分裂节点架构,其中网络中只有少数节点能够分裂。具有拆分能力的节点可以将传入消息以光形式转发到多个传出链路。通过将光信号转换成电子形式并以光形式传输到所有需要的出站链路上,可以实现非分割节点的多播能力。但是,由于光-电-光(O/E/O)转换所产生的延迟,电子级的业务复制比光学级的业务复制成本更高。由于组播流量梳理问题在计算上难以处理,我们采用了一种称为VSGroom的启发式方法,该方法试图将电子复制所需的资源最小化。我们将链路不相交、弧线不相交和路径不相交保护方法的概念扩展到训练组播会话,以保护它们免受单链路故障的影响。通过大量的仿真实验,对各种保护算法的性能进行了研究和比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message Integrity in the World Wide Web: Use of Nested Hash Function and a Fast Stream Cipher Feature Extraction Learning for Stereovision Based Robot Navigation System Semantics for a Distributed Programming Language Using SACS and Weakest Pre-Conditions On Evaluating Obfuscatory Strength of Alias-based Transforms using Static Analysis A Multi-Algorithmic Face Recognition System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1