/
draft-ietf-bier-te-arch-10.xml
2333 lines (1903 loc) · 124 KB
/
draft-ietf-bier-te-arch-10.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
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?xml version="1.0" encoding="US-ASCII"?>
<!-- This template is for creating an Internet Draft using xml2rfc,
which is available here: http://xml.resource.org. -->
<!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 RFC2205 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.2205.xml">
<!ENTITY RFC2212 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.2212.xml">
<!ENTITY RFC2629 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.2629.xml">
<!ENTITY RFC3209 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.3209.xml">
<!ENTITY RFC3552 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.3552.xml">
<!ENTITY RFC4253 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.4253.xml">
<!ENTITY RFC4655 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.4655.xml">
<!ENTITY RFC5440 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.5440.xml">
<!ENTITY RFC7752 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.7752.xml">
<!ENTITY RFC8345 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8345.xml">
<!ENTITY RFC8401 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8401.xml">
<!ENTITY RFC8402 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8402.xml">
<!ENTITY RFC8444 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8444.xml">
<!ENTITY RFC5226 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.5226.xml">
<!ENTITY RFC6241 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.6241.xml">
<!ENTITY RFC7589 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.7589.xml">
<!ENTITY RFC8174 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8174.xml">
<!ENTITY RFC8253 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8253.xml">
<!ENTITY RFC8279 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8279.xml">
<!ENTITY RFC8296 SYSTEM "http://xml.resource.org/public/rfc/bibxml/reference.RFC.8296.xml">
]>
<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>
<!-- used by XSLT processors -->
<!-- For a complete list and description of processing instructions (PIs),
please see http://xml.resource.org/authoring/README.html. -->
<!-- Below are generally applicable Processing Instructions (PIs) that most I-Ds might want to use.
(Here they are set differently than their defaults in xml2rfc v1.32) -->
<?rfc strict="yes" ?>
<!-- give errors regarding ID-nits and DTD validation -->
<!-- control the table of contents (ToC) -->
<?rfc toc="yes"?>
<!-- generate a ToC -->
<?rfc tocdepth="4"?>
<!-- the number of levels of subsections in ToC. default: 3 -->
<!-- control references -->
<?rfc symrefs="yes"?>
<!-- use symbolic references tags, i.e, [RFC2119] instead of [1] -->
<?rfc sortrefs="yes" ?>
<!-- sort the reference entries alphabetically -->
<!-- control vertical white space
(using these PIs as follows is recommended by the RFC Editor) -->
<?rfc compact="yes" ?>
<!-- do not start each main section on a new page -->
<?rfc subcompact="no" ?>
<!-- keep one blank line between list items -->
<?rfc iprnotified="no" ?>
<!-- Change to "yes" if someone has disclosed IPR for the draft -->
<!-- end of list of popular I-D processing instructions -->
<rfc ipr="trust200902" docName="draft-ietf-bier-te-arch-10" category="std">
<front>
<title abbrev="BIER-TE ARCH">Tree Engineering for Bit Index Explicit Replication (BIER-TE)</title>
<author role="editor" fullname="Toerless Eckert" initials="T.T.E." surname="Eckert">
<organization abbrev="Futurewei">Futurewei Technologies Inc.</organization>
<address>
<postal>
<street>2330 Central Expy</street>
<city>Santa Clara</city>
<code>95050</code>
<country>USA</country>
</postal>
<email>tte+ietf@cs.fau.de</email>
</address>
</author>
<author fullname="Gregory Cauchie" initials="G.C." surname="Cauchie">
<organization>Bouygues Telecom</organization>
<address>
<email>GCAUCHIE@bouyguestelecom.fr</email>
</address>
</author>
<author fullname="Michael Menth" initials="M.M." surname="Menth">
<organization>University of Tuebingen</organization>
<address>
<email>menth@uni-tuebingen.de</email>
</address>
</author>
<date month="July" year="2021"/>
<abstract>
<t> This memo describes per-packet stateless strict and loose path
steered replication and forwarding for Bit Index Explicit Replication
packets (RFC8279). It is called BIER Tree Engineering (BIER-TE) and
is intended to be used as the path steering mechanism for Traffic Engineering
with BIER.</t>
<t>BIER-TE introduces a new semantic for bit positions (BP) that indicate adjacencies,
as opposed to BIER in which BPs indicate Bit-Forwarding Egress Routers (BFER).
BIER-TE can leverage BIER forwarding engines with little changes.
Co-existence of BIER and BIER-TE forwarding in the same domain is possible, for example by using
separate BIER sub-domains (SDs). Except for the optional routed adjacencies, BIER-TE does not
require a BIER routing underlay, and can therefore operate without depending
on an Interior Gateway Routing protocol (IGP).</t>
<t>As it operates on the same per-packet stateless forwarding principles, BIER-TE
can also be a good fit to support multicast path steering in Segment Routing (SR) networks.</t>
</abstract>
</front>
<middle>
<section anchor="overview" title="Overview">
<t> BIER-TE is based on architecture, terminology and packet formats with BIER as
described in <xref target="RFC8279"/> and <xref target="RFC8296"/>. This
document describes BIER-TE in the expectation that the reader is familiar
with these two documents.</t>
<t>BIER-TE introduces a new semantic for bit positions (BP) that indicate adjacencies,
as opposed to BIER in which BPs indicate Bit-Forwarding Egress Routers (BFER).
With BIER-TE, the BIFT of each BFR is only populated with BP that are adjacent to the BFR
in the BIER-TE Topology. Other BPs are empty in the BIFT. The BFR replicate
and forwards BIER packets to adjacent BPs that are set in the packet.
BPs are normally also cleared upon forwarding to avoid duplicates and loops.
This is detailed further below.
</t>
<t>BIER-TE can leverage BIER forwarding engines with little or no changes.
It can also co-exist with BIER forwarding in the same domain, for example by using
separate BIER sub-domains. Except for the optional routed adjacencies, BIER-TE does not
require a BIER routing underlay, and can therefore operate without depending
on an Interior Gateway Routing protocol (IGP).</t>
<t>As it operates on the same per-packet stateless forwarding principles, BIER-TE
can also be a good fit to support multicast path steering in Segment Routing (SR) networks.</t>
<t>This document is structured as follows:
<list style="symbols">
<t><xref target="introduction"/> introduces BIER-TE with two reference
forwarding examples, followed by an introduction of the new concepts of the BIER-TE
(overlay) topology and finally a summary of the relationship between BIER and BIER-TE and a discussion of accelerated hardware forwarding.</t>
<t><xref target="components"/> describes the components of the BIER-TE architecture,
Flow overlay, BIER-TE layer with the BIER-TE control plane (including the BIER-TE controller) and BIER-TE forwarding plane, and the routing underlay.</t>
<t><xref target="forwarding"/> specifies the behavior of the BIER-TE forwarding plane with the different type of adjacencies and possible variations of BIER-TE forwarding pseudocode, and finally the mandatory and optional requirements.</t>
<t><xref target="controller-ops"/> describes operational considerations for the BIER-TE controller, foremost how the BIER-TE controller can optimize the use of BP by using specific type of BIER-TE adjacencies for different type of topological situations, but also how to assign bits to avoid loops and duplicates (which in BIER-TE does not come for free), and finally how SI, sub-domains and BFR-ids can be managed by a BIER-TE controller, examples and summary.</t>
<t><xref target="SR"/> concludes the technology specific sections of document by further relating BIER-TE to Segment Routing (SR).</t>
</list></t>
<t>Note that related work, <xref target="I-D.ietf-roll-ccast"/>
uses Bloom filters <xref target="Bloom70"/> to represent leaves or edges of the intended delivery tree. Bloom filters
in general can support larger trees/topologies with fewer addressing bits than explicit BitStrings,
but they introduce the heuristic risk of false positives and cannot clear bits in
the BitString during forwarding to avoid loops. For these reasons, BIER-TE
uses explicit BitStrings like BIER. The explicit BitStrings of BIER-TE can also
be seen as a special type of Bloom filter, and this is how related work <xref target="ICC"/>
describes it.</t>
<!-- Removed for now by review with Lou Berger
<section anchor="te" title="BIER-TE and Traffic Engineering (BIER-TE)">
<t>BIER-TE is not a standalone, complete traffic engineering signaling solution such as RSVP with RSVP-TE
extensions (<xref target="RFC2205"/>, <xref target="RFC3209"/>). Instead it is a BIER derived architecture
and forwarding plane that allows to signal "source-routed" paths and replication points without
per-path, per-replication-point state on the transit nodes. This document introduces the name
"Tree Engineering" for BitStrings using this semantic. BIER-TE is therefore more similar to Segment Routing
(SR, (<xref target="RFC8402"/>)) than RSVP-TE. Note that SR does not provide stateless replication point
and receiver set signaling in its packet header. See <xref target="SR"/> for a more detailed discussion of
BIER-TE and SR.</t>
<t>BIER-TE can be used alone in use cases not requiring bandwidth or buffer resource reservations,
such as high resilient services through dual transmission with path diversity or optimization
of network capacity utilization through calculated paths/trees ("load balancing across non-ECMP paths").
Due to its stateless BIER approach, BIER-TE does not create per-flow/per-tree state on intermedia nodes.</t>
<t>BIER-TE can also be combined with bandwidth and buffer management functions to support
traffic engineering such as per-flow guaranteed bandwidth and guaranteed latency across BIER-TE
steered paths / trees. Combinations of BIER or BIER-TE with such per-tree/per-flow resource
guarantees are called BIER-TE. The following paragraphs summarize options and considerations.</t>
<t>In <xref target="components"/> below, the BIER-TE architecture specifies the BIER-TE Controller
as an entity calculating both the BIER-TE topology and desired paths/trees for overlay flows
based on the desired policies. A Path Computation Engine (PCE, see <xref target="RFC4655"/>)
that can calculate the BitString for BIER-TE is an instance of such a BIER-TE Controller.
If the PCE can also perform resource management such as per-flow bandwidth reservations and
optional latency guarantees, then it becomes a PCE for BIER-TE with traffic engineering.</t>
<t>To support bandwidth guarantees in the forwarding plane, the ingres BIER-TE node
(BFIR) may need to have a per-flow policer if ingressed traffic is not trusted to stay within
its admitted traffic envelope. This is a well understood policy function that can be deployed
without changes to BIER-TE.</t>
<t>If latency guarantees as required as for example by Guaranteed Services (<xref target="RFC2212"/>),
then additional per-hop latency control in the forwarding plane can be required. This can also
be added to BIER-TE deployments without changes to BIER-TE. Per-hop stateless solutions for this
such as in <xref target="I-D.qiang-detnet-large-scale-detnet"/> would allow to maintain
the per-hop stateless design goal of BIER-TE and expand it into BIER-TE. Per-hop stateful solutions like
per-flow, per-hop shaping may also be beneficial given how BIER-TE eliminates the need for
per-flow, per-hop multicast replication and steering state.</t>
<t>Mechanisms how to combine BIER-TE or BIER with other mechanisms to build BIER-TE are outside
the scope of this document. See <xref target="I-D.eckert-teas-bier-te-framework"/>.</t>
</section>
-->
<section anchor="boilerplate" 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>
<section anchor="introduction" title="Introduction">
<section anchor="examples" title="Basic Examples">
<t>BIER-TE forwarding is best introduced with simple examples.</t>
<figure anchor="basic-example" title="BIER-TE basic example">
<artwork align="left"><![CDATA[
BIER-TE Topology:
Diagram:
p5 p6
--- BFR3 ---
p3/ p13 \p7 p15
BFR1 ---- BFR2 BFR5 ----- BFR6
p1 p2 p4\ p14 /p10 p11 p12
--- BFR4 ---
p8 p9
(simplified) BIER-TE Bit Index Forwarding Tables (BIFT):
BFR1: p1 -> local_decap
p2 -> forward_connected() to BFR2
BFR2: p1 -> forward_connected() to BFR1
p5 -> forward_connected() to BFR3
p8 -> forward_connected() to BFR4
BFR3: p3 -> forward_connected() to BFR2
p7 -> forward_connected() to BFR5
p13 -> local_decap
BFR4: p4 -> forward_connected() to BFR2
p10 -> forward_connected() to BFR5
p14 -> local_decap
BFR5: p6 -> forward_connected() to BFR3
p9 -> forward_connected() to BFR4
p12 -> forward_connected() to BFR6
BFR6: p11 -> forward_connected() to BFR5
p15 -> local_decap
]]></artwork></figure>
<t>
Consider the simple network in the above BIER-TE overview example picture
with 6 BFRs. p1...p14 are the bit positions (BP) used. All BFRs can act as
an ingress BFR (BFIR), BFR1, BFR3, BFR4 and
BFR6 can also be egress BFRs (BFERs). Forward_connected() is the name for
adjacencies that are representing subnet adjacencies of the network.
Local_decap() is the name of the adjacency to decapsulate BIER-TE packets and
pass their payload to higher layer processing.
</t>
<t>
Assume a packet from BFR1 should be sent via BFR4 to BFR6. This requires
a BitString (p2,p8,p10,p12,p15). When this packet is examined by BIER-TE
on BFR1, the only bit position from the BitString that is also set in
the BIFT is p2. This will cause BFR1 to send the only copy of the packet
to BFR2. Similarly, BFR2 will forward to BFR4 because of p8, BFR4 to BFR5
because of p10 and BFR5 to BFR6 because of p12. p15 finally makes BFR6 receive
and decapsulate the packet.
</t>
<t>To send in addition to BFR6 via BFR4 also a copy to BFR3, the BitString needs
to be (p2,p5,p8,p10,p12,p13). When this packet is examined by
BFR2, p5 causes one copy to be sent to BFR3 and p8 one copy to BFR4.
When BFR3 receives the packet, p13 will cause it to receive and decapsulate
the packet.
</t>
<t>If instead the BitString was (p2,p6,p8,p10,p12,p13,p15), the packet
would be copied by BFR5 towards BFR3 because of p6 instead of being copied by
BFR2 to BFR3 because of p5 in the prior case. This is showing the ability of the shown
BIER-TE Topology to make the traffic pass across any possible path and be
replicated where desired.
</t>
<t>BIER-TE has various options to minimize BP assignments,
many of which are based on assumptions about the required multicast traffic
paths and bandwidth consumption in the network.</t>
<t>The following picture shows a modified example, in which Rtr2 and Rtr5 are
assumed not to support BIER-TE, so traffic has to be unicast encapsulated across
them. To emphasize non-L2, but routed/tunneled forwarding of BIER-TE packets,
these adjacencies are called "forward_routed". Otherwise there is no difference
in their processing over the aforementioned "forward_connected" adjacencies.</t>
<t>In addition, bits are saved in the following example by assuming that BFR1 only
needs to be BFIR but not BFER or transit BFR.</t>
<figure anchor="basic-overlay" title="BIER-TE basic overlay example">
<artwork align="left"><![CDATA[
BIER-TE Topology:
Diagram:
p1 p3 p7
....> BFR3 <.... p5
........ ........>
BFR1 (Rtr2) (Rtr5) BFR6
........ ........>
....> BFR4 <.... p6
p2 p4 p8
(simplified) BIER-TE Bit Index Forwarding Tables (BIFT):
BFR1: p1 -> forward_routed() to BFR3
p2 -> forward_routed() to BFR4
BFR3: p3 -> local_decap
p5 -> forward_routed() to BFR6
BFR4: p4 -> local_decap
p6 -> forward_routed() to BFR6
BFR6: p5 -> local_decap
p6 -> local_decap
p7 -> forward_routed() to BFR3
p8 -> forward_routed() to BFR4
]]></artwork></figure>
<t>To send a BIER-TE packet from BFR1 via BFR3 to BFR6,
the BitString is (p1,p5). From BFR1 via BFR4 to BFR6
it is (p2,p6). A packet from BFR1 to BFR3,BFR4 and from BFR3
to BFR6 uses (p1,p2,p3,p4,p5). A packet from BFR1 to BFR3,BFR4 and
from BFR4 to BFR uses (p1,p2,p3,p4,p6). A packet from BFR1 to BFR4,
and from BFR4 to BFR6 and from BFR6 to BFR3 uses (p2,p3,p4,p6,p7).
A packet from BFR1 to BFR3, and from BFR3 to BFR6 and from BFR6 to BFR4
uses (p1,p3,p4,p5,p8).</t>
</section>
<section anchor="topology" title="BIER-TE Topology and adjacencies">
<t>The key new component in BIER-TE compared to BIER is the BIER-TE topology
as introduced through the two examples in <xref target="examples"/>.
It is used to control where replication can or should happen and how to
minimize the required number of BP for adjacencies.
</t>
<t>
The BIER-TE Topology consists of the BIFTs of all the BFR and
can also be expressed as a directed graph where the edges are the adjacencies
between the BFR labelled with the BP used for the adjacency. Adjacencies are
naturally unidirectional. BP can be reused across multiple adjacencies as long as this does not
lead to undesired duplicates or loops as explained further down in the
text.
</t>
<t>If the BIER-TE topology represents (a subset of) the underlying (layer 2)
topology of the network as shown in the first example, this may be called a "native"
BIER-TE topology. A topology consisting only of "forward_routed" adjacencies as
shown in the second example may be called an "overlay" BIER-TE topology.
A BIER-TE topology will both "forward_connected" and "forward_routed" adjacencies
may be called a "hybrid" BIER-TE topology.</t>
</section>
<!-- topology -->
<section anchor="comparison" title="Relationship to BIER">
<t>BIER-TE is designed so that is forwarding plane is a simple extension to the BIER forwarding plane, hence allowing for it to be added to BIER deployments where it can be beneficial.</t>
<t>BIER-TE is also intended as an option to expand the BIER architecture into deployments where BIER may not be the best fit, such as statically provisioned networks with needs for path steering but without desire for distributed routing protocols.</t>
<t><list style="numbers">
<t>BIER-TE inherits the following aspects from BIER unchanged:
<list style="numbers">
<t>The fundamental purpose of per-packet signaled packet replication and delivery via a BitString.</t>
<t>The overall architecture consisting of three layers, flow overlay, BIER(-TE) layer and routing underlay.</t>
<t>The supportable encapsulations, <xref target="RFC8296"/> or other (future) encapsulations.</t>
<t>The semantic of all <xref target="RFC8296"/> header elements used by the BIER-TE forwarding plane other than the semantic of the BP in the BitString.</t>
<t>The BIER forwarding plane, with the exception of how bits have to be cleared during replication.</t>
</list></t>
<t>BIER-TE has the following key changes with respect to BIER:
<list style="numbers">
<t>In BIER, bits in the BitString of a BIER packet header indicate a BFER and bits in the BIFT indicate the BIER control plane calculated next-hop toward that BFER. In BIER-TE, bits in the BitString of a BIER packet header indicate an adjacency in the BIER-TE topology, and only the BFRs that are upstream of this adjacency have this bit populated with the adjacency in their BIFT.</t>
<t>In BIER, the implied reference option for the core part of the BIER layer control plane is the BIER extension to distributed routing protocol, such as standardized in ISIS/OSPF extensions for BIER, <xref target="RFC8401"/> and <xref target="RFC8444"/>. The reference option for the core part of the BIER-TE control plane is the BIER-TE controller. Nevertheless, both BIER and BIER-TE BIFT forwarding plane state could equally be populated by any mechanism.</t>
<t>Assuming the reference options for the control plane, BIER-TE replaces in-network autonomous path calculation by explicit paths calculated by the BIER-TE controller.</t>
</list></t>
<t>The following element/functions described in the BIER architecture are not required by the BIER-TE architecture:
<list style="numbers">
<t>BIRTs on BFR for BIER-TE are not required when using a BIER-TE controller because the controller can directly populate the BIFTs. In BIER, BIRTs are populated by the distributed routing protocol support for BIER, allowing BFR to populate their BIFTs locally from their BIRTs. Other BIER-TE control plane or management plane options may introduce requirements for BIRTs for BIER-TE BFR.</t>
<t>The BIER-TE layer forwarding plane does not require BFR to have a unique BP and therefore also no unique BFR-id. See for example See <xref target="leaf-bfer"/>.</t>
<t>Identification of BFR by the BIER-TE control plane is outside the scope of this specification. Whereas the BIER control plane uses BFR-ids in its BFR to BFR signaling, a BIER-TE controller may choose any form of identification deemed appropriate.</t>
<t>BIER-TE forwarding does not use the BFR-id field of the BIER packet header.</t>
</list></t>
<t>Co-existence of BIER and BIER-TE in the same network requires the following:
<list style="numbers">
<t>The BIER/BIER-TE packet header needs to allow addressing both BIER and BIER-TE BIFT. Depending on the encapsulation option, the same SD may or may not be reusable across BIER and BIER-TE. See <xref target="encapsulation"/>.
In either case, a packet is always only forwarded end-to-end via BIER or via BIER-TE (ships in the nights forwarding).</t>
<t>BIER-TE deployments will have to assign BFR-ids to BFR and insert them into the BFR-id field of BIER packet headers as BIER does, whenever the deployment uses (unchanged) components developed for BIER that use BFR-id, such as multicast flow overlays or BIER layer control plane elements. See also <xref target="bfr-id"/>.</t>
</list></t>
</list></t>
</section>
<section anchor="fwd-comparison" title="Accelerated/Hardware forwarding comparison">
<t>Forwarding of BIER-TE is designed to easily build/program common forwarding hardware
with BIER. The pseudocode in <xref target="pseudocode"/> shows how existing
BIER/BIFT forwarding can be modified to support the REQUIRED BIER-TE forwarding functionality,
by using BIER BIFT's "Forwarding Bit Mask" (F-BM): Only the clearing of bits to avoid duplicate
packets to a BFR neighbor is skipped in BIER-TE forwarding because it is not necessary
and could not be done when using BIER F-BM.</t>
<t>Whether to use BIER or BIER-TE forwarding is simply a choice of the mode
of the BIFT indicated by the packet (BIER or BIER-TE BIFT). This is determined
by the BFR configuration for the encapsulation, see <xref target="encapsulation"/>.</t>
</section>
<!-- fwd-comparison -->
</section>
<!-- overview -->
<section anchor="components" title="Components">
<t>BIER-TE can be thought of being constituted from the same three
layers as BIER: The "multicast flow overlay", the "BIER layer" and
the "routing underlay". The following picture also shows how the "BIER layer"
is constituted from the "BIER-TE forwarding plane" and the "BIER-TE control plane"
represent by the "BIER-TE Controller".</t>
<figure anchor="architecture" title="BIER-TE architecture">
<artwork align="left"><![CDATA[
<------BGP/PIM----->
|<-IGMP/PIM-> multicast flow <-PIM/IGMP->|
overlay
BIER-TE [BIER-TE Controller] <=> [BIER-TE Topology]
control ^ ^ ^
plane / | \ BIER-TE control protocol
| | | e.g. YANG/Netconf/RestConf
| | | PCEP/...
v v v
Src -> Rtr1 -> BFIR-----BFR-----BFER -> Rtr2 -> Rcvr
|<----------------->|
BIER-TE forwarding plane
|<- BIER-TE domain->|
|<--------------------->|
Routing underlay
]]></artwork></figure>
<section anchor="flow-overlay" title="The Multicast Flow Overlay">
<t>The Multicast Flow Overlay has the same role as described for BIER
in <xref target="RFC8279"/>, Section 4.3. See also <xref target="engineered-bitstrings"/>.</t>
</section>
<!-- flow-overlay -->
<section anchor="control-plane" title="The BIER-TE Control Plane">
<t>In the BIER architecture <xref target="RFC8279"/>, the BIER control
plane is not explicitly separated from the BIER forwarding plane,
but instead their functions are summarized together in Section 4.2.
Example standardized options for the BIER control plane include
ISIS/OSPF extensions for BIER, <xref target="RFC8401"/> and <xref target="RFC8444"/>.</t>
<t>For BIER-TE, the control plane includes at minimum the following functionality.</t>
<t><list style="numbers">
<t>During initial provisioning of the network and/or during modifications of its topology and/or services: protocols and/or procedures to establish BIER-TE BIFTs:
<list style="numbers">
<t>Determine the desired BIER-TE topology for a BIER-TE sub-domains: the native and/or overlay adjacencies that are assigned to BPs.</t>
<t>Determine the per-BFR BIFT from the BIER-TE topology.</t>
<t>Optionally assign BFR-id to BFIR for later insertion into BIER-TE headers on BFIR. Alternatively, bfir-id in BIER packet headers may be managed solely by the flow overlay layer and/or be unused.</t>
<t>Install/update the BIFTs into the BFRs and optionally BFR-id into BFIR.</t>
</list></t>
<t>During operations of the network: Protocols and/or procedures to support creation/change/removal of overlay flows on BFIR:
<list style="numbers">
<t>Process the BIER-TE requirements for the multicast overlay flow: BFIR and BFERs of the flow as well as policies for the path selection of the flow.</t>
<t>Determine the BitStrings and optionally Entropy.</t>
<t>Install state on the BFIR to imposition the desired BIER packet header(s) for packets of the overlay flow.</t>
<t>Install the necessary state on the BFERs to decapsulate the BIER packet header and properly dispatch its payload.</t>
</list></t>
</list></t>
<section anchor="bier-te-controller" title="The BIER-TE Controller">
<t>Notwithstanding other options, this architecture describes the
BIER control plane as shown in <xref target="architecture"/> to consists of:
<list style="symbols">
<t>A single centralized BIER-TE controller.</t>
<t>Data-models and protocols to communicate between controller and BFR in step 1, such YANG/Netconf/RestConf.</t>
<t>Protocols to communicate between controller and BFIR in step 2, such as BIER-TE extensions for <xref target="RFC5440"/>.</t>
</list>
</t>
<t>The BIER control plane could equally be implemented without any active dynamic components
by an operator via CLI on the BFRs. In that case, operator configured local policy on the BFIR would have to
determine how to set the appropriate BIER header fields. The BIER-TE control plane could also be decentralized
and/or distributed, but this document does not consider any additional protocols and/or procedures
which would then be necessary to coordinate its entities to achieve the above described functionality.</t>
<section anchor="topology-discovery" title="BIER-TE Topology discovery and creation">
<t>Step 1.1 includes network topology discovery and BIER-TE topology creation. The latter describes the process by which a Controller determines which routers are to be configured as BFR and the adjacencies between them.</t>
<t>In statically managed networks, such as in industrial environments, both discovery and creation can be a manual/offline process.</t>
<t>In other networks, topology discovery may rely on protocols including extending a Link-State-Protocol (LSP) based IGP into the BIER-TE controller itself, <xref target="RFC7752"/> (BGP-LS) or <xref target="RFC8345"/> (Yang topology) as well as BIER-TE specific methods, for example via <xref target="I-D.ietf-bier-te-yang"/>. These options are non-exhaustive.</t>
<t>Dynamic creation of the BIER-TE topology can be as easy as mapping the network topology 1:1 to the BIER-TE topology by assigning a BP for every network subnet adjacency. In larger networks, it likely involves more complex policy and optimization decisions including how to minimize the number of BP required and how to assign BP across different BitStrings to minimize the number of duplicate packets across links when delivering an overlay flow to BFER using different SIs/BitStrings. These topics are discussed in <xref target="controller-ops"/>.</t>
<t>When the topology is determined, the BIER-TE Controller then pushes
the BitPositions/adjacencies to the BIFT of the BFRs, populating only those SI:BitPositions
to the BIFT of each BFR to which that BFR should be able to send packets to
- adjacencies connecting to this BFR.</t>
<t>Communications between the BIER-TE Controller and BFRs (beside topology discovery)
is ideally via standardized protocols and data-models such as Netconf/RestConf/Yang/PCEP.
Vendor-specific CLI on the BFRs is also an option (as in many other SDN
solutions lacking definition of standardized data model).</t>
</section>
<section anchor="engineered-bitstrings" title="Engineered Trees via BitStrings">
<t>In BIER, the same set of BFER in a single sub-domain is always encoded as the same BitString.
In BIER-TE, the BitString used to reach the same set of BFER in the same sub-domain can be
different for different overlay flows because the BitString encodes the paths towards the BFER,
so the BitStrings from different BFIR to the same set of BFER will often be different, and
the BitString from the same BFIR to the same set of BFER can different for different overlay
flows for policy reasons such as shortest path trees, Steiner trees (minimum cost trees),
diverse path trees for redundancy and so on.</t>
<t>See also <xref target="I-D.ietf-bier-multicast-http-response"/> for a solution
describing this interaction.</t>
</section>
<section anchor="changes-in-topo" title="Changes in the network topology">
<t>If the network topology changes (not failure based) so that adjacencies
that are assigned to bit positions are no longer needed, the BIER-TE Controller can
re-use those bit positions for new adjacencies. First, these bit positions
need to be removed from any BFIR flow state and BFR BIFT state, then they
can be repopulated, first into BIFT and then into the BFIR.</t>
</section>
<!-- changes-in-topo -->
<section anchor="failures" title="Link/Node Failures and Recovery">
<t>When link or nodes fail or recover in the topology, BIER-TE could quickly
respond with out-of-scope FRR procedures such as
<xref target="I-D.eckert-bier-te-frr"/>. It can also more slowly react by
recalculating the BitStrings of affected multicast flows. This reaction is
slower than the FRR procedure because the BIER-TE Controller needs to receive
link/node up/down indications, recalculate the desired BitStrings and push
them down into the BFIRs. With FRR, this is all performed locally on a BFR
receiving the adjacency up/down notification.</t>
</section>
<!-- failures -->
</section>
<!-- control-plane -->
</section>
<!-- XXX -->
<section anchor="forwarding-plane" title="The BIER-TE Forwarding Plane">
<t>The BIER-TE Forwarding Plane constitutes of the following components:
<list style="numbers">
<t>On BFIR imposition of BIER header for packets from overlay flows. This is driven by a combination of state established by the BIER-TE control plane and/or the multicast flow overlay as explained in <xref target="flow-overlay"/>.</t>
<t>On BFR (including BFIR and BFER), forwarding/replication of BIER packets according to their BitString as explained below and optionally Entropy. Processing of other BIER header fields such as DSCP is outside the scope of this document.</t>
<t>On BFER removal of BIER header and dispatching of the payload according to state created by the BIER-TE control plane and/or overlay layer.</t>
</list>
</t>
<t>When the BIER-TE Forwarding Plane receives a packet, it simply looks
up the bit positions that are set in the BitString of the packet in the
Bit Index Forwarding Table (BIFT) that was populated by the BIER-TE Controller.
For every BP that is set in the BitString, and that has one or
more adjacencies in the BIFT, a copy is made according to the type
of adjacencies for that BP in the BIFT. Before sending any copy, the
BFR clears all BPs in the BitString of the packet for which the
BFR has one or more adjacencies in the BIFT, except when the adjacency
indicates "DoNotClear" (DNC, see <xref target="forward-connected"/>). This is done to inhibit that packets can loop.</t>
</section>
<!-- forwarding-plane -->
<section anchor="routing-underlay" title="The Routing Underlay">
<t>For forward_connected() adjacencies, BIER-TE is sending BIER packets to directly connected
BIER-TE neighbors as L2 (unicasted) BIER packets without requiring a
routing underlay. For forward_routed() adjacencies, BIER-TE forwarding encapsulates
a copy of the BIER packet so that it can be delivered by the forwarding plane
of the routing underlay to the routable destination address indicated in the adjacency.
See <xref target="forward-routed"/> for the adjacency definition.</t>
<t>BIER relies on the routing underlay to calculate paths towards BFERs and derive
next-hop BFR adjacencies for those paths. This commonly relies on BIER specific extensions
to the routing protocols of the routing underlay but may also be established
by a controller. In BIER-TE, the next-hops of a packet are determined by the BitString
through the BIER-TE Controller established adjacencies on the BFR for the BPs of the BitString.
There is thus no need for BFER specific routing underlay extensions to forward BIER packets with
BIER-TE semantics.</t>
<t>Encapsulation parameters can be provisioned by the BIER-TE controller into
the forward_connected() or forward_routed() adjacencies directly without relying on a routing underlay.
</t>
<t>If the BFR intends to support FRR for BIER-TE, then the BIER-TE
forwarding plane needs to receive fast adjacency up/down notifications:
Link up/down or neighbor up/down, e.g. from BFD. Providing these notifications
is considered to be part of the routing underlay in this document.</t>
</section>
<!-- routing-underlay -->
<section anchor="te-considerations" title="Traffic Engineering Considerations">
<t>Traffic Engineering (<xref target="I-D.ietf-teas-rfc3272bis"/>)
provides performance optimization of operational IP networks while utilizing
network resources economically and
reliably. The key elements needed to effect TE are policy, path steering
and resource management. These elements require support at the
control/controller level and within the forwarding plane.</t>
<t>Policy decisions are made within the BIER-TE control plane, i.e., within
BIER-TE Controllers. Controllers use policy when composing BitStrings
and BFR BIFT state. The mapping of user/IP traffic to specific
BitStrings/BIER-TE flows is made based on policy. The specific details of
BIER-TE policies and how a controller uses them are out of scope of this
document.</t>
<t>Path steering is supported via the definition of a BitString. BitStrings
used in BIER-TE are composed based on policy and resource management
considerations. For example, when composing BIER-TE BitStrings, a Controller must take
into account the resources available at each BFR and for each BP
when it is providing congestion loss free services such as
Rate Controlled Service Disciplines <xref target="RCSD94"/>. Resource availability
could be provided for example via routing protocol information, but
may also be obtained via a BIER-TE control protocol such as Netconf or
any other protocol commonly used by a PCE to understand the resources
of the network it operates on. The
resource usage of the BIER-TE traffic admitted by the BIER-TE controller
can be solely tracked on the BIER-TE Controller based on local accounting
as long as no forward_routed() adjacencies are used (see <xref target="forward-connected"/> for the definition
of forward_routed() adjacencies). When forward_routed() adjacencies are used,
the paths selected by the underlying routing protocol need to be tracked as well.</t>
<t>Resource management has implications on the forwarding plane beyond
the BIER-TE defined steering of packets. This includes allocation of
buffers to guarantee the worst case requirements of admitted RCSD traffic
and potential policing and/or rate-shaping mechanisms, typically done
via various forms of queuing. This level of resource control,
while optional, is important in networks that wish to
support congestion management policies to control or regulate the offered
traffic to deliver different levels of service and alleviate congestion
problems, or those networks that wish to control latencies experienced by
specific traffic flows.</t>
</section>
<!-- te-considerations -->
</section>
<!-- components -->
<section anchor="forwarding" title="BIER-TE Forwarding">
<section anchor="btft" title="The Bit Index Forwarding Table (BIFT)">
<t>The Bit Index Forwarding Table (BIFT) exists in every BFR. For every
sub-domain in use, it is a table indexed by SI:bit position and is populated by the
BIER-TE control plane. Each index can be empty or contain a list of one or more
adjacencies.</t>
<t>Like BIER, BIER-TE can support multiple sub-domains, each with a separate BIFT.</t>
<t>In <xref target="RFC8279"/>, Figure 2, indices into the BIFT are both SI:BitString and
BFR-id, where BitString is indicating a BP: BFR-id = SI * 2^BSL + BP.
As shown in <xref target="adjacencies"/>, in BIER-TE, only SI:BP are used as indices into a BIFT because they identify adjacencies
and not BFR.</t>
<figure anchor="adjacencies" title="BIFT adjacencies">
<artwork align="left"><![CDATA[
------------------------------------------------------------------
| Index: | Adjacencies: |
| SI:bit position | <empty> or one or more per entry |
==================================================================
| 0:1 | forward_connected(interface,neighbor{,DNC}) |
------------------------------------------------------------------
| 0:2 | forward_connected(interface,neighbor{,DNC}) |
| | forward_connected(interface,neighbor{,DNC}) |
------------------------------------------------------------------
| 0:3 | local_decap({VRF}) |
------------------------------------------------------------------
| 0:4 | forward_routed({VRF,}l3-neighbor) |
------------------------------------------------------------------
| 0:5 | <empty> |
------------------------------------------------------------------
| 0:6 | ECMP({adjacency1,...adjacencyN}, seed) |
------------------------------------------------------------------
...
| BitStringLength | ... |
------------------------------------------------------------------
Bit Index Forwarding Table
]]></artwork></figure>
<t>The BIFT is programmed into the data plane of BFRs by the BIER-TE
Controller and used to forward packets, according to the rules
specified in the BIER-TE Forwarding Procedures.</t>
<t>Note that a BIFT index (SI:BP) may be populated in the BIFT of more
than one BFR. See <xref target="rings"/> for an example of how a BIER-TE controller
could assign BPs to (logical) adjacencies shared across multiple BFRs,
<xref target="leaf-bfer"/> for an example of assigning the same BP to different
adjacencies, and <xref target="reuse"/> for guidelines regarding re-use of BPs across different
adjacencies.</t>
<t>{VRF} indicates the Virtual Routing and Forwarding context into which
the BIER payload is to be delivered. This is optional and depends
on the multicast flow overlay.</t>
</section>
<!-- btft -->
<section anchor="atypes" title="Adjacency Types">
<section anchor="forward-connected" title="Forward Connected">
<t>A "forward_connected" adjacency is towards a directly connected
BFR neighbor using an interface address of that BFR on the connecting
interface. A forward_connected() adjacency does not route packets
but only L2 forwards them to the neighbor.</t>
<t>Packets sent to an adjacency with "DoNotClear" (DNC) set in the
BIFT MUST NOT have the bit position for that adjacency cleared when the
BFR creates a copy for it. The bit position will still be cleared for
copies of the packet made towards other adjacencies. This can be
used for example in ring topologies as explained below.</t>
</section>
<!-- forward-connected -->
<section anchor="forward-routed" title="Forward_routed">
<t>A "forward_routed" adjacency is an adjacency towards a BFR that
uses a (tunneling) encapsulation which will cause the packet to be
forwarded by the routing underlay toward the adjacent BFR. This can
leverage any feasible encapsulation, such as MPLS or tunneling over IP/IPv6,
as long as the BIER-TE packet can be identified as a payload. This identification
can either rely on the BIER/BIER-TE co-existence mechanisms described in
<xref target="encapsulation"/>, or by explicit support for a BIER-TE payload type
in the tunneling encapsulation.</t>
<t>"forward_routed" adjacencies are necessary to pass BIER-TE traffic across
non BIER-TE capable routers or to minimize the number of required BP by
tunneling over (BIER-TE capable) routers on which neither replication nor
path-steering is desired, or simply to leverage path redundancy and FRR of the
routing underlay towards the next BFR. They may also be useful to a
multi-subnet adjacent BFR to leverage the routing underlay ECMP
independent of BIER-TE ECMP (<xref target="forward-ecmp"/>).</t>
</section>
<!-- forward-routed -->
<section anchor="forward-ecmp" title="ECMP">
<t>BIER ECMP is tied to the BIER BIFT processing semantic and are therefore
not directly usable with BIER-TE.</t>
<t>A BIER-TE "Equal Cost Multipath" (ECMP) adjacency has a list of two or
more non-ECMP adjacencies and a seed parameter. When a BIER-TE packet is copied
onto such an ECMP adjacency, an implementation specific so-called hash function
will select one out of the lists adjacencies to which the packet is forwarded.
This ECMP hash function MUST select the same adjacency from that list for all
packets with the same entropy parameter. The seed parameter allows to design
hash functions that are easy to implement at high speed without running into
polarization issues across multiple consecutive ECMP hops. See <xref target="ecmp"/>
for more explanations.</t>
</section>
<!-- forward-ecmp -->
<section anchor="forward-local" title="Local Decap(sulation)">
<t>A "local_decap" adjacency passes a copy of the payload of
the BIER-TE packet to the protocol within the BFR (IPv4/IPv6, Ethernet,...) responsible for
that payload according to the packet header fields.
A local_decap() adjacency turns the BFR into a BFER for matching
packets. Local_decap() adjacencies require the BFER to support
routing or switching for NextProto to determine how to further
process the packet.</t>
</section>
<!-- forward-local -->
</section>
<!-- atypes -->
<section anchor="encapsulation" title="Encapsulation / Co-existence with BIER">
<t>Specifications for BIER-TE encapsulation are outside the scope of this document.
This section gives explanations and guidelines.</t>
<t>Because a BFR needs to interpret the BitString of a BIER-TE packet differently
from a BIER packet, it is necessary to distinguish BIER from BIER-TE packets.
In the BIER encapsulation <xref target="RFC8296"/>,
the BIFT-id field of the packet indicates the BIFT of the packet. BIER and BIER-TE can
therefore be run simultaneously, when the BIFT-id address space is shared across
BIER BIFT and BIER-TE BIFT. Partitioning the BIFT-id address space is subject
to BIER-TE/BIER control plane procedures.</t>
<t>When <xref target="RFC8296"/> is used for BIER with MPLS, BIFT-id address ranges
can be dynamically allocated from MPLS label space only for the set of actually
used SD:BSL BIFT. This allows to also allocate non-overlapping label ranges for BIFT-ids
that are to be used with BIER-TE BIFTs.</t>
<t>With MPLS, it is also possible to reuse the
same SD space for both BIER-TE and BIER, so that the same SD has both a
BIER BIFT and according range of BIFT-ids and a disjoint BIER-TE BIFT and non-overlapping range of BIFT-ids.</t>
<t>When a fixed mapping from BSL, SD, SI is used without specifically
distinguishing BIER and BIER-TE, such as proposed for non-MPLS forwarding with
<xref target="RFC8296"/> in <xref target="I-D.ietf-bier-non-mpls-bift-encoding"/>
revision 04, section 5., then it is necessary to allocate disjoint SDs to BIER
and BIER-TE BIFT so that both can be addressed by the BIFT-ids. The encoding
proposed in section 6. of the same document does not statically encode BSL
or SD into the BIFT-id, but allows for a mapping, and hence could provide for
the same freedom as when MPLS is being used (same or different SD for BIER/BIER-TE).</t>
<t>"forward_routed" requires an encapsulation permitting to unicast BIER-TE packets
to a specific interface address on a target BFR. With MPLS encapsulation, this can
simply be done via a label stack with that addresses label as the top label - followed
by the label assigned to the (BSL,SD,SI) BitString.
With non-MPLS encapsulation, some form of IP encapsulation would be required (for example IP/GRE).
</t>
<t>The encapsulation used for "forward_routed" adjacencies can equally support
existing advanced adjacency information such as "loose source routes" via e.g. MPLS
label stacks or appropriate header extensions (e.g. for IPv6).</t>
</section>
<!-- encapsulation -->
<section anchor="pseudocode" title="BIER-TE Forwarding Pseudocode">
<t>
The following pseudocode, <xref target="simple-pseudocode-picture"/>, for BIER-TE forwarding is based
on the BIER forwarding pseudocode of <xref target="RFC8279"/>, section 6.5 with one modification.</t>
<figure anchor="simple-pseudocode-picture" title="BIER-TE Forwarding Pseudocode for required functions, based on BIER Pseudocode">
<artwork align="left"><![CDATA[
void ForwardBitMaskPacket_withTE (Packet)
{
SI=GetPacketSI(Packet);
Offset=SI*BitStringLength;
for (Index = GetFirstbit position(Packet->BitString); Index ;
Index = GetNextbit position(Packet->BitString, Index)) {
F-BM = BIFT[Index+Offset]->F-BM;
if (!F-BM) continue; [3]
BFR-NBR = BIFT[Index+Offset]->BFR-NBR;
PacketCopy = Copy(Packet);
PacketCopy->BitString &= F-BM; [2]
PacketSend(PacketCopy, BFR-NBR);
// The following must not be done for BIER-TE:
// Packet->BitString &= ~F-BM; [1]
}
}
]]></artwork></figure>
<t>In step [2], the F-BM is used to clear bit(s) in PacketCopy.
This step exists in both BIER and BIER-TE, but the F-BMs need to be
populated differently for BIER-TE than for BIER for the desired clearing.</t>
<t>In BIER, multiple bits of a BitString can have the same BFR-NBR.
When a received packets BitString has more than one of those bits set,
the BIER replication logic has to avoid that more than one PacketCopy is
sent to that BFR-NBR ([1]). Likewise, the PacketCopy sent to a BFR-NBR
must clear all bits in its BitString that are not routed across BFR-NBR.
This protects against BIER replication on any possible further
BFR to create duplicates ([2]).</t>
<t>To solve both [1] and [2] for BIER, the F-BM of each bit needs to have all
bits set that this BFR wants to route across BFR-NBR. [2] clears
all other bits in PacketCopy->BitString, and [1] clears those bits from
Packet->BitString after the first PacketCopy.</t>
<t>In BIER-TE, a BFR-NBR is an adjacency, forward_connected, forward_routed
or local_decap. There is no need for [2] to suppress duplicates in the way
BIER does because in general, different BP would never have the same
adjacency. If a BIER-TE controller actually finds some optimization in
which this would be desirable, then the controller is also responsible to
ensure that only one of those bits is set in any Packet->BitString, unless
the controller explicitly wants for duplicates to be created.</t>
<t>For BIER-TE, F-BM is handled as follows:
<list style="numbers">
<t>The F-BM of all bits without an adjacency has all bits clear. This
will cause [3] to skip further processing of such a bit.</t>
<t>All bits with an adjacency (with DNC flag clear) have an F-BM
that has only those bits set for which this BFR does not have an adjacency.
This causes [2] to clear all bits from PacketCopy->BitString for which this
BFR does have an adjacency.</t>
<t>[1] is not performed for BIER-TE. All bit clearing required by BIER-TE
is performed by [2].</t>
</list></t>
<t>This Forwarding Pseudocode can support the REQUIRED BIER-TE forwarding
functions (see <xref target="requirements"/>), forward_connected,
forward_routed() and local decap, but not the RECOMMENDED functions DNC flag
and multiple adjacencies per bit nor the OPTIONAL function, ECMP adjacencies.
The DNC flag cannot be supported when using only [1] to mask bits.</t>
<t>The modified and expanded Forwarding Pseudocode in <xref target="pseudocode-picture"/> specifies how to
support all BIER-TE forwarding functions (required, recommended and optional):
<list style="symbols">
<t>This pseudocode eliminates per-bit F-BM, therefore reducing the size of BIFT state by BitStringLength^2*SI and eliminating the need for per-packet-copy masking operation except for adjacencies with the DNC flag set:
<list style="symbols">
<t>AdjacentBits[SI] are bits with a non-empty list of adjacencies. This can be computed whenever the BIER-TE Controller updates the adjacencies.</t>
<t>Only the AdjacentBits need to be examined in the loop for packet copies.</t>
<t>The packets BitString is masked with those AdjacentBits before the loop to avoid doing this repeatedly for every PacketCopy.</t>
</list></t>
<t>The code loops over the adjacencies because there may be more than one adjacency for a bit.</t>
<t>When an adjacency has the DNC bit, the bit is set in the packet copy (to save bits in rings for example).</t>
<t>The ECMP adjacency is shown. Its parameters are a ListOfAdjacencies from which one is picked.</t>
<t>The forward_local, forward_routed, local_decap() adjacencies are shown with their parameters.</t>
</list></t>
<figure anchor="pseudocode-picture" title="Complete BIER-TE Forwarding Pseudocode for required, recommended and optional functions">
<artwork align="left"><![CDATA[
void ForwardBitMaskPacket_withTE (Packet)
{
SI=GetPacketSI(Packet);
Offset=SI*BitStringLength;
AdjacentBits = Packet->BitString &= ~AdjacentBits[SI];
Packet->BitString &= AdjacentBits[SI];
for (Index = GetFirstbit position(AdjacentBits); Index ;
Index = GetNextbit position(AdjacentBits, Index)) {
foreach adjacency BIFT[Index+Offset] {
if(adjacency == ECMP(ListOfAdjacencies, seed) ) {
I = ECMP_hash(sizeof(ListOfAdjacencies),
Packet->Entropy, seed);
adjacency = ListOfAdjacencies[I];
}
PacketCopy = Copy(Packet);
switch(adjacency) {
case forward_connected(interface,neighbor,DNC):
if(DNC)
PacketCopy->BitString |= 1<<(Index-1);
SendToL2Unicast(PacketCopy,interface,neighbor);
case forward_routed({VRF},neighbor):
SendToL3(PacketCopy,{VRF,}l3-neighbor);
case local_decap({VRF},neighbor):
DecapBierHeader(PacketCopy);
PassTo(PacketCopy,{VRF,}Packet->NextProto);
}
}
}
}
]]></artwork></figure>
</section>
<!-- pseudocode -->