Two Parallel Queues Created by Arrivals with Two Demands II
From MaRDI portal
Publication:3703619
DOI10.1137/0145052zbMath0579.90033OpenAlexW4233124504MaRDI QIDQ3703619
Publication date: 1985
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0145052
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (24)
On the structure and solutions of functional equations arising from queueing models ⋮ 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 ⋮ A note on solutions of a functional equation arising in a queuing model for a LAN gateway ⋮ Queueing with redundant requests: exact analysis ⋮ New steps in walks with small steps in the quarter plane: series expressions for the generating functions ⋮ Counting walks in a quadrant: a unified approach via boundary value problems ⋮ On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits ⋮ Mean sojourn times in two-queue fork-join systems: bounds and approximations ⋮ Tail asymptotics for a generalized two-demand queueing model -- a kernel method ⋮ Sojourn times in G/M/1 fork‐join networks ⋮ On Parametric Steady State Analysis of a Generalized Stochastic Petri Net with a Fork-Join Subnet ⋮ EXPLICIT SOLUTION FOR QUEUE LENGTH DISTRIBUTION OF M/T-SPH/1 QUEUE ⋮ Exact Monte Carlo simulation for fork-join networks ⋮ Response times in M/M/s fork-join networks ⋮ Two coupled queues with vastly different arrival rates: critical loading case ⋮ Exact tail asymptotics in a priority queue -- characterizations of the preemptive model ⋮ Fork-Join program response time on multiprocessors with exchangeable join ⋮ An upper bound and finiteness criteria for the Galois group of weighted walks with rational coefficients in the quarter plane ⋮ ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL ⋮ A human proof of Gessel’s lattice path conjecture ⋮ A fork-join queueing model: Diffusion approximation, integral representations and asymptotics ⋮ Approximate analysis of a closed fork/join model ⋮ Synchronized queues with deterministic arrivals
This page was built for publication: Two Parallel Queues Created by Arrivals with Two Demands II