Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 10^6 bits per second. The propagation speed of the media is 4 × 10^6 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 10^7 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the range of sequence numbers?Please explain in detail @pritam prasun
Only video that successfully explained go back n you got a positive acknoledgement from my side
what a video man, finally I understan this topic. Thank so much
Thanks bunch!
Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 10^6 bits per second. The propagation speed of the media is 4 × 10^6 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 10^7 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible.
What is the range of sequence numbers?Please explain in detail
@pritam prasun
Thanks a lot bro😊
Great video! thanks a lot! :)
you're the best. thank you SO much.
What will be the sequence if cumulative ack is used with T(ack) equals to time to reach 4 packets
doesn't GBN use cumulative acknowledgement?
thank you so much. ass saved successfully.
Why don't you use cumulative acknowledgement?
why do we get the first Ack after the transmission of the last packet ? It depends on the RTT so if for example RTT and Ts =1 we will get it inbetween
#notification squad
somthing is wrong
good example, poor drawing
haha