RE: [RAM] The mapping problem: rendezvous points?

Dave Thaler <dthaler@windows.microsoft.com> Tue, 08 May 2007 20:28 UTC

Return-path: <ram-bounces@iab.org>
Received: from [127.0.0.1] (helo=stiedprmman1.va.neustar.com) by megatron.ietf.org with esmtp (Exim 4.43) id 1HlWI7-0005uQ-L8; Tue, 08 May 2007 16:28:11 -0400
Received: from [10.91.34.44] (helo=ietf-mx.ietf.org) by megatron.ietf.org with esmtp (Exim 4.43) id 1HlWI5-0005uL-MO for ram@iab.org; Tue, 08 May 2007 16:28:09 -0400
Received: from smtp.microsoft.com ([131.107.115.212]) by ietf-mx.ietf.org with esmtp (Exim 4.43) id 1HlWI5-0000nO-CG for ram@iab.org; Tue, 08 May 2007 16:28:09 -0400
Received: from TK5-EXHUB-C101.redmond.corp.microsoft.com (157.54.70.76) by TK5-EXGWY-E801.partners.extranet.microsoft.com (10.251.56.50) with Microsoft SMTP Server (TLS) id 8.0.685.24; Tue, 8 May 2007 13:28:02 -0700
Received: from win-imc-02.wingroup.windeploy.ntdev.microsoft.com (157.54.69.169) by TK5-EXHUB-C101.redmond.corp.microsoft.com (157.54.70.76) with Microsoft SMTP Server id 8.0.685.25; Tue, 8 May 2007 13:28:02 -0700
Received: from WIN-MSG-21.wingroup.windeploy.ntdev.microsoft.com ([157.54.62.25]) by win-imc-02.wingroup.windeploy.ntdev.microsoft.com with Microsoft SMTPSVC(6.0.3790.3959); Tue, 8 May 2007 13:28:00 -0700
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
Subject: RE: [RAM] The mapping problem: rendezvous points?
Date: Tue, 08 May 2007 13:27:38 -0700
Message-ID: <271CF87FD652F34DBF877CB0CB5D16FC054EA59D@WIN-MSG-21.wingroup.windeploy.ntdev.microsoft.com>
In-Reply-To: <9C228355-9425-4C66-A9A7-47498490E3B1@virtualized.org>
X-MS-Has-Attach:
X-MS-TNEF-Correlator:
Thread-Topic: [RAM] The mapping problem: rendezvous points?
Thread-Index: AceRreXOhnNX7OTOR0GrRD2oYNcTwwAAGUhw
References: <8F47F550-6224-4AFF-8359-CBA98D3F2FAB@muada.com> <271CF87FD652F34DBF877CB0CB5D16FC054EA470@WIN-MSG-21.wingroup.windeploy.ntdev.microsoft.com> <9C228355-9425-4C66-A9A7-47498490E3B1@virtualized.org>
From: Dave Thaler <dthaler@windows.microsoft.com>
To: David Conrad <drc@virtualized.org>
X-OriginalArrivalTime: 08 May 2007 20:28:00.0637 (UTC) FILETIME=[5F3B3AD0:01C791AF]
X-Spam-Score: 0.0 (/)
X-Scan-Signature: 0a7aa2e6e558383d84476dc338324fab
Cc: ram@iab.org
X-BeenThere: ram@iab.org
X-Mailman-Version: 2.1.5
Precedence: list
List-Id: Routing and Addressing Mailing List <ram.iab.org>
List-Unsubscribe: <https://www1.ietf.org/mailman/listinfo/ram>, <mailto:ram-request@iab.org?subject=unsubscribe>
List-Archive: <http://www1.ietf.org/pipermail/ram>
List-Post: <mailto:ram@iab.org>
List-Help: <mailto:ram-request@iab.org?subject=help>
List-Subscribe: <https://www1.ietf.org/mailman/listinfo/ram>, <mailto:ram-request@iab.org?subject=subscribe>
Errors-To: ram-bounces@iab.org

Applications generally work fine with random loss.
They work less well with _deterministic_ loss.

Some common application models that are adversely affected by PULL:

1) Client resolves a name to a list of addresses, and tries each one 
(with some timeout since there's no guarantee of response) until a
connection succeeds.  Here if the first packet(s) to an address fail
(or take too long, but failure happens in PULL schemes once a queue
overflows) then it fails over to the next address.  As a result it will
connect via a different path to a different server (and see possibly
different results, either quantitatively or qualitatively).

2) Client resolves a name to a list of addresses, and tries each
one in parallel and chooses the first one to succeed.  Here a 
deterministic delay (say a closer address is un-cached, but one
far away is cached for some other reason), again causes the inefficient
one to be chosen.

3) Server responds to a simple client request via an asymmetric path.
No DNS occurs here, and the response goes via a router not involved
in the client-to-server direction.  A cache miss causes a loss
(since there's a huge number of such clients, a non-negligible
percentage will be dropped since you can't queue all the packets
waiting for the delay).  As a result, the client never gets the response
and either gives up or fails over to a different server (which might
have the same problem...)

The above are just examples of common application classes which show
why I personally consider PULL schemes to be a non-starter.

-Dave

> -----Original Message-----
> From: David Conrad [mailto:drc@virtualized.org]
> Sent: Tuesday, May 08, 2007 1:17 PM
> To: Dave Thaler
> Cc: ram@iab.org
> Subject: Re: [RAM] The mapping problem: rendezvous points?
> 
> Hi,
> 
> On May 8, 2007, at 11:18 AM, Dave Thaler wrote:
> > I disagree with the word "everything".  The two high level choices
> > are:
> >
> > PULL: work on-demand (which results in deterministic loss and hence
> > adversely affects applications) and cache the result for some time
> 
> What applications are adversely affected by a delay in transmitting
> the first packet?  How do such applications work in today's "best
> effort" Internet?
> 
> Thanks,
> -drc
> 
> 
> 


_______________________________________________
RAM mailing list
RAM@iab.org
https://www1.ietf.org/mailman/listinfo/ram