Optimal flow control allocation policies in communication networks with priorities

M(>or=2) transmitting stations sending packets to a single receiver over a slotted time-multiplexed link are considered. The objective is to characterize dynamic policies that minimize the discounted and long-term average costs due to holding packets at the M stations. This flow control problem is modeled as a Markov decision process and treated by dynamic programming methods. The authors derive properties of optimal (discounted) policies that reduce the computational complexity of the flow control algorithm, and prove two properties of optimal policies. These properties are used to show that the optimization reduces to the calculation of optimal allocations for a finite number of states. Some special cases are considered.<<ETX>>

[1]  J. Kiefer,et al.  On the theory of queues with many servers , 1955 .

[2]  Linn I. Sennott,et al.  Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs , 1989, Oper. Res..

[3]  Franklin F. Kuo,et al.  Computer-Communication Networks , 1973 .

[4]  Anthony Ephremides,et al.  Channel-access control for integrated voice/data networks , 1990, 29th IEEE Conference on Decision and Control.

[5]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[6]  Mischa K. Schwartz.  Computer Communications Network Design and Analysis , 1977 .

[7]  Jeffrey E. Wieselthier,et al.  A new class of protocols for multiple access in satellite networks , 1980 .

[8]  D. Teneketzis,et al.  Time-average and asymptotically optimal flow control policies in networks with multiple transmitters , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[9]  Mario Gerla,et al.  Flow Control Protocols , 1982 .

[10]  D. Teneketzis,et al.  Routing in queueing networks under imperfect information: stochastic dominance and thresholds , 1989 .

[11]  Mischa Schwartz,et al.  Bandwidth Allocation Strategies in Wide-Band Integrated Networks , 1986, IEEE J. Sel. Areas Commun..

[12]  D. Teneketzis,et al.  Optimal hop-by-hop flow control policies in computer networks with multiple transmitters: convexity and monotonicity properties. I. linear and equal holding costs , 1990, 29th IEEE Conference on Decision and Control.