Re: Equal-cost path
Dave Katz <dkatz@JUNIPER.NET> Wed, 13 April 2005 18:47 UTC
Received: from cherry.ease.lsoft.com (cherry.ease.lsoft.com [209.119.0.109]) by ietf.org (8.9.1a/8.9.1a) with ESMTP id OAA21873 for <ospf-archive@LISTS.IETF.ORG>; Wed, 13 Apr 2005 14:47:59 -0400 (EDT)
Received: from vms.dc.lsoft.com (209.119.0.2) by cherry.ease.lsoft.com (LSMTP for Digital Unix v1.1b) with SMTP id <8.010108B5@cherry.ease.lsoft.com>; Wed, 13 Apr 2005 14:47:57 -0400
Received: by PEACH.EASE.LSOFT.COM (LISTSERV-TCP/IP release 14.3) with spool id 66405011 for OSPF@PEACH.EASE.LSOFT.COM; Wed, 13 Apr 2005 14:47:56 -0400
Received: from 207.17.137.57 by WALNUT.EASE.LSOFT.COM (SMTPL release 1.0l) with TCP; Wed, 13 Apr 2005 14:47:56 -0500
Received: from merlot.juniper.net (merlot.juniper.net [172.17.27.10]) by colo-dns-ext1.juniper.net (8.11.3/8.9.3) with ESMTP id j3DIlt922041 for <OSPF@PEACH.EASE.LSOFT.COM>; Wed, 13 Apr 2005 11:47:55 -0700 (PDT) (envelope-from dkatz@juniper.net)
Received: from [172.16.12.13] (nimbus-sc.juniper.net [172.16.12.13]) by merlot.juniper.net (8.11.3/8.11.3) with ESMTP id j3DIloe56033 for <OSPF@PEACH.EASE.LSOFT.COM>; Wed, 13 Apr 2005 11:47:50 -0700 (PDT) (envelope-from dkatz@juniper.net)
Mime-Version: 1.0 (Apple Message framework v619.2)
References: <5551AD75D2C0BC459A85A2CEFAE4F80050C7D4@usvissfp01.win.marconi.com>
Content-Type: text/plain; charset="US-ASCII"; format="flowed"
Content-Transfer-Encoding: 7bit
X-Mailer: Apple Mail (2.619.2)
Message-ID: <14f33d018be89c528d9646f864cd5ed9@juniper.net>
Date: Wed, 13 Apr 2005 11:47:50 -0700
Reply-To: Mailing List <OSPF@PEACH.EASE.LSOFT.COM>
Sender: Mailing List <OSPF@PEACH.EASE.LSOFT.COM>
From: Dave Katz <dkatz@JUNIPER.NET>
Subject: Re: Equal-cost path
To: OSPF@PEACH.EASE.LSOFT.COM
In-Reply-To: <5551AD75D2C0BC459A85A2CEFAE4F80050C7D4@usvissfp01.win.marconi.com>
Precedence: list
Content-Transfer-Encoding: 7bit
On Apr 13, 2005, at 7:38 AM, Naidu, Venkata wrote: > If we assuming all nodes in an area have same > capabilities (like, line rate forwarding etc), fewer number > node path performs better in the average case. > I do not believe that you can make this claim, except in a simulation, which has little to do with reality. In real networks, with reasonably fast routers and links, the performance of the routers and per-link serialization are greatly overwhelmed by other issues (such as the speed of light and queue lengths.) One could just as plausibly posit that, on average, a random assignment in the case of equal path costs could improve performance by spreading the load more effectively across the infrastructure, but it totally depends on the particulars of equipment, topology, and traffic. A case could also be made that well-engineered networks ought not to have equal cost paths by accident; most of the time they should only appear if the network engineers wanted to take advantage of path splitting. In any case, a router that did not support equal cost multipath would be so broken that nobody would buy it, making the whole question academic. --Dave
- Equal-cost path Ilan Bercovich
- Re: Equal-cost path Kireeti Kompella
- Re: Equal-cost path Yasuhiro Ohara
- Re: Equal-cost path Kireeti Kompella
- Re: Equal-cost path Naidu, Venkata
- Re: Equal-cost path Dave Katz
- Re: Equal-cost path Naidu, Venkata
- Re: Equal-cost path Dave Katz
- Re: Equal-cost path Erblichs