Queues, stores, and tableaux

DOI10.1239/jap/1134587823zbMath1255.90040OpenAlexW2963701881MaRDI QIDQ5476155

Jean Mairesse, Moez Draief, Neil O'Connell

Publication date: 29 June 2006

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jap/1134587823

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (14)

RSK in last passage percolation: a unified approach ⋮ On the stationary solutions of random polymer models and their zero-temperature limits ⋮ The single server queue and the storage model: large deviations and fixed points ⋮ The half-space Airy stat process ⋮ Joint distribution of Busemann functions in the exactly solvable corner growth model ⋮ Stationary half-space last passage percolation ⋮ A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents ⋮ Tropical combinatorics and Whittaker functions ⋮ Batch latency analysis and phase transitions for a tandem of queues with exponentially distributed service times ⋮ Stationary measures for two dual families of finite and zero temperature models of directed polymers on the square lattice ⋮ Invariant measures for the box-ball system based on stationary Markov chains and periodic Gibbs measures ⋮ Determinantal transition kernels for some interacting particles on the line ⋮ Batch queues, reversibility and first-passage percolation ⋮ Bi-infinite solutions for KdV- and Toda-type discrete integrable systems based on path encodings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic stationarity of queues in series and the heavy traffic approximation
• On the quasireversibility of a multiclass Brownian service station
• Probabilistic proof of the interchangeability of ./M/1 queues in series
• Departures from many queues in series
• An introduction to the theory of point processes
• The existence of fixed points for the \(\cdot\)/GI/1 queue.
• The attractiveness of the fixed points of a \(\cdot/\text{GI}/1\) queue.
• Asymptotic results on infinite tandem queueing networks
• Brownian analogues of Burke's theorem.
• The asymmetric exclusion process: Comparison of update procedures
• Non-colliding random walks, tandem queues, and discrete orthogonal polynomial ensembles
• A representation for non-colliding random walks
• Permutations, matrices, and generalized Young tableaux
• The interchangeability of ·/M/1 queues in series
• Waiting Times When Queues are in Tandem
• The Reversibility Property of Production Lines
• The Optimal Order of Service in Tandem Queues
• Behavior of Tandem Buffers with Geometric Input and Markovian Output
• On the input-output map of aG/G/1 queue
• The information-theoretic capacity of discrete-time queues
• A path-transformation for random walks and the Robinson-Schensted correspondence
• Conditioned random walks and the RSK correspondence
• Eigenvalues and Condition Numbers of Complex Random Matrices
• Entropy and the timing capacity of discrete queues
• GUEs and queues
• Pitman's \(2M-X\) theorem for skip-free random walks with Markovian increments

This page was built for publication: Queues, stores, and tableaux