A destination-initiated multicast routing protocol for shortest path tree constructions

Baoxian Zhang, H. Mouftah
{"title":"A destination-initiated multicast routing protocol for shortest path tree constructions","authors":"Baoxian Zhang, H. Mouftah","doi":"10.1109/GLOCOM.2003.1258753","DOIUrl":null,"url":null,"abstract":"In this work, we design a destination-initiated protocol, which aims at building source-rooted shortest path tree (SPT) in a hop-by-hop manner for providing scalable multicast. The designed protocol can support group applications with dynamic membership well. Performance analysis and simulation results show that the destination-initiated characteristic can significantly reduce the computation, storage and communication overhead associated with SPT constructions.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2003.1258753","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In this work, we design a destination-initiated protocol, which aims at building source-rooted shortest path tree (SPT) in a hop-by-hop manner for providing scalable multicast. The designed protocol can support group applications with dynamic membership well. Performance analysis and simulation results show that the destination-initiated characteristic can significantly reduce the computation, storage and communication overhead associated with SPT constructions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
目的端发起的组播路由协议,用于构建最短路径树
在这项工作中,我们设计了一个目的地发起的协议,旨在以逐跳的方式构建源根最短路径树(SPT),以提供可扩展的多播。所设计的协议能够很好地支持具有动态成员关系的组应用。性能分析和仿真结果表明,目标初始化特性可以显著降低SPT构造相关的计算、存储和通信开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fast time-varying dispersive channel estimation and equalization for 8-PSK cellular system Service outage based power and rate allocation for parallel fading channels GQR models for directional wireless channels Digital timing recovery for communication systems On the capacity of multi-cell UMTS
×
引用
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