@sharddhagami   because 8 ms ⇒ 8*10^6 ns.

21 Jan 2017 - 11:22am
20 Jan 2017 - 12:25am

No it is 72.

5 Jan 2017 - 8:23pm

Where you studied RTT = TT+2*PT ?
As per give in Kurose and Ross it is RTT defined as time it takes for a small packet to travel from client to server and then back to the client. The RTT includes packet-propagation delays, packet-queuing delays in intermediate routers and switches, and packet-processing delays. As we consider other delays zero so it is only PT+PT.

5 Jan 2017 - 5:27pm

Yes!
1 Collision: (0,0)(1,1)(2,2)(3,3) {4/64}.
2 B wins the race: (1,0)(2,0)(3,0)(2,1)(3,1)(3,2) {6/64}

5 Jan 2017 - 4:27pm

Nice explanation!
Also here is some animation for GBN and SR.
May be this is helpful too!
http://www.ccs-labs.org/teaching/rn/animations/gbn_sr/

5 Jan 2017 - 3:48pm

Consider an example {<M> | M is a TM and and L(M) = {00,11} }
The Rice's Theorem states that as this property is non-trivial property so it is undecidable. But we can say we can give this finite set to TM and find whether TM accept these strings or not. Guess what we can't find out since TM can loop forever on some strings so this is undecidable.

http://gatecse.in/rices-theorem/

8 Aug 2016 - 5:55am