MAP_1, MAP_2/G/1 finite queues with service scheduling function dependent upon queue lengths
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
We analyze MAP_1,MAP_2/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.
Abstract
We analyze MAP_1,MAP_2/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.
참고문헌 (13)
- S. Asmussen, "Marked point processes as limits of Markovian arrival streams", J. Appl. Probab, 30(2), pp.365~372 (1993)
- D. I. Choi, "Performance analysis of priority leaky bucket scheme with queue-length-threshold scheduling policy", IEE Proc. Comm., 145(6), pp.395~401 (1998)
- B. D. Choi, "An analysis of M, MMPP", G, IEICE Tran. on Comm. E81- B, pp.1998, (1)[DOI]
- D. I. Choi, "Analysis of a queueing system with a general service scheduling function, with applications to telecommunication network traffic control", European J. Oper. Res, 178(2), pp.463~471 (2007)
- D. I. Choi, "Performance analysis of a dynamic priority queue for traffic control of bursty traffics in ATM networks", IEE Proc. Commun, 148(6), pp.395~401 (2001)
- E. Cinlar, "Markov renewal theory", Advances in Appl. Probability, 1, pp.123~187 (1969)
- S. S. Fratini, "Analysis of a dynamic priority queue", Comm. Statist. Stochastic Models, 6(3), pp.415~444 (1990)
- 1981, , ~
- H. Heffes, "A Markov-modulated characterization of packetized voice and data traffic and related statistical multiplexer performance", IEEE J. Select. Areas Commun, 6, pp.856~868 (1986)
- C. Knessl, "A dynamic priority queue model for simultaneous service of two traffic types", SIAM J. Applied Mathematics, 63(2), pp.398~422 (2002)
- D. M. Lucantoni, "A single-server queue with server vacations and a class of nonrenewal arrival processes", Adv. in Appl. Probab, 22(3), pp.676~705 (1990)
- H. Nassar, "ueueing analysis of an ATM multimedia multiplexer with nonpreemptive priority", IEE Proc. Commun, 150(3), pp.189~196 (2003)
- A. Sugahara, "Analysis of a nonpreemptive priority queue with SPP arrivals of high class", Performance Evaluation, 21(3), pp.215~238 (1995)