Re: [rrg] Questions about Enhanced Efficiency of Mapping Distribution Protocols

"Sriram, Kotikalapudi" <kotikalapudi.sriram@nist.gov> Wed, 30 December 2009 05:18 UTC

Return-Path: <kotikalapudi.sriram@nist.gov>
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 724A73A68FE for <rrg@core3.amsl.com>; Tue, 29 Dec 2009 21:18:19 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -6.599
X-Spam-Level:
X-Spam-Status: No, score=-6.599 tagged_above=-999 required=5 tests=[BAYES_00=-2.599, RCVD_IN_DNSWL_MED=-4]
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 3ynkayClye1T for <rrg@core3.amsl.com>; Tue, 29 Dec 2009 21:18:07 -0800 (PST)
Received: from smtp.nist.gov (rimp2.nist.gov [129.6.16.227]) by core3.amsl.com (Postfix) with ESMTP id 217E33A68B8 for <rrg@irtf.org>; Tue, 29 Dec 2009 21:17:55 -0800 (PST)
Received: from WSXGHUB2.xchange.nist.gov (wsxghub2.nist.gov [129.6.18.19]) by smtp.nist.gov (8.13.1/8.13.1) with ESMTP id nBU5HF46000641; Wed, 30 Dec 2009 00:17:15 -0500
Received: from MBCLUSTER.xchange.nist.gov ([fe80::d479:3188:aec0:cb66]) by WSXGHUB2.xchange.nist.gov ([2002:8106:1213::8106:1213]) with mapi; Wed, 30 Dec 2009 00:17:08 -0500
From: "Sriram, Kotikalapudi" <kotikalapudi.sriram@nist.gov>
To: Charrie Sun <charriesun@gmail.com>
Date: Wed, 30 Dec 2009 00:17:07 -0500
Thread-Topic: Questions about Enhanced Efficiency of Mapping Distribution Protocols
Thread-Index: AcqEUXLPfRG3zqpVQCC1fCq1mrvZDAEt7xae
Message-ID: <D7A0423E5E193F40BE6E94126930C493078D7343EE@MBCLUSTER.xchange.nist.gov>
References: <4eb512450912232027l730a767cnc8e3192c5eaa1c41@mail.gmail.com>
In-Reply-To: <4eb512450912232027l730a767cnc8e3192c5eaa1c41@mail.gmail.com>
Accept-Language: en-US
Content-Language: en-US
X-MS-Has-Attach:
X-MS-TNEF-Correlator:
acceptlanguage: en-US
Content-Type: text/plain; charset="Windows-1252"
Content-Transfer-Encoding: quoted-printable
MIME-Version: 1.0
X-NIST-MailScanner: Found to be clean
X-NIST-MailScanner-From: kotikalapudi.sriram@nist.gov
Cc: "rrg@irtf.org" <rrg@irtf.org>
Subject: Re: [rrg] Questions about Enhanced Efficiency of Mapping Distribution Protocols
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: Wed, 30 Dec 2009 05:18:23 -0000

Sun:

Thanks for the comments/questions.
With your permission, I am posting them and my responses to the RRG list.
Please see my responses inline below. I hope they are helpful.

Sriram

>From: Charrie Sun [charriesun@gmail.com]
>Sent: Wednesday, December 23, 2009 11:27 PM
>To: Sriram, Kotikalapudi
>Subject: Questions about Enhanced Efficiency of Mapping Distribution Protocols
>
>Hi Sriram,
> I have recently read your proposal of "Enhanced Efficiency of 
>Mapping Distribution Protocols in Map-and-Encap Schemes" 
>for the scalable routing task. I raised some questions and want to 
>discuss with you. Since it includes some pictures in the 
>discussion I put them in the attachment. 
>
>
>1)	The figure below which you showed in your presentation slide

KS: For the benefit of people in this list, this is the figure in slide 20 of my presentation:
http://www.antd.nist.gov/~ksriram/MDP_Dublin_KS_Slides.pdf

>Well why does the slope of Approach 2’s curve become flatter? 
>As each time a response sends only one relevant mapping 
>I thought the first-packet-delay wouldn’t change in the theoretical sense.
>What matters more, I think, would be the average delay of all first-packet.
>Say, comparing as to a common prefix, and this would compare 
>the first two approaches more explicitly.

KS: This is a heuristic plot. Yes, I had the _average_ of first packet delay in mind. 
When the # of exceptions (x-axis) is quite small, in approach 2 the first packet may 
benefit from a cache at ILM-R (see slide 14), and when the # of exceptions goes higher, 
then most map requests will propagate to ILM resulting in higher delays. But you are right 
that the plot will be primarily flat then onwards. In approach 1, on the other hand, when 
the # of exceptions is higher, then the cache hit ratio will be perfect for “first” packets of 
subsequent sessions because the “first” packet of the very first session destined for 
that prefix has already fetched all of the maps (including all exceptions). But the first 
packet of the very first session destined for a prefix in consideration has to wait for 
many exception maps to be processed at the ILM-R and the ITR. Hence, the more 
rapidly increasing delay-plot for approach 1. I think you were OK with the plot for 
approach 1, but I thought I will try to elaborate on explanation for both delay-plots 
and try to put it all in perspective. Thanks for the question.
  
>2)	The second question arises when you talk about hierarchy of ETRs in Slide 23.

KS: Here you are referring to slide 23 / slide 24 in the presentation:  
http://www.antd.nist.gov/~ksriram/MDP_Dublin_KS_Slides.pdf
-- also same as Figure 3 (page 6) in the detailed document:
http://www.antd.nist.gov/~ksriram/NGRA_map_mgmt.pdf

>Well I think it is in fact a matter of core’s routing system, and each ETR should 
>advertise their directly-mapped EID prefixes. Though higher level ETRs can 
>aggregate mapping to alleviate the load of mapping distribution, this can 
>mix up mapping system with the routing system. However how to define 
>“core” and “edge” is still a hard problem :)

KS: Your comment here is well taken. Yes, in general “ETR should advertise 
their directly-mapped EID prefixes” as you have stated. My thinking is that 
if lower-level ETRs (see Slides 23 and 24) DO indeed delegate to a higher-level 
ETR the aggregation and notification of mapping messages, then the higher-level 
ETR can suppress the fragments (deaggregates) while it announces a map for 
the covering aggregate EID. However, if a subnet is multi-homed to multiple ETRs 
(see slide 24 or Fig. 3 in the detailed document), then the subnet (deaggregate) 
gets announced by another higher-level ETR even thought the parent higher-level 
ETR has announced only the aggregate. In this situation, our proposal is to depref 
the deaggregated EID subprefix in the mapping distribution protocol by incorporating 
a “backup” indicator (see slide 24). A sending host will normally receive 
a response (to a map request) with information about the primary ETR 
(i.e., the aggregating ETR) as the locator for a prefix. The backup ETR 
will be used in a map response only in circumstances when primary ETR 
is known to be in a failure-recovery state or has otherwise withdrawn the aggregate.
Finally, on your last point, yes, I am also somewhat troubled about 
definition of "core" and "edge" separation.

Sriram