Re: [rrg] Compact Routing - draft critique

"Flinck, Hannu (NSN - FI/Espoo)" <hannu.flinck@nsn.com> Thu, 25 February 2010 14:37 UTC

Return-Path: <hannu.flinck@nsn.com>
X-Original-To: rrg@core3.amsl.com
Delivered-To: rrg@core3.amsl.com
Received: from localhost (localhost [127.0.0.1]) by core3.amsl.com (Postfix) with ESMTP id 27AA028C167 for <rrg@core3.amsl.com>; Thu, 25 Feb 2010 06:37:53 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -1.992
X-Spam-Level:
X-Spam-Status: No, score=-1.992 tagged_above=-999 required=5 tests=[AWL=0.007, BAYES_00=-2.599, J_CHICKENPOX_43=0.6]
Received: from mail.ietf.org ([64.170.98.32]) by localhost (core3.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id ce5UduMBXvJr for <rrg@core3.amsl.com>; Thu, 25 Feb 2010 06:37:52 -0800 (PST)
Received: from demumfd002.nsn-inter.net (demumfd002.nsn-inter.net [93.183.12.31]) by core3.amsl.com (Postfix) with ESMTP id 63CA528C165 for <rrg@irtf.org>; Thu, 25 Feb 2010 06:37:51 -0800 (PST)
Received: from demuprx016.emea.nsn-intra.net ([10.150.129.55]) by demumfd002.nsn-inter.net (8.12.11.20060308/8.12.11) with ESMTP id o1PEdthA020117 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=FAIL); Thu, 25 Feb 2010 15:39:55 +0100
Received: from demuexc024.nsn-intra.net (demuexc024.nsn-intra.net [10.159.32.11]) by demuprx016.emea.nsn-intra.net (8.12.11.20060308/8.12.11) with ESMTP id o1PEdtCF004834; Thu, 25 Feb 2010 15:39:55 +0100
Received: from FIESEXC035.nsn-intra.net ([10.159.0.25]) by demuexc024.nsn-intra.net with Microsoft SMTPSVC(6.0.3790.3959); Thu, 25 Feb 2010 15:39:54 +0100
X-MimeOLE: Produced By Microsoft Exchange V6.5
Content-class: urn:content-classes:message
MIME-Version: 1.0
Content-Type: text/plain; charset="us-ascii"
Content-Transfer-Encoding: quoted-printable
Date: Thu, 25 Feb 2010 16:39:52 +0200
Message-ID: <26E5D1C5D5365D47B147E5E62FC735853F91F9@FIESEXC035.nsn-intra.net>
In-Reply-To: <4B80A6B1.7020103@firstpr.com.au>
X-MS-Has-Attach:
X-MS-TNEF-Correlator:
Thread-Topic: Compact Routing - draft critique
Thread-Index: AcqypPiTJqDAl+xKRQ6gGtayC/bcGgDgJkDg
References: <4B80A6B1.7020103@firstpr.com.au>
From: "Flinck, Hannu (NSN - FI/Espoo)" <hannu.flinck@nsn.com>
To: ext Robin Whittle <rw@firstpr.com.au>, RRG <rrg@irtf.org>
X-OriginalArrivalTime: 25 Feb 2010 14:39:54.0636 (UTC) FILETIME=[653464C0:01CAB628]
Subject: Re: [rrg] Compact Routing - draft critique
X-BeenThere: rrg@irtf.org
X-Mailman-Version: 2.1.9
Precedence: list
List-Id: IRTF Routing Research Group <rrg.irtf.org>
List-Unsubscribe: <http://www.irtf.org/mailman/listinfo/rrg>, <mailto:rrg-request@irtf.org?subject=unsubscribe>
List-Archive: <http://www.irtf.org/mail-archive/web/rrg>
List-Post: <mailto:rrg@irtf.org>
List-Help: <mailto:rrg-request@irtf.org?subject=help>
List-Subscribe: <http://www.irtf.org/mailman/listinfo/rrg>, <mailto:rrg-request@irtf.org?subject=subscribe>
X-List-Received-Date: Thu, 25 Feb 2010 14:37:53 -0000

