91Ó°ÊÓ

In this problem, there are two servers, and \(n\) customers move back and forth between the servers. After being served by a server, a customer either enters service at the other server or joins the queue if the other server is busy. We are also told that service times at both servers follow an exponential distribution with parameter \(\mu\). The exponential distribution is a continuous probability distribution that describes the time between events in a Poisson point process. In this case, it describes the time a server spends serving a customer. The exponential distribution can be represented as \(f(t) = \mu e^{-\mu t}\), where \(t\) is the time and \(\mu\) is the rate parameter.

To find the proportion of time that there are \(j\) customers at server \(1\), we can compute the stationary distribution of customers in the system. The stationary distribution is the probability distribution of the system’s state when time goes to infinity. Based on the given scenario, the balance equations can be defined as: For \(j=0\): \[P_0 \mu + P_{n-1} \mu = P_1 \mu\] For \(1 \leq j \leq n-1\): \[P_{j-1} \mu + P_{j+1} \mu = P_j (\mu + \mu)\] For \(j=1\), specifically: \[P_0 \mu + P_2 \mu = P_1 2\mu\]

Solve the balance equations to find the probability, \(P_j\), of having \(j\) customers at server \(1\). From the equation for \(j=0\), we have: \[P_1 = P_0 + \frac{P_{n-1}}{2}\] From the equation for \(1 \leq j \leq n-1\), we observe that for any \(j\), \(P_{j+1} = P_{j-1}\). This means that for every non-negative integer \(k \leq n-2\), we have \[P_{2k+1} = P_{2k-1}\] Based on this, we can compute \(P_j\) for any \(j\) from \(P_0\): \[P_j = \begin{cases} P_0, &\text{if } j \text{ is even} \\ P_0 + \frac{P_{n-1}}{2}, &\text{if } j \text{ is odd} \end{cases}\] Notice that since \(P_0 + P_1 + \ldots + P_n = 1\) and \(P_{2k+1} = P_{2k-1}\) for every \(k\), \[P_0 \left(1 + \frac12 + \frac12 + \ldots + \frac12 \right) + \frac{P_{n-1}}{2} \left( 1 + 1 + \ldots + 1 \right) = 1\] \[P_0 \left( 1 + \frac{n}{2} \right) + \frac{P_{n-1}}{2} \left( \lfloor \frac{n+1}{2}\rfloor \right) = 1\] Now, we can compute \(P_0\) and \(P_{n-1}\): \[P_{0} = \frac{2}{n+2}\] \[P_{n-1} = 2P_0\] Finally, we can compute \(P_j\) as: \[P_j = \begin{cases} \frac{2}{n+2}, &\text{if } j \text{ is even} \\ \frac{2}{n+2} \left(1 + \frac{n}{2}\right), &\text{if } j \text{ is odd} \end{cases}\] These probabilities represent the proportion of time that there are \(j\) customers at server \(1\) for \(j = 0, 1, \ldots, n\).