摘要
本文考虑了匹配排队网络 ＰＨ／Ｍ／ｃ→ｏＰＨ／ＰＨ／１，研究了两个子系统和整个网络的忙期与非闲期的概率分布，得到了具有一致误差的算法．然后证明了这些算法的时间与空间的计算复杂性都是多项式的．最后给出了数例。
We consider the matched queueing network PH/M/c→ oPH/PH/1. The prob- ability distributions of busy periods and non-idle periods for the two subsystems and the whole network are studied and their algorithms with uniform error are derived. It is proved that both the time and space complexities of the algorithms are polynomially bounded. At last, a numerical example is presented.
出处
《运筹学学报》
CSCD
2000年第1期22-32,共11页
Operations Research Transactions
基金
National Natural Science Foundation of China !(Grant No. 19671088)
关键词
匹配排队网络
PH分布
忙期
非闲期
算法
Matched queueing network
PH-distribution
busy period
non-idle period
algorithm
uniform error
computational complexity.
