Advances in Applied Probability · 1991 · 106 citations · 23 references
BusinessComputer ScienceComputer NetworksQueuing TheoryService OperationsNetworks Of QueuesQueueing AnalysisQueueing NetworksQueueing ProcessesQueueing SystemsQueueing TheoryBalance EquationsDiscrete-time Queueing ModelsJob TransitionsProduct-form NetworksProduct-form SolutionsRouting In Queueing Networks
A general framework of continuous-time queueing networks is studied with simultaneous state dependent service completions such as due to concurrent servicing or discrete-time slotting and with state dependent batch routings such as most typically modelling blocking. By using a key notion of group-local-balance, necessary and sufficient conditions are given for the stationary distribution to be of product form. These conditions and a constructive computation of the product form are based upon merely local solutions of the group-local-balance equations which can usually be solved explicitly for concrete networks. Moreover, a decomposition theorem is presented to separate service and routing conditions. General batch service and batch routing examples yielding a product form are hereby concluded. As illustrated by various examples, known results on both discrete- and continuous-time queueing networks are unified and extended.
23
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Forest Baskett, K. Mani Chandy, Richard R. Muntz et al. · Journal of the ACM · 1975 · 2.4K citations · Full text
Reversibility and Stochastic Networks
Joel E. Cohen, F. P. Kelly · Technometrics · 1981 · 2.3K citations
James R. Jackson · Operations Research · 1957 · 1.3K citations
James R. Jackson · Management Science · 1963 · 895 citations
James R. Jackson · Management Science · 2004 · 742 citations