. 1

- 2

  • S. Floyd and V. Jacobson, On Traffic Phase Effects in Packet Switched Gateways Internetworking: Research and Experience vol.3 no.3 pp. 115-156, September 1992. (An earlier version of this paper appeared in Computer Communication Review, vol. 21 no.2 April 1991)
  • S. Floyd and V. Jacobson, Random Early Detection gateways for congestion avoidance, IEEE/ACM Transactions of Networking vol. 1, no. 4, pp. 397-413, August 1993. . http://www-nrg.ee.lbl.gov/nrg-paper.html
  • V. Jacobson, Congestion avoidance and control" Proc. ACM SIGCOMM 88, pp. 314-329.
  • V. Jacobson, Modified TCP congestion avoidance algorithm" message to end2end-interest mailing list, April 1990, URL .
  • V. Jacobson, Berkeley TCP evolution from 4.3-tahoe to 4.3-reno , Proc. of the 18th Internet Engineering Task Force, Vancouver, August, 1990.
  • P. Karn and C. Partridge, Improving Round Trip Time Estimates in Reliable Transport Protocols" ACM Trans. on Computer Systems, vol. 9no. 4, pp. 364-373, November 1991.
  • T. V. Lakshman, U. Madhow, B. Suter, Window-based error recovery and flow control with a slow acknowledgement channel: a study of TCP/IP performance, Proceedings of IEEE Infocom 1997.

  • B. Makrucki, On the performance of Submitting Excess Traffic to ATM Networks, Proc. of Globecom 1991 pp. 281-288, December 1991.
  • D. Mitra, Asymptotically optimal design of congestion control for high speed data networks, IEEE Trans. Commun., vol. 40, no. 2, pp. 301-311, February 1992.
  • D. Mitra and J. B. Seery, Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays, Computer Networks and ISDN Systems, vol. 25, pp. 663-679, 1993.
  • A. Mukherjee and J. C. Strikwerda, Analysis of dynamic congestion control protocols - a Fokker-Planck approximation, Proc. ACM SIGCOMM 91, pp. 159-169.
  • A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks - the multiple node case", Proc.