A finite capacity BMAPK/GK/1 queue with the generalized foreground–background processor-sharing discipline

A finite capacity BMAPK/GK/1 queue with the generalized foreground–background processor-sharing discipline

0.00 Avg rating0 Votes
Article ID: iaor20062941
Country: Germany
Volume: 67
Issue: 3
Start Page Number: 428
End Page Number: 434
Publication Date: Mar 2006
Journal: Automation and Remote Control
Authors: ,
Keywords: GI/G/1 queues
Abstract:

A queueing system with a batch Markov arrival process, several types of customers, generalized foreground–background processor-sharing discipline with minimal served length, and separate finite buffers for customers of different types or a common finite buffer for customers of all types is studied. Mathematical relations for computing the stationary joint distributions of the number of customers of all types in the system are derived.

Reviews

Required fields are marked *. Your email address will not be published.