Premium
The shortest queue model with jockeying
Author(s) -
Zhao Yiqiang,
Grassmann W. K.
Publication year - 1990
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199010)37:5<773::aid-nav3220370514>3.0.co;2-2
Subject(s) - queue , computer science , poisson distribution , exponential function , mathematical optimization , mathematics , computer network , statistics , mathematical analysis
In this article we deal with the shortest queue model with jockeying. We assume that the arrivals are Poisson, each of the exponential servers has his own queue, and jockeying among the queues is permitted. Explicit solutions of the equilibrium probabilities, the expected customers, and the expected waiting time of a customer in the system are given, which only depend on the traffic intensity. Numerical results can be easily obtained from our solutions. Several examples are provided in the article.