tcp congestion control over local area network using multiple routers and algorithms
M.LAKSHMI,A.SARANYA
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:3 Issue:2 Year: 25 August,2014 Pages:375-382
Abstract
As a result of its strict adherence to end-to-end congestion control, the current Internet suffers from two maladies: Congestion collapse from undelivered packets, and unfair allocations of bandwidth between competing traffic flows. The first malady-congestion collapse from undelivered packets-arises when packets that are dropped before reaching their ultimate continually consume bandwidth destinations. The second malady-unfair bandwidth allocation to competing network flows-arises in the Internet for a variety of reasons, one of which is the existence of applications that do not respond properly to congestion. Adaptive applications that respond to congestion by rapidly reducing their transmission rates are likely to receive unfairly small bandwidth allocations when competing with unresponsive applications. The TCP algorithm, for instance, inherently causes each TCP flow to receive a bandwidth that is inversely proportional to its round-trip time. Hence, TCP connections with short round-trip times may receive unfairly large allocations of network bandwidth when compared to connections with longer round-trip times.
Kewords
TCP/IP.
Reference
[1] D. Bertsekas and R. Gallager, Data Networks, second edition, Prentice Hall, 1987 [2] Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queuing Algorithm,” in Proc. of ACM SIGCOMM, September 1989, pp. 1–12. [3] Parekh and R. Gallager, “A Generalized Processor Sharing Approach to Flow Control – the Single Node Case,” IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 344–357, June 1993. [4] R. Jain, S. Kalyanaraman, R. Goyal, S. Fahmy, and R. Viswanathan, “ERICA Switch Algorithm: A Complete Description,” ATM Forum Document 96- 1172, Traffic Management WG, August 1996 [5] W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms,” RFC 2001, IETF, January 1997 [6] Lin and R. Morris, “Dynamics of Random Early Detection,” in Proc. Of ACM SIGCOMM, September 1997, pp. 127–137. [7] Suter, T.V. Lakshman, D. Stiliadis, and A. Choudhury, “Design Considerations for Supporting TCP with Per-Flow Queuing,” in Proc. of IEEE Infocom ’98, March 1998, pp. 299–305. [8] B. Braden et al., “Recommendations on Queue Management and Congestion Avoidance in the Internet,” RFC 2309, IETF, April 1998. [9] D. Clark and W. Fang, “Explicit Allocation of Best-Effort Packet Delivery Service,” IEEE/ACM Transactions on Networking, vol. 6, no. 4, pp. 362– 373, August 1998.
