Title :
A linear programming problem in separable closed queueing networks
Author_Institution :
Dept. of Math. & Comput. Sci., Leiden Univ., Netherlands
fDate :
2/1/1989 12:00:00 AM
Abstract :
A separable closed queueing network is decomposed into two subnetworks. The rates of the servers in one of the subnetworks are controllable in order to maximize the throughput of the other one. This problem of optimal flow control is transformed to a linear programming problem. The optimal solution of the linear program yields the structure of the optimal control. Conditions for the network are given to guarantee the applicability of this approach
Keywords :
graph theory; linear programming; optimal control; queueing theory; graph theory; linear programming; optimal flow control; separable closed queueing networks; servers; Adaptive control; Automatic control; Intelligent networks; Linear programming; Optimal control; Programmable control; Regulators; Silicon compounds; Stochastic processes; Tuning;
Journal_Title :
Automatic Control, IEEE Transactions on
