Probabilistic proof of the interchangeability of ./M/1 queues in series

DOI10.1007/BF01150050zbMath0657.60118MaRDI QIDQ1110927

S. H. Smith

Publication date: 1987

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

tandem queuespoint processesinsensitivitydeparture process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (4)

Ordering of Tandem Constant-Service Stations to Minimize In-Process Stock Cost ⋮ Queues, stores, and tableaux ⋮ Bowl Shapes Are Better with Buffers–Sometimes ⋮ Optimal Order for Servers in Series with No Queue Capacity

Cites Work

• Optimal adaptive server allocation in a network
• The interchangeability of ·/M/1 queues in series
• On the ordering of tandem queues with exponential servers
• Filtering formulas and the ./M/1 queue in a quasireversible network

This page was built for publication: Probabilistic proof of the interchangeability of ./M/1 queues in series