z-logo
open-access-imgOpen Access
TheN×D-BMAP/G/1 Queueing Model: Queue Contents and Delay Analysis
Author(s) -
Bart Steyaert,
Joris Walraevens,
Dieter Fiems,
Herwig Bruneel
Publication year - 2011
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2011/401365
Subject(s) - algorithm , queue , computer science , queueing theory , function (biology) , burke's theorem , mathematics , database , statistics , queue management system , fork–join queue , evolutionary biology , biology , programming language
We consider a single-server discrete-time queueing system with N sources, where each source is modelled as a correlated Markovian customer arrival process, and the customer service times are generally distributed. We focus on the analysis of the number of customers in the queue, the amount of work in the queue, and the customer delay. For each of these quantities, we will derive an expression for their steady-state probability generating function, and from these results, we derive closed-form expressions for key performance measures such as their mean value, variance, and tail distribution. A lot of emphasis is put on finding closed-form expressions for these quantities that reduce all numerical calculations to an absolute minimum

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom