DOI 10.1007/s11134-011-9230-5 Linear loss networks

Abstract This paper investigates theoretical properties of throughput and cost in lin-ear loss networks. The maximum throughput of the network with exponential service times is derived and the arrival process that maximizes throughput, given a fixed ar-rival rate, is established. For general service times, an asymptotically critical loading regime is identified such that the probability of an arbitrary customer being lost is strictly within (0,1) as the network size increases. This regime delivers throughput comparable to the maximum at a relatively low network cost. The paper establishes the asymptotic throughput and network cost under this critical loading