Entropy maximisation and open queueing networks with priorities and blocking
D Kouvatsos, I Awan - Performance Evaluation, 2003 - Elsevier
A review is carried out on the characterisation and algorithmic implementation of an
extended product-form approximation, based on the principle of maximum entropy (ME), for
a wide class of arbitrary finite capacity open queueing network models (QNMs) with service
and space priorities. A single server finite capacity GE/GE/1/N queue with R (R> 1) distinct
priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed
batches and generalised exponential (GE) service times is analysed via entropy …
extended product-form approximation, based on the principle of maximum entropy (ME), for
a wide class of arbitrary finite capacity open queueing network models (QNMs) with service
and space priorities. A single server finite capacity GE/GE/1/N queue with R (R> 1) distinct
priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed
batches and generalised exponential (GE) service times is analysed via entropy …
Entropy Maximisation and Open Queueing Networks with Priority and Blocking.
DD Kouvatsos, IU Awan - 2003 - bradscholars.brad.ac.uk
A review is carried out on the characterisation and algorithmic implementation of an
extended product-form approximation, based on the principle of maximum entropy (ME), for
a wide class of arbitrary finite capacity open queueing network models (QNMs) with service
and space priorities. A single server finite capacity GE/GE/1/N queue with R (R> 1) distinct
priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed
batches and generalised exponential (GE) service times is analysed via entropy …
extended product-form approximation, based on the principle of maximum entropy (ME), for
a wide class of arbitrary finite capacity open queueing network models (QNMs) with service
and space priorities. A single server finite capacity GE/GE/1/N queue with R (R> 1) distinct
priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed
batches and generalised exponential (GE) service times is analysed via entropy …
以上显示的是最相近的搜索结果。 查看全部搜索结果