scientific article; zbMATH DE number 2046057

MaRDI QIDQ4451037zbMATH OpenFDO

Authors Moez Draief, Jean Mairesse, Neil O'Connell

Publication date 22 February 2004

Full work available at URL http://www.emis.de/journals/DMTCS/proceedings/html/dmAC0107.abs.html

zbMATH Keywords

Burke's theoremstorage modelsingle server queueRobinson-Schensted-Knuth algorithmnon-colliding random walkstandem of queues

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Inventory, storage, reservoirs (90B05)

Recommendations

• Queues, stores, and tableaux
• On the intersection of stacks and queues
• A generalization of symmetric queues
• Bounding the performance of tandem queues with finite buffer spaces
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Concavity of the throughput of tandem queueing systems with finite buffer storage space
• Equivalence relations in the approximations for the \(M/G/s/s+r\) queue.

Cited in

(3)

• The single server queue and the storage model: large deviations and fixed points
• Queues, stores, and tableaux
• Convergence of tandem Brownian queues

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451037)