Asymptotically exact decomposition approximations for open queueing networks
Operations Research Letters（1990）
摘要
Two decomposition approximations are presented for mean sojourn times in open single class queueing networks. If there is a single bottleneck station, the approximations are asymptotically exact in both light and heavy traffic. When applied to a Jackson network or an M/G/1 queue, these approximations are exact for all values of the traffic intensity. They also perform reasonably well on some small examples.
更多查看译文
关键词
heavy traffic,open single class,single bottleneck station,traffic intensity,Jackson network,decomposition approximation,mean sojourn time,small example,Asymptotically exact decomposition approximation,open queueing network
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要