DELAYED EXPONENTIAL CALLS SERVED IN RANDOM ORDER 379 



0.1 

 8 



^ 8 



^ 6 



4 



O.OOOI 



Fig. 17 

 c = 50. 



1.25 0.50 0.75 1.00 1.25 1.50 1.75 2.00 2.25 2.50 2.75 3.00 3.25 

 t/h = DELAY IN MULTIPLES OF AVERAGE HOLDING TIME 



Delayed traffic served in random order, exponential holding times, 



of delay distributions, random handling producing more quite short 

 and very long delays than does queueing. When a criterion of service is 

 set at a relatively short delay, one may often expect it to be met more 

 easily by not providing storing or gating circuits. On the other hand a 

 criterion of service based on relatively long delays can nearly always be 

 more readily met by the use of devices insuring partial or total queueing. 

 In the example above the per cent of calls delayed longer than 3 minutes 

 would be cut by a third through the use of queueing devices. 



Example No. 5 



Automobiles are parked in a large area adjacent to a State Fair 

 grounds. There is one main exit through which two cars can pass at the 

 same time. Upon leaving, drivers pay according to their parking time; 

 and it requires, on the average, 20 seconds to complete the payment. If 

 cars wish to leave during the afternoon busy period at a rate of 5.4 per 



