Analysis of a two-node task-splitting feedback tandem queue with infinite buffers by functional equation Online publication date: Sat, 31-Jan-2009
by Aliakbar Montazer Haghighi, Dimitar P. Mishev
International Journal of Mathematics in Operational Research (IJMOR), Vol. 1, No. 1/2, 2009
Abstract: In this article, a two-node single-processor Markovian tandem queueing system with task splitting and feedback is considered. Each node has an infinite buffer before it and, thus, no blocking is possible in the system. Splitting feature is added to the model considered and it makes it a novel tandem queue. The functional equation developed from the generating function applied to the system of difference equations is solved using Riemann-Hilbert problem. The mean of the stationary queue length at each node is found. An algorithm is given for computation of performance measures. Using approximation, a numerical example is offered to illustrate the workability of the algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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