论文信息 - A matrix-geometric solution of the jockeying problem

A matrix-geometric solution of the jockeying problem

Abstract The multi-server exponential queue is considered, studied by Disney and Mitchell in 1971, and by Elsayed and Bastani in 1985, where customers are allowed to jockey among queues. A matrix-geometric solution for the problem is proposed. By exploiting the structure of the model, simple procedures are developed for computing the stationary probability vector of the underlying continuous-time Markov chain, the waiting time distribution, and other performance characteristics of interest.

Edward P. C. Kao | Chiunsin Lin | E. P. Kao | Chiunsin Lin

[1] Elsayed A. Elsayed,et al. General solutions of the jockeying problem , 1985 .

[2] Vaidyanathan Ramaswami,et al. Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems , 1988 .

[3] Ernest Koenigsberg,et al. On Jockeying in Queues , 1966 .

[4] W. Grassmann. Transient solutions in Markovian queues : An algorithm for finding them and determining their waiting-time distributions , 1977 .

[5] V. Ramaswami,et al. Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death process , 1985, STOC 1985.

[6] Ralph L. Disney,et al. A solution for queues with instantaneous jockeying and other customer selection rules , 1970 .

[7] Frank A. Haight,et al. TWO QUEUES IN PARALLEL , 1958 .

[8] M. Neuts. The caudal characteristic curve of queues , 1984, Advances in Applied Probability.

[9] Marcel F. Neuts,et al. Matrix-Geometric Solutions in Stochastic Models , 1981 .

[10] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..

[11] Guy Latouche,et al. A general class of Markov processes with explicit matrix-geometric solutions , 1986 .

[12] Guy Latouche,et al. Semi-explicit solutions for M/PH/1-like queuing systems , 1983 .