An architectural infrastructure and topological optimization for end system multicast

Starsky H. Y. Wong, John C.S. Lui
{"title":"An architectural infrastructure and topological optimization for end system multicast","authors":"Starsky H. Y. Wong, John C.S. Lui","doi":"10.1109/MASCOT.2002.1167110","DOIUrl":null,"url":null,"abstract":"Although IP-multicast has been proposed and investigated for the some time, there are major problems inherent in the IP-multicasting technique, for example, scalability problems, difficulty to allocate a globally unique multicast address, complexity to support higher level features such as reliable data transfer congestion/flow control and security, and more importantly, deployment problem due to architectural changes to core routers. Recently, end-system multicast (ESM) has been proposed as an alternative solution so that multicasting services can be quickly deployed. In this paper we consider the \"architectural\" and \"optimization \" issues on designing an ESM-tree. Specifically, we present a distributed algorithm on how to create and maintain an ESM-tree. We also propose a distributed algorithm to perform a tree optimization (TO) so that an ESM-tree can dynamically adapt to the changing network condition (e.g., drop in transfer bandwidth) so that nodes can receive the multicast data more efficiently. The propose distributed algorithm has the theoretical properties that at all times, a tree-topology can be maintained and that any node joining, leaving, as well as any tree optimization operation will not \"partition\" an ESM-tree. Therefore, our work can be used to provide an efficient architectural infrastructure for ESM services. We have implemented a prototype ESM system and carried out experiments to illustrate the effectiveness and performance of our ESM optimization protocol.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"258 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2002.1167110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Although IP-multicast has been proposed and investigated for the some time, there are major problems inherent in the IP-multicasting technique, for example, scalability problems, difficulty to allocate a globally unique multicast address, complexity to support higher level features such as reliable data transfer congestion/flow control and security, and more importantly, deployment problem due to architectural changes to core routers. Recently, end-system multicast (ESM) has been proposed as an alternative solution so that multicasting services can be quickly deployed. In this paper we consider the "architectural" and "optimization " issues on designing an ESM-tree. Specifically, we present a distributed algorithm on how to create and maintain an ESM-tree. We also propose a distributed algorithm to perform a tree optimization (TO) so that an ESM-tree can dynamically adapt to the changing network condition (e.g., drop in transfer bandwidth) so that nodes can receive the multicast data more efficiently. The propose distributed algorithm has the theoretical properties that at all times, a tree-topology can be maintained and that any node joining, leaving, as well as any tree optimization operation will not "partition" an ESM-tree. Therefore, our work can be used to provide an efficient architectural infrastructure for ESM services. We have implemented a prototype ESM system and carried out experiments to illustrate the effectiveness and performance of our ESM optimization protocol.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
端系统组播的体系结构和拓扑优化
虽然ip组播技术已经被提出和研究了一段时间,但ip组播技术存在一些固有的主要问题,例如,可扩展性问题,分配全局唯一组播地址的困难,支持更高级别功能(如可靠的数据传输拥塞/流量控制和安全性)的复杂性,更重要的是,由于核心路由器的架构变化而导致的部署问题。最近,端系统组播(end-system multicast, ESM)被提出作为一种替代方案,以使组播业务能够快速部署。在本文中,我们考虑了设计esm树的“体系结构”和“优化”问题。具体来说,我们提出了一个关于如何创建和维护esm树的分布式算法。我们还提出了一种分布式算法来执行树优化(to),使ESM-tree能够动态适应不断变化的网络条件(例如,传输带宽的下降),从而使节点能够更有效地接收多播数据。本文提出的分布式算法的理论性质是,在任何时候都可以保持树的拓扑结构,并且任何节点的加入、离开以及任何树的优化操作都不会“分割”esm树。因此,我们的工作可用于为ESM服务提供高效的体系结构基础设施。我们已经实现了一个原型ESM系统,并进行了实验来说明我们的ESM优化协议的有效性和性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A simulation study of non-cooperative pricing strategies for circuit-switched optical networks A mixed abstraction level simulation model of large-scale Internet worm infestations TCP performance analysis of CDMA systems with RLP and MAC layer retransmissions Playing with time: on the specification and execution of time-enriched LSCs Analyzing the short-term fairness of IEEE 802.11 in wireless multi-hop radio networks
×
引用
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