Optimal Flow Control of an M/M/1 Queue with a Balanced Budget

IEEE Transactions on Automatic Control

Volumn 39, Issue 9, 1994, Pages 1918-1921

  Chakravorti, Bhaskar ^a  

^a TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; THEOREM PROVING; USER INTERFACES;

BALANCED BUDGET; OPTIMAL FLOW CONTROL;

QUEUEING THEORY;

EID: 0028496871     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.317124     Document Type: Article

References (15)

1. B. Sanders, “A private good/public good decomposition for optimal flow control of an M/M/1 queue,” IEEE Trans. Automat. Contr. vol. AC-30, pp. 1143–1145, 1985.
2. Y. Fugigaki and K. Sato, “Incentives in the generalized MDP procedure for the provision of public goods,” Rev. Econ. Stud. vol. XLVIII, pp. 473–486, 1981.
3. L. Kleinrock, Queueing Systems, Volume I: Theory. New York: Wiley, 1975.
4. E. Coddington and N. Levinson, Theory of Ordinary Differential Equations. New York, McGraw-Hill, 1955.
5. J. Green and J.-J. Laffont, Incentives in Public Decision Making. Amsterdam: North-Holland, 1979.
6. K. Bharath-Kumar and J. Jaffe, “A new approach to performance-oriented flow control,” IEEE Trans. Comm., vol. COM-29, pp. 427–435, 1981.
7. M. Gerla, H. Chan, and J. Boisson de Marca, “Routing, flow control and fairness in computer networks,” presented at ORSA-TIMS, Orlando, Florida, 1983.
8. D. Cansevar, “Decentralized algorithms for flow control in networks,” in Proc. 25th Conf. Dec. Contr., Athens, Greece, 1986.
9. C. Dougligeris and R. Mazumdar, “On Pareto optimal flow control in an integrated environment,” in Proc. 25thAllerton Conf., Urbana, IL, 1987.
10. M. T. Hsiao and A. Lazar, “Optimal decentralized flow control of Markovian queueing networks with multiple controllers,” CTR Tech. Rep. CUCTR-TR-19, Columbia Univ., New York, 1986.
11. Z. Zhang and C. Douligeris, “Convergence of synchronous and asynchronous algorithms in multi-class networks,” in IEEE INFOCOM '91 Proc., Bal Harbor, FL, Florida, 1991, pp. 939–943.
12. E. Malinvaud, “Procedures for the determination of a program of collective consumption,” European Econ. Rev., vol. 2, pp. 187–217.
13. J. Dréze and D. de la Vallée Poussin, “A tâtonnemont process for public goods,” Rev. Econ. Stud. vol. 38, pp. 133–150, 1971.
14. L. Hurwicz, “On informationally decentralized systems,” in Decision and Organization: A Volume in Honor of Jacob Marshak, C. McGuire and R. Radner, (Eds.). Amsterdam: North-Holland, 1972.
15. B. Chakravorti, “A rate allocation algorithm for computer networks with non-myopic and manipulative privately informed users,” Tech. Rep., Bellcore, Morristown, NJ, 1992.