Distributed shared multicast tree construction protocols for tree-shared multicasting in OBS networks

Myoungki Jeong, C. Qiao, M. Vandenhoute
{"title":"Distributed shared multicast tree construction protocols for tree-shared multicasting in OBS networks","authors":"Myoungki Jeong, C. Qiao, M. Vandenhoute","doi":"10.1109/ICCCN.2002.1043086","DOIUrl":null,"url":null,"abstract":"Tree-shared multicasting in OBS networks can achieve bandwidth savings, less processing load, and lower burst blocking (loss) probability. In this paper, we propose several distributed shared multicast tree construction protocols, namely greedy-prune, non-member-join, all-member-join, closest-member on-tree (CMOT), and closest-node on-tree (CNOT), for tree-shared multicasting in OBS networks. For performance comparison, we also consider an optimal shared tree which is modeled as Steiner minimal tree. We evaluate the proposed protocols using simulations in terms of cost of the shared tree to the optimal shared tree. Simulations show that the CNOT and CMOT protocols outperform the other three proposed protocols in terms of the cost of the shared tree, and perform close to cost of the optimal shared tree.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","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.1043086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Tree-shared multicasting in OBS networks can achieve bandwidth savings, less processing load, and lower burst blocking (loss) probability. In this paper, we propose several distributed shared multicast tree construction protocols, namely greedy-prune, non-member-join, all-member-join, closest-member on-tree (CMOT), and closest-node on-tree (CNOT), for tree-shared multicasting in OBS networks. For performance comparison, we also consider an optimal shared tree which is modeled as Steiner minimal tree. We evaluate the proposed protocols using simulations in terms of cost of the shared tree to the optimal shared tree. Simulations show that the CNOT and CMOT protocols outperform the other three proposed protocols in terms of the cost of the shared tree, and perform close to cost of the optimal shared tree.
OBS网络中树共享组播的分布式共享组播树构建协议
树共享组播在OBS网络中可以节省带宽,减少处理负荷,降低突发阻塞(丢失)概率。本文提出了几种分布式共享组播树构建协议,即贪婪剪枝协议、非成员连接协议、全成员连接协议、最亲密成员树上协议(CMOT)和最亲密节点树上协议(CNOT)。为了进行性能比较,我们还考虑了一种最优共享树,它被建模为斯坦纳最小树。从共享树到最优共享树的代价的角度对所提出的协议进行了仿真评估。仿真结果表明,CNOT和CMOT协议在共享树代价方面优于其他三种协议,且性能接近最优共享树代价。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信