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

被引:37
作者
Niu, ZS [1 ]
Takahashi, Y
机构
[1] Tsing Hua Univ, Dept Elect Engn, Beijing 100084, Peoples R China
[2] NTT, Multimedia Networks Labs, Tokyo 1808585, Japan
关键词
Markovian arrival process (MAP); finite capacity queue; vacation; setup time; close-down time; supplementary variable method;
D O I
10.1023/A:1019189610144
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:1 / 23
页数:23
相关论文
共 17 条
[1]   FINITE-CAPACITY VACATION MODELS WITH NONRENEWAL INPUT [J].
BLONDIA, C .
JOURNAL OF APPLIED PROBABILITY, 1991, 28 (01) :174-197
[2]  
David Lucantoni M., 1991, Commun. Stat. Stoch. Models, V7, P1, DOI DOI 10.1080/15326349108807174
[3]  
Doshi B., 1990, Stochastic analysis of computer and communication systems, P217
[4]  
Doshi B. T., 1986, Queueing Systems Theory and Applications, V1, P29, DOI 10.1007/BF01149327
[5]  
Hassan M, 1997, IEICE T COMMUN, VE80B, P317
[6]   A MARKOV MODULATED CHARACTERIZATION OF PACKETIZED VOICE AND DATA TRAFFIC AND RELATED STATISTICAL MULTIPLEXER PERFORMANCE [J].
HEFFES, H ;
LUCANTONI, DM .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1986, 4 (06) :856-868
[7]   MAP/G/1 queues under N-policy with and without vacations [J].
Kasahara, S ;
Takine, T ;
Takahashi, Y ;
Hasegawa, T .
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1996, 39 (02) :188-212
[8]  
KITAZUME H, 1997, S PERF MOD INF COMM, P28
[9]   A SINGLE-SERVER QUEUE WITH SERVER VACATIONS AND A CLASS OF NONRENEWAL ARRIVAL PROCESSES [J].
LUCANTONI, DM ;
MEIERHELLSTERN, KS ;
NEUTS, MF .
ADVANCES IN APPLIED PROBABILITY, 1990, 22 (03) :676-705
[10]   THE INTENSITY CONSERVATION LAW FOR QUEUES WITH RANDOMLY CHANGED SERVICE RATE [J].
MIYAZAWA, M .
JOURNAL OF APPLIED PROBABILITY, 1985, 22 (02) :408-418