Skip to main content
Log in

Linear loss networks

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Arratia, R.: Limiting point processes for rescalings of coalescing and annihilating random walks on Zd. Ann. Probab. 9(6), 909–936 (1981)

    Article  Google Scholar 

  2. Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)

    Google Scholar 

  3. Bramson, M., Griffeath, D.: Clustering and dispersion rates for some interacting particle systems on Z1. Ann. Probab. 8(2), 183–213 (1980)

    Article  Google Scholar 

  4. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    Google Scholar 

  5. Feller, W.: An Introduction to Probability Theory and Its Applications, vol. I. Wiley, New York (1968)

    Google Scholar 

  6. Feller, W.: An Introduction to Probability Theory and Its Applications, 2nd edn., vol. II. Wiley, New York (1971)

    Google Scholar 

  7. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46(2), 388–404 (2000)

    Article  Google Scholar 

  8. Jelenković, P., Momčilović, P., Squillante, M.: Scalability of wireless networks. IEEE/ACM Trans. Netw. 15(2), 295–308 (2007)

    Article  Google Scholar 

  9. Karatzas, I., Shreve, S.: Brownian Motion and Stochastic Calculus, 2nd edn. Springer, New York (1991)

    Book  Google Scholar 

  10. Krapivsky, P., Redner, S., Ben-Naim, E.: A Kinetic View of Statistical Physics. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  11. Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM, Philadelphia (1999)

    Book  Google Scholar 

  12. Liggett, T.: Interacting Particle Systems. Springer, New York (1985)

    Google Scholar 

  13. Liggett, T.: Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Springer, Berlin, (1999)

    Google Scholar 

  14. Martin, J.: Large tandem queueing networks with blocking. Queueing Syst. Theory Appl. 41(1–2), 45–72 (2002)

    Article  Google Scholar 

  15. Saleh, A., Simmons, J.: Evolution toward the next-generation core optical network. J. Lightwave Technol. 24(9), 3303–3321 (2006)

    Article  Google Scholar 

  16. Whitt, W.: Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues. Springer, New York (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petar Momčilović.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Momčilović, P., Squillante, M.S. Linear loss networks. Queueing Syst 68, 111–131 (2011). https://doi.org/10.1007/s11134-011-9230-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-011-9230-5

Keywords

Mathematics Subject Classification (2000)

Navigation