Skip to main content

The Impact of Class Clustering on a System with a Global FCFS Service Discipline

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

Abstract

This paper considers a continuous-time queueing model with two types (classes) of customers each having their own dedicated server with exponential service times. The system adopts a “global FCFS” service discipline, i.e., all arriving customers are accommodated in one single FCFS queue, regardless of their types. “Class clustering”, i.e., the fact that customers of any given type may (or may not) have a tendency to “arrive back-to-back”, is a concept that we believe is often neglected in literature. As it is clear that customers of different types hinder each other more as they tend to arrive in the system more clustered according to class, the major aim of this paper is to estimate the impact of the degree of class clustering on the system performance. In this paper both classes of customers have an own “cluster parameter”. The motivation of our work are systems where this kind of blocking is encountered, such as input-queueing network switches, security checkpoints or road splits.

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. Ngoduy, D.: Derivation of continuum traffic model for weaving sections on freeways. Transportmetrica 2, 199–222 (2006)

    Article  Google Scholar 

  2. Nishi, R., Miki, H., Tomoeda, A., Nishinari, K.: Achievement of alternative configurations of vehicles on multiple lanes. Physical Review E 79, 066119 (2009)

    Google Scholar 

  3. Van Woensel, T., Vandaele, N.: Empirical validation of a queueing approach to uninterrupted traffic flows. 4OR, A Quarterly Journal of Operations Research 4, 59–72 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Van Woensel, T., Vandaele, N.: Modeling traffic flows with queueing models: A review. Asia-Pacific Journal of Operational Research 24, 435–461 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  5. Karol, M., Hluchyj, M., Morgan, S.: Input versus output queueing on a space-division packet switch. IEEE Transactions on Communications 35, 1347–1356 (1987)

    Article  Google Scholar 

  6. Liew, S.: Performance of various input-buffered and output-buffered ATM switch design principles under bursty traffic: simulation study. IEEE Transactions on Communications 42, 1371–1379 (1994)

    Article  Google Scholar 

  7. Laevens, K.: A processor-sharing model for input-buffered ATM-switches in a correlated traffic environment. Microprocessors and Microsystems 22, 589–596 (1999)

    Article  Google Scholar 

  8. Stolyar, A.: MaxWeight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Annals of Applied Probability 14, 1–53 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Beekhuizen, P., Resing, J.: Performance analysis of small non-uniform packet switches. Performance Evaluation 66, 640–659 (2009)

    Article  Google Scholar 

  10. He, Q.: Analysis of a continuous time sm[k]/ph[k]/1/fcfs queue: Age process, sojourn times, and queue lengths. Journal of Systems Science and Complexity 25(1), 133–155 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  11. Houdt, B.V.: Analysis of the adaptive mmap[k]/ph[k]/1 queue: A multi-type queue with adaptive arrivals and general impatience. European Journal of Operational Research 220(3), 695–704 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  12. Houdt, B.V.: A matrix geometric representation for the queue length distribution of multitype semi-markovian queues. Performance Evaluation 69(7-8), 299–314 (2012)

    Article  Google Scholar 

  13. Mélange, W., Bruneel, H., Steyaert, B., Walraevens, J.: A two-class continuous-time queueing model with dedicated servers and global fcfs service discipline. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds.) ASMTA 2011. LNCS, vol. 6751, pp. 14–27. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Mélange, W., Bruneel, H., Steyaert, B., Claeys, D., Walraevens, J.: A continuous-time queueing model with class clustering and global fcfs service discipline. Journal of Industrial and Management Optimization 10, 193–206 (2014)

    MATH  MathSciNet  Google Scholar 

  15. Neuts, M.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The John Hopkins University Press (1981)

    Google Scholar 

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

    Google Scholar 

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

    Book  Google Scholar 

  18. Kleinrock, L.: Queueing Systems, Theory, vol. 1. Wiley-Interscience (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Mélange, W., Walraevens, J., Claeys, D., Steyaert, B., Bruneel, H. (2014). The Impact of Class Clustering on a System with a Global FCFS Service Discipline. In: Sericola, B., Telek, M., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2014. Lecture Notes in Computer Science, vol 8499. Springer, Cham. https://doi.org/10.1007/978-3-319-08219-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08219-6_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08218-9

  • Online ISBN: 978-3-319-08219-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics