A well known disadvantage of standard token-passing in ring and bus networks is the waste of channel bandwidth often seen in lightly loaded or asymmetric systems. It is possible to make use of the broadcast mechanism in token bus systems to distribute nearly up-to-date information about the state of individual stations to the entire system. One such scheme involves the determination of a randomly varying set of more active stations. These stations are given a chance to form a second logical ring above the standard logical ring that characterizes the token bus. The transmission cycles of the system can thus be made to alternate between standard token-passing and transmission cycles, and the cycles of token-passing and transmission within the logical ring of more active stations. We assume that each station makes at most one transmission when given the chance to transmit. For Poisson arrivals and otherwise general input distributions, the cycle-time distribution of the token is derived for each kind of cycle. An important random variable is the random token turnaround time seen by individual stations. For lightly loaded stations this time tends to be larger than for heavily loaded stations. The distribution of this random time, simple performance measures, and a comparative measure of stability, showing the adaptive scheme to be more stable than the standard, are obtained.
Department of Computer Sciences, Purdue University, West Lafayette, IN;
机译:令牌持有时间有限的令牌传递协议的延迟分析
机译:坚固的光纤有源星形耦合器,用于SAE线性令牌传递多路复用数据总线
机译:主从/令牌通过协议带宽分配的实验评估
机译:为无线令牌传递实时协议增加外来流量承受能力
机译:本地计算机网络数据链路层协议(运营商感知,多次访问,通过令牌环的总线环)的建模和验证。
机译:常规艾灸和无烟艾灸对膝骨关节炎的疗效比较:一项随机对照试验的研究方案
机译:将组播功能添加到无线多跳令牌传递协议:扩展rt-wmp