累积分层组播树稳定性的统计分析

Shi Feng, Wu Jianping, Xu Ke
{"title":"累积分层组播树稳定性的统计分析","authors":"Shi Feng, Wu Jianping, Xu Ke","doi":"10.1109/ICCT.2003.1209128","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the stability of a multicast (one-to-many) tree in cumulative layered multicast, which is traditionally realized by dropping a layer when congestion is detected. First, we define a stability index to evaluate and quantify tree's stability. Then, for obtaining the general expression of the stability index, we develop a simple statistical model, which is based on the link-dependent model and the dependency-degree model in [X. Zhang et al., 2001]. We show that even in the case of lower link-marking probability, the stability of multicast tree is significantly more sensitive to network congestion when dependency between different links becomes smaller, indicating that more links will leave the tree when congestion occurs.","PeriodicalId":237858,"journal":{"name":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Statistical analysis of stability of multicast trees in cumulative layered multicast\",\"authors\":\"Shi Feng, Wu Jianping, Xu Ke\",\"doi\":\"10.1109/ICCT.2003.1209128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the stability of a multicast (one-to-many) tree in cumulative layered multicast, which is traditionally realized by dropping a layer when congestion is detected. First, we define a stability index to evaluate and quantify tree's stability. Then, for obtaining the general expression of the stability index, we develop a simple statistical model, which is based on the link-dependent model and the dependency-degree model in [X. Zhang et al., 2001]. We show that even in the case of lower link-marking probability, the stability of multicast tree is significantly more sensitive to network congestion when dependency between different links becomes smaller, indicating that more links will leave the tree when congestion occurs.\",\"PeriodicalId\":237858,\"journal\":{\"name\":\"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2003.1209128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Communication Technology Proceedings, 2003. ICCT 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2003.1209128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文考虑了累积分层组播中一对多组播树的稳定性问题,传统的多播树是在检测到拥塞时去掉一层来实现的。首先,我们定义了一个稳定性指标来评价和量化树的稳定性。然后,为了得到稳定性指标的一般表达式,我们建立了一个简单的统计模型,该模型基于[X]中的链接依赖模型和依赖程度模型。张等,2001]。研究表明,即使在链路标记概率较低的情况下,当不同链路之间的依赖关系越小时,组播树的稳定性对网络拥塞的敏感性显著增强,这表明当拥塞发生时,会有更多的链路离开组播树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Statistical analysis of stability of multicast trees in cumulative layered multicast
In this paper, we consider the stability of a multicast (one-to-many) tree in cumulative layered multicast, which is traditionally realized by dropping a layer when congestion is detected. First, we define a stability index to evaluate and quantify tree's stability. Then, for obtaining the general expression of the stability index, we develop a simple statistical model, which is based on the link-dependent model and the dependency-degree model in [X. Zhang et al., 2001]. We show that even in the case of lower link-marking probability, the stability of multicast tree is significantly more sensitive to network congestion when dependency between different links becomes smaller, indicating that more links will leave the tree when congestion occurs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信