Diffusion approximations for models of congestion control in high-speed networks

Proceedings of the IEEE Conference on Decision and Control

Volumn 1, Issue , 1998, Pages 1096-1101

  Das, Atanu ^a   Srikant, R ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFUSION APPROXIMATION;

APPROXIMATION THEORY; MATHEMATICAL MODELS; POISSON DISTRIBUTION; RESOURCE ALLOCATION; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

CONGESTION CONTROL (COMMUNICATION);

EID: 0032273773     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (22)

1. Longer version of this paper. Available at http://tesla.csl.uiuc.edu/ "srikant/pub.html.
2. E. Altman, T. Bqar, and R. Srikant. Multi-user rate-based flow control with action delays: A team-theoretic approach. In Proceedings of the 36th IEEE Conference on Decision and Control, San Diego, CA, December 1997.
3. E. Altman, T. Bqar, and R. Srikant. Robust rate control for ABR sources. In Proceedings of IEEE INFOCOM, San Francisco, CA, March 1998.
4. L. Benmohamed and S. M. Meerkov. Feedback control of congestion in packet switching networks: The case of a single congested node. IEEE/ACM Transactions on Networking, 1(6):693-707, 1993.
5. L. Benmohamed and Y. T. Wang. A control-theoretic ABR explicit rate algorithm for ATM switches with per-VC queueing. In Proceedings of IEEE INFOCOM, San Francisco, CA, March 1998.
6. A. A. Borovkov. On limit laws for service processes in multi-channel systems. Siberian Math. J., pages 746-763, 1967. English Translation.
7. A. A. Borovkov. Stochastic Processes an Queueing Theory. Springer-Verlag, New York, NY, 1976.
8. A. E. Eckberg. Generalized peakedness of teletraffic processes. In Proceedings of the Tenth Intenational Teletraffic Congress, page 4.4b3, Montral, Canada, June 1983.
9. P. W. Glynn and W. Whitt. A new view of the heavy-traffic limit theorem for infinite-server queues. Advances in Applied Probability, 23:188-209, 1991.
10. S. Halfin and W. Whitt. Heavy-traffic limits for queues with many exponential servers. Operations Research, 29(3):567-588, 1981.
11. D. Heyman, T. V. Lakshman, and A. Niedhart. A new method for analyzing feedback-based protocols with applications to engineering web traffic over the internet. In Sigmetrics 97, pages 24-38, 1997.
12. D. Iglehart. Limit diffusion approximations for the many server queue and the repairman problem. Journal of Applied Probability, pages 429-441, 1965.
13. V. Jacobson. Congestion avoidance and control. ACM Computer Communication Review, 18:314-329, August 1988.
14. S. Kalyanaraman, R. Jain, S. Fahmy, R. Goyal, and B. Vandalore. The ERICA switch algorithm for ABR traffic management in ATM networks, 1997. http://www.cis.ohio-state.edu/jain/papers.
15. S. Karlin and H. Taylor. A Second Course in Stochastic Processes. Academic Press, New York, NY, 1981.
16. S. Keshav. An Engineering Approach to Computer Networks. Addison-Wesley, Reading, MA, 1997.
17. S. Mascolo, D. Cavendish, and M. Gerla. ATM rate based congestion control using a Smith predictor: an EPRCA implementation. In Proceedings of IEEE INFOCOM, San Francisco, CA, March 1996.
18. R. Srikant and W. Whitt. Simulation run lengths to estimate blocking probabilites in multiserver loss models. ACM Transactions on Modelling and Computer Simulation, pages 7-52, January 1996.
19. C. Stone. Limit theorems for random walks, birth and death processes and diffusion processes. Illinois Journal of Mathematics, pages 638-660, 1961.
20. P. Varaiya and J. Walrand. High-Performance Communication Networks. Morgan Kaufman, San Francisco, CA, 1996.
21. W. Whitt. On the heavy-traffic limit theorems for GI/G/co queues. Advances in Applied Probability, 14:171-190, 1982
22. W. Whitt. Heavy traffic approximations for service systems with blocking. AT&T Technical Journal, pages 689-707, May-June 1984.