Embark on a journey of knowledge! Take the quiz and earn valuable credits.
Take A QuizChallenge yourself and boost your learning! Start the quiz now to earn credits.
Take A QuizUnlock your potential! Begin the quiz, answer questions, and accumulate credits along the way.
Take A QuizCourse Queries Syllabus Queries 3 years ago
User submissions are the sole responsibility of contributors, with TuteeHUB disclaiming liability for accuracy, copyrights, or consequences of use; content is for informational purposes only and not professional advice.
No matter what stage you're at in your education or career, TuteeHUB will help you reach the next level that you're aiming for. Simply,Choose a subject/topic and get started in self-paced practice sessions to improve your knowledge and scores.
Ready to take your education and career to the next level? Register today and join our growing community of learners and professionals.
Your experience on this site will be improved by allowing cookies. Read Cookie Policy
Your experience on this site will be improved by allowing cookies. Read Cookie Policy
manpreet
Best Answer
3 years ago
Warm greetings to you,
Please I would like to find out where I need to adjust in the ns2 source code in order to implement the TCP algorithm below. It is a variant of TCP AIMD algorithm called TCP - BIAD
#................................................................................................................. if (ACK recieved) call routine function () if congestion window <= slow start threshold increment congestion window by 1 else set Minimum window = congestion window set target window = Average of max. Window and min. window if(dist. btw current window & target window > max.increment) set S to maximum increment else if (distance between current window and target window <=1) set S to 1 else set S to distance between current window and target window end if congestion window = congestion window + S/congestion window end if end if #........................................................................................................................... Algorithm after a single packet is Lost #.............................................................................................................................. if ( three DUPACKs are recieved) Maximum window = Congestion Window slowstart threshold = max (2, B x Minimum Roundtriptime)/ Pipe Size of bottleneck link during congestion congestion window = slow start threshold end if #.......................................................................................................................................I am new to this area so I will appreciate all necessary and related information materials and links you are willing to share.