Abstract
We considerM transmitting stations sending packets to a single receiver over a slotted time-multiplexed link. For each phase consisting ofT consecutive slots, the receiver dynamically allocates these slots among theM transmitters. Our objective is to characterize policies that minimize the long-term average of the total number of messages awaiting service at theM transmitters. We establish necessary and sufficient conditions on the arrival processes at the transmitters for the existence of finite cost time-average policies; it is not enough that the average arrival rate is strictly less than the slot capacity. We construct a pure strategy that attains a finite average cost under these conditions. This in turn leads to the existence of an optimal time-average pure policy for each phase lengthT, and to upper and lower bounds on the cost this policy achieves. Furthermore, we show that such an optimal time-average policy has the same properties as those of optimal discounted policies investigated by the authors in a previous paper. Finally, we prove that in the absence of costs accrued by messages within the phase, there exists a policy such that the time-average cost tends toward zero as the phase lengthT→∞.
Similar content being viewed by others
References
P. Billingsley,Convergence of Probability Measures (Wiley, New York, 1968).
R.M. Bournas, F.J. Beutler and D. Teneketzis, Properties of optimal hop-by-hop allocation policies in networks with multiple transmitters and linear equal holding costs, IEEE Trans. Auto. Control AC-36(1991)1450–1463.
D.H. Cansever and R.A. Milito, Optimal hop-by-hop flow control policies with multiple transmitters,Proc. 26th Conf. on Decision and Control, Los Angeles, CA (December 1987), pp. 1858–1862.
D.H. Cansever and R.A. Milito, Optimal hop-by-hop flow control policies with multiple transmitters,Proc. 27th Conf. on Decision and Control, Austin, TX (December 1988), pp. 1291–1296.
D.H. Cansever and R.A. Milito, Optimal multistage hop-by-hop flow control policies,Proc. 28th Conf. on Decision and Control, Tampa, FL (December 1989), pp. 2530–2535.
W. Feller,An Introduction to Probability Theory and Its Application, Vol. 2, 2nd ed. (Wiley, New York, 1971).
M. Gerla and L. Kleinrock, Flow control: A comparative survey, IEEE Trans. Commun. COM-28(1980)533–574.
M. Gerla and L. Kleinrock, Flow control protocols, in:Computer Network Architectures and Protocols, ed. P.E. Green, Jr. (Plenum, New York, 1982), pp. 361–412.
A. Gut,Stopped Random Walks, Limit Theorems and Application (Springer, New York, 1988).
J. Kiefer and J. Wolfowitz, On the theory of queues with many servers, Trans. Amer. Math. Soc. 78(1955)1–18.
J. Kiefer and J. Wolfowitz On the characteristics of the general queueing process with applications to random walk, Ann. Math. Stat. 27(1956)147–161.
J.F.C. Kingman, Inequalities in the theory of queues, J. Roy. Statist. Soc. Ser. B 32(1970)102–110.
P. Kumar and P. Varaiya,Stochastic Systems: Estimation, Identification and Adaptive Control (Prentice-Hall, Englewood Cliffs, NJ, 1986).
D.V. Lindley, The theory of queues with a single server, Proc. Cambridge Phil. Soc. 48(1952)277–289.
S.A. Lippman, On dynamic programming with unbounded rewards, Manag. Sci. 21(1975)1225–1233.
Z. Rosberg and I.S. Gopal, Optimal hop-by-hop flow control in computer networks, IEEE Trans. Auto. Control AC-31(1986)813–822.
M. Schwartz,Computer Communication Networks, Design and Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1977).
L.I. Sennott, Average cost optimal stationary policies in infinite state Markov decision processes with unbounded costs, Oper. Res. 37(1989)626–633.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bournas, R.M., Beutler, F.J. & Teneketzis, D. Time-average and asymptotically optimal flow control policies in networks with multiple transmitters. Ann Oper Res 35, 325–355 (1992). https://doi.org/10.1007/BF02025184
Issue Date:
DOI: https://doi.org/10.1007/BF02025184