| To: | Stephen Hemminger <shemminger@xxxxxxxx> |
|---|---|
| Subject: | Re: [RFC] TCP burst control |
| From: | "David S. Miller" <davem@xxxxxxxxxx> |
| Date: | Tue, 6 Jul 2004 16:04:47 -0700 |
| Cc: | netdev@xxxxxxxxxxx, rhee@xxxxxxxx |
| In-reply-to: | <20040706155858.11b368e6@xxxxxxxxxxxxxxxxxxxxx> |
| References: | <20040706155858.11b368e6@xxxxxxxxxxxxxxxxxxxxx> |
| Sender: | netdev-bounce@xxxxxxxxxxx |
On Tue, 6 Jul 2004 15:58:58 -0700 Stephen Hemminger <shemminger@xxxxxxxx> wrote: > When using advanced congestion control it is possible for TCP to decide that > it has a large window to fill with data right away. The problem is that if TCP > creates long bursts, it becomes unfriendly to other flows and is more likely > to overrun intermediate queues. > > This patch limits the amount of data in flight. It came from BICTCP 1.1 but > it > has been generalized to all TCP congestion algorithms. It has had some > testing, > but needs to be more widely tested. Both the New Reno and Westwood+ algorithms implement rate-halving to solve this problem. Why can't BICTCP use that instead of this special burst control hack? |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | PLS help fix: recent 2.6.7 won't connect to anything Re: [PATCH] fix tcp_default_win_scale., bert hubert |
|---|---|
| Next by Date: | Re: [PATCH] fix tcp_default_win_scale., Redeeman |
| Previous by Thread: | [RFC] TCP burst control, Stephen Hemminger |
| Next by Thread: | RE: [RFC] TCP burst control, Injong Rhee |
| Indexes: | [Date] [Thread] [Top] [All Lists] |