From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail-ed1-x52f.google.com (mail-ed1-x52f.google.com [IPv6:2a00:1450:4864:20::52f]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by lists.bufferbloat.net (Postfix) with ESMTPS id 25CE03CB35 for ; Thu, 7 Jan 2021 14:21:10 -0500 (EST) Received: by mail-ed1-x52f.google.com with SMTP id cw27so8845642edb.5 for ; Thu, 07 Jan 2021 11:21:10 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=ucdavis.edu; s=google; h=mime-version:references:in-reply-to:from:date:message-id:subject:to :cc; bh=r5XhvIRpi5XUWOZEJGc97ZRo77r5rQh4FPUYuJCDybA=; b=CjffkChfgXFxVJKqsqaMfL4SCpUZUtYLqNLtnCcgP5nVXD6Qlg8ZMYIuRzoIzVWn6o NLe8uD1cS4gxNSdpciI7Tyvu+OjDpVkaIIyCc5X/M0W5YoPU6al+5qh/G/mJ2GRMJS5L ZeMOhQBvv25Ks6H036BHpGceWRALnyIBODOP0= X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:references:in-reply-to:from:date :message-id:subject:to:cc; bh=r5XhvIRpi5XUWOZEJGc97ZRo77r5rQh4FPUYuJCDybA=; b=DTqdg6JMgwoUUtvwdtGk51nuivIygOGwQ/mE0WjYGvuviuiWBAQJepMRmXvxoxVq8e 4Q93HWXqL1aKAo8LoqokRANNur1Pk1yg3wa3EyKbXbhsTVycMehTrC4V5arW3zBWyBQC G2VqgI8BKIrDj25iiuTtJv3hFRuKN0hs4Lp2G8FN3jUj5bo9vf0vUgfCTNa40HYJLSrZ ruIZ4KzeUemKKsBTgizI87TmWfiuUq4ksr4WLYG+kIxCR5ys0u7Wm47xs2gHsh93bh0j 32szQ3zICGfBfrT/eHMuq7M/PeI4uIqctjWNKTAsJ16YdXP+pcdM157Zb0OmQH39n+nE Ihfw== X-Gm-Message-State: AOAM531oCJAjY2N+ZtseqYPDeq9vQR4KIf5eYnOZSDVg2MW5Vh4GKHw/ c8NWYb5zCI1XBNmC4H9zT4AJ9HKp5wE7FUPbmOvVcQ== X-Google-Smtp-Source: ABdhPJynEY/bLtcl5jBTzjrIOJ5fHdRDKhEI2PugZ+71YsS2l0Y6ZAEiPYunwhpG7e6OqBcq3Ajj6UeW0f0f4UNhzrs= X-Received: by 2002:a05:6402:a52:: with SMTP id bt18mr2788184edb.228.1610047269223; Thu, 07 Jan 2021 11:21:09 -0800 (PST) MIME-Version: 1.0 References: In-Reply-To: From: Taran Lynn Date: Thu, 7 Jan 2021 11:20:58 -0800 Message-ID: To: Dave Taht Cc: bloat , codel@lists.bufferbloat.net, ECN-Sane , Make-Wifi-fast , flent-users , BBR Development , ghosal@cs.ucdavis.edu Content-Type: multipart/alternative; boundary="0000000000008de08b05b854572a" X-Mailman-Approved-At: Thu, 07 Jan 2021 14:22:56 -0500 Subject: Re: [Bloat] D* tcp looks pretty good, on paper X-BeenThere: bloat@lists.bufferbloat.net X-Mailman-Version: 2.1.20 Precedence: list List-Id: General list for discussing Bufferbloat List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Thu, 07 Jan 2021 19:21:10 -0000 --0000000000008de08b05b854572a Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable The source can be found at https://github.com/lambda-11235/tcp_davis . The code mentioned in the paper can be found under the tag "arxiv_2020". The current master branch has an additional stable mode that I was testing out. On Thu, Jan 7, 2021 at 10:35 AM Dave Taht wrote: > See: https://arxiv.org/pdf/2012.14996.pdf > > Things I really like: > > * they used flent > * Using "variance" as the principal signal. This is essentially one of > the great unpublished and unanalyzed improvements on the minstrel > algorithm as well > * Conventional ecn response > * outperforms bbr on variable links > > Only negative so far is I haven't found any published source to it. :( > > Otherwise a very promising start to a year. > > "The choice of feedback mechanism between delay and packet loss has > long been a point of contention in TCP congestion control. This has > partly been resolved, as it has become increasingly evident that delay > based methods are needed to facilitate modern interactive web > applications. However, what has not been resolved is what control > should be used, with the two candidates being the congestion window > and the pacing rate. BBR is a new delay based congestion control > algorithm that uses a pacing rate as its primary control and the > congestion window as a secondary control. We propose that a congestion > window first algorithm might give more desirable performance > characteristics in situations where latency must be minimized even at > the expense of some loss in throughput. To evaluate this hypothesis we > introduce a new congestion control algorithm called TCP D*, which is a > congestion window first algorithm that adopts BBR's approach of > maximizing delivery rate while minimizing latency. In this paper, we > discuss the key features of this algorithm, discuss the differences > and similarity to BBR, and present some preliminary results based on a > real implementation." > > > > > -- > "For a successful technology, reality must take precedence over public > relations, for Mother Nature cannot be fooled" - Richard Feynman > > dave@taht.net CTO, TekLibre, LLC Tel: 1-831-435-0729 > --0000000000008de08b05b854572a Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable

The source can be found at https://github.com/lambda-11235/tcp_davis .

The code mentioned in the paper can be found under the tag=20 "arxiv_2020". The current master branch has an additional stable = mode=20 that I was testing out.


= On Thu, Jan 7, 2021 at 10:35 AM Dave Taht <dave.taht@gmail.com> wrote:
See: https://arxiv.org/pdf/2012.149= 96.pdf

Things I really like:

* they used flent
* Using "variance" as the principal signal. This is essentially o= ne of
the great unpublished and unanalyzed improvements on the minstrel
algorithm as well
* Conventional ecn response
* outperforms bbr on variable links

Only negative so far is I haven't found any published source to it. :(<= br>
Otherwise a very promising start to a year.

"The choice of feedback mechanism between delay and packet loss has long been a point of contention in TCP congestion control. This has
partly been resolved, as it has become increasingly evident that delay
based methods are needed to facilitate modern interactive web
applications. However, what has not been resolved is what control
should be used, with the two candidates being the congestion window
and the pacing rate. BBR is a new delay based congestion control
algorithm that uses a pacing rate as its primary control and the
congestion window as a secondary control. We propose that a congestion
window first algorithm might give more desirable performance
characteristics in situations where latency must be minimized even at
the expense of some loss in throughput. To evaluate this hypothesis we
introduce a new congestion control algorithm called TCP D*, which is a
congestion window first algorithm that adopts BBR's approach of
maximizing delivery rate while minimizing latency. In this paper, we
discuss the key features of this algorithm, discuss the differences
and similarity to BBR, and present some preliminary results based on a
real implementation."




--
"For a successful technology, reality must take precedence over public=
relations, for Mother Nature cannot be fooled" - Richard Feynman

dave@taht.net <Da= ve T=C3=A4ht> CTO, TekLibre, LLC Tel: 1-831-435-0729
--0000000000008de08b05b854572a--