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
|
$Id: IMPLEMENTATION.txt,v 1.2 2005/02/15 17:10:03 gdt Exp $
This file contains notes about the internals of the BGP
implementation. The initial impetus is understanding the memory usage
of Quagga'a BGP implementation. There may be some inaccuracies; it is
in the repository in the hopes that it will be significantly more
helpful than not.
* FILES
bgp_advertise.[hc]:
data structures: advertised prefixes, attributes
bgp_aspath.[hc]:
struct aspath:
These are stored in a hash, apparently in wire format.
bgp_attr.[hc]:
struct attr: contains all attributes
size(ILP32) 26 words/104 bytes (poor packing, v6/multicast is 10)
bgp_attr_parse: origin, aspath, next hop probably most of interest
bgp_attr_origin: set flag bit
bgp_attr_aspath: put in refcounted hash table, so share pointer
bgp_attr_nexthop: store in attribute structure
bgp_btoa.c: ? test program
bgp_clist.[hc]:
data structures: community lists (including permit/deny state)
bgp_community.[hc]:
data structures: community atttributes (multiple communities per struct)
bgp_damp.[hc]:
per-route damping data, and damping control information
bgp_debug.[hc]:
debugging support (vty config, dump of packets)
bgp_dump.[hc]:
MRT-compatible dump format routines
bgp_ecommunity.[hc]:
Extended communities attributes (multiple ecommmunities per struct)
bgp_filter.[hc]:
AS path access list filtering
bgp_fsm.[hc]:
Per-peer state machine for TCP connection, hold time, etc.
bgp_main.c:
Daemon startup.
bgp_mplsvpn.[hc]:
parsing of attribute structures for MPLS VPNs [need better description]
bgp_network.[hc]:
Opening and binding of sockets, finding addresses for interfaces
bgp_nexthop.[hc]:
data structures: Nexthop cache [not clear how used, if truly cache
in sense of memoization, or something else]
importing EGP routes into IGP (thread created)
"scanning" (thread created)
bgp_scan: has useful clues to data structure complexity. Scanning
process iterates over database of received advertisements, and
builds 'cache' structure.
bgp_open.[ch]:
Open messages, and capability negotiation
bgp_packet.[hc]
sending and receiving of UPDATE/WITHDRAW
collision resolution for simultanteous opens
bgp_read: top-level read routine: reads whole packet (nonblocking)
and dispatches to per-message-type receive
bgp_update_receive:
calls bgp_attr_parse
reads nrli into struct bgp_nrli update
uninterning of aspath, community, ecommmunity, cluster,
transit which were interned in bgp_attr_parse
bgp_regex.[ch]:
Glue to convert BGP regexps to standard (_ means many things).
bgp_route.[hc]:
data structures: routes as received, static routes
Application of filters. Lots of route processing.
bgp_nlri_parse:
sanity checks, then calls bgp_update with peer, prefix, attributes pointer
bgp_update: bgp_update_main, then RS processing
bgp_update_main:
find 'struct bgp_node *' for this afi/safi
look for route in table, then 'intern' attributes
** interning is process of
looking for data in hash table, and putting there if missing, refcnt
using pointer to existing data
many validity checks
get new struct bgp_path_info
call bgp_path_info_add with rn and bgp_path_info
call bgp_process
bgp_routemap.c
implementation of route maps (match and set)
bgp_snmp.c
SNMP glue. Not particularly interesting except to add variables or
debug SNMP.
bgp_table.[hc]
data structures: struct bgp_table, struct bgp_node
allocation/lookup/utility operations - not a lot of protocol processin
bgp_vty.[hc]
protocol-wide vty hooks
bgp_zebra.[hc]
Processing interface events from zebra, redistribution of routes.
bgpd.h
struct bgp_master: daemon main data structure
struct bgp: per-instance structure
struct peer_group
struct bgp_notify: (in-core representation of wire format?)
struct bgp_nexthop: (v4 and v6 addresses, *ifp)
struct bgp_filter: distribute, prefix, aslist, route_maps
struct peer: neighbor structure (very rich/complex)
struct bgp_nlri: reference to wire format
#define of protocol constants
attribute type codes
fsm states/events
timer values
bgpd.c
instance/peer allocation
configuration
initialization/termination
* DATA STRUCTURE SIZES
Question: How much memory does quagga's bgpd use as a function of
state received from peers?
It seems that a struct bgp_path_info is kept for each prefix. The "struct
attr *" is interned, and variables within that are interned. So, 40
bytes are kept per received prefix, plus interned shared values. This
could be 36 if 'int suppress' where changed to a u_char and moved to
be with the other u_chars. Without MPLS, this could be 32 bytes.
Note that 8 bytes of this is linked list overhead, meaning that 24
bytes are the raw per-prefix storage requirements.
Also, a struct bgp_damp_info is apparently maintained per route; this
is fairly large (about 44 bytes).
[TODO: the role of struct bgp_node.]
* TIME COMPLEXITY
It appears that received prefixes from each peer are stored in a
linked list.
|
