Table of Contents#### Download Safari Books Online apps: Apple iOS | Android | BlackBerry

### 6.6. Two Variations on the M/M/1 Queue

#### 6.6.1. The M/M/∞ Queue: A Responsive Server

Entire Site

Free Trial

Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.

We now briefly consider two variations on the M/M/1 queue, essentially to give insight into how one proceeds with the analysis of a queueing system.

Suppose that a provider of service capacity brings on a new server to serve every arriving customer. This is like a private bank where new agents are brought on to provide individual attention to each customer when she or he arrives. This system can be modeled as a queue with an infinite number of servers, though, at any time, the number of servers is finite.

We can model and analyze this queue by using the same techniques as with an M/M/1 queue. We start with the state-transition-rate diagram shown in Figure 6.7. Note that μ_{j}, the rate of departure from the *j*th queue, is *j*μ, which models the fact that when there are *j* customers, there are *j* servers. From the diagram, we can directly invoke Equation 6.29 to write down , the stationary probability of being in state *j*, as