Abstract
We consider a finite‐capacity single‐server vacation model with close‐down/setup times and Markovian arrival processes (MAP). The queueing model has potential applications in classical IP over ATM or IP switching systems, where the close‐down time corresponds to an inactive timer and the setup time to the time delay to set up a switched virtual connection (SVC) by the signaling protocol. The vacation time may be considered as the time period required to release an SVC or as the time during which the server goes to set up other SVCs. By using the supplementary variable technique, we obtain the queue length distribution at an arbitrary instant, the loss probability, the setup rate, as well as the Laplace–Stieltjes transforms of both the virtual and actual waiting time distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Blondia, Finite capacity vacation models with non-renewal input, J. Appl. Probab. 28(1991) 174–197.
B. Doshi, Queueing systems with vacations-A survey, Queueing Systems 1(1986) 29–66.
B. Doshi, Single server queues with vacations, in: Stochastic Analysis of Computer Communication Systems, ed. H. Takagi (Elsevier, Amsterdam, 1990) 217–265.
M. Hassan and M. Atiquzzaman, A delayed vacation model of an M/G/1 queue with applications to SVCC-based ATM networks, IEICE Trans. Commun. E80-B (1997) 317–323.
H. Heffes and D.M. Lucantoni, A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance, IEEE J. Selected Areas Commun. 4(6) (1986) 856–868.
S. Kasahara, T. Takine, T. Suda and T. Hasegawa, MAP/G/1 queues under N-policy with and without vacations, J. Oper. Res. Soc. Japan 39(1996) 188–212.
H. Kitazume and Y. Takahashi, A queueing model of SVC mechanism for IP over ATM networks, in: Symposium on Performance Models for Information Communication Networks, Kamakura, Japan (1997) pp. 28–33 (in Japanese).
D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7(1991) 1–46.
D.M. Lucantoni, K. Meier-Hellstern and M.F. Neuts, A single server queue with server vacations and a class of nonrenewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676–705.
M. Miyazawa, The intensity conservation law for queues with randomly changed service rate, J. Appl. Probab. 22 (1985) 408–418.
M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).
Z. Niu, Y. Takahashi and N. Endo, Queueing model of SVC-based IP over ATM networks, IEICE Technical Reports, SSE97 (1997).
Z. Niu, Y. Takahashi and N. Endo, Performance evaluation of SVC-based IP-over-ATM networks, IEICE Trans. Commun. E81-B(5) (1998) 948–957.
V. Paxson and S. Floyd, Wide area traffic: The failure of Poisson modeling, in: SIGCOMM '94 (1994).
Y. Sakai, Y. Takahashi, Y. Takahashi and T. Hasegawa, A composite queue with vacation/setup/closedown times for IP over ATM networks, J. Oper. Res. Soc. Japan 41 (1998) 68–80.
H. Takagi, Queueing Analysis, A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems (Elsevier, Amsterdam, 1991).
T. Takine, Y. Matsumoto, T. Suda and T. Hasegawa, Mean waiting times in nonpreemptive priority queues with Markovian arrival and i.i.d. service processes, Performance Evaluation 20 (1994) 131–149.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Niu, Z., Takahashi, Y. A finite‐capacity queue with exhaustive vacation/close‐down/setup times and Markovian arrival processes. Queueing Systems 31, 1–23 (1999). https://doi.org/10.1023/A:1019189610144
Issue Date:
DOI: https://doi.org/10.1023/A:1019189610144