On the Shortest Queue Policy for the Tandem Parallel Queue

Publisher Website
Google Scholar
Abstract
We consider two nodes in tandem. At each node or service center, there are two exponential servers present with the same service rate μ and each with its own queue. Customers arrive at the first node according to a Poisson process with arrival rate λ. At their arrival, they have to be assigned to one of the servers, so they are routed to one of the queues at node 1. Customers leaving center 1 enter node 2 and are routed to one of the queues at node 2. In this paper, we consider the case with full information and the case with partial information.

This publication has 15 references indexed in Scilit: