摘要
本文建立了一种门限式令牌总线局部网协议的数学模型——多用户单服务排队离散系统.用马尔可夫链理论,对所建立的数学模型进行了理论分析,推导出离散系统的平均循环周期公式、平均队长公式和平均等待时间公式,最后用蒙特卡洛法对离散系统进行了计算机模拟,模拟结果与理论值相吻合.
This paper propose that the mathematical model of gated polling and Token Bus Prolocol for LANs is a multi-queue, single-server discrete system. By the Markov chain method, analytic formulae for the mean values of cycle time and queue length and waiting time are derived. Finally, we utilize Montecarlo methods in order to simulate the discrete system. The simulation results indicate minor errors introduced by the established system.
出处
《云南大学学报（自然科学版）》
CAS
CSCD
1990年第2期146-152,共7页
Journal of Yunnan University(Natural Sciences Edition)
关键词
局部网
门限式
等待时间
通信网
discrete, random variable, Markov chains, queue length, waiting times
