A linear programming problem in separable closed queueing networks

DOI10.1109/9.21103zbMath0672.90064OpenAlexW2139439421MaRDI QIDQ3826347

Ad Ridder

Publication date: 1989

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

zbMATH Keywords

optimal flow controlseparable closed queueing network

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Queueing theory (aspects of probability theory) (60K25) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Application models in control theory (93C95) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Control of end-to-end delay tails in a multiclass network: LWDF discipline optimality

This page was built for publication: A linear programming problem in separable closed queueing networks