[Teas] teas: covering in-network path calculation Q.
Toerless Eckert <tte@cs.fau.de> Fri, 23 March 2018 09:54 UTC
Return-Path: <eckert@i4.informatik.uni-erlangen.de>
X-Original-To: teas@ietfa.amsl.com
Delivered-To: teas@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id E523112DA1C for <teas@ietfa.amsl.com>; Fri, 23 Mar 2018 02:54:06 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.854
X-Spam-Level:
X-Spam-Status: No, score=-2.854 tagged_above=-999 required=5 tests=[BAYES_00=-1.9, HEADER_FROM_DIFFERENT_DOMAINS=0.249, LOCALPART_IN_SUBJECT=1.107, RCVD_IN_DNSWL_MED=-2.3, T_RP_MATCHES_RCVD=-0.01] 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 GFo0NeROjtf8 for <teas@ietfa.amsl.com>; Fri, 23 Mar 2018 02:54:04 -0700 (PDT)
Received: from faui40.informatik.uni-erlangen.de (faui40.informatik.uni-erlangen.de [131.188.34.40]) (using TLSv1.2 with cipher AECDH-AES256-SHA (256/256 bits)) (No client certificate requested) by ietfa.amsl.com (Postfix) with ESMTPS id D059B12D7EC for <teas@ietf.org>; Fri, 23 Mar 2018 02:54:03 -0700 (PDT)
Received: from faui40p.informatik.uni-erlangen.de (faui40p.informatik.uni-erlangen.de [IPv6:2001:638:a000:4134::ffff:77]) by faui40.informatik.uni-erlangen.de (Postfix) with ESMTP id F081C58C4AE for <teas@ietf.org>; Fri, 23 Mar 2018 10:53:59 +0100 (CET)
Received: by faui40p.informatik.uni-erlangen.de (Postfix, from userid 10463) id D3405B0DDCA; Fri, 23 Mar 2018 10:53:59 +0100 (CET)
Date: Fri, 23 Mar 2018 10:53:59 +0100
From: Toerless Eckert <tte@cs.fau.de>
To: teas@ietf.org
Message-ID: <20180323095359.GY30215@faui40p.informatik.uni-erlangen.de>
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Disposition: inline
User-Agent: Mutt/1.5.21 (2010-09-15)
Archived-At: <https://mailarchive.ietf.org/arch/msg/teas/Fo_mloOZZIN28CRQbVdRnviUFW8>
Subject: [Teas] teas: covering in-network path calculation Q.
X-BeenThere: teas@ietf.org
X-Mailman-Version: 2.1.22
Precedence: list
List-Id: Traffic Engineering Architecture and Signaling working group discussion list <teas.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/teas>, <mailto:teas-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/teas/>
List-Post: <mailto:teas@ietf.org>
List-Help: <mailto:teas-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/teas>, <mailto:teas-request@ietf.org?subject=subscribe>
X-List-Received-Date: Fri, 23 Mar 2018 09:54:09 -0000
Dear TEAS WG. Hope newcomer questions are endured here on the mailing list: I do understand how the TE architectures support the explicit offpath calculated path model. What i do not know if/how it also describes/ deals with distributed or in-network path computation options. Browsing through the list of documents without trying to read through all of them, it looked easier to ask. The two well known options i am thinking of are: - CSPF in RSVP-TE. Not distributed, but in-network, relying on IGP collected information. - IGP metric engineering. If/how are these considered in TEAs documents ? I am asking, because i am really a lot more interested in path diversity engineering for resilience in DetNet Unicast/Multicast or non-DetNet Multicast, and these are today more obscure and likely not covered, but probably not too difficult to add if the above ones have established good proof points. The two, non-offpath PCEC network assisted approaches coming to mind are: - disjoint path sets from disjoint instances of path calculation, e.g.: metric engineered IGP topologies. (yes, very problematic, i know. Just mentioning). - disjoint path sets derived from a single instance of an algorithm, such as MRT. Any explanation of current state of the art in TEAS for this highly welcome! Thank you Toerless
- [Teas] teas: covering in-network path calculation… Toerless Eckert