×

Time to reach buffer capacity in a BMAP queue. (English) Zbl 1127.68011

Summary: A detailed study is presented on the first time to reach buffer capacity in a queue with batch arrivals and general service time distribution. A flexible analytical model of the input stream, which is the Batch Markovian Arrival Process (BMAP), is assumed. The results include the explicit formula for the Laplace transform of the distribution of the first buffer overflow time and discussion of its computational aspects. In addition, the popular special case of the BMAP queue, which is the batch Poisson arrival queue, is studied. Theoretical results are illustrated via numerical calculations based on IP traffic data.

MSC:

68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
60K25 Queueing theory (aspects of probability theory)
90B22 Queues and service in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Abate J., Computational Probability pp 257– (1999)
[2] DOI: 10.1007/BF01158520 · Zbl 0749.60013
[3] DOI: 10.1023/A:1019994728099 · Zbl 1035.90018
[4] DOI: 10.1080/15326348908807110 · Zbl 0673.60102
[5] DOI: 10.1007/BF01158772 · Zbl 0818.60087
[6] Chiera B.A., What is a unit of capacity worth? Probability in Engineering and Informational Science 16 pp 513– (2002)
[7] Chydzinski , A. Delay analysis in a BMAP queue. Proc. of 13th International Conference on Telecommunications . Funchal : Portugal , May 2006 .
[8] Chydzinski A., Journal of Communication Software and Systems 2 pp 275– (2006)
[9] DOI: 10.1109/90.650143
[10] DOI: 10.1016/0166-5316(93)90035-S · Zbl 0781.60098
[11] DOI: 10.1214/aoap/1177004772 · Zbl 0830.60021
[12] Gnedenko B.V., Introduction to Queueing Theory,, 2. ed. (1989)
[13] DOI: 10.1080/15326349608807395 · Zbl 0863.60094
[14] DOI: 10.1016/S0166-5316(03)00067-1
[15] Korolyuk W. S., Boundary Problems for Compound Poisson Processes (1975)
[16] Kulkarni L., Perform. Eval. pp 117– (1996)
[17] DOI: 10.1109/90.282603 · Zbl 01936506
[18] DOI: 10.1080/15326349108807174 · Zbl 0733.60115
[19] DOI: 10.1080/15326349408807291 · Zbl 0801.60083
[20] DOI: 10.1080/15326349808807482 · Zbl 0928.60083
[21] DOI: 10.2307/3213143 · Zbl 0422.60043
[22] Neuts M.F., Structured Stochastic Matrices of M/G/1 Type and Their Applications (1989)
[23] DOI: 10.1093/imaman/dpi014 · Zbl 1125.90318
[24] DOI: 10.2307/1426503 · Zbl 0424.60093
[25] DOI: 10.1016/j.comnet.2003.10.004 · Zbl 1078.68554
[26] Schwefel H.-P., Teletraffic Engineering in the Internet Era (2001)
[27] Takagi H., Queueing Analysis Finite Systems 2 (1993)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.