Thank you Robin for spending your time to reading the proposal! Good and
thoughtful
comments indeed.

Below are my responses and remarks.

Best regards
Hannu 

>-----Original Message-----
>From: ext Robin Whittle [mailto:rw@firstpr.com.au] 
>Sent: Sunday, February 21, 2010 05:21
>To: RRG
>Cc: Flinck, Hannu (NSN - FI/Espoo)
>Subject: Compact Routing - draft critique
>
>No-one has submitted a critique of Hannu Flinck's proposal:
>
>  Compact routing in locator identifier mapping system
>  http://tools.ietf.org/html/draft-irtf-rrg-recommendation-04#section-7
>
>The RRG Report ID does not have any references, but the 
>proposal document itself is an attachment to:
>
>  Mapping system based on compact routing  (2009-12-15)
>  http://www.ietf.org/mail-archive/web/rrg/current/msg05519.html
>
>The summary was posted on 2009-12-17:
>
>  http://www.ietf.org/mail-archive/web/rrg/current/msg05531.html
>
>Here is my 1006 word (including quotation footnote) draft critique.
>I will revise it, perhaps to less than 500 words, once I get 
>some feedback from Hannu.
>
>
>  - Robin
>
>
>
>
>Critique of "Compact routing in locator identifier mapping system"
>------------------------------------------------------------------
>
>The "Compact routing in locator identifier mapping system" 
>proposal - hereafter "CRM" - is most easily understood as an 
>alteration to the routing structure of the LISP-ALT mapping 
>overlay system.  It is not a complete proposal, and therefore 
>cannot be considered as a scalable routing solution suitable 
>for further development.

This is true, but its use is not limited to LISP, or LISP+ALT. It is
more 
generic to that. It can serve as a basis for any system that need a
mapping system 
That is relying a packet or packets to the destination. Eventually BGP
could just take 
The role of topology discovery between the landmark nodes.  

However, I am ok that the critique is in the context of LISP/LISP+ALT as
this was 
used in my write up as the main reference.     

>ALT is a global query server system by which ITRs or Map 
>Resolvers (MRs) can request mapping for a given "edge" address 
>(EID) address.  The authoritative query servers are either 
>ETRs or Map Servers (MSs).  The query traverses the ALT 
>network and is delivered to the MS or ETR - which sends it 
>reply directly to the MR or ITR via the Internet.
>Despite its name, LISP is not a Locator / Identifier Separation
>architecture.   LISP is a Core-Edge Separation architecture.  Core-Edge
>Elimination architectures such as ILNP and HIP implement the 
>Locator / Identifier Separation naming model.
>

Yes. Agreed.

>The ALT network consists of routers running a BGP system quite 
>separate from that of the Internet, communicating with each 
>other via tunnels.
>ALT can be used to deliver the initial packets an ITR has no 
>mapping for, to deliver them to the destination network and 
>for them to function as map requests.  CRM includes this as a 
>specific aim:
>
>  ... particularly when the mapping system is also a message relaying
>  service, i.e. the first packet is delivered through the mapping
>  system to its destination.
>
>Since fractions of a second to perhaps several seconds may 
>elapse before the ITR receives the map reply, it is possible 
>that more than one packet may be sent over the ALT overlay 
>network.  This use of the overlay network for potentially long 
>and/or numerous traffic packets, rather than short map 
>requests, significantly increases the load on the data plane 
>of the overlay network.


Right, but the same system if landmarks could deliver more that just 
the first packet. This is a capacity issue (CPU, BW). 

>CRM is concerned with optimising the path length taken by these "query"
>packets (which may be traffic packets) through a significantly 
>modified version of the ALT network - by altering or adding to 
>the network's BGP control plane.  Compact Routing principles 
>are discussed in this regard, with the aim of reducing the 
>control plane load on any one router while also generally 
>reducing typical or maximum paths taken by the query packets.

Right.

>While Compact Routing principles may be able to achieve these 
>goals, compared to whatever, as-yet unspecified, structure the 
>ALT network would achieve (to minimise path lengths while 
>remaining robust against single points of failure) there are 
>two objections to this approach.
>
>Firstly, a CRM-modified ALT structure would still be a global 
>query server system.  No matter how ALT's path lengths and 
>delays are optimised, there is a fundamental problem with a 
>querier - which could be anywhere in the world - relying on 
>mapping information from one or ideally two or more 
>authoritative query servers, which could also be anywhere in 
>the world.  The delays and risks of packet loss which are 
>inherent in such a system constitute a fundamental problem for 
>any CES or CEE system which relies on it.  The only solution 
>is to employ local full database query servers, or some other 
>arrangement in which there are larger numbers of authoritative 
>query servers, with one or more typically being located quite 
>close (say one or two thousand kilometers) from any querier.

I agree with the problem. And the solution that you offer works
in the ideal world where large databases can be synchronized without 
any delays. Replication of data is likely to be a problem in the real
world case as so many times earlier. 


>Secondly, the alterations contemplated in this proposal 
>involve the roles of particular nodes in the network being 
>dynamically assigned - as part of its self-organizing nature.  
>Therefore, at one point in time, a physical node may be 
>responsible for aggregating routes to a given set of 
>authoritative query servers, while at a later time, this role 
>may be moved to another node.

Exactly.



>The discussion of Clustering in the middle of page 4 also 
>indicates that particular nodes are responsible for 
>registering EIDs from typically far-distant ETRs, all of which 
>are handling closely related EIDs which this node can 
>aggregate.  Since MSes are apparently nodes within the compact 
>routing system, and the process of an MS deciding whether to 
>accept EID registrations is determined as part of the 
>self-organising properties of the system [1], there are 
>concerns about how the vital function of EID registration can 
>be performed securely, when no particular physical node is 
>responsible for it.

Very correct. There was an off line comment that pointed out the same
issue. I haven't address this yet, but this is not unsolvable as ISPs
create trust relationships in the internet exchange points and with 
peering arrangements. Currently this is done by filtering out "unwanted"

Announcements. The trust between the landmarks (mapping servers) can be 
built based on the current BGP relationships. However, this needs more 
from my part.      

>Since individual nodes cost money, and are presumably run by 
>individual participants in the entire system, it is not clear 
>how those nodes which have the greatest traffic and the most 
>responsibilities are to have their running costs paid for by 
>those who benefit from its activities.
>Furthermore, those who benefit also rely on this node in terms 
>of reliability and security - and it does not seem tenable to 
>trust this to some dynamically chosen node, whose security and 
>reliability cannot be reliably ascertained.

The situation is the same with BGP in DFZ. And true, it needs to
be evaluated for other proposals as well. 

>There are simpler solutions to the mapping problem than having 
>an elaborate network of routers.  If a global-scale query 
>system is still preferred, then it would be better to have 
>ITRs use local MRs, each of which is dynamically configured to 
>know the IP address of the million or so authoritative Map 
>Server (MS) query servers - or two million or so
>assuming they exist in pairs for redundancy.   This 10^6 figure is
>mentioned on page 3.  Whether it is a realistic figure is 
>uncertain, since neither CRM nor ALT have any clear set of 
>design objectives.
>
>Neither ALT nor a CRM-enhanced ALT network can be suitable 
>mapping solutions for CES or CEE architectures due to their 
>global nature.  The solution to this problem involve bringing 
>authoritative query servers closer to the queriers.
>
>
>[1] "Accepting a map registration from an xTR, the map server 
>also accepts to take a role to create a cluster of 
>neighborhood, and to act as a cluster head for these xTRs. To 
>summarize map servers forming the clusters of compact routing 
>should be selected based on their capability to aggregate 
>EIDs. This capability can be concluded from BGP announcements. 
>For boot strapping an initial seed set of EIDs could be 
>delegated to all or some map servers. However, this set will 
>change as the registration situation evolves."
----------------------

Thank you for your through comments.