Skip to main content
SpringerLink
Log in

Stability of Two-Stage Queues with Blocking

  • Conference paper
Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 14))

Abstract

Queueing networks are known to provide a useful modeling and evaluation tool in computer and telecommunications. Unfortunately, realistic features like finite capacities, retrials, priority, ... usually complicate or prohibit analytic solutions. Numerical and approximate computations as well as simplifications and performance bounds for queueing networks therefore become of practical interest. However, it is indispensable to delimit the stability domain wherever these approximations are justified.

In this paper we applied for the first time the strong stability method to analyze the stability of the tandem queues \(\left[M/G/1 \rightarrow ./M/1/1\right]\). This enables us to determine the conditions for which the characteristics of the network with retrials \(\left[M/G/1/1 \rightarrow ./M/1/1\right]\), can be approximated by the characteristics of the ordinary network \(\left[M/G/1 \rightarrow ./M/1/1\right] \) (without retrials).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Aïssani, D., Kartashov, N.V.: Ergodicity and stability of Markov chains with respect to the topology in the space of transition kernels. Doklady Akademii Nauk Ukrainskoi SSR seriya A 11, 3–5 (1983)

    MATH  Google Scholar 

  2. Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: A unified approch via limite fluid limit models. Annals of Applied Probability 5(1), 49–77 (1993)

    Article  Google Scholar 

  3. Dallery, Y., Gershwin, B.: Manufacturing flow line systems: a review of models and analytical results. Queueing systems 12, 3–94 (1992)

    Article  MATH  Google Scholar 

  4. Faramand, F.: Single line queue with repeated demands. Queueing Systems 6, 223–228 (1990)

    Article  MathSciNet  Google Scholar 

  5. Fayolle, G., Malyshev, V.A., Menshikov, M.V., Sidorenko, A.F.: Lyaponov functions for Jackson networks. Rapport de recherche 1380, INRIA, Domaine de Voluceau, LeChenay (1991)

    Google Scholar 

  6. Ferng, H.W., Chang, J.F.: Connection-wise end-to-end performance analysis of queueing networks with MMPP inputs. Performance Evaluation 43, 362–397 (2001)

    MATH  Google Scholar 

  7. Foster, F.G., Perros, H.G.: On the blocking process in queue networks. Eur. J. Oper. Res. 5, 276–283 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gnedenko, B.W., Konig, D.: Handbuch der Bedienungstheorie. Akademie Verlag, Berlin (1983)

    Google Scholar 

  9. Kartashov, N.V.: Strong stable Markov chains. VSP. Utrecht. TBIMC. Scientific Publishers (1996)

    Google Scholar 

  10. Karvatsos, D., Xenios, N.: MEM for arbitrary queueing networks with multiple general servers and repetative service blocking. Performance Evaluation 10, 169–195 (1989)

    Article  MathSciNet  Google Scholar 

  11. Kerbache, L., Gregor, S.J.M.: The generalized expansion method for open finite queueing networks. Eur. J. Oper. Res. 32, 448–461 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  12. Li, Y., Cai, X., Tu, F., Shao, X., Che, M.: Optimisation of tandem queue systems with finite buffers. Computers and Operations Research 31, 963–984 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Moutzoukis, E., Langaris, C.: Two queues in tandem with retrial customers. Probability in the Engineering and Informational Sciences 15, 311–325 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pellaumail, J., Boyer, P.: Deux files d’attente á capacité limitée en tandem. Tech. Rept. 147: CNRS/INRIA. Rennes (1981)

    Google Scholar 

  15. Hillier, F., So, K.: On the optimal design of tandem queueing systems with finite buffers. Queueing systems theory application 21, 245–266 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. Huntz, G.C.: Sequential arrays of waiting lines. Operations Research 4, 674–683 (1956)

    Article  Google Scholar 

  17. Avi-Itzhak, B., Yadin, M.: A sequence of two servers with no intermediate queue. Management Science 11, 553–564 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  18. Suzuki, T.: On a tandem queue with blocking. Journal of the Operations Research Society of Japon 6, 137–157 (1964)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Modelization and Optimization of Systems, Bejaia university, Algeria, 06000, Algeria

    Ouiza Lekadir & Djamil Aissani

Authors
  1. Ouiza Lekadir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Djamil Aissani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory of Theoretical and Applied Computer Science, UFR MIM,, Paul Verlaine University of Metz, Metz, France

    Hoai An Le Thi

  2. Faculty of Sciences, Technology and Communications, University of Luxembourg, Luxembourg

    Pascal Bouvry

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Rouen Mont, Saint Aignan, France

    Tao Pham Dinh

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lekadir, O., Aissani, D. (2008). Stability of Two-Stage Queues with Blocking. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_55

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation