![]() #Reset the bytes_ values on the traffic sinks #Calculate the bandwidth (in MBit/s) and write it to the files #How many bytes have been received by the traffic sinks? #Set the time after which the procedure should be called again $ns duplex-link-op $n3 $n5 orient right-down $ns duplex-link-op $n3 $n4 orient right-up $ns duplex-link-op $n1 $n2 orient right-up $ns duplex-link-op $n0 $n2 orient right-down $ns duplex-link $n3 $n5 2Mb 10ms DropTail $ns duplex-link $n3 $n4 2Mb 10ms DropTail $ns duplex-link $n2 $n3 1.7Mb 20ms DropTail $ns duplex-link $n1 $n2 2Mb 10ms DropTail $ns duplex-link $n0 $n2 2Mb 10ms DropTail #Open the trace files for Xgraph and out.nam for namĮxec xgraph out_ out_ -geometry 600x400 & #Define different colors for data flows (for NAM) ![]() Also the bandwidth of L2 has selected in such a way that it becomes the bottleneck link and the "record" procedure has used to measure the throughput at the receivers. This script simulates two TCP flows one between n0 and n4 and one between n1 and n5. ![]() How two TCP flows compete for the bandwidth
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |