1. Customers entering a shop are served in the order of their arrival by the single server. Theyarrive in the manner of a Poisson process with intensity, and their service times are independentexponentially distributed random variables with parameter u. By considering the jump chain, showthat the expected duration of a busy period B of the server is (μ-2)-1 when λ < . (The busyperiod runs from the moment a customer arrives to find the server free until the earliest subsequenttime when the server is again free.)

Answered: Image /qna-images/answer/09c6463e-6ae5-4e8e-9a66-5e8271d1c22d.jpg

Answered: 1. Customers entering a shop are served…

Linear Algebra: A Modern Introduction

4th Edition

ISBN:9781285463247

Author:David Poole

Publisher:David Poole

Chapter3: Matrices

Section3.7: Applications

Problem 12EQ: 12. Robots have been programmed to traverse the maze shown in Figure 3.28 and at each junction...

See similar textbooks

Similar questions

12. Robots have been programmed to traverse the maze shown in Figure 3.28 and at each junction randomly choose which way to go. Figure 3.28 (a) Construct the transition matrix for the Markov chain that models this situation. (b) Suppose we start with 15 robots at each junction. Find the steady state distribution of robots. (Assume that it takes each robot the same amount of time to travel between two adjacent junctions.)
Suppose the number of photons emitted by an atom during a one-minute time window can be modeled as a Poisson random variable with parameter λ = 2. Now, suppose you watch the atomfor two minutes, and the number of emitted photons in each minute is an independent Poisson process. Calculate the probability that you see exactly one photon during the two minutes. (Hint: this is the probability that you see no photons in the first minute and one photon in the second minute, plus the probability that you see one photon in the first minute and no photons in the second minute.) Similarly calculate the probability that you see exactly two photons during the two minutes.Compare these probabilities to the probabilities that a Poisson random variable with parameter λ= 4 takes the value one, or two. Are they the same?
Consider two types of call arrivals to a cell in a mobile telephone network: new calls that originate in a cell and calls that are handed over from neighboring cells. It is desirable to give preference to handover calls over new calls. For this reason, some of the channels in the cell are reserved for handover calls, while the rest of the channels are available to both types of calls. = = Suppose that all calls arrive in a cell according to a Poisson process with rate Anc 125 calls per hour for new calls, and λho 50 calls per hour for handover calls. The cell has a capacity of 10 channels. Each call occupies 1 channel and the call time has an exponential distribution with mean two minutes. Suppose that no channels are reserved for handover calls. (a) Calculate the blocking probability in the cell and find the average number of channels used. (b) When a call has to wait, find its average waiting time.
7. (Sec. 3.6) Consider sending packets of data through the internet, and we have a counter that determines the number of missing/corrupted packets. Suppose that number X has a Poisson distribution with parameter 23. = (a) What is the probability that the counter determines that the transmission has exactly one miss- ing/corrupted packet of data? (b) What is the probability that the counter determines that the transmission has at least 3 miss ing/corrupted packets of data? (c) If two transmissions of data across the internet ar that at least one of them does not contain a missing/corrupted packet? e independently selected, what is the probability
Customer A and B are being served by two clerks in the post office. Customer C is waiting and he is the last customer of today. Suppose a clerk’s serving time for any customer follows exponential distribution with parameter λ independently. Customers will be served once any of the clerks are available. What’s the probability that customer A the last customer to leave the post office?
A certain type of tree has seedlings randomly dispersed in a large area, with the mean density of seedlings being approximately three per square yard. If the seedlings are randomly dispersed, 1 the number of seedlings per region, Y can be modelled as a Poisson random variable. If a forester randomly locates ten 1-square-yard sampling regions in the area, find the probability that none of the regions will contain seedlings and state the moment generating function of the random variable Y.
A small bank has two tellers, one for deposis and one for withdrawals. The service time for each teller is exponentially distributed, with a mean of 1 min. Customers arriving at the bank according to a poisson process, with mean rate 40 per hour; it is assumed that depositors and withdrawers constitute separate poisson processes, each with mean rate 20 per hour , and that no customer is both a depositor and a withdrawer. The bank is thinking of changing the current arrangement to allow each teller to handle both deposits and withdrawals. The bank would expect that each teller's mean service time would increase to 1.2 min, but it hopes that the new arrangement would prevent long lines in front of one teller while the other teller is idle, a situation that occurs from time to time under the current setup. Analyze the two arrangements with respect to the average idle time of teller and the expected number of customers in the bank at any given time.
A service company receives on average 4 service requests per day. The requests are received randomly according to Poisson process. The company has 2 service engineers and sends one engineer to attend each request. 1 An engineer needs an exponentially distributed service time with the mean of day(s). 2 The company's policy is to have maximum of 2 requests waiting in the queue If this number is reached, all incoming requests are rejected (sent to a competitor). Answer the following questions based on the information provide above: (a) Using the Kendall's notation, indicate what type of queueing system it is: (b) Compute the system state probabilities (provide at least 3 decimals): Po = P1= P2 = P3 = Pa = (c) Compute the expected total number of customer requests (waiting and served) in the system. ELL] = (d) Compute the expected number of accepted requests. Aaccepted = (e) Compute the expected total processing time (waiting + being served) for the accepted requests. E[Time] =

Recommended textbooks for you

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

Algebra & Trigonometry with Analytic Geometry

Algebra

ISBN:

9781133382119

Author:

Swokowski

Publisher:

Cengage

Calculus For The Life Sciences

Calculus

ISBN:

9780321964038

Author:

GREENWELL, Raymond N., RITCHEY, Nathan P., Lial, Margaret L.

Publisher:

Pearson Addison Wesley,

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

Algebra & Trigonometry with Analytic Geometry

Algebra

ISBN:

9781133382119

Author:

Swokowski

Publisher:

Cengage

Calculus For The Life Sciences

Calculus

ISBN:

9780321964038

Author:

GREENWELL, Raymond N., RITCHEY, Nathan P., Lial, Margaret L.

Publisher:

Pearson Addison Wesley,

SEE MORE TEXTBOOKS