Queueing theory for TCP Preloader

Queueing theory for TCP - PowerPoint PPT Presentation


  • 218 Views
  • Updated On :
  • Presentation posted in: General

DJW 2007 2/24. . if (seqno > _last_acked) {if (!_in_fast_recovery) {_last_acked = seqno;_dupacks = 0;inflate_window();send_packets(now);_last_sent_time = now;return;}if (seqno < _recover) {uint32_t new_data = seqno - _last_acked;_last_acked = seqno;if (new_data < _cwnd) _cwnd -= new_data; else _cwnd=0;_cwnd = _mss;retransmit_packet(now);send_packets(now);return;}uint32_t flightsize = _highest_sent - seqno;_cwnd = min(_ssthresh, flightsize _1141

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Queueing theory for TCP ' - Ava


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
ad
  • Login