Raymond Wu, Jie Lu
ITA Conference 2007
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. © 2011 Springer Science+Business Media, LLC.
Raymond Wu, Jie Lu
ITA Conference 2007
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Bowen Zhou, Bing Xiang, et al.
SSST 2008