Re: [iccrg] Fairness mechanism of BBRv2

Neal Cardwell <ncardwell@google.com> Thu, 28 March 2019 17:19 UTC

Return-Path: <ncardwell@google.com>
X-Original-To: iccrg@ietfa.amsl.com
Delivered-To: iccrg@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 024B512027B for <iccrg@ietfa.amsl.com>; Thu, 28 Mar 2019 10:19:11 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -17.501
X-Spam-Level:
X-Spam-Status: No, score=-17.501 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIMWL_WL_MED=-0.001, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, ENV_AND_HDR_SPF_MATCH=-0.5, RCVD_IN_DNSWL_NONE=-0.0001, SPF_PASS=-0.001, URIBL_BLOCKED=0.001, USER_IN_DEF_DKIM_WL=-7.5, USER_IN_DEF_SPF_WL=-7.5] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key) header.d=google.com
Received: from mail.ietf.org ([4.31.198.44]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id MLvTjoJJgeqb for <iccrg@ietfa.amsl.com>; Thu, 28 Mar 2019 10:19:08 -0700 (PDT)
Received: from mail-ot1-x329.google.com (mail-ot1-x329.google.com [IPv6:2607:f8b0:4864:20::329]) (using TLSv1.2 with cipher ECDHE-RSA-AES128-GCM-SHA256 (128/128 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id AB5E112002F for <iccrg@irtf.org>; Thu, 28 Mar 2019 10:19:08 -0700 (PDT)
Received: by mail-ot1-x329.google.com with SMTP id d24so4547222otl.11 for <iccrg@irtf.org>; Thu, 28 Mar 2019 10:19:08 -0700 (PDT)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=google.com; s=20161025; h=mime-version:references:in-reply-to:from:date:message-id:subject:to :cc; bh=+80iJagWrUYkB5A7XxVVmmZzKXbH4Runjtr2WN/XogA=; b=F0YF0Y47jods4lB8nr2EiNCttGaAfr0DbGVeSB79KgC5z2jwcHRxgwR6xkTmPX0bu5 oCpqChMx1SAYxRFVojXwASN5FiRM+AHnDVJTseMe5BLj5nuDQEw6utrXIfZ2SwKnxq2K e0FeEC+5s4beNapvfpgTlJgrNdi0QPVnPAlvVUWE82IQcUpAsmGNiXJPjY3QcZXoLpnn rMP4yzqPqA8Ie1f/X8swFRiLe5LpAvDwhlhzPlh5s667Vc9o5u4bl4mejY1Mt1O4k0Ql U8JqEpK8o5qjgJP/ToFDb0VEakF7IZBP+3wQew0+JYLbG1Mqyi4j9RVcOns50UiragkV fgnQ==
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=+80iJagWrUYkB5A7XxVVmmZzKXbH4Runjtr2WN/XogA=; b=X+v6v7XuKG0E3kBef4yzuMpeeACGSP/4+DEsgiHXd7MXDxb3N9tjIaPtTBMw2GgOjI iMUTm62+EAaBOun3QbC0j53bW3T6R7Z7UzzOR3grc73zOTUoA+riT+5KKWnFCude82ws g+sJReih0Pci0+HuCOlQqzliGEjzetf4FsQm+PT0arPhplIhuwAaeG7hcbHZFeCeDhSu 2xftvQN+05e60pH3sP/zNzIwYGqmFt6jNLQUSr6Y3eQ1+V/EXruovEPg0hHzPcriCEpZ /ANgJ0v7ex6UdAMRI1G1YrWqGOehWNWvOnedOJiav7ukk8LZ5pkogRWy9VCsnPMtLSWu 9URg==
X-Gm-Message-State: APjAAAU1oDD2GY/29MdBcsE3GaSWCvr0T61VrYu34HeT1W/EfVRSDJGG Nr+HudWEq4BxYPmdcaE6J+u3mDhwTHKNaiXU/U0GPzBhdbChHFo3
X-Google-Smtp-Source: APXvYqxDAJyY6jdIQsbFn0/vEpsXOn+XfrmAD3MzqlSf76HQ8d7s9+qE16IocMTcOjuDvgmg9+rRx3s/wdg89BsUuHE=
X-Received: by 2002:a9d:6503:: with SMTP id i3mr7094313otl.73.1553793547493; Thu, 28 Mar 2019 10:19:07 -0700 (PDT)
MIME-Version: 1.0
References: <2992479c-d4bd-9647-384f-cad5f5b119bf@kit.edu>
In-Reply-To: <2992479c-d4bd-9647-384f-cad5f5b119bf@kit.edu>
From: Neal Cardwell <ncardwell@google.com>
Date: Thu, 28 Mar 2019 18:18:49 +0100
Message-ID: <CADVnQynMDGpa54XL3L12H56asS+Y5E3UFimmS2d9RoEKPeDpeA@mail.gmail.com>
To: Mario Hock <mario.hock@kit.edu>
Cc: "iccrg@irtf.org" <iccrg@irtf.org>
Content-Type: text/plain; charset="UTF-8"
Archived-At: <https://mailarchive.ietf.org/arch/msg/iccrg/LuLLzDXfEBRxBGcO_J7ToNlVTWk>
Subject: Re: [iccrg] Fairness mechanism of BBRv2
X-BeenThere: iccrg@irtf.org
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: "Discussions of Internet Congestion Control Research Group \(ICCRG\)" <iccrg.irtf.org>
List-Unsubscribe: <https://www.irtf.org/mailman/options/iccrg>, <mailto:iccrg-request@irtf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/iccrg/>
List-Post: <mailto:iccrg@irtf.org>
List-Help: <mailto:iccrg-request@irtf.org?subject=help>
List-Subscribe: <https://www.irtf.org/mailman/listinfo/iccrg>, <mailto:iccrg-request@irtf.org?subject=subscribe>
X-List-Received-Date: Thu, 28 Mar 2019 17:19:11 -0000

Hi Mario,

Yes, that's right. The basic idea is:

(a) In a bottleneck that is providing loss or ECN signals, the BBRv2
flows will be doing a MD (multiplicative decrease) in the volume of
in-flight data (cwnd). As with the MD in Reno or CUBIC, this leaves an
amount of unused headroom (in the buffer and/or bottleneck link) that
is larger for high-rate flows, and smaller for low-rate flows. So the
convergence dynamics are somewhat analogous to CUBIC, which also uses
an MD and then super-linear increase process.

(b) In a bottleneck that has a deep buffer and is not providing loss
or ECN signals, the BBRv2 flows will be converging toward approximate
fairness using the same MI/MD  rate-based scheme used in BBRv1. The
basic reason that the flows pull toward fairness is that in each round
of probing, the MI probing from small flows produces a larger
proportional increase in their bandwidth estimate than does the MI
probing from large flows. Here the dynamics are a bit analogous to a
market with a fixed-rate set of sales transactions; if all the players
are trying to increase their market share (sales rate) by stocking
shelves with an MI relative to their sales in the last interval, the
small start-up producers will find it much easier to grow
multiplicatively for a while, while the bigger players will end up
noticing their market share is shrinking multiplicatively due to
losing customers to the smaller players.

I believe the (a) part is fairly closely analogous to the essence of
the well-studied CUBIC dynamics. For the (b) part, we have an
algebraic analysis and simulation scripts/graphs, if there is
interest. I might be able to post those after the IETF if there is
interest.

best,
neal


On Thu, Mar 28, 2019 at 5:30 PM Mario Hock <mario.hock@kit.edu> wrote:
>
> Neal,
>
> as just discussed during the ICCRG session (jabber question), can you
> give some details about the "convergence to fairness" mechanism of BBRv2
> (intra-protocol)?
>
> Did I get you right that either MD (multiplicative decrease) or MI
> (multiplicative increase) leads to fairness, depending on buffer size?
>
> Also, did you mean increase/decrease of CWnd or of rate?
>
> Best, Mario
>
> _______________________________________________
> iccrg mailing list
> iccrg@irtf.org
> https://www.irtf.org/mailman/listinfo/iccrg