Stepwise explicit solution for the joint distribution of queue length of a MAP single-server service queueing system with splitting and varying batch size delayed-feedback
by Aliakbar Montazer Haghighi; Dimitar P. Mishev
International Journal of Mathematics in Operational Research (IJMOR), Vol. 9, No. 1, 2016

Abstract: Applying truncation, augmentation and tridiagonalisation on infinite block matrices with infinite block matrix elements and duality properties of G/M/1 and M/G/1, and considering two Poisson arrivals as a MAP queueing network, we develop a stepwise algorithm to explicitly compute the joint distribution of the number of tasks in a system (queue length). We believe it is the first time such a development is offered in the literature. The system consists of an infinite-buffer single-server service-station, a splitter and an infinite-buffer single-mover delay-station. Tasks arrive from two sources: singly from outside and by batch from inside, the delay-station to the service-station. Both types of tasks arrive according to a Poisson process with two different parameters. Batch sizes vary between a minimum and a maximum number. A numerical example that demonstrates when the algorithm works and how the parameters must be chosen to reduce the approximation error together with an error analysis is included.

Online publication date: Wed, 06-Jul-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com