Determine smallest integer number of trunk lines needed


Messages are transmitted from low speed terminals and arrive at a message concentrator at a rate of 600/hr. They are held in a buffer until a high-speed trunk line is free to transmit them.the trunk line transmission time is exponential with a mean of 30 sec.

1. Determine the smallest integer number of trunk lines needed so that tq the waiting time in the queue satisfies the relation t t[tq< 60 sec.]> 0.95,i.e , the probability exceeds 95% that the time the message spends in the buffer is less than 60 sec.

2. Compute L and q for the number of trunk lines you determined.

Request for Solution File

Ask an Expert for Answer!!
Basic Statistics: Determine smallest integer number of trunk lines needed
Reference No:- TGS0103962

Expected delivery within 24 Hours