[ns] help to implement ENFAT-AODV protocol
i have to implement enfat-aodv protocol using aodv packets,so i should add the backup route. pllz tell me what does this function must contain
Re: [ns] error in validate
> @alok9408 > validate A validate with no errors does not happen very often. One failed "group test" only is actually very good. As long as you can run all your required simulations : Nothing to worry about. Note : Validate uses 108 group tests (ns-2.35), to run the ~2,000 individual tests. See ns-2.35/tcl/test/. - -- View this message in context: http://network-simulator-ns-2.7690.n7.nabble.com/error-in-validate-tp30029p30030.html Sent from the ns-users mailing list archive at Nabble.com.
[ns] error in validate
sir, I am getting error on validation time: "validate overall report: some tests failed: ./test-all-tcpLinux " how to erro thank you
Re: [ns] Which NS2 Source file should be modified to implement this Algorithm
> @Amodu Oluwatosin > TCP Congestion I guess you can compare your code with the old "tcp congestion" files for ns-2.30 http://www.mathcs.emory.edu/~cheung/Courses/558/Syllabus/06-Extend-NS/TCP.html Or / and the patches : congestion_ns230.patch https://drive.google.com/file/d/0B7S255p3kFXNcTJ4SU81N0ctYk0/view?usp=sharing congestion_ns235.patch https://drive.google.com/file/d/0B7S255p3kFXNcW0yY1VOZHhvRUU/view?usp=sharing - -- View this message in context: http://network-simulator-ns-2.7690.n7.nabble.com/Which-NS2-Source-file-should-be-modified-to-implement-this-Algorithm-tp30027p30028.html Sent from the ns-users mailing list archive at Nabble.com.
[ns] Which NS2 Source file should be modified to implement this Algorithm
Hi 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. #. 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 maximum Window and minimum window if (distance between current window and target window > maximum 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 you are willing to share. Thanks Regards