摘要
本文采用嵌入马尔可夫链理论和概率母函数的方法，根据循环查询时间变量的二阶特性，在离散时间状态下对非对称性令牌网络进行了分析，给出了一种报文分组平均等待时间的近似解析式，同时也给出了计算机模拟实验结果。
This paper presents an approximate analysis technique for asymmetric token bus and token ring networks. To analyze the asymmetric scheme we consider the second moment of random cyclic polling time. The methods of the imbedded Markov chain theory and the probability generating function is used to obtain the estimates of mean waiting times. The results of the systems with gated service in discrete time are based on extensive validation with simulations.
出处
《通信学报》
EI
CSCD
北大核心
1998年第1期75-80,共6页
Journal on Communications
基金
国家863/CIMS主题资助
云南省教委基金
关键词
非对称性
令牌网络
门限服务
离散时间
数据通信
asymmetric token bus and token ring network,gated service,discrete time
