Re: [dc] Elevator Pitch

"Ashish Dalela (adalela)" <adalela@cisco.com> Sat, 31 December 2011 14:33 UTC

Return-Path: <adalela@cisco.com>
X-Original-To: dc@ietfa.amsl.com
Delivered-To: dc@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1]) by ietfa.amsl.com (Postfix) with ESMTP id F3AF821F845A for <dc@ietfa.amsl.com>; Sat, 31 Dec 2011 06:33:18 -0800 (PST)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.213
X-Spam-Level:
X-Spam-Status: No, score=-2.213 tagged_above=-999 required=5 tests=[AWL=0.386, BAYES_00=-2.599]
Received: from mail.ietf.org ([12.22.58.30]) by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id TUQDIPTd36DZ for <dc@ietfa.amsl.com>; Sat, 31 Dec 2011 06:33:18 -0800 (PST)
Received: from bgl-iport-1.cisco.com (bgl-iport-1.cisco.com [72.163.197.25]) by ietfa.amsl.com (Postfix) with ESMTP id A5E7B21F8437 for <dc@ietf.org>; Sat, 31 Dec 2011 06:33:16 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/simple; d=cisco.com; i=adalela@cisco.com; l=9476; q=dns/txt; s=iport; t=1325341997; x=1326551597; h=mime-version:content-transfer-encoding:subject:date: message-id:in-reply-to:references:from:to:cc; bh=nDQTrxJ/V2XrV2G3ffZku131AoHaIvatyaBcyqALnZc=; b=O1/DqDMnjscfTrtOb1D1ZEFXgFOK/83aBo/IVyYfPj3XUEv1gHIGzHiq 9UV2vJaXcjwOTiRf3odz5LbJ31L9vXwH/a/2u8qrtrBDN3+OPH1ukf/61 nsbj54LtpSUhGdPRLXXDWrXuvfEKUNz52819xCMrt7Vouli4iyadKGSj3 w=;
X-IronPort-Anti-Spam-Filtered: true
X-IronPort-Anti-Spam-Result: ApIAAAoc/05Io8UY/2dsb2JhbABCARaEeZcJjzeCCoFyAQEBAwEBAQELBAEQDQQxAgcLBQcEAgEGAhEEAQEDAgYGCQIMAQICAgEBJR8JCAEBBAEKCAgTB4dYCJZSAYxbkHoEgS+HVwGBcjNjBIg1nwk
X-IronPort-AV: E=Sophos;i="4.71,436,1320624000"; d="scan'208";a="2571780"
Received: from vla196-nat.cisco.com (HELO bgl-core-1.cisco.com) ([72.163.197.24]) by bgl-iport-1.cisco.com with ESMTP; 31 Dec 2011 14:33:14 +0000
Received: from xbh-bgl-412.cisco.com (xbh-bgl-412.cisco.com [72.163.129.202]) by bgl-core-1.cisco.com (8.14.3/8.14.3) with ESMTP id pBVEXExo026925; Sat, 31 Dec 2011 14:33:14 GMT
Received: from xmb-bgl-416.cisco.com ([72.163.129.212]) by xbh-bgl-412.cisco.com with Microsoft SMTPSVC(6.0.3790.4675); Sat, 31 Dec 2011 20:03:14 +0530
X-MimeOLE: Produced By Microsoft Exchange V6.5
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: base64
x-cr-hashedpuzzle: Az1A DbxB EmPK E+Qe GJBX ORGz QV3s SHRV TA/9 V/kV XPFo Xjhk ZYXi aSTX asKH cT/c; 3; YwBkAGwAQABhAHMAZwBhAGEAcgBkAC4AbwByAGcAOwBkAGMAQABpAGUAdABmAC4AbwByAGcAOwByAHUAcwBzAHcAQAByAGkAdwAuAHUAcwA=; Sosha1_v1; 7; {48148014-87B1-4BDA-B945-A0C0245D9843}; YQBkAGEAbABlAGwAYQBAAGMAaQBzAGMAbwAuAGMAbwBtAA==; Sat, 31 Dec 2011 14:32:39 GMT; UgBFADoAIABbAGQAYwBdACAARQBsAGUAdgBhAHQAbwByACAAUABpAHQAYwBoAA==
x-cr-puzzleid: {48148014-87B1-4BDA-B945-A0C0245D9843}
Content-class: urn:content-classes:message
Date: Sat, 31 Dec 2011 20:02:39 +0530
Message-ID: <618BE8B40039924EB9AED233D4A09C5102B2533C@XMB-BGL-416.cisco.com>
In-Reply-To: <682C5C0D-10FD-49D7-BF48-28EB6EFBA72B@asgaard.org>
X-MS-Has-Attach:
X-MS-TNEF-Correlator:
Thread-Topic: [dc] Elevator Pitch
Thread-Index: AczGT2kn9NSOOaJESoGZbstWV4dKHgBeA+7g
References: <13205C286662DE4387D9AF3AC30EF456D74E7BD952@EMBX01-WF.jnpr.net><6665BC1FEA04AB47B1F75FA641C43BC0926D106C@FHDP1LUMXC7V41.us.one.verizon.com><201112211830.pBLIUiZA017188@cichlid.raleigh.ibm.com><13205C286662DE4387D9AF3AC30EF456D74E91DBFD@EMBX01-WF.jnpr.net><618BE8B40039924EB9AED233D4A09C5102A4881E@XMB-BGL-416.cisco.com><4EF7B019.3030202@riw.us><201112281700.pBSH0kB2011575@cichlid.raleigh.ibm.com><4EFC826C.80708@riw.us> <682C5C0D-10FD-49D7-BF48-28EB6EFBA72B@asgaard.org>
From: "Ashish Dalela (adalela)" <adalela@cisco.com>
To: Christopher LILJENSTOLPE <cdl@asgaard.org>, Russ White <russw@riw.us>
X-OriginalArrivalTime: 31 Dec 2011 14:33:14.0531 (UTC) FILETIME=[2124B730:01CCC7C9]
Cc: dc@ietf.org
Subject: Re: [dc] Elevator Pitch
X-BeenThere: dc@ietf.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: IETF Data Center Mailing List <dc.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/dc>, <mailto:dc-request@ietf.org?subject=unsubscribe>
List-Archive: <http://www.ietf.org/mail-archive/web/dc>
List-Post: <mailto:dc@ietf.org>
List-Help: <mailto:dc-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/dc>, <mailto:dc-request@ietf.org?subject=subscribe>
X-List-Received-Date: Sat, 31 Dec 2011 14:33:19 -0000

