Queueing analysis of discrete-time buffer systems with compound arrival process and variable service capacity

  • Bart Vinck
  • Herwig Bruneel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 977)


The subject of this paper is the analysis of a fairly general discrete-time queueing model by means of an analytical technique involving complex contour integration. The specific model we consider consists of a buffer system with infinite waiting room to which customers (messages) arrive according to a compound arrival process, characterized by general independent interarrivai times (intervals between consecutive arrival instants) and general independent bulk-sizes (numbers of arriving messages at arrival instants). The service times of the messages are assumed to be deterministically equal to one discrete time-unit (or “slot”), but the “service capacity” of the system, i.e., the number of messages that can be served simultaneously during each slot is assumed to have an arbitrary probability distribution. Various well-known discrete-time queueing models can be observed to be merely special cases of this general framework, but the model also includes many queueing sytems which have, so far, never been thoroughly analyzed.


Interarrival Time Service Capacity System Content Arrival Instant Multiserver Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J.J. Hunter. Mathematical Techniques of Applied Probability, Volume 2, Discrete Time Models: Techniques and Applications. Academic Press, New York, 1983.Google Scholar
  2. 2.
    H. Bruneel and B.G. Kim. Discrete-Time Models for Communication Systems Including ATM. Kluwer Academic Publishers, Boston, 1993.Google Scholar
  3. 3.
    M.E. Woodward. Communication and Computer Networks: Modelling with Discrete-Time Queues. Pentech Press, London, 1993.Google Scholar
  4. 4.
    H. Takagi. Queueing Analysis, A Foundation of Performance Evaluation, Volume 3: Discrete-Time Systems. North-Holland, Amsterdam, 1993.Google Scholar
  5. 5.
    W.W. Chu. Buffer behavior for Poisson arrivals and multiple synchronous constant outputs. IEEE Transactions on Computation, 19:530–534, 1970.Google Scholar
  6. 6.
    N.D. Georganas. Buffer behavior with Poisson arrivals and bulk geometric service. IEEE Transactions on Communication Technology, 24:938–940, 1976.CrossRefGoogle Scholar
  7. 7.
    B. Vinck and H. Bruneel. Analysing the discrete-time GG/Geo/1 queue using complex contour integration. Queueing Systems, 18:47–67, 1994.CrossRefGoogle Scholar
  8. 8.
    M.L. Chaudhry. Alternative numerical solutions of stationary queueing-time distributions in discrete-time queues: GI/G/1. Journal of the Operational Research Society, 44(10):1035–1051, 1993.Google Scholar
  9. 9.
    K. Geihs and H. Kobayashi. Bounds on buffer overflow probabilities in communication systems. Performance Evaluation, 2(3):149–160, 10 1982.CrossRefGoogle Scholar
  10. 10.
    Internal Report: The G G /D/G queue. SMACS Research Group, 1995.Google Scholar
  11. 11.
    H. Bruneel. Buffers with stochastic output interruptions. Electronics Letters, 19:735–737, 1983.Google Scholar
  12. 12.
    H. Bruneel. A general model for the behaviour of infinite buffers with periodic service opportunities. European Journal of Operational Research, 16:98–106, 1984.CrossRefGoogle Scholar
  13. 13.
    K. Laevens and H. Bruneel. Delay analysis for discrete-time queueing systems with randomly interupted servers. European Journal of Operational Research, 1994.Google Scholar
  14. 14.
    H. Bruneel, B. Steyaert, E. Desmet, and G.H. Petit. An analytical technique for the derivation of the delay performance of ATM switches with multiserver output queues. International Journal of Digital and Analog Communication Systems, 5:193–201, 1992.Google Scholar
  15. 15.
    E. Desmet, B. Steyaert, H. Bruneel, and G.H. Petit. Tail distributions of queue length and delay in discrete-time multiserver queueing models, applicable in ATM networks. volume Queueing, Performance and Control in ATM, pages 1–6, Copenhagen, 19–26 June 1991. International Teletraffic Conference (ITC) 13.Google Scholar
  16. 16.
    H. Bruneel, B. Steyaert, E. Desmet, and G.H. Petit. Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues. European Journal of Operational Research, 76:563–572, 1994.CrossRefGoogle Scholar
  17. 17.
    M.O. González. Classical Complex Analysis. Marcel Dekker Inc., New York, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Bart Vinck
    • 1
  • Herwig Bruneel
    • 1
  1. 1.Stochastic Modeling and Analysis of Communication Systems Research Group Laboratory for Communications EngineeringUniversity of GhentGentBelgium

Personalised recommendations