Two Parallel Queues Created by Arrivals with Two Demands II
From MaRDI portal
Recommendations
- Two Parallel Queues Created by Arrivals with Two Demands I
- Two Parallel Queues with Dynamic Routing
- Two queues with non-stochastic arrivals
- Two parallel finite queues with simultaneous services and Markovian arrivals
- scientific article; zbMATH DE number 1031888
- A Queueing System with Two Parallel Lines, Cost-Conscious Customers, and Jockeying
- A two-queue system with alternating service
- Two Queues Attended by a Single Server
Cited in
(29)- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
- An upper bound and finiteness criteria for the Galois group of weighted walks with rational coefficients in the quarter plane
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- On the structure and solutions of functional equations arising from queueing models
- Counting walks in a quadrant: a unified approach via boundary value problems
- Fork-Join program response time on multiprocessors with exchangeable join
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
- A human proof of Gessel's lattice path conjecture
- Asymptotic analysis of two coupled queues with vastly different arrival rates and finite customer capacities
- Controlling variability in split-merge systems and its impact on performance
- On parametric steady state analysis of a generalized stochastic Petri net with a fork-join subnet
- Exact Monte Carlo simulation for fork-join networks
- A note on solutions of a functional equation arising in a queuing model for a LAN gateway
- ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
- Two Parallel Queues Created by Arrivals with Two Demands I
- Queueing with redundant requests: exact analysis
- Two Parallel Queues with Dynamic Routing
- Mean sojourn times in two-queue fork-join systems: bounds and approximations
- Response times in M/M/s fork-join networks
- Sojourn times in G/M/1 fork-join networks
- Explicit solution for queue length distribution of M/T-SPH/1 queue
- Two coupled queues with vastly different arrival rates: critical loading case
- Tail asymptotics for a generalized two-demand queueing model -- a kernel method
- Stochastic customer order scheduling to minimize long-run expected order cycle time
- Extreme values for the waiting time in large fork-join queues
- Numerical computations and tail asymptotics for stationary indices of a discrete-time queue
- Approximate analysis of a closed fork/join model
- Synchronized queues with deterministic arrivals
- New steps in walks with small steps in the quarter plane: series expressions for the generating functions
This page was built for publication: Two Parallel Queues Created by Arrivals with Two Demands II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703619)
