Year-end Sale % OFF 
Abstract
Concerning the unsmooth growth of congestion window at congestion avoidance phase of TCP Reno,the traditional AIMD algorithm was researched and an improved congestion avoidance algorithm was proposed: a logarithmic function based on the growth of congestion window was adopted.In this new algorithm,additive factor is usually increased quickly when the network is doing well and less so when network situation is getting to congestion.The mathematical analysis shows the feasibility of the new algorithm,and its throughput,fairness and friendliness were evaluated by NS simulation.The simulation results show the effectiveness of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