100K or whatever that number is, is a big deal at the access. And that number will increase with time. The thing to bear in mind is that these are ADDITIONAL entries, not in lieu of other entries. E.g. network routes, local host-port entries, ACLs etc exist today and will continue to exist. Host routes are in addition to that. Access switches generally had about 16K or 32K table sizes. And we are talking about adding 3-4 times more to that.

The other thing is that access to core ratio is about 1000:1. So, we need to multiply the incremental costs by 1000 to get the full impact to TCO.

In regard to scaling, there are 4 places to look at:

1. Access
2. Core
3. Inter-datacenter
4. Datacenter-internet

These have different scaling properties. 

If you have different DC and DCI technologies, and you use Encap, you have high entries at Access, DCI and Datacenter-Internet. 

If you have common DC and DCI technologies, you have high Access and Datacenter-Internet entries.

If you have hierarchical MAC, then you have only high in Datacenter-Internet boundary. 

Net-net, out of the 4 things above, you can solve 3 (first 3). The fourth we have to distribute over multiple routers, which is not hard because it is always north-south traffic. 

Thanks, Ashish


-----Original Message-----
From: dc-bounces@ietf.org [mailto:dc-bounces@ietf.org] On Behalf Of Christopher LILJENSTOLPE
Sent: Thursday, December 29, 2011 10:58 PM
To: Russ White
Cc: dc@ietf.org
Subject: Re: [dc] Elevator Pitch

Greetings Russ et.al.,

On 29Dec2011, at 07.08, Russ White wrote:

