Technical University of Denmark

Written test, May 22, 2006 Course: Teletrac Engineering & Network Planning Aids allowed: All written materials allowed Weighting:

Page 1 of 3 pages

Course no. 34 340

All questions have the same weight. The evaluation is supplemented with an overall appraisal of the solution

Exercise 1 Erlangs Loss system with ordered hunting We consider Erlangs loss system with n = 3 channels. The arrival rate is = 2 calls per time unit, and the mean holding time is 1 = 1/2 time unit. 1. Find the oered trac. 2. Construct the state transition diagram and nd the state probabilities under the assumption of statistical equilibrium 3. Assume sequential (ordered) hunting of idle channels and nd the trac carried by each channel (the improvement function), using the recursion formula for the Erlang-B formula. Denote the three channels by a, b, c (order of hunting). 4. Set up a state transition diagram which keeps record of the state of each channel, where the state is dened by the busy channels as shown in the gure below.
               

ab

ac

abc

bc

Page 2 of 3 pages 5. Find the remaining state probabilities using the results above and the following state probabilities: 19 240 6 p(c) = 240 7 p(ac) = 240 5 p(bc) = 240 p(b) = 6. Find the trac carried by each channel expressed by the state probabilities. What is the proportion of time channel a is busy and the other channels b and c are idle? Exercise 2 Preferential trac We consider a system with full accessibility and n = 4 servers. Two dierent types of customers arrive according to Poisson processes. Type one customers arrive with rate 1 = 1 customer per time unit. If all servers are busy, then type one customers wait in an innite queue until they are served. (These customers are preferential customers, for example hand-over calls in wireless systems). Type two customers arrive with rate 2 = 2 customers per time unit. If all servers are busy, then type two customers are blocked (Lost-Calls-Cleared). (These customers are ordinary customers, for example new calls in wireless systems). All customers have the same mean service time 1 = 1 [time unit]. 1. Find the oered trac A1 for type one, A2 for type two, and the total oered trac. Which restrictions should Ai (i =1, 2) fulll for ensuring statistical equilibrium? 2. Construct a one-dimensional state transition diagram when the state of the system is dened as the total number of customers in the system (either being served or waiting). 3. Assume statistical equilibrium and nd the state probabilities. Find the probability that a type one customer is delayed. a type two customer is blocked. 4. Find the mean queue length, the mean waiting time for all customers of type one, and the mean waiting time for delayed customers of type one. 5. Assume the queueing discipline is FCFS. Write down the waiting time distribution for delayed type one customers (use the analogy with the state transition diagram of an Erlang-C system when all servers are busy).

Page 3 of 3 pages

Exercise 3 Closed and mixed queueing networks We consider a closed queueing network with one chain of customers and two nodes. Node one is of type M/M/1, and node two is of type M/M/2. After nishing service in a node a customers passes on to the other node. There is a total of 4 customers in the queueing network. The mean service times is s1 = 1 [time unit] in node one, and s2 = 2 [time units] in node 2. We assume the system is in statistical equilibrium. The state of the system is dened as the number of customers in node one. 1. Construct the one-dimensional state transition diagram of the system. 2. Find the state probabilities of the system and the average number of customers in each node. 3. Find from the above state probabilities the intensity by which the customers circulate in the system. 4. Find the mean sojourn times (sojourn time = waiting time + service time) in the two nodes (apply Littles law), and nd the mean cycle time of a customer. 5. Apply the convolution algorithm to nd the state probabilities of the system and calculate the average number of customers in the two nodes from the convolution terms. We add an open chain which loads node one with a0 erlang (0 a0 < 1). We denote the unknown load from the closed chain in node one by a1 . The state of node one is now given by p(i, j), where i is the number of customers from the closed chain and j is the number of customers from the open chain. 6. Write down the two-dimensional state probabilities of node one expressed by p(0, 0): p(i, j), 0 i 4,

0 j < .

7. Show by nding the marginal distribution: p(i, ) =

j=0

p(i, j) ,

and using the identity:

j=0

1 (i + j)! j a = , i! j! (1 a)i+1

that we can eliminate the open chain by reducing the service rate of node one by a factor (1 a0 ).

Good Luck!