运筹学学报
運籌學學報
운주학학보
OR TRANSACTIONS
2000年
1期
22-32
,共11页
匹配排队网络%PH分布%忙期%非闲期%算法%一致误差%计算复杂性
匹配排隊網絡%PH分佈%忙期%非閒期%算法%一緻誤差%計算複雜性
필배배대망락%PH분포%망기%비한기%산법%일치오차%계산복잡성
Matched queueing network%PH-distribution%busy period%non-idleperiod%algorithm%uniform error%computational complexity
本文考虑了匹配排队网络PH/M/c→oPH/PH/1,研究了两个子系统和整个网络的忙期与非闲期的概率分布,得到了具有一致误差的算法.然后证明了这些算法的时间与空间的计算复杂性都是多项式的.最后给出了数例.
本文攷慮瞭匹配排隊網絡PH/M/c→oPH/PH/1,研究瞭兩箇子繫統和整箇網絡的忙期與非閒期的概率分佈,得到瞭具有一緻誤差的算法.然後證明瞭這些算法的時間與空間的計算複雜性都是多項式的.最後給齣瞭數例.
본문고필료필배배대망락PH/M/c→oPH/PH/1,연구료량개자계통화정개망락적망기여비한기적개솔분포,득도료구유일치오차적산법.연후증명료저사산법적시간여공간적계산복잡성도시다항식적.최후급출료수례.
We consider the matched queueing network PH/M/c →oPH/PH/1. The probability 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.
