一种ATM网络多播的混合多MCS模型

Tae-Young Byun, K. Han
{"title":"一种ATM网络多播的混合多MCS模型","authors":"Tae-Young Byun, K. Han","doi":"10.1109/ICOIN.2001.905637","DOIUrl":null,"url":null,"abstract":"This paper presents a multicasting scheme to reduce the average end-to-end path delay on the multicast tree by removing duplicated or non-shortest paths, which we call improper paths, over ATM networks. First, we explain these improper paths that may be found in the full MCS model, and classify them into 4 types. Then, we propose methods to assign the group members to MCS to remove improper paths. Simulation results show the proposed scheme may provide much less end-to-end delay than existing multiple MCS schemes.","PeriodicalId":332734,"journal":{"name":"Proceedings 15th International Conference on Information Networking","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A hybrid multiple MCS model for multicast over ATM networks\",\"authors\":\"Tae-Young Byun, K. Han\",\"doi\":\"10.1109/ICOIN.2001.905637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a multicasting scheme to reduce the average end-to-end path delay on the multicast tree by removing duplicated or non-shortest paths, which we call improper paths, over ATM networks. First, we explain these improper paths that may be found in the full MCS model, and classify them into 4 types. Then, we propose methods to assign the group members to MCS to remove improper paths. Simulation results show the proposed scheme may provide much less end-to-end delay than existing multiple MCS schemes.\",\"PeriodicalId\":332734,\"journal\":{\"name\":\"Proceedings 15th International Conference on Information Networking\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 15th International Conference on Information Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2001.905637\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 15th International Conference on Information Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2001.905637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种在ATM网络中通过去除重复或非最短路径(我们称之为不适当路径)来降低组播树端到端平均路径延迟的方案。首先,我们解释了在完整的MCS模型中可能发现的这些不当路径,并将其分为4种类型。然后,我们提出了将群组成员分配到MCS的方法,以去除不合适的路径。仿真结果表明,该方案比现有的多种MCS方案提供更小的端到端延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A hybrid multiple MCS model for multicast over ATM networks
This paper presents a multicasting scheme to reduce the average end-to-end path delay on the multicast tree by removing duplicated or non-shortest paths, which we call improper paths, over ATM networks. First, we explain these improper paths that may be found in the full MCS model, and classify them into 4 types. Then, we propose methods to assign the group members to MCS to remove improper paths. Simulation results show the proposed scheme may provide much less end-to-end delay than existing multiple MCS schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信