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.
No takes yet. Share an insight, caveat, or question.
Bovopoulos et al. (1991) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: