A queue with semi-Markovian batch plus Poisson arrivals with application to the MPEG frame sequence

被引:0
|
作者
Wu, DA
Takagi, H
机构
[1] Univ Tsukuba, Tsukuba, Ibaraki 3058577, Japan
[2] Univ Tsukuba, Doctoral Program Policy & Planning Sci, Tsukuba, Ibaraki 3058573, Japan
关键词
semi-Markov process; batch arrival; queue; waiting time; MPEG; group of pictures (GOP);
D O I
10.1023/B:QUES.0000018025.34402.f5
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We consider a queueing system with a single server having a mixture of a semi-Markov process (SMP) and a Poisson process as the arrival process, where each SMP arrival contains a batch of customers. The service times are exponentially distributed. We derive the distributions of the queue length of both SMP and Poisson customers when the sojourn time distributions of the SMP have rational Laplace-Stieltjes transforms. We prove that the number of unknown constants contained in the generating function for the queue length distribution equals the number of zeros of the denominator of this generating function in the case where the sojourn times of the SMP follow exponential distributions. The linear independence of the equations generated by those zeros is discussed for the same case with additional assumption. The necessary and sufficient condition for the stability of the system is also analyzed. The distributions of the waiting times of both SMP and Poisson customers are derived. The results are applied to the case in which the SMP arrivals correspond to the exact sequence of Motion Picture Experts Group ( MPEG) frames. Poisson arrivals are regarded as interfering traffic. In the numerical examples, the mean and variance of the waiting time of the ATM cells generated from the MPEG frames of real video data are evaluated.
引用
收藏
页码:285 / 332
页数:48
相关论文
共 43 条
  • [21] Numerical Bounds for Semi-Markovian Quantities and Application to Reliability
    Sophie Mercier
    [J]. Methodology and Computing in Applied Probability, 2008, 10 : 179 - 198
  • [22] AN ANALYTICAL SOLUTION FOR THE DISCRETE-TIME SINGLE-SERVER SYSTEM WITH SEMI-MARKOVIAN ARRIVALS
    RIEGER, ES
    HASSLINGER, G
    [J]. QUEUEING SYSTEMS, 1994, 18 (1-2) : 69 - 105
  • [23] A single-server queue with batch arrivals and semi-Markov services
    Abhishek
    Boon, Marko A. A.
    Boxma, Onno J.
    Nunez-Queija, Rudesindo
    [J]. QUEUEING SYSTEMS, 2017, 86 (3-4) : 217 - 240
  • [24] A single-server queue with batch arrivals and semi-Markov services
    Marko A. A. Abhishek
    Onno J. Boon
    Rudesindo Boxma
    [J]. Queueing Systems, 2017, 86 : 217 - 240
  • [25] Ergodicity bounds for the Markovian queue with time-varying transition intensities, batch arrivals and one queue skipping policy
    Zeifman, A., I
    Razumchik, R., V
    Satin, Y. A.
    Kovalev, I. A.
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2021, 395
  • [26] AN EXTENSION OF LINDLEYS THEOREM TO SINGLE SERVER QUEUE WITH SEMI-MARKOVIAN INPUT AND SERVICE TIME PROCESSES
    NEUTS, MF
    TATA, MN
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1965, 36 (01): : 359 - &
  • [27] SOME EXPLICIT FORMULAS FOR STEADY-STATE BEHAVIOR OF QUEUE WITH SEMI-MARKOVIAN SERVICE TIMES
    NEUTS, MF
    [J]. ADVANCES IN APPLIED PROBABILITY, 1977, 9 (01) : 141 - 157
  • [28] Fuzzy SMC for Quantized Nonlinear Stochastic Switching Systems With Semi-Markovian Process and Application
    Qi, Wenhai
    Yang, Xu
    Park, Ju H.
    Cao, Jinde
    Cheng, Jun
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (09) : 9316 - 9325
  • [29] Numerical analysis for stochastic age-dependent population equations with Poisson jump and phase semi-Markovian switching
    Rathinasamy, A.
    Yin, Baojian
    Yasodha, B.
    [J]. COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2011, 16 (01) : 350 - 362
  • [30] A central limit theorem for a Markov-modulated infinite-server queue with batch Poisson arrivals and binomial catastrophes
    Yajima, Moeko
    Tuan Phung-Duc
    [J]. PERFORMANCE EVALUATION, 2019, 129 : 2 - 14