Queuing Networks with Random Selection for Service

DOI10.1109/TSE.1979.234189MaRDI QIDQ4184612zbMATH OpenFDO

Authors Jeffrey R. Spirn

Publication date 1979

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSE.1979.234189

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22)

Cited in

(5)

• Theory of queuing networks and its applications to the analysis of information-computing systems
• Exact solutions for open, closed and mixed queueing networks with rejection blocking
• On First-Come First-Served Versus Random Service Discipline in Multiclass Closed Queueing Networks
• A family of multiclass LCFS networks with a novel product-form solution
• Approximate analysis of load-dependent generally distributed queuing networks with low service time variability

This page was built for publication: Queuing Networks with Random Selection for Service

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