A vertex-allocation theorem for resources in queuing networks

DOI10.1145/42267.45068zbMath0659.90044OpenAlexW2091017177MaRDI QIDQ3809568

Satish K. Tripathi, C. Murray Woodside

Publication date: 1988

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/42267.45068

zbMATH Keywords

resource allocationqueueing networksoptimal performancemultiple open and closed chains

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (2)

Allocation of flows in closed bipartite queueing networks ⋮ Optimal Routing in Closed Queueing Networks with State Dependent Queues

This page was built for publication: A vertex-allocation theorem for resources in queuing networks