The review is done focused on Transmission Control Protocol/Internet Protocol (TCP/IP) by studying almost recently proposed algorithms to avoid congestion and improve performance. Our study in this work list many open issues that persevere in the designing, functioning and managing of the Internet. It aims at preventing incoming packet drops at gateways because of local buffer overflows. We identified that the enormous part of problems lies in Transport Protocol Implementation which will never mean it happens in Protocols themselves which may sometimes happen.

1. L. Benmohamed and S.M. Meerkov, “Feedback control of congestion in store-and-forward networks: The case of a single congested node,” IEEE/ACM Trans. Networking, vol. 1, pp. 693-707, Dec. 1993.
2. S. Chong, R. Nagarajan, and Y.-T. Wang, “Designing stable ABR flow control with rate feedback and open loop control: First order control case,” Perform. Eval., vol. 34, no. 4, pp. 189-206, Dec. 1998.
3. E. Altman, T. Basar, and R. Srikant, “Congestion control as a stochas- tic control problem with action delays,” Automatica, Dec. 1999.
4. H. Ozbay, S. Kalyanaraman, and A. Iftar, “On rate-based congestion control in high-speed networks: Design of single bottleneck,” in Proc. Amer. Control Conf., 1998.
5. S. Mascolo, “Congestion control in high-speed communication net- works using the Smith principle,” Automatica, vol. 35, no. 12, pp. 1921-1935, Dec. 1999.
6. E.J. Hernandez-Valencia, L. Benmohamed, R. Nagarajan, and S. Chong, “Rate control algorithms for the ATM ABR service,” Eur. Trans. Telecommun., vol. 8, pp. 7-20, 1997. 42 based flow controller for
7. R. Srikant, “Control of communication networks,” in Perspectives in Control Engineering: Technologies, Applications, New Directions,T. Samad, Ed. Piscataway, NJ: IEEE Press, 2000, pp. 462-488.
8. F.P. Kelly, A. Maulloo, and D. Tan, “Rate control for communication networks: Shadow prices, proportional fairness and stability,” J. Oper. Res. Soc., vol. 49, no. 3, pp. 237-252, Mar. 1998.
9. F.P. Kelly. (July 1999). Mathematical modelling of the Internet, in Proc. 4th Int. Congr. Industrial Applied Mathematics. Available: http:// www.statslab.cam.ac.uk/~frank/mmi.html
10. S.H. Low and D.E. Lapsley, “Optimization flow control, I: Basic algo- rithm and convergence,” IEEE/ACM Trans. Networking,vol.7,pp. 861-874, Dec. 1999. Available: http://netlab.caltech.edu
11. S.H.Low. (Sept. 18-20, 2000).AdualitymodelofTCPflow controls, in Proc. ITC Specialist Seminar on IP Traffic Measurement, Modeling and Management. Available: http://netlab.caltech.edu
12. S.H. Low, L. Peterson, and L.Wang. (June 2001). Understanding Ve- gas: A duality model, in Proc. ACM Sigmetrics. Available: http://netlab.caltech.edu/ pub.html
13. S. Athuraliya and S.H. Low, “Optimization flow control with New- ton-like algorithm,” J. Telecommun. Syst., vol. 15, no. 3/4, pp. 345-358, 2000.
14. F. Paganini. (2001).Onthe stability of optimization-based flow control, in Proc. Amer. Control Conf. Available: http://www.ee.ucla.edu/-paganini/ PS/remproof.ps
15. S. Kunniyur and R. Srikant. (Mar. 2000). End-to-end congestion con- trol schemes: Utility functions, random losses and ECN marks, in Proc. IEEE Infocom. Available: http://www.ieee-infocom.org/2000/pa- pers/401.ps
16. S. Kunniyur and R. Srikant. (Apr. 2001). A time-scale decomposition approach to adaptive ECN marking, in Proc. IEEE Infocom. Available: http:// comm.csl.uiuc.edu:80/~srikant/pub.html
17. J. Mo and J. Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 556-567, Oct. 2000.
18. J. Mo, R. La, V. Anantharam, and J.Walrand, “Analysis and compari- son of TCP Reno and Vegas,” in Proc. IEEE Infocom. Mar. 1999.
19. R. La andV. Anantharam. (Mar. 2000). Charge-sensitiveTCPand rate control in the Internet, in Proc. IEEE Infocom. Available: http://www.ieee-infocom.org/2000/papers/401.ps
20. K. Kar, S. Sarkar, and L. Tassiulas, “Optimization based rate control for multirate multicast sessions,” in Proc. IEEE Infocom., Apr. 2001.
21. V. Misra,W.-B Gong, and D. Towsley, “Fluid-based analysis of a net- work of AQM routers supporting tcp flows with an application to RED,” in Proc. ACM SIGCOMM, 2000.
22. C. Hollot,V. Misra,D.Towsley, andW.-B. Gong. (Apr. 2001).Acontrol theoretic analysis of RED, in Proc. IEEE Infocom. Available: http://www-net.cs. umass.edu/papers/papers.html
23. F. Paganini, “Flow control via pricing: a feedback perspective,” in Proc. 2000 Allerton Conf., Oct. 2000.
24. V. Jacobson. (Aug. 1988). Congestion avoidance and control, in Proc. SIGCOMM’88, ACM. Available: ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z
25. F.P. Kelly. (Dec. 1999). Models for a self-managed Internet, in Proc. R. Soc. Meeting. Available: http://www.statslab.cam.ac.uk/~frank/smi.html
26. R. Johari and D. Tan, “End-to-end congestion control for the Internet: Delays and stability,” Cambridge Univ., Cambridge, U.K., Cam- bridge Univ. Statistical Laboratory Research Report, Tech. Rep. 2000-2, 2000.
27. L. Massoulie, “Stability of distributed congestion control with heter- ogeneous feedback delays,” Microsoft Research, Cambridge, U.K., Tech. Rep. TR 2000-111, 2000.
28. G.Vinnicombe, “On the stability of end-to-end congestion control for the Internet,” Cambridge Univ., Cambridge, U.K., Tech. Rep. CUED/ F-INFENG/TR.398, Dec. 2000.
29. W.E. Leland, M.S.Taqqu,W.Willinger,andD.V.Wilson,“Onthe self-similar natureof Ethernet traffic,”IEEE/ACMTrans. Networking, vol. 2, pp. 1-15, 1994.
30. V. Paxson and S. Floyd, “Wide-area traffic: The failure of Poisson model- ing,” IEEE/ACM Trans. Networking, vol. 3, pp. 226-244, 1995.
31. W. Willinger, M.S. Taqqu, R. Sherman, and D.V. Wilson, “Self-similarity through high variability: Statistical analysis of Ethernet LAN traffic at the source level,” IEEE/ACM Trans. Networking, vol. 5, pp. 71-86, 1997.
32. M.E. Crovella and A. Bestavros, “Self-similarity inWorldWideWebtraffic: Evidence and possible causes,” IEEE/ACM Trans. Networking, vol. 5, pp. 835-846, 1997.
33. X. Zhu, J.Yu,andJ.C. Doyle,“Heavytails, generalized coding,andoptimal web layout,” in Proc. IEEE Infocom., Apr. 2001.
34. L.S. Brakmo and L.L. Peterson, “TCPVegas: End to end congestion avoid- ance on a global Internet,” IEEE J. Select. Areas Commun., vol. 13, pp. 1465-1480, Oct. 1995. Available: http://cs.princeton.edu/nsg/papers/ jsac-vegas.ps
35. S. Floyd and V. Jacobson, “Random early detection gateways for conges- tion avoidance,” IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993. Available: ftp://ftp.ee.lbl.gov/papers/early.ps.gz
36. G. de Veciana, T.J. Lee, and T. Konstantopoulos, “Stability and perfor- mance analysis of networks supporting elastic services,” IEEE/ACM Trans. Networking, vol. 9 , Feb. 2001.
37. F. BaccelliandD. Hong, “AIMD, fairnessandfractal scaling ofTCPtraffic,” INRIA, Paris, France, Tech. Rep. RR 4155, 2001.
38. F.P. Kelly,“Chargingandratecontrol for elastic traffic,”Eur. Trans.Telecommun.,vol.8,pp.33-37,1997.Available: http://www.statslab.cam.ac.uk/~frank/elastic.html
39. H. Yaiche, R.R. Mazumdar, and C. Rosenberg, “A game theoretic frame- work for bandwidth allocation and pricing in broadband networks,” IEEE/ACM Trans. Networking, vol. 8, pp. 2-14, Oct. 2000.
40. T.V. Lakshman and U. Madhow, “The performance of TCP/IP for networks with high bandwidth-delay products and random loss,” IEEE/ACM Trans. Net- working,vol.5, pp. 336-350,June1997.Available:http://www.ece.ucsb.edu/Fac- ulty/ Madhow/Publications/ton97.ps
41. M. Mathis, J. Semke, J. Mahdavi, and T. Ott, “The macroscopic behavior of the TCP congestion avoidance algorithm,” ACM Comput. Commun. Rev., vol. 27, no. 3, July 1997. Available: http://www.psc.edu/networking/papers/ model sub ccr97.ps
42. C. Hollot, V. Misra, D. Towsley, andW.-B. Gong. (Apr. 2001). On designing improved controllers for AQM routers supporting TCP flows, in Proc. IEEE Infocom. Available: http://www-net.cs.umass.edu/papers/papers.html
43. S.H. Low, F.Paganini, J.Wang, S.A. Adlakha, and J.C. Doyle, “Linear stability of TCP/RED and a scalable control,” in Proc. 39th Annual Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2001. Available: http://netlab.caltech.edu
44. S. Athuraliya and S.H. Low, “An empirical validation of a duality model of TCP and queue management algorithms,” in Proc. Winter Simulation Conf., Dec. 2001.
45. Steven H. Low, Fernando Paganini, and John C. Doyle , “Internet Congestion Control” in IEEE Control Systems Magazine 2002
46. JACOBSON, V. Congestion avoidance and control. In Proceedings of SIGCOMM ’88 (Stanford, CA, Aug. 1988), ACM.

Transmission Control Protocol/Internet Protocol (TCP/IP) Congestion Control Algorithms