帧丢失过多对扫描树重构的影响

A. Rindos, S. Woolet, Lee A. Sendelbach
{"title":"帧丢失过多对扫描树重构的影响","authors":"A. Rindos, S. Woolet, Lee A. Sendelbach","doi":"10.1109/LCN.1992.228117","DOIUrl":null,"url":null,"abstract":"The effects of excessive frame loss (presumably due to media speed mismatches and/or heavy congestion) on the frequency of spanning tree reconfiguration are examined. Assuming that the losses of successive bridge protocol data units (BPDUs) are independent, general formulas for the mean time and transient probability of a single node initiating spanning tree reconfiguration (due to loss of successive BPDUs) are derived as a function of its probability of frame loss. The case of n equivalently independent nodes in the network is considered. The mean time to first loss (conditioned and unconditioned on the initial state of the system) given a step increase in utilization to above 1, if the node is modeled as an M/M/1/K system, is determined. Throughout, methods for making the network less susceptible to unnecessary spanning tree reconfiguration are discussed.<<ETX>>","PeriodicalId":249184,"journal":{"name":"[1992] Proceedings 17th Conference on Local Computer Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Effects of excessive frame loss on scanning tree reconfiguration\",\"authors\":\"A. Rindos, S. Woolet, Lee A. Sendelbach\",\"doi\":\"10.1109/LCN.1992.228117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The effects of excessive frame loss (presumably due to media speed mismatches and/or heavy congestion) on the frequency of spanning tree reconfiguration are examined. Assuming that the losses of successive bridge protocol data units (BPDUs) are independent, general formulas for the mean time and transient probability of a single node initiating spanning tree reconfiguration (due to loss of successive BPDUs) are derived as a function of its probability of frame loss. The case of n equivalently independent nodes in the network is considered. The mean time to first loss (conditioned and unconditioned on the initial state of the system) given a step increase in utilization to above 1, if the node is modeled as an M/M/1/K system, is determined. Throughout, methods for making the network less susceptible to unnecessary spanning tree reconfiguration are discussed.<<ETX>>\",\"PeriodicalId\":249184,\"journal\":{\"name\":\"[1992] Proceedings 17th Conference on Local Computer Networks\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings 17th Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1992.228117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 17th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1992.228117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

过多的帧丢失(可能是由于媒体速度不匹配和/或严重拥塞)对生成树重构频率的影响进行了检查。假设连续的桥接协议数据单元(bpdu)的丢失是独立的,推导出单个节点启动生成树重构(由于连续bpdu的丢失)的平均时间和瞬时概率的一般公式,作为其帧丢失概率的函数。考虑网络中有n个等效独立节点的情况。如果节点被建模为M/M/1/K系统,则在利用率增加到1以上的情况下,到达第一次损失的平均时间(根据系统的初始状态有条件和无条件)是确定的。在整个过程中,讨论了使网络不容易受到不必要的生成树重构的影响的方法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Effects of excessive frame loss on scanning tree reconfiguration
The effects of excessive frame loss (presumably due to media speed mismatches and/or heavy congestion) on the frequency of spanning tree reconfiguration are examined. Assuming that the losses of successive bridge protocol data units (BPDUs) are independent, general formulas for the mean time and transient probability of a single node initiating spanning tree reconfiguration (due to loss of successive BPDUs) are derived as a function of its probability of frame loss. The case of n equivalently independent nodes in the network is considered. The mean time to first loss (conditioned and unconditioned on the initial state of the system) given a step increase in utilization to above 1, if the node is modeled as an M/M/1/K system, is determined. Throughout, methods for making the network less susceptible to unnecessary spanning tree reconfiguration are discussed.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Broadcasting and personalized communication in a torus and grid network HIPPI (high performance parallel interface) Throughput analysis of timed token protocols in double ring networks Modeling and analysis of high speed parallel token ring networks Addressing modes and management protocols in a gigabit LAN with switching tables
×
引用
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