Data networks (2nd ed.)
Introduction to Algorithms
Large Tandem Queueing Networks with Blocking
Queueing Systems: Theory and Applications
Scalability of wireless networks
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.01 |
This paper investigates theoretical properties of throughput and cost in linear loss networks. The maximum throughput of the network with exponential service times is derived and the arrival process that maximizes throughput, given a fixed arrival 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.