[117711] in North American Network Operators' Group

home help back first fref pref prev next nref lref last post

Re: bgp best path compare-routerid implementation example

daemon@ATHENA.MIT.EDU (Andy Davidson)
Fri Sep 25 03:22:04 2009

From: Andy Davidson <andy@nosignal.org>
To: devang patel <devangnp@gmail.com>
In-Reply-To: <d0fea3580909242124m4d8d878y8bcac2e3c583467c@mail.gmail.com>
Date: Fri, 25 Sep 2009 08:21:22 +0100
Cc: nanog@nanog.org
Errors-To: nanog-bounces+nanog.discuss=bloom-picayune.mit.edu@nanog.org


On 25 Sep 2009, at 05:24, devang patel wrote:

> I am looking for the *bgp best path compare*-*routerid* implementation
> example? I know the function of it but looking for some scenario  
> where its
> been used...

Hi, Devang

This option is really only used in order to instruct a router to skip  
the option before it in best path selection algorithm (prefer the path  
learned from the older established session).

I don't think you'd use it if you ran a normal network (or knew what  
you were doing ;-) ) because you'd typically use much more  
deterministic decisions to send traffic to specific and predictable  
paths, or you'd use hot-potato routing and send the traffic to the  
nearest equivalent exit ('prefer ebgp over ibgp' and 'prefer path with  
lowest igp metric' comes before 'use the oldest path').

Andy



-- 
Regards, Andy Davidson       +44 (0)20 7993 1700       www.netsumo.com
NetSumo  Specialist networks consultancy for ISPs, Whitelabel 24/7 NOC









home help back first fref pref prev next nref lref last post