Loading...
Please wait, while we are loading the content...
Similar Documents
TCP modeling in the presence of nonlinear window growth (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Barakat, Chadi Nunez-Queija, Rudesindo Avrachenkov, Kostia Altman, Eitan |
| Abstract | Introduction TCP congestion control is often analyzed using linear-increase multiplicative-decrease models for window variation [2,6,8,9,13]. These models assume that the window increases linearly with time until a congestion occurs. At the moments of congestion, they assume that the window decreases multiplicatively by a factor of one half. The average round-trip time (denoted RTT ) is used to calculate the window increase rate between congestion events. In particular, the window increase rate is taken equal to 1/(bRTT ) packets/s, where b is the number of packets covered by a TCP acknowledgement (ACK). This simple model for window variation holds on long-distance paths where the throughput (that is, the average transmission rate or the ratio of the total number of packets transmitted and the connection duration) of a TCP connection is small compared to the total bandwidth. However, on short-distance paths where |
| File Format | |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Average Transmission Rate Denoted Rtt Tcp Modeling Simple Model Total Number Average Round-trip Time Linear-increase Multiplicative-decrease Model Tcp Connection Introduction Tcp Congestion Control Long-distance Path Connection Duration Congestion Event Short-distance Path Tcp Acknowledgement Nonlinear Window Growth Window Increase Rate Window Variation Total Bandwidth |
| Content Type | Text |
