基于核心管理器的可扩展多播路由

Changdong Liu, Myung J. Lee, T. Saadawi
{"title":"基于核心管理器的可扩展多播路由","authors":"Changdong Liu, Myung J. Lee, T. Saadawi","doi":"10.1109/ICC.1998.685199","DOIUrl":null,"url":null,"abstract":"With the growing interests in distributed applications, efficient and scalable multicast routing is of great concern. Source-based tree multicast routing protocols, however, become very inefficient when used with large number of sources over large scale internetworks. Shared-tree based multicast routing protocols like PIM and CBT being developed by the IDMR working group of the IETF, trade efficiency of multicast delivery trees with scalability, but there are some issues open to further study. The work presented in this paper, the core-manager based multicast routing (CMMR) architecture, adopts shared-tree based techniques to achieve good scalability. It worked out an innovative approach to issues like core selection and multicast delivery tree management. The basic idea behind CMMR is that the core-manager (CM) keeps tracking cores of each multicast delivery tree in order to maintain a brief image of the tree. Consequently, new members will almost always be directed to a nearby core so that tree cost is well confined. However, not every new member has to actually consult the CM thanks to a self-growing scheme, maintaining control overhead low. Simulations show that the CMMR outperforms other existing shared-tree based multicast routing protocols like PIM, and can do as well as expensive near-optimal Steiner tree heuristics when average costs of multicast delivery trees are compared. Further improving on scalability is sought by using a hierarchical architecture, which requires the multicast addresses be administratively scoped in accordance with the hierarchy. Management of candidate cores are restricted within individual hierarchical regions. In addition, the CMMR scheme is recursive, meaning that all routers run the same algorithm regardless of their hierarchical levels.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"21 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Core-manager based scalable multicast routing\",\"authors\":\"Changdong Liu, Myung J. Lee, T. Saadawi\",\"doi\":\"10.1109/ICC.1998.685199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the growing interests in distributed applications, efficient and scalable multicast routing is of great concern. Source-based tree multicast routing protocols, however, become very inefficient when used with large number of sources over large scale internetworks. Shared-tree based multicast routing protocols like PIM and CBT being developed by the IDMR working group of the IETF, trade efficiency of multicast delivery trees with scalability, but there are some issues open to further study. The work presented in this paper, the core-manager based multicast routing (CMMR) architecture, adopts shared-tree based techniques to achieve good scalability. It worked out an innovative approach to issues like core selection and multicast delivery tree management. The basic idea behind CMMR is that the core-manager (CM) keeps tracking cores of each multicast delivery tree in order to maintain a brief image of the tree. Consequently, new members will almost always be directed to a nearby core so that tree cost is well confined. However, not every new member has to actually consult the CM thanks to a self-growing scheme, maintaining control overhead low. Simulations show that the CMMR outperforms other existing shared-tree based multicast routing protocols like PIM, and can do as well as expensive near-optimal Steiner tree heuristics when average costs of multicast delivery trees are compared. Further improving on scalability is sought by using a hierarchical architecture, which requires the multicast addresses be administratively scoped in accordance with the hierarchy. Management of candidate cores are restricted within individual hierarchical regions. In addition, the CMMR scheme is recursive, meaning that all routers run the same algorithm regardless of their hierarchical levels.\",\"PeriodicalId\":218354,\"journal\":{\"name\":\"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)\",\"volume\":\"21 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1998.685199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1998.685199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

随着人们对分布式应用的兴趣日益浓厚,高效、可扩展的组播路由成为人们关注的焦点。然而,基于源的树型多播路由协议在大规模网络上处理大量源时变得非常低效。IETF IDMR工作组开发的基于共享树的组播路由协议如PIM和CBT,既提高了组播传递树的效率,又具有可扩展性,但还存在一些有待进一步研究的问题。本文提出的基于核心管理器的组播路由(CMMR)架构采用基于共享树的技术来实现良好的可扩展性。它提出了一种创新的方法来解决核心选择和多播传递树管理等问题。CMMR背后的基本思想是,核心管理器(CM)保持跟踪每个多播传递树的核心,以维护树的简要图像。因此,新成员几乎总是指向附近的核心,从而很好地限制了树的成本。然而,并不是每个新成员都需要咨询CM,这要归功于一个自我增长的方案,从而保持了较低的控制开销。仿真结果表明,CMMR优于现有的基于共享树的组播路由协议(如PIM),并且在比较组播传递树的平均成本时,可以达到昂贵的近最优斯坦纳树启发式算法。通过使用层次结构寻求进一步提高可伸缩性,该结构要求根据层次结构对多播地址进行管理范围。候选核心的管理被限制在单个层次区域内。此外,CMMR方案是递归的,这意味着所有路由器都运行相同的算法,而不管它们的分层级别如何。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Core-manager based scalable multicast routing
With the growing interests in distributed applications, efficient and scalable multicast routing is of great concern. Source-based tree multicast routing protocols, however, become very inefficient when used with large number of sources over large scale internetworks. Shared-tree based multicast routing protocols like PIM and CBT being developed by the IDMR working group of the IETF, trade efficiency of multicast delivery trees with scalability, but there are some issues open to further study. The work presented in this paper, the core-manager based multicast routing (CMMR) architecture, adopts shared-tree based techniques to achieve good scalability. It worked out an innovative approach to issues like core selection and multicast delivery tree management. The basic idea behind CMMR is that the core-manager (CM) keeps tracking cores of each multicast delivery tree in order to maintain a brief image of the tree. Consequently, new members will almost always be directed to a nearby core so that tree cost is well confined. However, not every new member has to actually consult the CM thanks to a self-growing scheme, maintaining control overhead low. Simulations show that the CMMR outperforms other existing shared-tree based multicast routing protocols like PIM, and can do as well as expensive near-optimal Steiner tree heuristics when average costs of multicast delivery trees are compared. Further improving on scalability is sought by using a hierarchical architecture, which requires the multicast addresses be administratively scoped in accordance with the hierarchy. Management of candidate cores are restricted within individual hierarchical regions. In addition, the CMMR scheme is recursive, meaning that all routers run the same algorithm regardless of their hierarchical levels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信