Sally Floyd
Van Jacobson
- 1 D. Bacon, A. Dupuy, J. Schwartz, and Y. Yemimi, "Nest: A network simulation and prototyping tool," in Proc. Winter 1988 USENIX Conf., 1988, pp. 17-78.]]Google Scholar
- 2 K. Bala, I. Cidon, and K. Sohraby, "Congestion control for high speed packet switched networks," in Proc. INFOCOM '90, pp. 520-526, 1990.]]Google Scholar
- 3 D. Carla, "Two fast implementations of the 'minimal standard' random number generator," Commun. ACM, vol. 33, no. 1, pp. 87-88, Jan. 1990.]] Google Scholar
- 4 D.D. Clark, S. Shenker, and L. Zhang, "Supporting real-time applications in an integrated services packet network: Architecture and mechanism," in Proc. SIGCOMM '92, Aug. 1992, pp. 14-26.]] Google Scholar
- 5 S. Floyd, "Connections with multiple congested gateways in packetswitched networks, Part 1: One-way traffic," Comput. Commun. Rev., vol. 21, no. 5, pp. 30-47, Oct. 1991.]] Google Scholar
- 6 S. Floyd, "Issues in flexible resource management for datagram networks," in Proc. 3rd Workshop on VeO, High Speed Netw., Mar. 1992.]]Google Scholar
- 7 S. Floyd and V. Jacobson, "On traffic phase effects in packet-switched gateways," lnternetw.: Res. and Exper., vol. 3, no. 3, pp. 115-156, Sept. 1992.]]Google Scholar
- 8 S. Floyd and V. Jacobson, "The synchronization of periodic routing messages," to appear in Proc. SIGCOMM 93.]] Google Scholar
- 9 Hansen, A Table of Series and Products. Englewood Cliffs, NJ: Prentice Hall, 1975.]]Google Scholar
- 10 A. Harvey, Forecasting, Structural Time Series Models and the Kalman Filter. Cambridge, MA: Cambridge Univ. Press, 1989.]]Google Scholar
- 11 E. Hashem, "Analysis of random drop for gateway congestion control," Rep. LCS TR-465, Lab. for Comput. Sci., M.I.T., 1989, p. 103.]]Google Scholar
- 12 W. Hoeffding, "Probability inequalities for sums of bounded random variables," Amer. Statist. Assoc. J., vol. 58, pp. 13-30, Mar. 1963.]]Google Scholar
- 13 M. Hofri, Probabilistic Analysis of Algorithms. New York: Springer- Vefiag, 1987.]] Google Scholar
- 14 V. Jacobson, "Congestion avoidance and control," in Proc. SIGCOMM '88, Aug. 1988, pp. 314--329.]] Google Scholar
- 15 R. Jain, "A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks," Comput. Commun. Rev., vol. 19, no. 5, pp. 56-71, Oct. 1989.]] Google Scholar
- 16 R. Jain, "Congestion control in computer networks: Issues and trends," IEEE Netw., pp. 24-30, May 1990.]]Google Scholar
- 17 R. Jain, "Myths about congestion management in high-speed networks," Internetw.: Res. and Exper., vol. 3, no. 3, pp. 101-114, Sept. 1992.]]Google Scholar
- 18 R. Jain and K.K. Ramakrishnan, "Congestion avoidance in computer networks with a connectionless network layer: Concepts, goals, and methodology," in Proc. SIGCOMM '88, Aug. 1988.]] Google Scholar
- 19 S. Keshav, "REAL: A network simulator," Rep. 88/472, Comput. Science Dept., Univ. of California at Berkeley, 1988.]] Google Scholar
- 20 S. Keshav, "A control-theoretic approach to flow control," in Proc. SIGCOMM '91, Sept. 1991, pp. 3-16.]] Google Scholar
- 21 A. Mankin and K.K. Ramakrishnan, "Gateway congestion control survey,'' RFC 1254, Aug. 1991, p. 21.]] Google Scholar
- 22 P. Mishra and H. Kanakia, "A hop by hop rate-based congestion control scheme," in Proc. SIGCOMM '92, Aug. 1992, pp. 112-123.]] Google Scholar
- 23 D. Mitra and J. Seery, "Dynamic adaptive windows for high speed data networks: Theory and simulations," in Proc. SIGCOMM '90, Sept. 1990, pp. 30-40.]] Google Scholar
- 24 D. Mitra and J. Seery, "Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays," in Proc. IEEE INFOCOM '91, pp. 2B.l.i-2B.I.10.]]Google Scholar
- 25 S. Pingali, D. Tipper, and J. Hammond, "The performance of adaptive window flow controls in a dynamic load environment," in Proc. IEEE INFOCOM '90, June 1990, pp. 55--62.]]Google Scholar
- 26 J. Postel, "lntemet control message protocol," RFC 792, Sept. 1981.]] Google Scholar
- 27 W. Prue and J. Postel, "Something a host could do with source quench," RFC 1016. July 1987.]] Google Scholar
- 28 K.K. Ramakrishnan, D. Chiu, and R. Jain, '*Congestion avoidance in computer networks with a connectionless network layer, Part IV: A selective binary feedback scheme for general topologies," DEC-TR-510. Nov. 1987.]]Google Scholar
- 29 K.K. Ramakrishnan and R. Jain. "A binary feedback scheme for congestion avoidance in computer networks," ACM Trans. Cornput. Syst,, vol. 8, no. 2. pp. 158-181. 1990.]] Google Scholar
- 30 A. Romanow. "Some pedbrmance results for TCP over ATM with congestion." in Proc~ Second IEEE Vt, brksbop on Arch. and Implement. of High PerJbrm. Commnn, Subsyst., Williamsburg. VA, Sept. 1-3, 1993.]]Google Scholar
- 31 D. Sanghi and A. Agrawala, "DTP: An efficient transport protocol," Univ. of Maryland Tech. Rep. UMIACS-TR-91-133, Oct, 1991.]] Google Scholar
- 32 S, Shenker. "Comments on the IETF performance and congestion control working group draft on gateway congestion control policies," unpublished, 1989.]]Google Scholar
- 33 Z. Wang and J. Crowcrofi. "A new congestion control scheme: Slow start and search (Tri-Sl." Compur Commun. Rev., vol. 21, no. I. Jan. 1991, pp. 32-43.]] Google Scholar
- 34 Z. Wang and J. Crowcroft, "Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congextion control algorithm." Comput. Commun. Rev_ vol. 22, no, 2, pp, 9-16, Apr. 1992.]] Google Scholar
- 35 P, Young, Recursive Estimation and Time-Series Analysis. New York: Springer-Verlag, 1984. pp. 60-65.]] Google Scholar
- 36 L, Zhang, "A new architecture tot packet switching network protocols," MIT/LCS/TR-455, Lab. for Compm. Sci., Mass, Inst. of Technol.. Aug. 1989.]]Google Scholar
- 37 L. Zhang and D. Clark. "Oscillating behavior of network traffic: A case study simulation," Internetw.: Res. and Erper, vol. I. pp. 101-112, 199(}.]]Google Scholar
- 38 L. Zhang, S. Shenker, and D. Clark, "Observations on the dynamics of a congestion control algorithm: The effects of two-way traffic." in Pro,. SIGCOMM '91. Sept. 1991, pp. 133-148.]] Google Scholar
Index Terms
- Random early detection gateways for congestion avoidance
Recommendations
Congestion avoidance and control
SIGCOMM '88: Symposium proceedings on Communications architectures and protocolsIn October of '86, the Internet had the first of what became a series of 'congestion collapses'. During this period, the data throughput from LBL to UC Berkeley (sites separated by 400 yards and three IMP hops) dropped from 32 Kbps to 40 bps. Mike ...
Delay-based early congestion detection and adaptation in TCP: impact on web performance
Concerns over the scalability of TCP's end-to-end approach to congestion control and its AIMD congestion adaptation have led to proposals for router-based congestion control, specifically, active queue management (AQM). In this paper we present an end-...
Delay-based congestion avoidance for TCP
The set of TCP congestion control algorithms associated with TCP/Reno (e.g., slow-start and congestion avoidance) have been crucial to ensuring the stability of the Internet. Algorithms such as TCP/NewReno (which has been deployed) and TCP/Vegas (which ...
Comments