If you're just trying to fix the non-deterministic behavior, use
bgp deterministic-med
what this does is, order the oaths by peer-AS, then select the best path
in each group then find an overall bestpath from comparing the winners in
each group. This will assure that the same path is always pre
>
>
>I'm researching some strange behavior with some non-deterministic
>path selection with BGP on a few routers. I thumbed through Radia
>Perlman's second edition of Interconnections at the bookstore last
>night and saw that in her paragraph where she noted some problems
>with BGP, she referenced
If anyone wants to read this go to:
http://www.cis.ohio-state.edu/htbin/rfc/rfc1771.html
At 08:13 AM 7/21/00 -0400, you wrote:
>Just so happen to have a copy next to me. You're probably looking for:
>
>RFC 1771 or BGP4:Inter-Domain Routing in the Internet, by John Stewart.
>
>Denis
>
>-Origi
Andrew,
I have the second edition of Ms. Radia's book and I hope this is what your
looking for. If your refering to router policies not converging causing
other routers to change their minds, back and forth, then on the bottom of
page 435.
Timothy Griffin and Gordon Wilfong, "An Analysis of BG
Just so happen to have a copy next to me. You're probably looking for:
RFC 1771 or BGP4:Inter-Domain Routing in the Internet, by John Stewart.
Denis
-Original Message-
From: Andrew Smith [mailto:[EMAIL PROTECTED]]
Sent: Friday, July 21, 2000 7:44 AM
To: [EMAIL PROTECTED]
Subject: BGP wh
5 matches
Mail list logo
