Optimal flow control allocation policies in communication networks with multiple message classes
暂无分享,去创建一个
[1] Derya Cansever,et al. Optimal hop-by-hop control with multiple transmitters , 1987, 26th IEEE Conference on Decision and Control.
[2] Rodolfo A. Milito,et al. Optimal hop-by-hop flow control policies with multiple heterogeneous transmitters , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.
[3] J. Kiefer,et al. On the theory of queues with many servers , 1955 .
[4] Linn I. Sennott,et al. Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs , 1989, Oper. Res..
[5] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[6] Mario Gerla,et al. Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..
[7] Redha M. Bournas,et al. Time-average and asymptotically optimal flow control policies in networks with multiple transmitters , 1992, Ann. Oper. Res..
[8] Demosthenis Teneketzis,et al. Properties of optimal hop-by-hop allocation policies in networks with multiple transmitters and linear equal holding costs , 1991 .
[9] D. Teneketzis,et al. Routing in queueing networks under imperfect information: stochastic dominance and thresholds , 1989 .
[10] Mario Gerla,et al. Flow Control Protocols , 1982 .