[alto] Fwd: New Version Notification for draft-gao-alto-routing-state-abstraction-06.txt

Kai Gao <gaok12@mails.tsinghua.edu.cn> Tue, 04 July 2017 14:57 UTC

Return-Path: <gaok12@mails.tsinghua.edu.cn>
X-Original-To: alto@ietfa.amsl.com
Delivered-To: alto@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id 538451320CF for <alto@ietfa.amsl.com>; Tue, 4 Jul 2017 07:57:37 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -4.202
X-Spam-Level:
X-Spam-Status: No, score=-4.202 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, HTML_MESSAGE=0.001, RCVD_IN_DNSWL_MED=-2.3, RP_MATCHES_RCVD=-0.001, SPF_HELO_PASS=-0.001, SPF_PASS=-0.001] autolearn=ham autolearn_force=no
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 Cjg6S8Fovkhh for <alto@ietfa.amsl.com>; Tue, 4 Jul 2017 07:57:33 -0700 (PDT)
Received: from tsinghua.edu.cn (smtp28.tsinghua.edu.cn [166.111.204.52]) by ietfa.amsl.com (Postfix) with ESMTP id C9D381320DD for <alto@ietf.org>; Tue, 4 Jul 2017 07:57:22 -0700 (PDT)
Received: from [192.168.1.3] (unknown [59.66.206.67]) by app1 (Coremail) with SMTP id CsxvpgC3BhPMrFtZbl+LAA--.9362S2; Tue, 04 Jul 2017 22:57:16 +0800 (CST)
References: <149910612490.22853.17548397015476987145.idtracker@ietfa.amsl.com>
To: IETF ALTO <alto@ietf.org>
From: Kai Gao <gaok12@mails.tsinghua.edu.cn>
X-Forwarded-Message-Id: <149910612490.22853.17548397015476987145.idtracker@ietfa.amsl.com>
Message-ID: <da91fafe-9bc6-8e32-c99d-0a3c36fab395@mails.tsinghua.edu.cn>
Date: Tue, 4 Jul 2017 22:57:17 +0800
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:52.0) Gecko/20100101 Thunderbird/52.2.1
MIME-Version: 1.0
In-Reply-To: <149910612490.22853.17548397015476987145.idtracker@ietfa.amsl.com>
Content-Type: multipart/alternative; boundary="------------E20CB474C036C47FCFB7E338"
Content-Language: en-US
X-CM-TRANSID: CsxvpgC3BhPMrFtZbl+LAA--.9362S2
X-Coremail-Antispam: 1UD129KBjvJXoWxCry5CryDKrW8Jw1DXry5urg_yoWrZw45pF 4fKr13Gw1kJw1UG397Ja1IvrWru3y8Ka9rGw15tw1vga90gFyktFn2yFWjvFyUCr95CFW2 v34jvr1UZayDAaDanT9S1TB71UUUUUUqnTZGkaVYY2UrUUUUjbIjqfuFe4nvWSU5nxnvy2 9KBjDU0xBIdaVrnRJUUUyEb7Iv0xC_Cr1lb4IE77IF4wAFF20E14v26r1j6r4UM7CY07I2 0VC2zVCF04k26cxKx2IYs7xG6rWj6s0DM7CIcVAFz4kK6r1j6r18M28lY4IEw2IIxxk0rw A2z4x0Y4vE2Ix0cI8IcVAFwI0_tr0E3s1l84ACjcxK6xIIjxv20xvEc7CjxVAFwI0_Gr1j 6F4UJwA2z4x0Y4vEx4A2jsIE14v26rxl6s0DM28EF7xvwVC2z280aVCY1x0267AKxVW0oV Cq3wAac4AC62xK8xCEY4vEwIxC4wAS0I0E0xvYzxvE52x082IY62kv0487Mc02F40Ex7xS 62IqYxC26I8Yz20kMcIj6xIIjxv20xvE14v26r1j6r18McIj6I8E87Iv67AKxVWUJVW8Jw Am72CE4IkC6x0Yz7v_Jr0_Gr1lF7xvr2IY64vIr41lc7I2V7IY0VAS07AlzVAYIcxG8wCY 02Avz4vE14v_Xryl42xK82IYc2Ij64vIr41lx2IqxVAqx4xG67AKxVWUGVWUWwC20s026x 8GjcxK67AKxVWUGVWUWwC2zVAF1VAY17CE14v26r1j6r15MIIYrxkI7VAKI48JMIIF0xvE 2Ix0cI8IcVAFwI0_Jr0_JF4lIxAIcVC0I7IYx2IY6xkF7I0E14v26r1j6r4UMIIF0xvE42 xK8VAvwI8IcIk0rVWrZr1j6s0DMIIF0xvEx4A2jsIE14v26r1j6r4UMIIF0xvEx4A2jsIE c7CjxVAFwI0_Jr0_GrUvcSsGvfC2KfnxnUUI43ZEXa7xUUe_gUUUUUU==
X-CM-SenderInfo: 5jdryi2s6ptxtovo32xlqjx3vdohv3gofq/
Archived-At: <https://mailarchive.ietf.org/arch/msg/alto/gK9ALV3w6TMwhEhCtjXsxWZRKes>
Subject: [alto] Fwd: New Version Notification for draft-gao-alto-routing-state-abstraction-06.txt
X-BeenThere: alto@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: "Application-Layer Traffic Optimization \(alto\) WG mailing list" <alto.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/alto>, <mailto:alto-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/alto/>
List-Post: <mailto:alto@ietf.org>
List-Help: <mailto:alto-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/alto>, <mailto:alto-request@ietf.org?subject=subscribe>
X-List-Received-Date: Tue, 04 Jul 2017 14:57:37 -0000

