Skip to main content

A Tandem Queueing Network with Feedback Admission Control

  • Conference paper
Network Control and Optimization (NET-COOP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4465))

Included in the following conference series:

Abstract

Admission control in queueing networks is often based on partial information on the network state. This paper studies how the lack of state information affects performance by considering a simple model for admission control. The model is analyzed by studying a related censored process that has a matrix-geometric steady-state distribution. Numerical results show how partial information may cause some performance characteristics in queueing networks to be nonmonotone with respect to service rates.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adan, I.J.B.F., Weiss, G.: Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. Queueing Systems 54, 169–183 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. I. Wiley, Chichester (1966)

    MATH  Google Scholar 

  3. van Foreest, N.D., Mandjes, M., van Ommeren, J.C.W., Scheinhardt, W.R.W.: A tandem queue with server slow-down and blocking. Stochastic Models 21, 695–724 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Grassmann, W.K., Drekic, S.: An analytical solution for a tandem queue with blocking. Queueing Systems 36, 221–235 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Konheim, A.G., Reiser, M.: A queueing model with finite waiting room and blocking. Journal of the ACM 23, 328–341 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kroese, D.P., Scheinhardt, W.R.W., Taylor, P.G.: Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process. Ann. Appl. Probab. 14, 2057–2089 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Latouche, G., Neuts, M.F.: Efficient algorithmic solutions to exponential tandem queues with blocking. SIAM J. Algebra. Discr. 1, 93–106 (1980)

    MATH  MathSciNet  Google Scholar 

  8. Leskelä, L.: Stabilization of an overloaded queueing network using measurement-based admission control. J. Appl. Probab. 43, 231–244 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models. John Hopkins University Press (1981)

    Google Scholar 

  10. Rogers, L.C.G., Williams, D.: Diffusions, Markov Processes, and Martingales, 2nd edn., vol. I. Wiley, Chichester (1994)

    MATH  Google Scholar 

  11. Takács, L.: Combinatorial Methods in the Theory of Stochastic Processes. Wiley, Chichester (1967)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tijani Chahed Bruno Tuffin

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leskelä, L., Resing, J. (2007). A Tandem Queueing Network with Feedback Admission Control. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72709-5_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72708-8

  • Online ISBN: 978-3-540-72709-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics