Skip to main content

Analysis of a Two-Class FCFS Queueing System with Interclass Correlation

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2012)

Abstract

This paper considers a discrete-time queueing system with one server and two classes of customers. All arriving customers are accommodated in one queue, and are served in a First-Come-First-Served order, regardless of their classes. The total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. The classes of consecutively arriving customers, however, are correlated in a Markovian way, i.e., the probability that a customer belongs to a class depends on the class of the previously arrived customer. Service-time distributions are assumed to be general but class-dependent. We use probability generating functions to study the system analytically. The major aim of the paper is to estimate the impact of the interclass correlation in the arrival stream on the queueing performance of the system, in terms of the (average) number of customers in the system and the (average) customer delay and customer waiting time.

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. Borst, S.C., Boxma, O.J., Morrison, J.A., Queija, R.N.: The equivalence between processor sharing and service in random order. Operations Research Letters 31(4), 254–262 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bruneel, H., Kim, B.G.: Discrete-time models for communication systems including ATM. Kluwer Academic, Boston (1993)

    Book  Google Scholar 

  3. Carter, G.M., Cooper, R.B.: Queues with service in random order. Operations Research 20(2), 389–405 (1970)

    Article  Google Scholar 

  4. Chen, J., Guérin, R.: Performance study of an input queueing packet switch with two priority classes. IEEE Transactions on Communications 39(1), 117–126 (1991)

    Article  Google Scholar 

  5. De Clercq, S., Laevens, K., Steyaert, B., Bruneel, H.: A multi-class discrete-time queueing system under the FCFS service discipline. Annals of Operations Research (accepted for publication)

    Google Scholar 

  6. Fiems, D., Bruneel, H.: A note on the discretization of Little’s result. Operations Research Letters 30, 17–18 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gonzáles, M.O.: Classical complex analysis. Marcel Dekker, New York (1992)

    Google Scholar 

  8. Jaiswal, N.: Priority queues. Academic Press, New York (1968)

    MATH  Google Scholar 

  9. Jin, X., Min, G.: Analytical modelling and evaluation of generalized processor sharing systems with heterogeneous traffic. International Journal of Communication Systems 21(6), 571–586 (2008)

    Article  MathSciNet  Google Scholar 

  10. Kim, J., Kim, J., Kim, B.: Analysis of the M/G/1 queue with discriminatory random order service policy. Performance Evaluation 68(3), 256–270 (2011)

    Article  Google Scholar 

  11. Laevens, K., Bruneel, H.: Discrete-time multiserver queues with priorities. Performance Evaluation 33(4), 249–275 (1998)

    Article  Google Scholar 

  12. Lieshout, P., Mandjes, M.: Generalized processor sharing: Characterization of the admissible region and selection of optimal weights. Computers & Operations Research 35(8), 2497–2519 (2008)

    Article  MATH  Google Scholar 

  13. Maertens, T., Walraevens, J., Bruneel, H.: Performance comparison of several priority schemes with priority jumps. Annals of Operations Research 180(3), 1168–1185 (2008)

    MathSciNet  Google Scholar 

  14. Shortle, J.F., Fischer, M.J.: Approximation for a two-class weighted fair queueing discipline. Performance Evaluation 67(10), 946–958 (2010)

    Article  Google Scholar 

  15. Walraevens, J., Fiems, D., Wittevrongel, S., Bruneel, H.: Calculation of output characteristics of a priority queue through a busy period analysis. European Journal of Operational Research 198(3), 891–898 (2009)

    Article  MATH  Google Scholar 

  16. Walraevens, J., van Leeuwaarden, J.S.H., Boxma, O.J.: Power series approximations for two-class generalized processor sharing systems. Queueing systems 66(2), 107–130 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Wang, L., Min, G., Kouvatsos, D.D., Jin, X.: Analytical modeling of an integrated priority and WFQ scheduling scheme in multi-service networks. Computer Communications 33, S93–S101 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruneel, H., Maertens, T., Steyaert, B., Claeys, D., Fiems, D., Walraevens, J. (2012). Analysis of a Two-Class FCFS Queueing System with Interclass Correlation. In: Al-Begain, K., Fiems, D., Vincent, JM. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2012. Lecture Notes in Computer Science, vol 7314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30782-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30782-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30781-2

  • Online ISBN: 978-3-642-30782-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics