An Analysis of M, MMPP/G/1 Queues with QLT Scheduling Policy and Bernoulli Schedule

• CHOI Bong Dae

  the Department of Mathematics and Center for Applied Mathematics, Korea Advanced Institute of Science and Technology

• KIM Yeong Cheol

  the Department of Mathematics and Center for Applied Mathematics, Korea Advanced Institute of Science and Technology

• CHOI Doo Il

  the Department of Mathematics, Statistics and Computer Science, University of Illinois

• SUNG Dan Keun

  the Department of Electrical Engineering, Korea Advanced Institute of Science and Technology

抄録

We analyzed M,MMPP/G/1 finite queues with queue-length-threshold (QLT) scheduling policy and Bernoulli schedule where the arrival of type-1 customers (nonreal-time traffic) is Poisson and the arrival of type-2 customers (real-time traffic) is a Markov-modulated Poisson process (MMPP). The next customer to be served is determined by the queue length in the buffer of type-1 customers. We obtain the joint queue length distribution for customers of both types at departure epochs by using the embedded Markov chain method, and then obtain the queue length distribution at an arbitrary time by using the supplementary variable method. From these results, we obtain the loss probabilities and the mean waiting times for customers of each type. The numerical examples show the effects of the QLT scheduling policy on performance measures of the nonreal-time traffic and the bursty real-time traffic in ATM networks.

収録刊行物

• IEICE transactions on communications

  IEICE transactions on communications 81 (1), 13-22, 1998-01-25

  一般社団法人電子情報通信学会

キーワード

• queueing analysis
• QLT scheduling policy
• MMPP
• ATM network

詳細情報

• CRID: 1570291227534609920
• NII論文ID: 110003217949
• NII書誌ID: AA10826261
• ISSN: 09168516
• 本文言語コード: en
• データソース種別:
  • CiNii Articles