Skip to main content
SpringerLink
Log in

Numerical analysis of a discrete-time finite capacity queue with a burst arrival

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We study a discrete-time, multi-server, finite capacity queue with a burst arrival. Once the first job of a burst arrives at the queue, the successive jobs will arrive every time slot until the last job of the burst arrives. The number of jobs and the inter-arrival time of bursts are assumed to be generally distributed, and the service time is assumed to be equal to one slot. We propose an efficient numerical method to exactly obtain the job loss probability, the waiting time distribution and the mean queue length using an embedded Markov chain at the arrival instants of bursts.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Brandt, M. Brandt and H. Sulanke, A single server model for packetwise transmission of messages, Queueing Syst. 6(1990)287–310.

    Google Scholar 

  2. M. de Prycker,Asynchronous Transfer Mode (Ellis Horwood, 1990).

  3. O. Hashida, Y. Takahashi and S. Shimogawa, Switched batch Bernoulli process (SBBP) and the discrete-timeSBBP/G/1 queue with application to statistical multiplexer performance, IEEE J. Sel. Areas Commun. SAC-9(1991)394–401.

    Google Scholar 

  4. I. Kino and M. Miyazawa, The stationary work in system of aG/G/1 gradual input queue, J. Appl. Prob. 30(1993)207–222.

    Google Scholar 

  5. M. Miyazawa and G. Yamazaki, Loss probability of a burst arrival finite queue with synchronized service, Prob. Eng. Inf. Sci. 6(1992)201–216.

    Google Scholar 

  6. R. Morris, An algorithmic technique for a class of queueing models with packet switching applications, in:Proc. IEEE ICC'81 (1981) pp. 41.2.1–41.2.8.

  7. M.F. Neuts, On Viterbi's formula for the mean delay in a queue of data packets, Commun. Statist.-Stochastic Models 6(1990)87–98.

    Google Scholar 

  8. G. Pujolle and H.G. Perros, Queueing systems for modelling ATM networks, in:Proc. Int. Conf. on the Performance of Distributed Systems and Integrated Commun. Networks (1991).

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, Sophia University, 7-1, Kioi-cho, Chiyoda-ku, 102, Tokyo, Japan

    Hideaki Yamashita

Authors
  1. Hideaki Yamashita
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamashita, H. Numerical analysis of a discrete-time finite capacity queue with a burst arrival. Ann Oper Res 49, 101–110 (1994). https://doi.org/10.1007/BF02031593

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02031593

Keywords

Search

Navigation