{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.manongdao.com/data/attach/logo/logo.png', '推荐 该账号已被封号 的问题《Go-Back-N window size》','https://www.manongdao.com/q-1230032.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
Why in TCP's Go-Back-N Algorithm window size(N) has to be smaller than the sequence number space(S): S>N? I tried figuring it out myself but don't quiet get it
相关问题
- IPAddress.[Try]Parse parses 192.168 to 192.0.0.168
- Finding k smallest elements in a min heap - worst-
- binary search tree path list
- High cost encryption but less cost decryption
- What would prevent code running in a Docker contai
相关文章
- Socket编程 TCP方式发送时间有点长
- What are the problems associated to Best First Sea
- Coin change DP solution to keep track of coins
- RMI Threads prevent JVM from exiting after main()
- Algorithm for partially filling a polygonal mesh
- Robust polygon normal calculation
- Algorithm for maximizing coverage of rectangular a
- fsc.exe is very slow because it tries to access cr
Assume that sequence space was four (sequence numbers 0,1,2,3). Lets say window size was also 4. Sender sends 4 packets with sequence numbers (0,1,2,3). Receiver receives all four packets. So it sends 4 acknowledgements(0,1,2,3). Now assume all acknowledgements are lost. Sender will resend all four packets but receiver will assume they're the new ones. To avoid confusions arising from lost acknowledgements, we keep n < s