- 积分
- 648
- 鸿鹄币
- 个
- 好评度
- 点
- 精华
- 最后登录
- 1970-1-1
- 阅读权限
- 40
- 听众
- 收听
中级工程师
   
|
发表于 2012-7-5 17:08:23
|
显示全部楼层
6.Prefer the path with the lowest multi-exit discriminator (MED). Note the following:- ]$ n, w; G; g. U! |
a.- This comparison is done only if the first (neighboring) AS is the same in the two paths; any Confederation Sub-autonomous systems are ignored. In other words, MEDs are compared only if the first AS in the AS_SEQUENCE is the same for multiple paths. Any preceding AS_CONFED_SEQUENCE is ignored.
0 K* z2 ~% m! w* j b.- If bgp always-compare-med is enabled, MEDs are compared for all paths. This option needs to be enabled over the entire AS, otherwise, routing loops can occur.1 e- o( j J |) n2 p
c.- If bgp bestpath med-confed is enabled, MEDs are compared for all paths that consist only of AS_CONFED_SEQUENCE (paths originated within the local confederation).& M# G. Z2 M! `- F1 q
d.- Paths received from a neighbor with a MED of 4,294,967,295 will have the MED changed to 4,294,967,294 before insertion into the BGP table.
( Z% J# P5 ` v) t6 l7 L$ l e.- Paths received with no MED are assigned a MED of 0, unless bgp bestpath missing-as-worst is enabled; in that case, they are assigned a MED of 4,294,967,294.. w0 Q8 N+ n# R9 N6 s% ^
f.- The bgp deterministic med command also can influence this step.- J" @1 |9 D4 C- K3 N6 S% @2 k
6.优先选择具有最低MED值的路径。注意:% e: a, U8 o6 b5 ]8 ?1 C0 c' B$ Y
n 只有两条路径来自于同一个AS时,才进行MED的比较。联盟子AS将被忽略。换句话说,就是多条路径的AS_SEQUENCE中的第一个AS相同时,才比较MED。任何AS_CONFED_SEQUENCE都将被忽略
^! Q- Q; V, O& E5 c8 dn 如果bgp always-compare-med被激活,将对所有路径进行MED比较。这个选项需要在整个AS中激活,否则可能出现路由环路
3 _/ w4 ?* `; G. E) Rn 如果bgp bestpath med-confed被激活,将在仅由AS_CONFED_SEQUENCE(由本地联盟产生的路径)组成的所有路径之间比较MED6 Q' f" Y& Q" v6 O& H1 \8 u
n 从邻居收到的MED值为4294967295的路径在插入BGP表之前,要将值改为4294967294# u% h6 f* c- j5 p0 N
n 对于收到的没有MED值的路径,除非bgp bestpath missing-as-worst命令被激活,否则都要分配一个MED值0.在激活该命令的情况下,路径将赋予MED值4294947294 |
34#
2012-7-5 17:08:23
回复(0)
收起回复
|