{"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}
引用次数: 0
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.<>