Dear ALTO Working Group,

We have submitted a new version of the routing state abstraction draft. 
As always, your thoughts and comments are highly appreciated.

In previous versions, this draft used to be closely coupled with the 
path vector extension and the flow cost extension. From version -04, we 
have restructured the draft for better clarity. Now this draft serves as 
a supplement of the path vector draft, which targets the problem of 
compressing path vectors to reduce communication overhead and to improve 
privacy protection.

For that purpose, we have introduced an algorithm named "equivalent 
transformation". The algorithm is the core of a conference paper 
published earlier this year which contains the proof of correctness and 
some evaluation results.

The equivalent transformation algorithm requires a step to find 
redundant bandwidth constraints. Knowing that there might exist other 
solutions, this draft includes a relatively simple yet useful algorithm 
as a reference implementation.

The additional client-side information can be used to further improve 
the effiency of the redundancy check algorithm. We have modified the 
design to make the style more consistent with the base ALTO protocol 
than the newly proposed flow-based cost service.

The draft in its current state is a valuable supplement to the path 
vector extension. The algorithms in this draft can be used with the 
straw man approached described in Section 1 as a standalone 
implementation of the path vector extension, and can also work with 
other path vector implementations as a post-processing step.

Since the path vector extension is now adopted as a working group draft, 
we would like to hear opinions on further actions on this draft.

Thanks!

Regards,

Kai



-------- Forwarded Message --------
Subject: 	New Version Notification for 
draft-gao-alto-routing-state-abstraction-06.txt
Date: 	Mon, 03 Jul 2017 11:22:04 -0700
From: 	internet-drafts@ietf.org
To: 	Yang Yang <yry@cs.yale.edu>du>, Chen Gu <gc19931011jy@gmail.com>om>, 
xinwang2014@hotmail.com <xinwang2014@hotmail.com>om>, Y. Richard Yang 
<yry@cs.yale.edu>du>, Xin Wang (Tony) <xinwang2014@hotmail.com>om>, Qiao Xiang 
<qiao.xiang@cs.yale.edu>du>, Kai Gao <gaok12@mails.tsinghua.edu.cn>cn>, 
G.Robert Chen <chenguohai@huawei.com>om>, G. Robert Chen 
<chenguohai@huawei.com>



A new version of I-D, draft-gao-alto-routing-state-abstraction-06.txt
has been successfully submitted by Qiao Xiang and posted to the
IETF repository.

Name:		draft-gao-alto-routing-state-abstraction
Revision:	06
Title:		A Recommendation for Compressing ALTO Path Vectors
Document date:	2017-07-04
Group:		Individual Submission
Pages:		23
URL:            https://www.ietf.org/internet-drafts/draft-gao-alto-routing-state-abstraction-06.txt
Status:         https://datatracker.ietf.org/doc/draft-gao-alto-routing-state-abstraction/
Htmlized:       https://tools.ietf.org/html/draft-gao-alto-routing-state-abstraction-06
Htmlized:       https://datatracker.ietf.org/doc/html/draft-gao-alto-routing-state-abstraction-06
Diff:           https://www.ietf.org/rfcdiff?url2=draft-gao-alto-routing-state-abstraction-06

Abstract:
    The path vector extension [I-D.ietf-alto-path-vector] has extended
    the original ALTO protocol [RFC7285] with the ability to represent a
    more detailed view of the network, containing not only end-to-end
    metrics but also information about shared bottlenecks.

    However, the view computed by straw man algorithms can contain
    redundant information and result in unnecessary communication
    overhead.  The situation gets even worse when certain ALTO extensions
    are enabled, for example, the incremental update extension
    [I-D.ietf-alto-incr-update-sse] which continuously pushes data
    changes to ALTO clients.  Redundant information can trigger
    unnecessary updates.

    In this document, an algorithm is described which can effectively
    reduce the redundancy in the network view while still providing the
    same information as in the original path vectors.  The algorithm is
    fully compatible with the path vector extension and has several by-
    products which can be leveraged by other extensions to achieve better
    performances.





Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

The IETF Secretariat