Queue Length in a Queuing System with Dependent Service Times
Tóm tắt
A single-server queuing system with infinite capacity and a recurrent input flow is considered. Service times of the customer units have an exponential distribution with random parameter. The current value of the parameter is chosen from a finite set with given probabilities at the time the service of a certain customer is completed. Sequential values of the parameters form a special kind of Markov chain. The nonstationary behavior of the queue length is studied.
Tài liệu tham khảo
B. Legros, “M|G|1 queue with event-dependent arrival rates,” Queueing Syst. 89, 269–301 (2018).
B. Legros and A. D. Sezer, “Stationary analysis of a single queue with remaining service time-dependent arrivals,” Queueing Syst. 88, 139–165 (2018).
G. Pang and Y. Zhou, “Two-parameter process limits for infinite-server queues with dependent service times via chaining bounds,” Queueing Syst. 88, 1–25 (2018).
Abhishek, M. A. A. Boon, O. J. Boxma, et al., “A single-server queue with batch arrivals and semi-Markov services,” Queueing Syst. 86, 217–240 (2017).
P. Buchholz and J. Kriege, “Fitting correlated arrival and service times and related queueing performance,” Queueing Syst. 85, 337–359 (2017).
V. G. Ushakov and N. G. Ushakov, “Single server queueing system with dependent interarrival times,” Inform. Primen.11 (2), 112–116 (2017).
N. D. Leont’ev and V. G. Ushakov, “Analysis of a queueing system with autoregressive arrivals and nonpreemptive priority,” Inform. Primen. 10 (3), 15–22 (2016).
N. D. Leont’ev and V. G. Ushakov, “Analysis of a queueing system with autoregressive arrivals,” Inform. Primen. 8 (3), 39–44 (2014).
F. Kamoun, “Performance analysis of a discrete-time queuing system with a correlated train arrival process,” Perform. Eval. 63, 315–340 (2006).
F. Kamoun, “The discrete-time queue with autoregressive inputs revisited,” Queueing Syst. 54, 185–192 (2006).
G. U. Hwang and K. Sohraby, “On the exact analysis of a discrete-time queueing system with autoregressive inputs,” Queueing Syst. 43, 29–41 (2003).
G. U. Hwang, B. D. Choi, and J.-K. Kim, “The waiting time analysis of a discrete-time queue with arrivals as an autoregressive process of order 1,” J. Appl. Probab. 39, 619–629 (2002).
R. Szekli, R. L. Disney, and S. Hur, “A MR|GI|1 queues with pozitively correlated arrival stream,” J. Appl. Probab. 31, 497–514 (1994).
P. Tin, “A queueing system with Markov-dependent arrivals,” J. Appl. Probab. 22, 668–677 (1985).
A. Klemm, C. Lindemann, and M. Lohmann, “Modeling IP traffic using the batch Markovian arrival process,” Perform. Eval. 54, 149–173 (2003).
J. Davis, K. Chandra, and C. Thompson, “Nonlinear time-series model for VBR video traffic,” in Proceedings of the IEEE Conference on Local Computer Networks, Tampa, USA, 2000, pp. 678–683.
A. Elwalid, D. Heyman, T. V. Lakshman, et al., “Fundamental bounds and approximations for ATM multiplexers with applications to video teleconferencing,” IEEE J. Sel. Areas Commun. 13, 1004–1016 (1995).
Z. Drezner and N. Farnum, “A correlated Poisson distribution for correlated events,” Commun. Stat. Theory Methods 23, 841–857 (1994).
D. P. Gaver and P. A. W. Lewis, “First-order autoregressive gamma sequences and point processes,” Adv. Appl. Probab. 12, 727–745 (1980).
P. C. Consul and G. C. Jain, “A generalization of Poisson distribution,” Technometrics 15, 791–799 (1973).