Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Customers arrive at a two-server station in accordance with a Poisson process with a rate of two per hour. Arrivals finding server 1 free begin service with that server. Arrivals finding server 1 busy and server 2 free begin service with server 2. Arrivals finding both servers busy are lost. When a customer is served by server 1 , she then either enters service with server 2 if 2 is free or departs the system if 2 is busy. \(\mathrm{A}\) customer completing service at server 2 departs the system. The service times at server 1 and server 2 are exponential random variables with respective rates of four and six per hour. (a) What fraction of customers do not enter the system? (b) What is the average amount of time that an entering customer spends in the system? (c) What fraction of entering customers receives service from server \(1 ?\)

Short Answer

Expert verified
(a) The fraction of customers who do not enter the system is \( \frac{1}{8}\) (b) The average amount of time that an entering customer spends in the system is \( \frac{49}{384} \) hours. (c) The fraction of entering customers receiving service from server 1 is \( \frac{3}{8}\).

Step by step solution

01

Model the system

First, we need to model the system using a M/M/c/C model where c = 2, since we have two servers. The arrival rate (λ) is two per hour and the service rates at server 1 (μ1) and server 2 (μ2) are four and six per hour, respectively.
02

Calculate the state probabilities

Next, we need to calculate the state probabilities using the steady-state balance equations: \(P_0 = \frac{1}{1 + \frac{\lambda}{\mu_1} + \frac{\lambda^2}{\mu_1 \mu_2}}\) \(P_1 = \frac{\lambda}{\mu_1} P_0\) \(P_2 = \frac{\lambda^2}{\mu_1 \mu_2} P_0\) We have: \(P_0 = \frac{1}{1 + \frac{2}{4} + \frac{2^2}{4 \cdot 6}} = \frac{1}{1 + 0.5 + \frac{1}{6}} = \frac{1}{\frac{16}{12}} = \frac{3}{4}\) \(P_1 = \frac{2}{4} P_0 = \frac{1}{2} \cdot \frac{3}{4} = \frac{3}{8}\) \(P_2 = \frac{2^2}{4 \cdot 6} P_0 = \frac{1}{6} \cdot \frac{3}{4} = \frac{1}{8}\)
03

Calculate system performance measures

(a) The fraction of customers who do not enter the system is represented by the probability of the system being in state 2 (both servers are busy). Thus, we have: Fraction of customers who do not enter the system = \(P_2 = \frac{1}{8}\) (b) To calculate the average amount of time that an entering customer spends in the system, we first need to find the average time spent in each server. For an M/M/c/C model, the expected service time for server i is given by: \(E[T_i] = \frac{1}{\mu_i}\) \(E[T_1] = \frac{1}{4} = 0.25h\) \(E[T_2] = \frac{1}{6} = \frac{1}{6}h\) Now, we can find the average amount of time that an entering customer spends in the system by considering the probabilities of going through each server: Average time in the system = \(E[T_1] P_1 + E[T_2] P_2 = 0.25 \cdot \frac{3}{8} + \frac{1}{6} \cdot \frac{1}{8} = \frac{3}{32} + \frac{1}{48} = \frac{49}{384} h\) (c) The fraction of entering customers who receive service from server 1 is represented by the probability of the system being in state 1 (only server 1 is busy): Fraction of entering customers receiving service from server 1 = \(P_1 = \frac{3}{8}\) Final answers: (a) The fraction of customers who do not enter the system is \( \frac{1}{8}\) (b) The average amount of time that an entering customer spends in the system is \( \frac{49}{384} \) hours. (c) The fraction of entering customers receiving service from server 1 is \( \frac{3}{8}\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

In the Erlang loss system suppose the Poisson arrival rate is \(\lambda=2\), and suppose there are three servers, each of whom has a service distribution that is uniformly distributed over \((0,2)\). What proportion of potential customers is lost?

For the \(M / G / 1\) queue, let \(X_{n}\) denote the number in the system left behind by the nth departure. (a) If $$ X_{n+1}=\left\\{\begin{array}{ll} X_{n}-1+Y_{n}, & \text { if } X_{n} \geqslant 1 \\ Y_{n}, & \text { if } X_{n}=0 \end{array}\right. $$ what does \(Y_{n}\) represent? (b) Rewrite the preceding as $$ X_{n+1}=X_{n}-1+Y_{n}+\delta_{n} $$ where $$ \delta_{n}=\left\\{\begin{array}{ll} 1, & \text { if } X_{n}=0 \\ 0, & \text { if } X_{n} \geqslant 1 \end{array}\right. $$ Take expectations and let \(n \rightarrow \infty\) in Equation ( \(8.64\) ) to obtain $$ E\left[\delta_{\infty}\right]=1-\lambda E[S] $$ (c) Square both sides of Equation \((8.64)\), take expectations, and then let \(n \rightarrow \infty\) to obtain $$ E\left[X_{\infty}\right]=\frac{\lambda^{2} E\left[S^{2}\right]}{2(1-\lambda E[S])}+\lambda E[S] $$ (d) Argue that \(E\left[X_{\infty}\right]\), the average number as seen by a departure, is equal to \(L\).

Consider an \(M / G / 1\) system in which the first customer in a busy period has the service distribution \(G_{1}\) and all others have distribution \(G_{2}\). Let \(C\) denote the number of customers in a busy period, and let \(S\) denote the service time of a customer chosen at random. Argue that (a) \(a_{0}=P_{0}=1-\lambda E[S]\) (b) \(E[S]=a_{0} E\left[S_{1}\right]+\left(1-a_{0}\right) E\left[S_{2}\right]\) where \(S_{i}\) has distribution \(G_{i}\). (c) Use (a) and (b) to show that \(E[B]\), the expected length of a busy period, is given by $$ E[B]=\frac{E\left[S_{1}\right]}{1-\lambda E\left[S_{2}\right]} $$ (d) Find \(E[C]\).

Arrivals to a three-server system are according to a Poisson process with rate \(\lambda\). Arrivals finding server 1 free enter service with \(1 .\) Arrivals finding 1 busy but 2 free enter service with \(2 .\) Arrivals finding both 1 and 2 busy do not join the system. After completion of service at either 1 or 2 the customer will then either go to server 3 if 3 is free or depart the system if 3 is busy. After service at 3 customers depart the system. The service times at \(i\) are exponential with rate \(\mu_{i}, i=1,2,3\). (a) Define states to analyze the above system. (b) Give the balance equations. (c) In terms of the solution of the balance equations, what is the average time that an entering customer spends in the system? (d) Find the probability that a customer who arrives when the system is empty is served by server 3 .

Consider a closed queueing network consisting of two customers moving among two servers, and suppose that after each service completion the customer is equally likely to go to either server-that is, \(P_{1,2}=P_{2,1}=\frac{1}{2}\). Let \(\mu_{i}\) denote the exponential service rate at server \(i, i=1,2\) (a) Determine the average number of customers at each server. (b) Determine the service completion rate for each server.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free