Optimal Resource Allocation for Markovian Queueing Networks: The Complete Information Case

Authors

Andreas D. Bovopoulos, Washington University in St. Louis
Aurel A. Lazar, Washington University in St. Louis

Document Type

Technical Report

Publication Date

1989-01-01

Filename

WUCS-89-21.pdf

Technical Report Number

WUCS-89-21

Abstract

The problem of finding the optimal routing and flow control of a single-class Markovian network under a suitable optimization criterion is analyzed. It is proven that, if complete information about the state of the network is made available to the network controller, the optimal state dependent routing is essentially deterministic, and the optimal flow control is of a generalized window type. An iterative linear programming algorithm is given for the derivation of the optimal routing and flow control policy.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7B27SNQ

Recommended Citation

Bovopoulos, Andreas D. and Lazar, Aurel A., "Optimal Resource Allocation for Markovian Queueing Networks: The Complete Information Case" Report Number: WUCS-89-21 (1989). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/734