-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdraft-keyupate-lsvr-applicability-01.xml
454 lines (388 loc) · 20.1 KB
/
draft-keyupate-lsvr-applicability-01.xml
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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
<?xml version="1.0"?>
<!DOCTYPE rfc SYSTEM "rfc2629.dtd" [
<!-- One method to get references from the online citation libraries.
There has to be one entity for each item to be referenced.
An alternate method (rfc include) is described in the references. -->
<!ENTITY RFC2119 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.2119.xml">
<!ENTITY RFC2328 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.2328.xml">
<!ENTITY RFC4271 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.4271.xml">
<!ENTITY RFC2328 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.2328.xml">
<!ENTITY RFC5580 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.5580.xml">
<!ENTITY RFC4957 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.4957.xml">
<!ENTITY RFC7752 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.7752.xml">
<!ENTITY RFC7938 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.7938.xml">
<!ENTITY RFC5925 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.5925.xml">
<!ENTITY RFC7938 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.7938.xml">
<!ENTITY RFC8174 SYSTEM
"http://xml.resource.org/public/rfc/bibxml/reference.RFC.8174.xml">
<!ENTITY I-D.draft-keyupate-lsvr-bgp-spf SYSTEM
"http://xml.resource.org/public/rfc/bibxml3/reference.I-D.draft-keyupate-lsvr-bgp-spf-00.xml">
<!ENTITY I-D.draft-acee-idr-lldp-peer-discovery SYSTEM
"http://xml.resource.org/public/rfc/bibxml3/reference.I-D.draft-acee-idr-lldp-peer-discovery-02.xml">
<!ENTITY I-D.draft-xu-idr-neighbor-autodiscovery SYSTEM
"http://xml.resource.org/public/rfc/bibxml3/reference.I-D.draft-xu-idr-neighbor-autodiscovery-06.xml">
<!ENTITY I-D.draft-ymbk-lsvr-lsoe SYSTEM
"http://xml.resource.org/public/rfc/bibxml3/reference.I-D.draft-ymbk-lsvr-lsoe-00.xml">
<!ENTITY I-D.draft-li-dynamic-flooding SYSTEM
"http://xml.resource.org/public/rfc/bibxml3/reference.I-D.draft-li-dynamic-flooding-04.xml">
]>
<?rfc comments="yes"?>
<?rfc compact="no"?>
<?rfc inline="yes"?>
<?rfc sortrefs="yes"?>
<?rfc subcompact="no"?>
<?rfc symrefs="yes"?>
<?rfc toc="yes"?>
<?rfc tocdepth="5"?>
<?rfc tocindent="yes"?>
<?rfc tocompact="yes"?>
<rfc category="info" docName="draft-keyupate-lsvr-applicability-01.txt"
ipr="trust200902">
<front>
<title abbrev="">Usage and Applicability of Link State Vector Routing in Data Centers </title>
<author fullname="Keyur Patel" initials="K"
surname="Patel">
<organization>Arrcus, Inc.</organization>
<address>
<postal>
<street>2077 Gateway Pl</street>
<city>San Jose, CA</city>
<country>USA</country>
<code>95110</code>
</postal>
<phone></phone>
<email>[email protected]</email>
</address>
</author>
<author fullname="Acee Lindem" initials="A"
surname="Lindem">
<organization>Cisco Systems</organization>
<address>
<postal>
<street>301 Midenhall Way</street>
<city>Cary, NC</city>
<country>USA</country>
<code>95110</code>
</postal>
<phone></phone>
<email>[email protected]</email>
</address>
</author>
<author fullname="Shawn Zandi" initials="S"
surname="Zandi">
<organization>Linkedin</organization>
<address>
<postal>
<street>222 2nd Street</street>
<city>San Francisco</city>
<region>CA</region>
<code>94105</code>
<country>USA</country>
</postal>
<email>[email protected]</email>
</address>
</author>
<author fullname="Gaurav Dawra" initials="G"
surname="Dawra">
<organization>Linkedin</organization>
<address>
<postal>
<street>222 2nd Street</street>
<city>San Francisco</city>
<region>CA</region>
<code>94105</code>
<country>USA</country>
</postal>
<email>[email protected]</email>
</address>
</author>
<date/>
<area>Routing</area>
<workgroup>LSVR</workgroup>
<abstract>
<t>
This document discusses the usage and applicability of Link State Vector Routing
(LSVR) extensions in the CLOS architecture of Data Center Networks. The document is
intended to provide a simplified guide for the deployment of LSVR extensions.
</t>
</abstract>
</front>
<middle>
<section anchor="intro" title="Introduction">
<t>
This document complements <xref target="I-D.keyupate-lsvr-bgp-spf"/> by
discussing the applicability of the technology in a simple and fairly common
deployment scenario, which is described in <xref target="usecases"/>.
</t>
<t>
After describing the deployment scenario, <xref target="motivation"/>
will describe the reasons for BGP modifications for such deployments.
</t>
<t>
Once the control plane routing protocol requirements are described,
<xref target="bgpspf"/> will cover the LSVR protocol enhancements
to BGP to meet these requirements and their applicability to Data Center
CLOS networks.
</t>
</section>
<section title="Requirements Language">
<t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL
NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED",
"MAY", and "OPTIONAL" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/>
when, and only when, they appear in all capitals, as shown here.</t>
</section>
<section anchor="reco" title="Recommended Reading">
<t>
This document assumes knowledge of existing data center networks and data center
network topologies <xref target="CLOS"/>. This document also assumes
knowledge of data center routing protocols like
BGP <xref target="RFC4271"/>, BGP-SPF <xref target="I-D.keyupate-lsvr-bgp-spf"/>,
OSPF <xref target="RFC2328"/>, as well as,
data center OAM protocols like LLDP <xref target="RFC4957"/> and
BFD <xref target="RFC5580"/>.
</t>
</section>
<section anchor="usecases" title="Common Deployment Scenario">
<t>
Within a Data Center, a common network design to interconnect servers is done using the CLOS
topology <xref target="CLOS"/>. The CLOS topology is fully non-blocking and the topology is
realized using Equal Cost Multipath (ECMP). In a CLOS topology, the minimum number
of parallel paths between two servers is determined by the width of a tier-1 stage as shown in
the figure 1.
</t>
<t>
The following example illustrates multistage CLOS topology.
</t>
<figure align="center" anchor="fig1" title="Illustration of the basic CLOS">
<artwork align="left"><![CDATA[
Tier-1
+-----+
|NODE |
+->| 12 |--+
| +-----+ |
Tier-2 | | Tier-2
+-----+ | +-----+ | +-----+
+------------>|NODE |--+->|NODE |--+--|NODE |-------------+
| +-----| 9 |--+ | 10 | +--| 11 |-----+ |
| | +-----+ +-----+ +-----+ | |
| | | |
| | +-----+ +-----+ +-----+ | |
| +-----+---->|NODE |--+ |NODE | +--|NODE |-----+-----+ |
| | | +---| 6 |--+->| 7 |--+--| 8 |---+ | | |
| | | | +-----+ | +-----+ | +-----+ | | | |
| | | | | | | | | |
+-----+ +-----+ | +-----+ | +-----+ +-----+
|NODE | |NODE | Tier-3 +->|NODE |--+ Tier-3 |NODE | |NODE |
| 1 | | 2 | | 3 | | 4 | | 5 |
+-----+ +-----+ +-----+ +-----+ +-----+
| | | | | | | |
A O B O <- Servers -> Z O O O
]]></artwork>
</figure>
</section>
<section anchor="motivation" title="Justification for BGP SPF Extension">
<t>
Many data centers
use BGP as a routing protocol to create an overlay as well as an underlay network for their CLOS
Topologies to simplify layer-3 routing and operations <xref target="RFC7938"/>.
However, BGP is a path-vector routing protocol. Since it
does not create a fabric topology, it uses hop-by-hop EBGP peering to
facilitate hop-by-hop routing to create the underlay network and to resolve any
overlay next hops.
The hop-by-hop BGP peering paradigm imposes several
restrictions within a CLOS. It severely prohibits a deployment of Route Reflectors/Route
Controllers as the EBGP peerings are inline with the data path. The BGP best path algorithm is
prefix-based and it prevents announcements of prefixes to other BGP speakers until the best
path decision process is performed for the prefix at each intermediate hop.
These restrictions significantly delay the overall convergence of the underlay
network within a CLOS.
</t>
<t>
The LSVR SPF modifications allow BGP to overcome these limitations. Furthermore, using the BGP-LS NLRI
format <xref target="RFC7752"/> allows the LSVR data to be advertised for nodes, links, and prefixes in the
BGP routing domain and used for SPF computations.
</t>
</section>
<section anchor="bgpspf" title="LSVR Applicability to CLOS Networks">
<t>
With the BGP SPF extensions <xref target="I-D.keyupate-lsvr-bgp-spf"/>, the BGP
best path computation and route computation are replaced with OSPF-like
algorithms <xref target="RFC2328"/> both to determine whether an BGP-LS NLRI
has changed and needs to be re-advertised and to compute the routing table.
These modifications will significantly improve convergence of the underlay
while affording the operational benefits of a single routing protocol
<xref target="RFC7938"/>.
</t>
<t>
Data center controllers typically require visibility to the BGP topology to compute
traffic-engineered paths. These controllers learn the topology and other relevant
information via the BGP-LS address family <xref target="RFC7752"/> which is totally
independent of the underlay address families (usually IPv4/IPv6 unicast). Furthermore,
in traditional BGP underlays, all the BGP routers will need to advertise their BGP-LS
information independently. With the BGP
SPF extensions, controllers can learn the topology using the same BGP advertisements
used to compute the underlay routes. Furthermore, these data center controllers can
avail the convergence advantages of the BGP SPF extensions. The placement of
controllers can be outside of the forwarding path or within the forwarding path.
</t>
<t>
Alternatively, as each and every router in the BGP SPF domain will have a complete view
of the topology, the operator can also choose to configure BGP sessions in hop-by-hop
peering model described in <xref target="RFC7938"/> along with BFD <xref target="RFC5580"/>.
In doing so, while the hop-by-hop peering model lacks inherent benefits of the
controller-based model, BGP updates need not be serialized by BGP best path algorithm in
either of these models. This helps overall network convergence.
</t>
<section anchor="lsvrsafi" title="Usage of BGP-LS SAFI">
<t>
The BGP SPF extensions <xref target="I-D.keyupate-lsvr-bgp-spf"/> define a new BGP-LS SAFI
for announcement of BGP SPF link-state. The NLRI format and its associated attributes follow
the format of BGP-LS for node, link, and prefix announcements. Whether the peering
model within a CLOS follows hop-by-hop peering described in <xref target="RFC7938"/> or any
controller-based or route-reflector peering, an operator can exchange BGP SPF SAFI routes over
the BGP peering by simply configuring BGP SPF SAFI between the necessary BGP speakers.
</t>
<t>
The BGP-LS SPF SAFI can also co-exist with BGP IP Unicast SAFI which could exchange overlapping IP routes.
The routes received by these SAFIs
are evaluated, stored, and announced separately according to the rules of <xref target="RFC4760"/>. The
tie-breaking of route installation is a matter of the local policies and preferences of the network
operator.
</t>
<t>
Finally, as the BGP SPF peering is done following the procedures described in <xref target="RFC4271"/>, all the
existing transport security mechanisms including <xref target="RFC5925"/> are available for the BGP-LS SPF SAFI.
</t>
<section anchor="other-safi" title="Relationship to Other BGP AFI/SAFI Tuples">
<t>Normally, the BGP-LS AFI/SAFI is used solely to compute the underlay and is given preference over other
AFI/SAFIs. Other BGP SAFIs, e.g., IPv6/IPv6 Unicast VPN would use the BGP-SPF computed routes for next hop
resolution. However, if BGP-LS NLRI is also being advertised for controller consumption, there is no need
to replicate the Node, Link, and Prefix NLRI in BGP-NLRI. Rather, additional NLRI attributes can be advertised
in the BGP-LS SPF AFI/SAFI as required.
</t>
</section>
</section>
<section anchor="peering" title="Peering Models">
<t>
As previously stated, BGP SPF can be deployed using the existing peering model
where there is a single hop BGP session on each and every link in the data center
fabric <xref target="RFC7938"/>. This provides for both the advertisement of routes
and the determination of link and neighboring switch availability. With BGP SPF, the underlay will converge
faster due to changes in the decision process to allow NLRI changes to be readvertised after detecting a
change.
</t>
<t>
Alternately, BFD <xref target="RFC5580"/> can be used to swiftly determine the availability of links and
the BGP peering model can be significantly sparser than the data center fabric. BGP SPF sessions then only
be established with enough peers to provide a bi-connected graph. If IEBGP is used, then the BGP routers at
tier N-1 will act as route-reflectors for the routers at tier N.
</t>
<section anchor="bi-connected" title="Bi-Connected Graph Heuristic">
<t>With this heuristic, discovery of BGP peers is assumed <xref target="bgp-discovery"/>. Additionally, it
assumed that the direction of the peering can be ascertained. In the context of a data center fabric, direction
is either northbound (toward the spine), southbound (toward the Top-Of-Rack (TOR) switches) or east-west (same
level in hierarchy. The determination of the direction is beyond the scope of this document. However, it would
be reasonable to assume a technique where the TOR switches can be identified and the number of hops to the TOR
is used to determine the direction.</t>
<t>In this heuristic, BGP speakers allow passive session establishment for southbound BGP sessions. For northbound
sessions, BGP speakers will attempt to maintain two northbound BGP sessions with different switches (in data center
fabrics there is normally a single layer-3 connection anyway). For east-west sessions, passive BGP session
establishment is allowed. However, BGP speaker will never actively establish an east-west BGP session unless
it can't establish two northbound BGP sessions.</t>
</section>
</section>
<section anchor="bgp-discovery" title="BGP Peer Discovery">
<t>
While BGP peer discovery is not part of <xref target="I-D.keyupate-lsvr-bgp-spf"/>, there are, at least,
three proposals for BGP peer discovery. At least one of these mechanisms will be adopted and will
be applicable to deployments other than the data center. It is strongly RECOMMENDED that the accepted
mechanism be used in conjunction with BGP SPF in data centers. The BGP discovery mechanism should discovery
both peer addresses and endpoints for BFD discovery. Additionally, it would be great if there were a
heuristic for determining whether the peer is at a tier above or below the discovering BGP speaker (refer to
<xref target="bi-connected"/>).
</t>
<t>
The BGP discovery mechanisms under consideration are <xref target="I-D.acee-idr-lldp-peer-discovery"/>,
<xref target="I-D.xu-idr-neighbor-autodiscovery"/>, and <xref target="I-D.ymbk-lsvr-lsoe"/>.
</t>
</section>
<section anchor="dci" title="Data Center Interconnect (DCI) Applicability">
<t>
Since BGP SPF is to be used for the routing underlay and DCI gateway boxes typically have direct
or very simple connectivity, BGP external sessions would typically not include the BGP SPF SAFI.
</t>
</section>
<section anchor="other-env" title="Non-CLOS/FAT Tree Topology Applicability">
<t>
The BGP SPF extensions <xref target="I-D.keyupate-lsvr-bgp-spf"/> can be used in other topologies and avail
the inherent convergence improvements. Additionally, sparse peerting techniques may be utilized
<xref target="peering"/>. However, determining whether or to establish a BGP session is more complex and
the heuristic described in <xref target="bi-connected"/> cannot be used. In such topologies, other
techniques such as those described in <xref target="I-D.li-dynamic-flooding"/> may be employed.
One potential deployment would be the underlay for a Service Provider (SP) backbone where usage of a
single protocol, i.e., BGP, is desired.
</t>
</section>
</section>
<section anchor="IANA" title="IANA Considerations">
<t>
No IANA updates are requested by this document.
</t>
</section>
<section anchor="Security" title="Security Considerations">
<t>
This document introduces no new security considerations above
and beyond those already specified in the <xref target="RFC4271"/> and
<xref target="I-D.keyupate-lsvr-bgp-spf"/>.
</t>
</section>
<section anchor="Acknowledgements" title="Acknowledgements">
<t>
The authors would like to thank Alvaro Retana and Yan Filyurin for the review and comments.
</t>
</section>
</middle>
<back>
<references title="Normative References">
<?rfc include="reference.RFC.2119"?>
<?rfc include="reference.RFC.8174"?>
&I-D.draft-keyupate-lsvr-bgp-spf;
</references>
<references title="Informative References">
<?rfc include="reference.RFC.4271"?>
<?rfc include="reference.RFC.2328"?>
<?rfc include="reference.RFC.5580"?>
<?rfc include="reference.RFC.4957"?>
<?rfc include="reference.RFC.7752"?>
<?rfc include="reference.RFC.7938"?>
<?rfc include="reference.RFC.5925"?>
<?rfc include="reference.RFC.4760"?>
&I-D.draft-acee-idr-lldp-peer-discovery;
&I-D.draft-xu-idr-neighbor-autodiscovery;
&I-D.draft-ymbk-lsvr-lsoe;
&I-D.draft-li-dynamic-flooding;
<reference anchor="CLOS" target="">
<front>
<title>A Study of Non-Blocking Switching Networks</title>
<author initials="" surname="">
<organization></organization>
</author>
<date month='March' year='1953' />
</front>
<seriesInfo name='' value='The Bell System Technical Journal, Vol. 32(2),
DOI 10.1002/j.1538-7305.1953.tb01433.x' />
</reference>
</references>
</back>
</rfc>