Skip to main content
Springer Nature Link
Log in

A Batch-Service Queueing Model with a Discrete Batch Markovian Arrival Process

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

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6148))

Abstract

Queueing systems with batch service have been investigated extensively during the past decades. However, nearly all the studied models share the common feature that an uncorrelated arrival process is considered, which is unrealistic in several real-life situations. In this paper, we study a discrete-time queueing model, with a server that only initiates service when the amount of customers in system (system content) reaches or exceeds a threshold. Correlation is taken into account by assuming a discrete batch Markovian arrival process (D-BMAP), i.e. the distribution of the number of customer arrivals per slot depends on a background state which is determined by a first-order Markov chain. We deduce the probability generating function of the system content at random slot marks and we examine the influence of correlation in the arrival process on the behavior of the system. We show that correlation merely has a small impact on the threshold that minimizes the mean system content. In addition, we demonstrate that correlation might have a significant influence on the system content and therefore has to be included in the model.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. Andersen, A.T., Nielsen, B.F.: A Markovian approach for modeling packet traffic with long-range dependence. IEEE J. Selected Areas in Comm. 16(5), 719–732 (1998)

    Article  Google Scholar 

  2. Arumuganathan, R., Jeyakumar, S.: Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times. Appl. Math. Model 29, 972–986 (2005)

    Article  MATH  Google Scholar 

  3. Bellalta, B.: A queueing model for the non-continuous frame assembly scheme in finite buffers. In: Al-Begain, K., Fiems, D., Horváth, G. (eds.) ASMTA 2009. LNCS, vol. 5513, pp. 219–233. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Blondia, C.: A discrete-time batch Markovian arrival process as B-ISDN traffic model. Belgian J. Oper. Res., Stat. Comput. Sci. 32, 3–23 (1993)

    Google Scholar 

  5. Bruneel, H.: Queueing behavior of statistical multiplexers with correlated inputs. IEEE Trans. Commun. COM-36(12), 1339–1341 (1988)

    Article  Google Scholar 

  6. Chakravarthy, S.: A finite-capacity GI/PH/1 queue with group services. Nav. Res. Log. 39(3), 345–357 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chang, S.H., Choi, D.W.: Performance analysis of a finite-buffer discrete-time queue with bulk arrival, bulk service and vacations. Comp. Oper. Res. 32, 2213–2234 (2005)

    MATH  Google Scholar 

  8. Chang, S.H., Takine, T.: Factorization and stochastic decomposition properties in bulk queues with generalized vacations. Queueing Syst. 50, 165–183 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chaudhry, M.L., Templeton, J.G.C.: A first course in bulk queues. John Wiley & Sons, Chichester (1983)

    MATH  Google Scholar 

  10. Chen, Y., Qiao, C., Yu, X.: Optical burst switching (OBS): a new area in optical networking research. IEEE Network 18(3), 16–23 (2004)

    Article  Google Scholar 

  11. Claeys, D., Laevens, K., Walraevens, J., Bruneel, H.: Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service. Accepted in Math. Meth. Oper. Res.

    Google Scholar 

  12. Claeys, D., Walraevens, J., Laevens, K., Bruneel, H.: Delay analysis of two batch-service queueing models with batch arrivals: Geo X/Geo c/1. Accepted in 4OR

    Google Scholar 

  13. De Turck, K., De Vuyst, S., Fiems, D., Wittevrongel, S.: Performance analysis of the IEEE 802.16e sleep mode for correlated downlink traffic. Telecomm. Syst. 39, 145–156 (2008)

    Article  Google Scholar 

  14. Gail, H.R., Hantler, S.L., Taylor, B.A.: Spectral analysis of M/G/1/ and G/M/1 type Markov chains. Adv. Appl. Prob. 28(1), 114–165 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Gao, P., Wittevrongel, S., Bruneel, H.: On the behavior of multiserver buffers with geometric service times and bursty input traffic. IEICE Trans. Commun. E87-B(12), 3576–3583 (2004)

    Google Scholar 

  16. Goswami, V., Mohanty, J.R., Samanta, S.K.: Discrete-time bulk-service queues with accessible and non-accessible batches. Appl. Math. Comput. 182, 898–906 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gupta, U.C., Goswami, V.: Performance analysis of finite buffer discrete-time queue with bulk service. Comp. Oper. Res. 29, 1331–1341 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  18. Herrmann, C.: The complete analysis of the discrete time finite DBMAP/G/1/N queue. Perform. Eval. 43, 95–121 (2001)

    Article  MATH  Google Scholar 

  19. Janssen, A.J.E.M., van Leeuwaarden, J.S.H.: Analytic computation schemes for the discrete-time bulk service queue. Queueing Syst. 50, 141–163 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kim, B., Kim, J.: Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue. Comp. Oper. Res. 37(7), 1220–1227 (2010)

    Article  MATH  Google Scholar 

  21. Kim, N.K., Chaudhry, M.L.: Equivalences of batch-service queues and multi-server queues and their complete simple solutions in terms of roots. Stoch. Anal. Appl. 24, 753–766 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  22. Lee, H.W., Moon, J.M., Kim, B.K., Park, J.G., Lee, S.W.: A simple eigenvalue method for low-order D-BMAP/G/1 queues. Appl. Math. Model 29, 277–288 (2005)

    Article  MATH  Google Scholar 

  23. Lu, K., Wu, D., Fang, Y., Qiu, R.C.: Performance analysis of a burst-frame-based MAC Protocol for ultra-wideband ad hoc networks. In: Proc. IEEE Int. Conf. Commun. 2005 (ICC 2005), Seoul, May 16-20, vol. 5, pp. 2937–2941 (2005)

    Google Scholar 

  24. Powell, W.B., Humblet, P.: The bulk service queue with a general control strategy: theoretical analysis and a new computational procedure. Oper. Res. 34(2), 267–275 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  25. Qiao, C.M., Yoo, M.S.: Optical burst switching (OBS) - a new paradigm for an optical Internet. J. High Speed Netw. 8(1), 69–84 (1999)

    Google Scholar 

  26. Samanta, S.K., Chaudhry, M.L., Gupta, U.C.: Discrete-time Geo X|G (a,b)|1|N queues with single and multiple vacations. Math. Comp. Model 45, 93–108 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  27. Samanta, S.K., Gupta, U.C., Sharma, R.K.: Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations. Eur. J. Oper. Res. 182(1), 321–339 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  28. Sikdar, K., Gupta, U.C.: Analytic and numerical aspects of batch service queues with single vacation. Comp. Oper. Res. 32, 943–966 (2005)

    Article  MATH  Google Scholar 

  29. Yi, X.W., Kim, N.K., Yoon, B.K., Chae, K.C.: Analysis of the queue-length distribution for the discrete-time batch-service Geo X|G a,Y|1|K queue. Eur. J. Oper. Res. 181, 787–792 (2007)

    Article  MATH  Google Scholar 

  30. Zhang, Z.: Analysis of a discrete-time queue with integrated bursty inputs in ATM networks. Int. J. Digit. Analog Commun. Syst. 4, 191–203 (1991)

    Article  Google Scholar 

  31. Zhao, Y.Q., Campbell, L.L.: Equilibrium probability calculations for a discrete-time bulk queue model. Queueing Syst. 22, 189–198 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stochastic Modelling and Analysis of Communication Systems (SMACS) Research Group, Department of Telecommunications and Information Processing (TELIN), Ghent University, Sint-Pietersnieuwstraat 41, B-9000, Gent, Belgium

    Dieter Claeys, Joris Walraevens, Koenraad Laevens, Bart Steyaert & Herwig Bruneel

Authors
  1. Dieter Claeys
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joris Walraevens
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Koenraad Laevens
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bart Steyaert
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Herwig Bruneel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Advanced Technology, University of Glamorgan, CF37 1DL, Pontypridd, UK

    Khalid Al-Begain

  2. Department TELIN, Ghent University, Sint-Pietersnieuwstraat 41, 9000, Gent, Belgium

    Dieter Fiems

  3. Department of Computing,, Imperial College London, South Kensington Campus, SW7 2AZ, London, United Kingdom

    William J. Knottenbelt

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Claeys, D., Walraevens, J., Laevens, K., Steyaert, B., Bruneel, H. (2010). A Batch-Service Queueing Model with a Discrete Batch Markovian Arrival Process. In: Al-Begain, K., Fiems, D., Knottenbelt, W.J. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2010. Lecture Notes in Computer Science, vol 6148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13568-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13568-2_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13567-5

  • Online ISBN: 978-3-642-13568-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics