A tandem queue with coupled processors: Computational issues
The paper considers a two-stage queue, where jobs arrive at the first station according to a Poisson process. After receiving service at this station, they move to the second station, and upon completion of service at the second station they leave the system. The amount of work that a job requires at each of the station is an exponentially distributed random variable, and the total service capacity of the two stations together is constant. When both stations are nonempty, a given proportion of the capacity is allocated to station 1, and the remaining proportion is allocated to station 2. If one of the stations is empty, however, the total service capacity of the stations is allocated to the nonempty station. The paper investigates the two-dimensional Markov process representing the numbers of jobs at the two stations. It is known that the problem of finding the bivariate generating function of the stationary distribution can be reduced to a Riemann-Hilbert boundary value problem. In general, obtaining performance measures from the formal solution of a Riemann-Hilbert boundary value problem is not straightforward. The paper discusses the computational issues that arise when obtaining performance measures.
- A tandem queueing model with coupled processors.
- Stationary analysis of a tandem queue with coupled processors subject to global breakdowns
- A cyclic service tandem queueing model with parallel queues in the first stage
- A tandem \(\text{BMAP}/G/1 \to \bullet/M/N/0\) queue with group occupation of servers at the second station
- scientific article; zbMATH DE number 151798
- A tandem queueing model with coupled processors.
- A two-node jackson's network subject to breakdowns
- A two-queue model with Bernoulli service schedule and switching times
- Asymptotic analysis of a queueing system by a two-dimensional state space
- scientific article; zbMATH DE number 3814724 (Why is no real title available?)
- scientific article; zbMATH DE number 3177037 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- Server assignment policies for maximizing the steady-state throughput of finite queueing systems
- The relaxation time of two queueing systems in series
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Two processes interacting only during breakdown: The case where the load is not lost
- A tandem queueing model with coupled processors.
- A paired queueing system arising in multimedia synchronization.
- Stationary analysis of certain Markov-modulated reflected random walks in the quarter plane
- Stationary analysis of a tandem queue with coupled processors subject to global breakdowns
- On the structure and solutions of functional equations arising from queueing models
- A coupled processor model with simultaneous arrivals and ordered service requirements
- A queueing model with two classes of retrial customers and paired services
- Invariant measures and error bounds for random walks in the quarter-plane based on sums of geometric terms
- Tandem Conveyor Queues
- Coupled Processor: A Second-Order Continuous-State-Space Model
- A. B. Clarke's Tandem Queue Revisited—Sojourn Times
- Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem
- Two parallel processors with coupled inputs
- A retrial queue to model a two-relay cooperative wireless system with simultaneous packet reception
- Exact tail asymptotics for a two-stage queue: complete solution
- Erratum to: ``Wireless three-hop networks with stealing. II: Exact solutions through boundary value problems
- A Tandem Queuewith a Movable Server: An Eigenvalue Approach
- A two-class retrial system with coupled orbit queues
- scientific article; zbMATH DE number 2217275 (Why is no real title available?)
- Asymptotic behavior of a system of two coupled queues when the content of one queue is very high
- Rare event asymptotics for a random walk in the quarter plane
- A retrial system with two input streams and two orbit queues
This page was built for publication: A tandem queue with coupled processors: Computational issues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494528)