> 
>> Actually, 100K host routes in leaf nodes may well be a Big Deal. It
>> depends on what type of devices need to understand host routes.
> 
> So let me try to abstract the problem a little... There are two things
> that cost money in building a network:
> 
> 1. State --the more you carry, the more hardware is going to cost.
> 2. Bandwidth --the less optimal your bandwidth utilization, the more
> you're spending on something that's not used.
> 
> The first rule of all network design is that the more state you put in a
> network, the more optimal your bandwidth usage. To reduce the cost of
> bandwidth, you have to spend money on state. To reduce the cost of
> state, you must increase your spending on bandwidth.

Agreed, mostly.  The question is where the state resides, control plane or data plane (do you differentiate between possible state and active state).  Control plane "possible state" should be cheaper (by orders of magnitude) than data plane "active state" - however, transitioning between the two is a complex problem (that has gotten somewhat easier as we have gotten smarter about distributed systems over time)
> 
> The second of network design is the balance point where the network is
> cheapest is different in every network.

agreed

> 
> So, IMHO, the point of protocol design should be to allow the design the
> maximum amount of flexibility and granularity in when and where to hide
> information, to make the right tradeoff for any particular network.
> 
agreed

> Now, to return to the discussion at hand: If you don't want to pay for
> devices that will handle 100 million routes, but you have 100 million
> devices, then you're going to have some degree of suboptimal bandwidth
> utilization. There's simply no way around this reality.

agreed
> 
> IMHO, however we resolve this problem, we need to resolve it in a way
> that allows an operator to support 100 million routes in every node, if
> they choose to optimize for bandwidth at the cost of hardware. Or to
> support 1 route in every node using really cheap hardware, if they want
> to optimize for state. Or for any point in the sliding scale in between
> (within reason).

agreed

> 
> So this control plane needs to:
> 
> 1. Be able to support 100 million destinations at the host level (that
> doesn't mean 100 million paths, but only 100 million destinations --two
> different problems).

yes

> 
> 2. Be able to aggregate to hide information at anyplace that's logical
> within the network.

yes

> 
> BTW, some folks would like to solve this problem by making the control
> plane react to the data plane --but this carries it's own baggage in
> complexity and in operational capabilities. Reactive control planes
> always converge more slowly, and waste bandwidth at a rate that's
> arguably higher than simple aggregation. So there's no "silver bullet"
> waiting in the wings in the form of caching at the control plane level.

however, I believe that aggregation time may be coming down, especially in a more homogenous environment (like a DC) vs a heterogeneous environment (like the DFZ).

> 
>>> 2. Why does this mobility need to be at layer 2 specifically? Are we
>>> assuming DDNS and other sorts of solutions in this space will simply
>>> never be fast enough/scale far enough/etc?
>> 
>> Like it or not, the key requirement for VM mobility is that the VM's
>> IP address does not change. That means the VM can't really move from
>> one IP subnet to another. That means either moving to bigger and
>> bigger L2s (all under one IP subnet) as the DC expands or the need to
>> inject /32 host routes.
> 
> Again, the same tradeoff as above --moving to a bigger l2 domain also
> means losing the ability to optimally direct traffic through the network
> (unless you put another control plane on top of the l2 and l3 control
> planes already in existence --which just adds the complexity you're
> trying to get away from in the host routes back into the network state!).

Or replacing one or two of those L2/L3 control planes with a control plane with a global view, which is easier to do in a constrained network like a traffic engineering core or a data center.  It's is a bounded problem.  As you stated, however, convergence MAY be slower, but I would argue that converging a network of Nx10K switching/routing nodes takes a non-trivial amount of time as well :)

> 
>> Neither of those approaches seems particularly scalable/desirable if
>> you look 10 years down the road and think of 1M+ physical machines in
>> a DC.
> 
> There is no "particularly desirable" solution, in reality, because
> building a network with no control plane state anyplace that uses
> bandwidth in a perfectly optimal way is simply impossible no matter how
> you slice it (unless you're going to go into quantum routing!).
> 
> :-)
> 
> Russ
> _______________________________________________
> dc mailing list
> dc@ietf.org
> https://www.ietf.org/mailman/listinfo/dc

--  
李柯睿
Check my PGP key here: https://www.asgaard.org/~cdl/cdl.asc
Current vCard here: https://www.asgaard.org/~cdl/cdl.vcf

_______________________________________________
dc mailing list
dc@ietf.org
https://www.ietf.org/mailman/listinfo/dc