Re: [nsp] bgp deterministic-med

From: Alex Bligh (amb@gxn.net)
Date: Fri Aug 21 1998 - 05:05:01 EDT


Srihari,
>
> Determinstic-MED.
> -----------------
> In this case, we store the paths from the common AS together, so that our
> pair-wise path selection results in the same bespath consistently. That is
>
> local pref MED Neighboring-AS Router ID
> path 3 100 10 700 100.1.1.1
> path 1 100 100 700 1.1.1.1
> path 2 100 100 600 10.1.1.1 <<< winner
>
> We are deterministic in the sense that paths (3 and 1) are always
> together. Path3 wins over path1 based on MED and path2 wins over path3 based
> on router_id.

Excellent. That's exactly the problem I'm seeing, and this is obviously
the knob to fix it. Any disadvantges? (memory, CPU etc.?) (he asks
going to apply it right now)...

-- 
Alex Bligh
GX Networks (formerly Xara Networks)



This archive was generated by hypermail 2b29 : Sun Aug 04 2002 - 04:13:13 EDT