Analysis of a two-node task-splitting feedback tandem queue with infinite buffers by functional equation

DOI10.1504/IJMOR.2009.022884MaRDI QIDQ843402zbMATH OpenOpenAlexFDO

Authors Aliakbar Montazer Haghighi, Dimitar P. Mishev

Publication date 12 October 2009

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijmor.2009.022884

zbMATH Keywords

queueing theoryqueues and service

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

The authors describe the Markovian tandem queueing model with task splitting and feedback. For this model the joint queue length of the system from the generating function was obtained. Each node in the model has an infinite buffer and, no blocking is possible in the system. The functional equations were developed from the generating function. They are solved analytically through the Riemann-Hilbert boundary value problem and conformal mapping. The given numerical computations make it possible to find the mean queue length at each node algorithmically by using the generating function. However, an exact distribution of the queue length remains an open problem. The results obtained show that the model and its solution are quite effective both in a combined parallel and task-splitting feedback. A given algorithm for computing the performance measures of a model is very valuable and important in the tandem queue analysis.

Recommendations

• A tandem queueing system with task-splitting, feedback, and blocking
• Analysis of Queueing Tandem with Feedback by the Method of Limiting Decomposition
• Analysis of the \(M/GI/1\to ./M/1\) queueing model
• Single-server Poisson queueing system with splitting and delayed-feedback: part I
• A tandem queueing model with coupled processors.

Cited in

(6)

• A tandem queueing system with task-splitting, feedback, and blocking
• An analysis of the number of tasks in a parallel multi-processor system with task-splitting and feedback.
• Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method
• Analysis of Queueing Tandem with Feedback by the Method of Limiting Decomposition
• Flexible group service MAP / PH / 1 queueing model with working vacation and optional service
• Analysis of a flexible group service MAP/PH/1 queueing model with soft failure and reneging

This page was built for publication: Analysis of a two-node task-splitting feedback tandem queue with infinite buffers by functional equation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843402)