Re: [re-ECN] FW: ConEx BoF announcement text
" Ilpo Järvinen " <ilpo.jarvinen@helsinki.fi> Thu, 22 October 2009 19:36 UTC
Return-Path: <ilpo.jarvinen@helsinki.fi>
X-Original-To: re-ecn@core3.amsl.com
Delivered-To: re-ecn@core3.amsl.com
Received: from localhost (localhost [127.0.0.1]) by core3.amsl.com (Postfix)
with ESMTP id 26D4B28C114 for <re-ecn@core3.amsl.com>;
Thu, 22 Oct 2009 12:36:36 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -5.092
X-Spam-Level:
X-Spam-Status: No, score=-5.092 tagged_above=-999 required=5 tests=[AWL=1.207,
BAYES_00=-2.599, MIME_8BIT_HEADER=0.3, RCVD_IN_DNSWL_MED=-4]
Received: from mail.ietf.org ([64.170.98.32]) by localhost (core3.amsl.com
[127.0.0.1]) (amavisd-new, port 10024) with ESMTP id f6PCW8iwAa4k for
<re-ecn@core3.amsl.com>; Thu, 22 Oct 2009 12:36:35 -0700 (PDT)
Received: from mail.cs.helsinki.fi (courier.cs.helsinki.fi [128.214.9.1]) by
core3.amsl.com (Postfix) with ESMTP id 1B54A3A6884 for <re-ecn@ietf.org>;
Thu, 22 Oct 2009 12:36:34 -0700 (PDT)
Received: from svm-3.cs.helsinki.fi (melkinkari.cs.helsinki.fi
[128.214.11.43]) (AUTH: PLAIN cs-relay, TLS: TLSv1/SSLv3,256bits,AES256-SHA)
by mail.cs.helsinki.fi with esmtp;
Thu, 22 Oct 2009 22:36:42 +0300 id 0006C55E.4AE0B44A.000016BB
Received: by svm-3.cs.helsinki.fi (Postfix, from userid 50795) id AC95515400A;
Thu, 22 Oct 2009 22:36:42 +0300 (EEST)
Received: from localhost (localhost [127.0.0.1]) by svm-3.cs.helsinki.fi
(Postfix) with ESMTP id 9870F114401; Thu, 22 Oct 2009 22:36:42 +0300 (EEST)
Date: Thu, 22 Oct 2009 22:36:41 +0300 (EEST)
From: "=?ISO-8859-15?Q?Ilpo_J=E4rvinen?=" <ilpo.jarvinen@helsinki.fi>
X-X-Sender: ijjarvin@melkinkari.cs.Helsinki.FI
To: Fred Baker <fred@cisco.com>
In-Reply-To: <F437BD07-581B-4542-ABDB-ABABEDC3B8DD@cisco.com>
Message-ID: <Pine.LNX.4.64.0910222140130.20686@melkinkari.cs.Helsinki.FI>
References: <4A916DBC72536E419A0BD955EDECEDEC0636399B@E03MVB1-UKBR.domain1.systemhost.net>
<4ADD187E.6000200@thinkingcat.com>
<200910221807.n9MI7P2a002071@bagheera.jungle.bt.co.uk>
<F437BD07-581B-4542-ABDB-ABABEDC3B8DD@cisco.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Cc: re-ECN unIETF list <re-ecn@ietf.org>
Subject: Re: [re-ECN] FW: ConEx BoF announcement text
X-BeenThere: re-ecn@ietf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: re-inserted explicit congestion notification <re-ecn.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/listinfo/re-ecn>,
<mailto:re-ecn-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/re-ecn>
List-Post: <mailto:re-ecn@ietf.org>
List-Help: <mailto:re-ecn-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/re-ecn>,
<mailto:re-ecn-request@ietf.org?subject=subscribe>
X-List-Received-Date: Thu, 22 Oct 2009 19:36:36 -0000
On Thu, 22 Oct 2009, Fred Baker wrote: > I'll argue something slightly different. It comes to the same endpoint, but > through a different observation. Some of us, you Bob especially, are very > familiar with this; others are perhaps less so. Bear with me. > > Jain's 1994 patent on congestion control defines two terms: the "cliff" and > the "knee" of a throughput curve. > > | > T | availabile capacity > h | --------------------------------------- > r | +---+ > u | knee/ \cliff > p | / \ > u | / \ > t | / \ > | / \ > |/ \ > |/ ---------------- > ----------------------------------------- > Window ---> > > As the TCP/SCTP window increases from zero to some value, throughput also > increases. That stops when the available capacity has been consumed; at that > point, even if the window grows, throughput does not. What increases instead > is RTT, because a queue grows. Up to this point I agree with this paragraph... > If window continues to increase, at some point the queue starts dropping > traffic, and throughput degrades. ...However, this is not a true claim. As long as no unnecessary work is not done at any bottleneck (and we don't have a shared resource such as a wireless channel), thoughput does _not_ degrade (at all!), even though many keep asserting that without much of a thought nowadays. Of course non-infinitely long flows would introduce some anomalities to calculations through which one could use to show that this claim is "true" but I think that's hardly what people usually mean when they make that claim that dropping implies throughput degradation. Somewhat related, for some reason there's a very common misconcept that drops imply poor performance. That is often stated as a fact without looking deeper into what really was the cause for sub-optimal performance, often that turns out to be something else when looked closely enough. I'd say that very often losses were, in fact, innocent. Quite often the blame would fall on constant factor MD (if one is honest enough to admit). Btw, your graph is not accurate (wrt. Jain), he's drawing a much sharper drop than you do at his "cliff" (so with ascii you'd have to use | at first to match him). I've some doubts about validity of that sharp angle too, so I find your graph is much more sensible (that is, as long as the resource is shared). > By definition, the window at the "knee" is smaller than the window at > the "cliff", but throughput is the same. > > Common TCP congestion control algorithms such as Reno and Cubic tune to the > cliff. That has the upside of maximizing throughput; it has the downside that > it is abusive to other applications such as voice/video (increased and > variable RTT, and induces loss), and to other TCP sessions. #include > <discussion of bittorent and why other users are negatively impacted by it> I think Bob doesn't agree with you here, he isn't saying that congestion is something bad but something nearly opposite. Bob's own words: "It would contradict this to say congestion is a problem - it's not - it's healthy and natural in a data network." ...It's just that if you keep doing that too much (beyond the congestion volume allocated for you), you would "suffer (if I've understood him right). ...So it has very little to do with operating in the "cliff" or "knee" in short timescales (unless of course you've already ran out of your quota). > Other TCP congestion control algorithms based on ECN, CalTech FAST, etc, try > to tune to the knee. This gets them exactly the same throughput including > support of very high rate applications but with a smaller window value and > therefore lower queue depth and lower probability of loss - both for > themselves and their competitors. It does so without negatively, or at least > AS negatively, impacting applications they compete with beyond seeking to > share the available capacity with them. I certainly agree with you here that low queuing delay is a desirable property too. ...However, I don't see how e.g., ECN alone could achieve low queue delay and high throughput at the same time, you'd need something more than that (mainly to remove the 0.5 factored MD). And after removing that, we'd get something close to what Matt Mathis is suggesting and that then does not anymore depend on ECN to work (though I think one could certainly avoid lots of loss recovering by signalling in early with ECN). -- i.
- [re-ECN] ConEx BoF announcement text philip.eardley
- [re-ECN] FW: ConEx BoF announcement text toby.moncaster
- Re: [re-ECN] FW: ConEx BoF announcement text Leslie Daigle
- Re: [re-ECN] FW: ConEx BoF announcement text Bob Briscoe
- Re: [re-ECN] FW: ConEx BoF announcement text Leslie Daigle
- Re: [re-ECN] FW: ConEx BoF announcement text Bob Briscoe
- Re: [re-ECN] FW: ConEx BoF announcement text Bob Briscoe
- Re: [re-ECN] FW: ConEx BoF announcement text philip.eardley
- Re: [re-ECN] FW: ConEx BoF announcement text toby.moncaster
- Re: [re-ECN] FW: ConEx BoF announcement text Leslie Daigle
- Re: [re-ECN] FW: ConEx BoF announcement text toby.moncaster
- Re: [re-ECN] FW: ConEx BoF announcement text bmanning
- Re: [re-ECN] FW: ConEx BoF announcement text Leslie Daigle
- Re: [re-ECN] FW: ConEx BoF announcement text Richard Bennett
- Re: [re-ECN] FW: ConEx BoF announcement text Richard Bennett
- Re: [re-ECN] FW: ConEx BoF announcement text toby.moncaster
- Re: [re-ECN] FW: ConEx BoF announcement text philip.eardley
- Re: [re-ECN] FW: ConEx BoF announcement text toby.moncaster
- Re: [re-ECN] FW: ConEx BoF announcement text Kwok Ho Chan
- Re: [re-ECN] FW: ConEx BoF announcement text João Taveira Araújo
- Re: [re-ECN] FW: ConEx BoF announcement text John Leslie
- Re: [re-ECN] FW: ConEx BoF announcement text Leslie Daigle
- Re: [re-ECN] FW: ConEx BoF announcement text Bob Briscoe
- Re: [re-ECN] FW: ConEx BoF announcement text Fred Baker
- Re: [re-ECN] FW: ConEx BoF announcement text Ilpo Järvinen
- Re: [re-ECN] FW: ConEx BoF announcement text Fred Baker
- Re: [re-ECN] FW: ConEx BoF announcement text Ilpo Järvinen
- Re: [re-ECN] FW: ConEx BoF announcement text Fred Baker
- Re: [re-ECN] FW: ConEx BoF announcement text Leslie Daigle
- Re: [re-ECN] FW: ConEx BoF announcement text Bob Briscoe
- Re: [re-ECN] FW: ConEx BoF announcement text Bob Briscoe
- Re: [re-ECN] FW: ConEx BoF announcement text Leslie Daigle
- Re: [re-ECN] FW: ConEx BoF announcement text João Taveira Araújo
- Re: [re-ECN] FW: ConEx BoF announcement text Ilpo Järvinen
- Re: [re-ECN] FW: ConEx BoF announcement text toby.moncaster
- Re: [re-ECN] FW: ConEx BoF announcement text Bob Briscoe
- Re: [re-ECN] FW: ConEx BoF announcement text John Leslie
- Re: [re-ECN] FW: ConEx BoF announcement text philip.eardley
- Re: [re-ECN] FW: ConEx BoF announcement text toby.moncaster
- Re: [re-ECN] FW: ConEx BoF announcement text philip.eardley