论文部分内容阅读
在这篇论义中,我们在IEEE—PTR方案的基础上,提出了两个新的PTR方案,其中一个为具有予约机理的、具有优先权的令牌环形网通信协议(R—PTR),另一个为无予约机理的、具有优先权的令牌环形网通信协议(WR—PTR).这两个方案都不使用堆栈.在这篇论文中,对R-PTR和WR—PTR方案,给出了有关分组平均传输时延和信道利用率的近似计算式,并通过计算机仿真实验验证了近似公式的可信赖性.通过进一步的仿真实验的研究,发现了这两个新方案的一些很有趣的特性,例如其动态特性等.最后,从各方面性能上,对这两个新方案和IEEE—PTR—方案进行了比较.
In this argument, we propose two new PTR schemes based on the IEEE-PTR scheme, one of which is a prioritized Token Ring Network Protocol (R-PTR) , And the other is a non-contract-based, token-ring network protocol with priority (WR-PTR). Both of these schemes do not use the stack. In this paper, the R-PTR and WR- , Gives an approximate calculation formula about packet average transmission delay and channel utilization, and verifies the reliability of the approximate formula through computer simulation.Furthermore, through the simulation research, we find some of the two new schemes Interesting features, such as their dynamic features, etc. Finally, the performance of these two new schemes and the IEEE-PTR-scheme are compared.