1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/* $OpenBSD: rde_decide.c,v 1.7 2003/12/26 22:41:01 henning Exp $ */
/*
* Copyright (c) 2003 Claudio Jeker <claudio@openbsd.org>
* Copyright (c) 2003 Henning Brauer <henning@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/queue.h>
#include "bgpd.h"
#include "ensure.h"
#include "rde.h"
/*
* Decision Engine RFC implementation:
* Phase 1:
* - calculate LOCAL_PREF if needed -- EBGP or IGP learnt routes
* - IBGP routes may either use LOCAL_PREF or the local system computes
* the degree of preference
* - If the route is ineligible, the route MAY NOT serve as an input to
* the next phase of route selection
* - if the route is eligible the computed value MUST be used as the
* LOCAL_PREF value in any IBGP readvertisement
*
* Phase 2:
* - If the NEXT_HOP attribute of a BGP route depicts an address that is
* not resolvable the BGP route MUST be excluded from the Phase 2 decision
* function.
* - If the AS_PATH attribute of a BGP route contains an AS loop, the BGP
* route should be excluded from the Phase 2 decision function.
* - The local BGP speaker identifies the route that has:
* a) the highest degree of preference of any route to the same set
* of destinations
* b) is the only route to that destination
* c) is selected as a result of the Phase 2 tie breaking rules
* - The local speaker MUST determine the immediate next-hop address from
* the NEXT_HOP attribute of the selected route.
* - If either the immediate next hop or the IGP cost to the NEXT_HOP changes,
* Phase 2 Route Selection MUST be performed again.
*
* Route Resolvability Condition
* - A route Rte1, referencing only the intermediate network address, is
* considered resolvable if the Routing Table contains at least one
* resolvable route Rte2 that matches Rte1's intermediate network address
* and is not recursively resolved through Rte1.
* - Routes referencing interfaces are considered resolvable if the state of
* the referenced interface is up and IP processing is enabled.
*
* Breaking Ties (Phase 2)
* 1. Remove from consideration all routes which are not tied for having the
* smallest number of AS numbers present in their AS_PATH attributes.
* Note, that when counting this number, an AS_SET counts as 1
* 2. Remove from consideration all routes which are not tied for having the
* lowest Origin number in their Origin attribute.
* 3. Remove from consideration routes with less-preferred MULTI_EXIT_DISC
* attributes. MULTI_EXIT_DISC is only comparable between routes learned
* from the same neighboring AS.
* 4. If at least one of the candidate routes was received via EBGP,
* remove from consideration all routes which were received via IBGP.
* 5. Remove from consideration any routes with less-preferred interior cost.
* If the NEXT_HOP hop for a route is reachable, but no cost can be
* determined, then this step should be skipped.
* 6. Remove from consideration all routes other than the route that was
* advertised by the BGP speaker whose BGP Identifier has the lowest value.
* 7. Prefer the route received from the lowest peer address.
*
* Phase 3: Route Dissemination
* - All routes in the Loc-RIB are processed into Adj-RIBs-Out according
* to configured policy. A route SHALL NOT be installed in the Adj-Rib-Out
* unless the destination and NEXT_HOP described by this route may be
* forwarded appropriately by the Routing Table.
*/
/*
* Decision Engine OUR implementation:
* Our implementation has only one RIB. The filtering is done first. The
* filtering calculates the preference and stores it in LOCAL_PREF (Phase 1).
* Ineligible routes are flagged as ineligible via nexthop_add(). The flags
* are inherited from the nexthop descriptor.
* Phase 3 is done together with Phase 2 -- the output filtering is done in
* the session engine.
* In following cases a prefix needs to be reevaluated:
* - update of a prefix (path_update)
* - withdraw of a prefix (prefix_remove)
* - state change of the nexthop (nexthop-{in}validate)
* - state change of session (session down)
*
*/
/*
* compare two prefixes with equal pt_entry. Returns an integer greater than or
* less than 0, according to whether the prefix p1 is more or less preferred
* than the prefix p2. p1 should be used for the new prefix and p2 for a
* already added prefix.
*/
static int
prefix_cmp(struct prefix *p1, struct prefix *p2)
{
struct rde_aspath *asp1, *asp2;
ENSURE(p1 != NULL);
/* p2 is allowed to be NULL */
if (p2 == NULL)
return (1);
asp1 = p1->aspath;
asp2 = p2->aspath;
/* 1. check if prefix is eligible a.k.a reachable */
if (asp2->nexthop == NULL)
return (1);
if (asp1->nexthop == NULL)
return (-1);
if (asp2->nexthop->state != NEXTHOP_REACH)
return (1);
if (asp1->nexthop->state != NEXTHOP_REACH)
return (-1);
/* 2. preference of prefix, bigger is better */
if ((asp1->flags.lpref - asp2->flags.lpref) != 0)
return (asp1->flags.lpref - asp2->flags.lpref);
/* 3. aspath count, the shorter the better */
if ((asp2->flags.aspath->hdr.as_cnt -
asp1->flags.aspath->hdr.as_cnt) != 0)
return (asp2->flags.aspath->hdr.as_cnt -
asp1->flags.aspath->hdr.as_cnt);
/* 4. origin, the lower the better */
if ((asp2->flags.origin - asp1->flags.origin) != 0)
return (asp2->flags.origin - asp1->flags.origin);
/* 5. MED decision, only comparable between the same neighboring AS */
if (aspath_neighbour(asp1->flags.aspath) ==
aspath_neighbour(asp2->flags.aspath))
/* the bigger, the better */
if ((asp1->flags.med - asp2->flags.med) != 0)
return (asp1->flags.med - asp2->flags.med);
/* 6. EBGP is cooler than IBGP */
/*
* It is absolutely important that the ebgp value in peer_config.ebgp
* is bigger than all other ones (IBGP, confederations)
*/
if ((p1->peer->conf.ebgp - p2->peer->conf.ebgp) != 0) {
if (p1->peer->conf.ebgp == 1) /* p1 is EBGP other is lower */
return 1;
else if (p2->peer->conf.ebgp == 1) /* p2 is EBGP */
return -1;
}
/* 7. nexthop costs. NOT YET -> IGNORE */
/* 8. lowest BGP Id wins */
if ((p2->peer->remote_bgpid - p1->peer->remote_bgpid) != 0)
return (p2->peer->remote_bgpid - p1->peer->remote_bgpid);
/* 9. lowest peer address wins */
if ((p2->peer->conf.remote_addr.sin_addr.s_addr -
p1->peer->conf.remote_addr.sin_addr.s_addr) != 0)
return (p2->peer->conf.remote_addr.sin_addr.s_addr -
p1->peer->conf.remote_addr.sin_addr.s_addr);
fatalx("Uh, oh a politician in the decision process");
/* NOTREACHED */
return 0;
}
/*
* Find the correct place to insert the prefix in the prefix list.
* If the active prefix has changed we need to send an update.
* The to evaluate prefix must not be in the prefix list.
*/
void
prefix_evaluate(struct prefix *p, struct pt_entry *pte)
{
struct prefix *xp;
if (p != NULL) {
if (LIST_EMPTY(&pte->prefix_h))
LIST_INSERT_HEAD(&pte->prefix_h, p, prefix_l);
else {
LIST_FOREACH(xp, &pte->prefix_h, prefix_l)
if (prefix_cmp(p, xp) > 0) {
LIST_INSERT_BEFORE(xp, p, prefix_l);
break;
}
}
}
xp = LIST_FIRST(&pte->prefix_h);
if (pte->active != xp) {
/* need to generate an update */
if (pte->active != NULL) {
ENSURE(pte->active->aspath != NULL);
ENSURE(pte->active->aspath->active_cnt > 0);
pte->active->aspath->active_cnt--;
}
/*
* XXX send update with remove for pte->active and add for xp
* but remember that xp may be ineligible or NULL.
* do not send an update if the only available path
* has an unreachable nexthop
*/
if (!(xp != NULL && xp->aspath->nexthop != NULL &&
xp->aspath->nexthop->state != NEXTHOP_REACH))
rde_send_kroute(xp, pte->active);
if (xp == NULL || xp->aspath->nexthop == NULL ||
xp->aspath->nexthop->state != NEXTHOP_REACH)
pte->active = NULL;
else {
pte->active = xp;
pte->active->aspath->active_cnt++;
ENSURE(pte->active->aspath->active_cnt <=
pte->active->aspath->prefix_cnt);
}
}
}
|
