排队网络中的逗留时间

Sojourn Times in Queueing Networks

Mathematics of Operations Research · 1982
被引 49
ABS 3

中文导读

研究了多类顾客、泊松到达、路径依赖和状态依赖服务的排队网络,分析了逗留时间的极限分布、均值及无超车路径上的分布,并证明Reich的结论可推广至无超车路径。

Abstract

We consider a queueing network with types of customers. Poisson arrivals, type dependent routing and state dependent service. A number of stochastic aspects relating to sojourn times are investigated. Included are limiting state distributions imbedded at customer move times, mean sojourn times, and sojourn time distributions along overtake-free paths. It is shown that Reich's results extend to overtake-free paths yielding limiting sojourn time distributions which correspond to the sum of exponential independent stages of sojourn in individual nodes. The analysis is bused solely on considerations of population distributions through conditioning on customers' itineraries in the network.

排队论随机过程计算机网络运筹学