An analysis of M,MMPP/G/1 queues with QLT scheduling policy and Bernoulli schedule

Cited 9 time in webofscience Cited 0 time in scopus
  • Hit : 474
  • Download : 0
We analyze 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.
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Issue Date
1998-01
Language
English
Article Type
Article
Keywords

QUEUING SYSTEM; PERFORMANCE; MULTIPLEXER; TIME

Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E81B, no.1, pp.13 - 22

ISSN
0916-8516
URI
http://hdl.handle.net/10203/77437
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0