The shortest queue model with jockeying
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.
Back to my
home page.