A finite-capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes

Citation
Zs. Niu et Y. Takahashi, A finite-capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes, QUEUEING S, 31(1-2), 1999, pp. 1-23
Citations number
17
Categorie Soggetti
Engineering Mathematics
Journal title
QUEUEING SYSTEMS
ISSN journal
02570130 → ACNP
Volume
31
Issue
1-2
Year of publication
1999
Pages
1 - 23
Database
ISI
SICI code
0257-0130(1999)31:1-2<1:AFQWEV>2.0.ZU;2-Y
Abstract
We consider a finite-capacity single-server vacation model with close-down/ setup times and Markovian arrival processes (MAP). The queueing model has p otential applications in classical IP over ATM or IP switching systems, whe re 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 sign aling protocol. The vacation time may be considered as the time period requ ired to release an SVC or as the time during which the server goes to set u p other SVCs. By using the supplementary variable technique, we obtain the queue length distribution at an arbitrary instant, the loss probability, th e setup rate, as well as the Laplace-Stieltjes transforms of both the virtu al and actual waiting time distributions.