Re: [v6ops] Mirja Kühlewind's Discuss on draft-ietf-v6ops-rfc6555bis-05: (with DISCUSS and COMMENT)

"Mirja Kuehlewind (IETF)" <ietf@kuehlewind.net> Sat, 21 October 2017 00:42 UTC

Return-Path: <ietf@kuehlewind.net>
X-Original-To: v6ops@ietfa.amsl.com
Delivered-To: v6ops@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 678EB13445C for <v6ops@ietfa.amsl.com>; Fri, 20 Oct 2017 17:42:26 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.001
X-Spam-Level:
X-Spam-Status: No, score=-2.001 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1, DKIM_VALID_AU=-0.1, SPF_PASS=-0.001] autolearn=unavailable autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); domainkeys=pass (1024-bit key) header.from=ietf@kuehlewind.net header.d=kuehlewind.net
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 KVeUYv8wflXs for <v6ops@ietfa.amsl.com>; Fri, 20 Oct 2017 17:42:25 -0700 (PDT)
Received: from kuehlewind.net (kuehlewind.net [83.169.45.111]) (using TLSv1 with cipher DHE-RSA-AES256-SHA (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id 56E25134457 for <v6ops@ietf.org>; Fri, 20 Oct 2017 17:42:24 -0700 (PDT)
DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=default; d=kuehlewind.net; b=rg6ggMEn9pHetylRU0OxmL5Klf1d0zK57K3loPABBdyp3yR7Swr2EKgeK0HOX6+3dsI2B0AQL+GS91Et2YMW3gpHiz2ksJPhOOJWT3DfE0ifDa8d2K0RQsQVXqJQtRhFgfRkyCOG/Ls9PTsiT2tEBUJU5sqIarwi0Yqx9csW0rI=; h=Received:Received:Content-Type:Mime-Version:Subject:From:In-Reply-To:Date:Cc:Content-Transfer-Encoding:Message-Id:References:To:X-Mailer:X-PPP-Message-ID:X-PPP-Vhost;
Received: (qmail 26440 invoked from network); 21 Oct 2017 02:35:41 +0200
Received: from p5dec2db8.dip0.t-ipconnect.de (HELO ?192.168.178.33?) (93.236.45.184) by kuehlewind.net with ESMTPSA (DHE-RSA-AES256-SHA encrypted, authenticated); 21 Oct 2017 02:35:41 +0200
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Mac OS X Mail 10.3 \(3273\))
From: "Mirja Kuehlewind (IETF)" <ietf@kuehlewind.net>
In-Reply-To: <EC587186-ED84-4F41-826F-D47037102366@apple.com>
Date: Sat, 21 Oct 2017 02:35:40 +0200
Cc: Ron Bonica <rbonica@juniper.net>, draft-ietf-v6ops-rfc6555bis@ietf.org, v6ops-chairs@ietf.org, The IESG <iesg@ietf.org>, v6ops@ietf.org
Content-Transfer-Encoding: quoted-printable
Message-Id: <80B25C07-9CEE-436E-8122-5A7252DAA5E7@kuehlewind.net>
References: <150816014000.466.3576592756007530260.idtracker@ietfa.amsl.com> <EC587186-ED84-4F41-826F-D47037102366@apple.com>
To: Tommy Pauly <tpauly@apple.com>
X-Mailer: Apple Mail (2.3273)
X-PPP-Message-ID: <20171021003541.26431.82668@lvps83-169-45-111.dedicated.hosteurope.de>
X-PPP-Vhost: kuehlewind.net
Archived-At: <https://mailarchive.ietf.org/arch/msg/v6ops/H7hr0qqLaQKRrgNuB4iiH9K_gCE>
Subject: Re: [v6ops] =?utf-8?q?Mirja_K=C3=BChlewind=27s_Discuss_on_draft-ietf?= =?utf-8?q?-v6ops-rfc6555bis-05=3A_=28with_DISCUSS_and_COMMENT=29?=
X-BeenThere: v6ops@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: v6ops discussion list <v6ops.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/v6ops>, <mailto:v6ops-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/v6ops/>
List-Post: <mailto:v6ops@ietf.org>
List-Help: <mailto:v6ops-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/v6ops>, <mailto:v6ops-request@ietf.org?subject=subscribe>
X-List-Received-Date: Sat, 21 Oct 2017 00:42:26 -0000

Hi Tommy,

I will have a closer look on Monday. Just one small nit that can be fixed later as well: the abstract should also mention that this doc obsoletes 6555.

Mirja


> Am 20.10.2017 um 23:51 schrieb Tommy Pauly <tpauly@apple.com>om>:
> 
> Hi Mirja,
> 
> Thanks very much for the helpful feedback! I've just posted a new version here:
> 
> https://tools.ietf.org/html/draft-ietf-v6ops-rfc6555bis-06
> https://www.ietf.org/rfcdiff?url2=draft-ietf-v6ops-rfc6555bis-06
> 
> Direct responses inline.
> 
> Thanks!
> Tommy
> 
>> On Oct 16, 2017, at 6:22 AM, Mirja Kühlewind <ietf@kuehlewind.net> wrote:
>> 
>> Mirja Kühlewind has entered the following ballot position for
>> draft-ietf-v6ops-rfc6555bis-05: Discuss
>> 
>> When responding, please keep the subject line intact and reply to all
>> email addresses included in the To and CC lines. (Feel free to cut this
>> introductory paragraph, however.)
>> 
>> 
>> Please refer to https://www.ietf.org/iesg/statement/discuss-criteria.html
>> for more information about IESG DISCUSS and COMMENT positions.
>> 
>> 
>> The document, along with other ballot positions, can be found here:
>> https://datatracker.ietf.org/doc/draft-ietf-v6ops-rfc6555bis/
>> 
>> 
>> 
>> ----------------------------------------------------------------------
>> DISCUSS:
>> ----------------------------------------------------------------------
>> 
>> I would totally be a yes on this document, but I would like to first discuss a
>> processing issue: I do not agree with the assessment that this draft should
>> obsolete RFC6555. The draft itself says: "This document expands on "Happy
>> Eyeballs" [RFC6555]..." which sounds to me like an update. Further I believe
>> RFC6555 is still a valid algorithm that can be used as specified, also RFC6555
>> provides probably more useful background info that is not captured by this new
>> draft. I would recommend to update instead. Also, in any case the obsolete or
>> update should to be mentioned in the abstract.
> 
> Based on our WG discussions and last call, we believe that obsoleting RFC 6555 is the correct status for this draft. A "simple" implementation of the 6555bis algorithm is still aligned with the algorithm in 6555, and we would like to see new implementations taking the nuances of the new algorithm description into account.
> 
> I added more explicit text to the Introduction to explain that this document is obsoleting RFC 6555, which should read more clearly now.
> 
>> 
>> 
>> ----------------------------------------------------------------------
>> COMMENT:
>> ----------------------------------------------------------------------
>> 
>> Question on the equation in section 5:
>> "MAX( 1.25 * RTT_MEAN + 4 * RTT_VARIANCE, 2 *RTT_MEAN )"
>> While it is not well explained how RTT_MEAN and RTT_VARIANCE are measured, I
>> would recommend to just use *3RTT instead (where RTT is the value you have
>> cached for a certain destination address, no matter how that has been
>> measured/calculated), as RFC2988 says:
>> 
>> "When the first RTT measurement R is made, the host MUST set
>> 
>>            SRTT <- R
>>            RTTVAR <- R/2
>>            RTO <- SRTT + max (G, K*RTTVAR)"
>> 
>> which translates to 3*R if you only have one value.
> 
> Very good point! The formula is what our implementation uses, but you're correct that it was not clear how to calculate the values described (which for us come from historical data).
> 
> I've re-worked that paragraph to simply make the point that the delay should correspond to the first SYN retransmission of the previous attempt, and point to RFC 6298 to describe the calculations involved.
> 
>> 
>> I also don't think that is is necessary to talk about exponential backoff. To
>> me that seems more confusing than helpful here.
> 
> This comment was added based on some discussion in the WG. I've re-worked this sentence to clarify that the delay should only be approximating the first SYN retransmission, and not any other RTT calculation or back off.
> 
>> 
>> However, it might be helpful to note that 3*RTT also means that in the best
>> case the handshake is already completed before you try the next address. And
>> further, I would assume that you might still want to have a fixed max default
>> value (of e.g. 300ms or 250ms?) because otherwise on paths where you have high
>> delay sequential probing might be too slow, no?
> 
> The following paragraph does indicate that implementations MUST have min and max values, and gives recommended values for these. I believe this should address your concern!
> 
>> 
>> 
>