A tandem queueing system with task-splitting, feedback, and blocking
Summary: A novel two-station single-processing tandem queueing system with task splitting, feedback, and blocking is considered. Two cases are analysed: \(\bullet\) a finite buffer at each station, \(\bullet\) only the intermediate buffer finite. After completing processing at each station, a task may leave the system, join the other station, go for split, go to the other station or return to its own station. The steady-state joint distribution of the queue lengths that will lead to the moments of the queue lengths, mean waiting time, probabilities of each station and the system being busy and being idle are obtained through algorithms. A numerical example is provided.
- Analysis of a two-node task-splitting feedback tandem queue with infinite buffers by functional equation
- scientific article; zbMATH DE number 1187255
- Busy period of a single-server Poisson queueing system with splitting and batch delayed-feedback
- Stationary tail asymptotics of a tandem queue with feedback
- Single-server Poisson queueing system with splitting and delayed-feedback: part I
- An analysis of the number of tasks in a parallel multi-processor system with task-splitting and feedback.
- Busy period of a single-server Poisson queueing system with splitting and batch delayed-feedback
- 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
- A Tandem Queueing Network with Feedback Admission Control
- Servers in tandem with k-stage blocking and communications-type flow
- A Tandem Queueing System with Batch Session Arrivals
- Analysis of MAP / PH / 1 retrial inventory queueing system with constant retrial rate, Bernoulli vacation, breakdown, delayed repair, balking, (s, S) policy and emergency replenishment
- Analysis of \(MAP^I_1, PH^{OA}_2 / PH^I_1, PH^O_2 / 1\) retrial inventory queue with two way communication, \((s, S)\) replenishment policy, feedback, Bernoulli vacation and impatient customers
- Analysis of a two-node task-splitting feedback tandem queue with infinite buffers by functional equation
This page was built for publication: A tandem queueing system with task-splitting, feedback, and blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1000171)