Introduction
http://www.ieee802.org/1/files/public/docs2010/liaison-nfinn-split-horizon-vid-filtering-0710-v04.pdf
describes in pages 19 and 20 the “Optimal distribution of data: Non-802.1aq” and “Using VIDs for
manually configured optimum data distribution”
The following slides expand the description in those two pages with
 Multi (e.g. 2) domain E-LAN example
 1 root and 2 roots E-Tree examples
 Internal node configuration details for E-LAN and E-Tree cases, including






Relay VIDs and switch configurations
Egress filtering
Egress and ingress VID translation,
Per domain local VID values
Per link local VID values (used in transport networks)
Primary VID values in MEPs and MIPs
v02 adds some E-Tree cases, corrections of some mistakes in v01, an evaluation of UP and
Down MEP/MIP primary VID values and support of those multi-VID models in G.8021
v03 includes some corrections in the B1 and B2 node expansion figures on slides
5,17,20,26
v04 includes G.8021 functional models for nodes B1 to B5 for E-LAN, 2nd type E-Tree, 3rd
type E-Tree and 4th type E-Tree in slides 31 to 43; while developing those slides it was
noticed that it is possible to enhance the egress filtering for the 2nd, 3rd and 4th E-Tree
cases; this is also reflected in slides 14-15, 17-18 and 20-21. In addition, interworking cases
between nodes with split-horizon port group designs and nodes with multi-vid designs for
E-LAN and 2nd type E-Tree are illustrated in slides 45-46.
1
C11
E-LAN (1 domain)
V
Configuration of ‘I’ and ‘V’ relayVIDs, local VIDs, egress filtering
and VID translation
P11
C12
V
B1
P10
P13
P12
I
P31
I
C2
V
P20
P21
P23
B2
P32
B3
P30
V
C3
I
C11
I V
V
V
V,I
V I
2
V,I
VI
VID
Translation at
egress port
P10
V
V
V
I
I
V
B2
B1
I
V
VI
V
V
B3
V,I
I V
V
SVL
I
C3
VI
C2
V
P11
V,I
B1
I V
C12
VI
V
VI
VLAN has common local VID
value ‘I’ on the inner links B1B2, B2-B3 and B3-B1
Internal configuration of node
B1 with the E-LAN FID including
the ‘I’ and ‘V’ relay-VID learning
and forwarding processes and
VID translation at the egress
ports
V
VLAN has 2 relay-VID
values ‘I’ and ‘V’ which
operate in SVL mode
P12
I
P13
I
X: Local VID
X: Relay-VID
XY, Y X: relay-VID X to local-VID Y Translation at egress port
SVL: Shared VLAN Learning
E-LAN (2 domains)
C11
Extension of previous
example with a 2nd domain
with edge nodes B2-B4-B5
P11
C12
B1
P10
P13
P12
P40
P42
P45
B4
P30
C3
VLAN has two domains
with a full mesh of links
P25
P52
P54
 VLAN with two domains
interconnected by node B2
Next slide illustrates
B5
P55
P50
C51
3
B3
B2
P24
C4
P32
P21
P23
P20
C2
P31
C52
 Need for two inner domain
VIDs (Ia, Ib) in this case
 Relay-VIDs registered at
each output port
 VID translation at egress
ports
 VID values used on the links
between the nodes
 Detailed architecture in node
B2 (FID with 3 relay-VIDs,
SVL, VID Translation)
E-LAN (2 domains)
IaV
C11
VIa
C12
V,IbIa
V
C2
V,Ia,Ib
VIa,Ib
V,I
B1
V,Ia
IaV
V
VLAN has common local VID
value ‘Ia’ on the inner links B1B2, B2-B3 and B3-B1
V
VLAN in Node B2 has 3 relayVID values ‘Ia’, ‘Ib’ and ‘V’ which
operate in SVL mode
V
Ia
V
V
Ia
V
V,Ib
B3
V,Ia
IaV
V
C3
Ia
V,Ib
Ia
P21
B2
Ib
VLAN has common local VID
value ‘Ib’ on the inner links B2B4, B4-B5 and B5-B2
Ib
Ia V
Ia Ib
V,Ia
V,Ia
SVL
P20
V
V
C4
V V,Ib
Ib
V
V
V,Ib
B4
B5
VIb
VIb IbV
IbV
C52
V Ib
P23
Ia
Ib
IbV
V,Ib
V
Ia
V
V Ia
V
B2
V
C51
VID Translation
at egress port
P24
Ib
P25
4
Ib
X: Local VID
X: Relay-VID
XY, Y X: relay-VID X to local-VID Y Translation at egress port
SVL: Shared VLAN Learning
E-LAN (1 domain)
C11
P11
C12
P10
B1
P13
P12
Q
P31
P
P20
C2
P21
P23
B2
P32
B3
P30
C3
R
VID translation at the
ingress ports in the domain
enables the usage of
different local VID values on
each of the inner domain
links. A requirement in
transport networks.
V
VLAN has different local VID values
‘P’, ‘Q’ and ‘R’ on the inner links B1B2, B2-B3 and B3-B1
C11
P11
VI
I V
V
VI
V
V,I
5
V
V,I
VI
V
V
V
Q
P
V
B2
R
V
V
B3
V,I
I V
V
V
VI
SVL
I
C3
VR
I R
C2
P10
V,I
B1
IP PI
VP PV
C12
B1
V
VID Translation
at ingress port
X: local VID
XY, Y X: local-VID Y to relay-VID X Translation at ingress port
X: Relay-VID
XY, Y X: relay-VID X to local-VID Y Translation at egress port
P12
Q
P13
P
SVL: Shared VLAN Learning
VLAN has different local VID values
‘P’, ‘Q’ and ‘R’ on the inner links B1B2, B1-B3 and B3-B2
C11
VID translation at the ingress ports in the
domain enables the usage of different
local VID values on each of the inner
domain links in both domains. A
requirement in transport networks.
I V
V
VI
C12
V
PI
PV
IaP
V,IbP
V
C2
V,I
B1
V,I
V
V
Q
V
B3
V,I
I V
V
C3
R
V,Ib
V,Ia,Ib
VIa,Ib
V
P
V,Ib
E-LAN (2 domains)
P
P21
B2
L
C4
V V,I
VI
B4
V,I
IV
R
V
V Ia
V
V
C52
V Ib
P23
Ia
Ib
IV
M V
V
VM MV B5
IM MI
V,I
B2
SVL
P20
V
V
PV
K
P Ia
P Ib
VLAN has different local VID values
‘K’, ‘L’ and ‘M’ on the inner links B2B4, B2-B5 and B5-B4
V,Ia
V,Ia
P24
V
C51
6
X: Local VID
X: Relay-VID
VID Translation
at ingress port
XY, Y X: local-VID Y to relay-VID X Translation at ingress port
XY, Y X: relay-VID X to local-VID Y Translation at egress port
K
P25
L
SVL: Shared VLAN Learning
Security in transport networks
In the previous E-LAN examples ingress
VID Translation is not deployed at all
input ports (e.g. not on P20 in slide 6, not
on P20, P21, P23, P24, P25 on slide 4)
This prevents that frames with
unexpected local VID values can access
the port and intrude the VLANs
Ia
P20; Ingress Ia
Filtering = Ib
Disabled
B2
P23;
Ingress
Ia Filtering =
Disabled
SVL
V
V
V Ia
V Ib
Ia
Ib
V
Ib
V
Ia
Ib
Ia
Ib
V
P24; Ingress Filtering
= Disabled
7
V
Ia V
This security issue is resolved when
ingress VID translation is deployed at
every input port
Ib
Ia Ib
With the “Ingress Filtering” parameter for
the ports set to ‘disabled’ those VLAN
connections are not secured; frames
arriving on other input ports of e.g. node
B2 with a local VID value ‘V’, ‘Ia’ or ‘Ib’
can enter the E-LAN VLAN (see Red
dashed lines)
P21; Ingress Filtering = Disabled
P25;
Ingress
Filtering =
Disabled
VID Translation for E-LAN (2 domains) example
When using different VID values
on the links between nodes it is
required to identify the ports
which form a group and ports
which are individual
C11
VID: G
C12
VID: A
P11
B1
P10
P13
P12
VID: Q
P31
VID: P
C2
VID: B
P21
P23
P20
P32
B3
VID: R
P30
VID:
F
B2
P24 P25
VID: K
C4
P40
VID:
C
P42
P45
B4
VID: L
P52
P54
VID: M
For node B2 the following applies:
B5
P55
P50
VID: D
C51
8
 All individual ports must be
associated with a relay VID (R-VID)
C3
value identifying Individual ports
 Ports which form a group must be
associated with a R-VID value
identifying that group
 Administration of individual ports and
grouped ports is done via the Ingress
VID Translation tables in each port
(see next slide for example)
VID: E
C52
 Group 1: (P21,P23): R-VID: Ia
 Group 2: (P24,P25): R-VID: Ib
 Individual: P20: R-VID: V
For node B5:
 Group 1: (P52,P54): R-VID: I
 Individual: P50,P55: R-VID: V
Using VIDs for manually configured optimum data
distribution for E-LAN (2 domains) example using ingress
VID translation on all ports
Bridge
Port
Can transmit
(before xlate)
(Ingress) VID
Translation
Egress VID
Translation
B2
P20
V, Ia, Ib
BV
IaB, IbB, VB
P21
V, Ib
PIa (Group 1)
IbP, VP
P23
V, Ib
RIa (Group 1)
IbR, VR
P24
V, Ia
KIb (Group 2)
IaK, VK
P25
V, Ia
LIb (Group 2)
IaL, VL
P50
V, I
DV
ID, VD
P52
V
LI (Group 1)
VL
P54
V
MI (Group 1)
VM
P55
V, I
EV
IE, VE
B1
…
…
…
…
B3
…
…
…
…
B4
…
…
…
…
B5
9
Port Group concept in transport networks
The logical concept of a “Port Group” could be maintained in
a transport network as a configuration element in the
manually configured optimum data distribution for E-LAN
connection management
 Each port in a node in such E-LAN is marked as either an Individual
Port or as a port in a Port Group #i (i≥1)
 The ports in a Port Group will see their local VID values translated
into a common relay VID value in the ingress VID translation process
 Relay VID values for the individual and the port group ports have a
node local scope; each node can select those values independent of
other nodes
10
E-Tree
11
E-Tree types
There are four types of E-Tree
 Unidirectional P2MP E-Tree (outside scope of this document)
 Bidirectional RMP E-Tree with single root and individual leaves
 Bidirectional RMP E-Tree with multiple roots and individual leaves
 Bidirectional RMP E-Tree with multiple roots, individual leaves and one or more leaf
groups
The 4th type requires the use of the largest set of relay VID values and local VID
values
 Relay VIDs identify the frame’s source and potential set of destination ports: R, I,
VG1 to VGN
 Local VIDs identify the frame’s source port: root, individual leaf, leaf group #i
The 2nd type requires the use of two relay VID values (R, I) and one local VID value
per link
 Local VID identifies in the frame’s source port: root, individual leaf
 Ingress VID translation converts local VID value to appropriate relay VID value
 Egress VID translation converts both relay VID values to same local VID value
The 3rd type requires the use of two relay VID values (R, I) and one or two local
VID values per link
 Local VID values can not be pruned to single value on the links between the root
ports
12
Next slides illustrate the 2nd, 3rd and 4th E-Tree types and their configuration
details from the viewpoint of a transport network
E-Tree (1 root, no leaf groups)
Ports
R1
G
L1
A
P10
 Root: R1
 Leaf: L1,L2,L3,L4,L51,L52
P11
B1
Q
P13
P12
Local VID values
P31
P
B3
P21
L2
B
P20
P30
L3
F
 A to G, K, L, P, Q
Relay VID values
B2
 I, R
P24 P25
K
P42
L4
P40
C
B4
Single local VID value for
both directions of transport
per link, e.g.
L
B5
E
P55
P50
D
L51
13
 B2-B4 link: K
P52
L52
Possible due to
 usage of ingress and
egress VID translation
 single root
E-Tree (1 root, no leaf groups)
AI
AR
A
L1
RG
IG
R1
PI
PR
RP
IP
R
R
Q
I
P
B3
I
B
R
BI
BR
F
R
IF
RF
P
B2
R
P20
R
B
K
L4
C
I
R
CI
CR
B4
P21
L3
P I
PR
L2
I
B1
R
Graphical representation of
configuration details…
G
B2
SVL
BI
BR
R
L
I
I
B5
D
R
ID
RD
R
IE
RE
E
L52
P24
L
K
P25
L51
14
X: Local VID
X: Relay-VID
XY, Y X: local-VID Y to relay-VID X Translation at ingress port
XY, Y X: relay-VID X to local-VID Y Translation at egress port
SVL: Shared VLAN Learning
Using VIDs for manually configured optimum data
distribution for E-Tree (1 root, no leaf groups) example
Bridge
Port
Can transmit
(before xlate)
(Ingress) VID
Translation
Egress VID
Translation
B1
P10
R
AI
RA
P11
I
GR
IG
P12
R
PI
RP
P13
R
QI
RQ
P20
R
BI
RB
P21
I
PR
IP
P24
R
KI
RK
P25
R
LI
RL
P30
R
FI
RF
P31
I
QR
IQ
P40
R
CI
RC
P42
I
KR
IK
P50
R
DI
RD
P52
I
LR
IL
P55
R
EI
RE
B2
B3
B4
B5
15
E-Tree (2 roots, no leaf groups)
Ports
 Root: R1, R5
 Leaf: L1,L2,L3,L4,L5
R1
G
L1
A
P11
Local VID values
B1
P10
P
 A to G, K, L, M, P, Q, R
Q
P13
P12
P31
R
B3
P21
L2
B
P20
B2
P42
L4
P40
C
B4
F
1 local VID
value
P24 P25
K
P30
2 local VID
values
L M
P52
B5
P55
P50
D
E
R5
L3
Relay VID values
 I, R
Single local VID value for both
directions of transport for subset
of links with only individual
leaves behind it
 B2-B4 link: K
Two local VID values for other
subset of links with roots plus
individual leaves behind it; i.e.
 B1-B2 link: P, R
 B2-B5 link: L, M
Possible due to
L5
16
 usage of ingress and egress
VID translation
E-Tree (2 roots, no leaf groups)
AI
AR
A
R,I
R
L4
C
R
CI
CR
B4
I
P
B3
F
R
IF
RF
P P21
L3
B2
P20
R R,I
K
I
Q
R,I
R
BI
BR
R
B
L
M
B5
RE
R,IE
R,I
ID
RD
D
B2
SVL
BI
BR
R
I
R,I
R
R
RR
RR
B
R,I
PI
P I
L2
Graphical representation of
configuration details…
G
B1
R
RR
RR PI
IP PI
IP RR
RR
L1
RG
R,IG
R1
E
R5
M
P24
L
K
L5
17
X: Local VID
X: Relay-VID
XY, Y X: local-VID Y to relay-VID X Translation at ingress port
XY, Y X: relay-VID X to local-VID Y Translation at egress port
SVL: Shared VLAN Learning
P25
Using VIDs for manually configured optimum data
distribution for E-Tree (2 roots, no leaf groups) example
Bridge
Port
Can transmit
(before xlate)
(Ingress) VID
Translation
Egress VID
Translation
B1
P10
R
AI
RA
P11
R,I
GR
IG, RG
P12
R,I
PI, RR
IP, RR
P13
R
QI
RQ
P20
R
BI
RB
P21
R,I
PI, RR
IP, RR
P24
R
KI
RK
P25
R,I
LI, MR
IL, RM
P30
R
FI
RF
P31
I
QR
IQ
P40
R
CI
RC
P42
I
KR
IK
P50
R
DI
RD
P52
R,I
LI, MR
IL, RM
P55
R,I
EI
IE, RE
B2
B3
B4
B5
18
E-Tree (2 roots, 1 leaf group)
Ports
R1
G
L1
A
P10
LG13
P11
J
B1
Q
T
P13
P12
P31
B3
P21
B
P20
P24
K
P42
L4
P40
C
B4
H
19
F
2 local VID
values
3 local VID
values
O LM
P52
B5
P55
P50
P41
LG14
P30
L3
 A to H,J, K, L, M, N,O,P,Q,
R,S,T
Relay VID values
B2
P25
N
Local VID values
P33
P RS
L2
 Root: R1, R5
 Leaf: L1,L2,L3,L4,L5
 Leaf group 1: LG14,LG13
D
L5
E
R5
 I, R, VG1
E-Tree (2 roots, 1 leaf group)
AI
AR
A
G
R
R,I,VG1
J
Q
T
R, VG1
R,I,VG1
I,VG1
P RS
KI
KR
NVG1
NVG1
R
HR
HVG1
HVG1
B4
LG14
20
X: Local VID
X: Relay-VID
R,I,VG1
R
D
B2
SVL
BI
BR
R
I
B5
R,VG1
H
O L M
RE
R,I,VG1E
R,I,VG1
ID
RD
CI
CR
B
RR
RR
I,VG1
C
P20
R,I,VG1
R,VG1
K N
L4
L3
B2
BI
BR
P P21 R
VG1
R
IF
RF
S
PI
P I
R,I,VG1
F
R
VG1
B
B3
R,VG1
S
S
L2
Graphical representation of
configuration details…
LG13
B1
SVG1
VG1S SVG1
VG1S PI
IP PI
IP RR
RR RR
RR
L1
RG
R,I,VG1G
R1
E
VG1
R5
M
P25
N
L
P24
K
L5
XY, Y X: local-VID Y to relay-VID X Translation at ingress port
XY, Y X: relay-VID X to local-VID Y Translation at egress port
O
SVL: Shared VLAN Learning
Using VIDs for manually configured optimum data
distribution for E-Tree (2 roots, 1 leaf group) example
Bridge
Port
Can transmit
(before xlate)
(Ingress) VID
Translation
Egress VID Translation
B1
P10
R
AI
RA
P11
R,I,VG1
GR
IG, RG, VG1G
P12
R,I,VG1
PI, RR, SVG1
IP, RR, VG1S
P13
R,VG1
QI, TVG1
RQ, VG1T
P20
R
BI
RB
P21
R,I,VG1
PI, RR, SVG1
IP, RR, VG1S
P24
R,VG1
KI, NVG1
RK, VG1N
P25
R,I,VG1
LI, MR, OVG1
IL, RM, VG1O
P30
R
FI
RF
P31
I,VG1
QR, TVG1
IQ, VG1T
P33
R,VG1
JVG1
RJ, VG1J
P40
R
CI
RC
P41
R,VG1
HVG1
RH, VG1H
P42
I,VG1
KR, NVG1
IK, VG1N
P50
R
DI
RD
P52
R,I,VG1
LI, MR, OVG1
IL, RM, VG1O
P55
R,I,VG1
ER
IE, RE, VG1E
B2
B3
B4
B5
21
E-LAN/E-Tree in ITU-T models
22
G.8021 E-LAN/E-Tree modelling
802.1Q multi-VID E-LAN/E-Tree models can be 1-to-1 translated into
G.8021 ETH layer model
 Each relay VID reference point is represented by an ETH_FP (Flow Point)
reference point
 The multi relay-VID FID is represented by an “ETH Flow Forwarding (FF)
process in SVL mode” within an ETH Connection function (see clause
9.1.1/G.8021)
MI_FF_ Learning
MI_FF_STP_LearningState[]
Relay-VID ‘I’ learning and
forwarding process
‘I’
ETH_CI
ETH_CI
Set of ETH_FPs
represents EISS
0
0
1
1
2
Learning
2
n
n
0
1
2 Forwarding 2
n
(Address, port)
ETH_TFP
ETH_FP
Relay-VID
reference point
....
ETH/ETH-m
ETH/ETH-m_A_PP
0
ETH_CI
1
2
ETH_AP represents
ISS reference point
ETH_AP
VID Translation relates
local VID with one or
more ETH_FPs
G.8021 ETH to ETH multiplexing adaptation function
Relay-VID ‘R’
learning and
forwarding
process
Address
‘R’
Learning
n
(Address, {port})
0
0
0
1
1
1
2
2 Forwarding 2
n
n
ETH_CI
n
ETH_CI
MI_FF_ Learning
23
n
Address Table
(Address, port)
ETH/ETH-m_A_MP
ETH_CI
(Address, {port})
Address
MI_FF_Flush_Learned
MI_FF_ Flush_Config
MI_FF_Group_Default
MI_FF_ETH_FF
MI_FF_Ageing
0
1
MI_FF_STP_LearningState[]
G.8021 ETH Flow Forwarding (FF) process in SVL mode
MEP and MIP functions in E-LAN/E-Tree
24
MEPs and MIPs in these E-LAN cases
Looking at the model of E-LAN Node B2 I am wondering where the MEP and MIP
functions should be located
Two locations are considered
 Red
 Green
P21
P20
Green locations are consistent with
802.1Q functionality order, but require
extensions to the G.8021 MEP Sink and
MIP Sink functions, which currently do not
support to read OAM from “multiple VIDs”
25
PV
P Ia
P Ib
Red locations imply that the VID
Translation is located between
the UP MEPs and the MAC Relay,
which is not consistent with its
current location in the clause 6.9
Support of the EISS function
P
B2
SVL
BV
BV
R
V
B Ia
P23
Ia
B Ib
Ib
P24
K
P25
L
MEPs and MIPs in these E-Tree cases
Looking at the model of E-Tree Node B2 I am wondering where the MEP and MIP
functions should be located
Green locations are consistent with
802.1Q functionality order
26
P21 R
PI
P I
Red locations imply that the VID
Translation is located between
the UP MEPs and the MAC Relay,
which is not consistent with its
current location in the clause 6.9
Support of the EISS function
P
P20
B
RR
RR
Two locations are considered
 Red
 Green
B2
SVL
BI
BR
R
I
M
P24
Both Red and Green locations require
extensions to the G.8021 MEP Sink and MIP Sink
functions to support reading from “multiple VIDs”
P25
K
L
MEP and MIP primary VID assignments in E-LAN node B2
MAC Relay
Primary VID: Ib
Primary VID: V
Primary VID: V
Primary VID: Ia
Primary VID: V
Primary VID: Ib
Primary VID: V
Primary VID: V
Primary VID: V
Primary VID: V
P20
LAN
Up and Down MEP and
Half MIP functions have
same primary VID (V)
27
P21 and P23
Ib
.. Ib
V
.. V
Ib
.. Ib
Ia
.. Ia
V
BV
B Ib
Ia Ib
B Ia
BV
V
LAN
Up MEP and Half MIP
functions have different
primary VID (Ia) than
Down MEP/Half MIP (V)
P24 and P25
Ia
V
.. V
Primary VID: Ia
.. Ia
Primary VID: V
LAN
Up MEP and Half MIP
functions have different
primary VID (Ib) than
Down MEP/Half MIP (V)
Primary VID values for the Up MEP/HalfMIP functions on the three port sets are
different (V, Ia and Ib); configuration should be performed carefully
MEP and MIP primary VID assignments in 3rd type E-Tree
node B2
MAC Relay
Primary VID: R
Primary VID: I
Primary VID: R
Primary VID: R
Primary VID: I
Primary VID: R
Primary VID: R
Primary VID: R
P21 and P25
P20 and P24
.. R
R
.. I
.. R
.. I
LAN
Up and Down MEP and
Half MIP functions have
same primary VID (R)
28
I
I R
.. R
R
.. I
I
LAN
Up MEP and Half MIP
functions have different
primary VID (I) than
Down MEP/Half MIP (R)
Primary VID values for the Up MEP/HalfMIP functions on the two port sets are
different (R and I); configuration should be performed carefully
MEP and MIP primary VID assignments in 4th type E-Tree
node B2
MAC Relay
Primary VID: R
Primary VID: R
Primary VID: I
Primary VID: R
Primary VID: I
Primary VID: R
Primary VID: R
Primary VID: R
Primary VID: R
P21 and P25
P20
I
LAN
Up MEP and Half MIP
functions have different
primary VID (I) than
Down MEP/Half MIP (R)
VG1 VG1 R
KI
BR
R
BI
.. R
.. I
.. VG1
LAN
Up and Down MEP and
Half MIP functions have
same primary VID (R)
29
I
VG1 I R
.. R
R
.. I
.. VG1
VG1 I
P24
KR
Primary VID: I
N VG1
Primary VID: I
N VG1
Primary VID: R
LAN
Up MEP and Half MIP
functions have different
primary VID (I) than
Down MEP/Half MIP (R)
Primary VID values for the Up MEP/HalfMIP functions on the three port sets are
different (R and I); configuration should be performed carefully
G.8021 MEP/MIP functions
G.8021 ETH MIP function has single ETH_FP
 To support the multi-VID E-Tree the G.8021 MIP function should get multiple
ETH_FPs
 OAM XXM frames may ingress on each of those ETH_FPs and the
associated XXR frames may egress on the primary_ETH_FP
G.8021 specifies ETH MEP and ETHG MEP functions
 ETH MEP function contains a single ETH_FP
 ETHG MEP function contains multiple ETH_FPs
 OAM frames can be read/extracted from one ETH_FP only
 OAM frames can be generated/inserted into one ETH_FP only
 The multi-VID E-LAN/E-Tree models require and ETH MEP function with
multiple ETH_FPs, with reading/extracting capabilities of OAM frames on
every ETH_FP and generating/inserting capabilities of OAM frames on the
primary_ETH_FP only
 ETH and ETHG MEP functions could be merged into one ETH MEP function, or
alternatively the ETH MEP function can be left unchanged and the ETHG MEP
function can be extended to read/extract OAM from every ETH_FP
30
G.8021 nodal functional models for E-LAN
and E-Tree cases
Slides 32-34: E-LAN
Slides 35-37: E-Tree, 2nd type
Slides 38-40: E-Tree, 3rd type
Slides 41-43: E-Tree, 4th type
31
G.8021 nodal functional models for E-LAN (2 domains) example
FF(V) FF(I)
B1
Local VID 
ETH_FP mapping
represents “Ingress
VID Translation” and
provides security
Local VID value
ETH_FP  Local
VID mapping
represents “Egress
VID Translation”
A A A
GGG
P P
P10
P11
P12
QQ
P13
Connecting
ETH_FF(x) with
ETH_FP represents
“Egress Filtering”
FF(V)FF(Ia)
FF(Ib)
B2
ETH_FP(V) is
optional in this case;
could be deleted
B B B B
P20
32
P P P
P21
R R R
P23
K K K
P24
L L L
P25
G.8021 nodal functional models for E-LAN (2 domains) example
FF(V) FF(I)
B3
F F F
QQ
R R
P30
P31
P32
FF(V) FF(I)
B4
33
C C C
K K
MM
P40
P42
P45
G.8021 nodal functional models for E-LAN (2 domains) example
FF(V) FF(I)
B5
D D D
L L
MM
E E E
P50
P52
P54
P55
C11
VID: G
C12
VID: A
P11
B1
P10
P13
P12
VID: Q
P31
VID: P
C2
VID: B
VID: K
VID:
C
B4
VID:
F
VID: L
P52
P45
P54
P55
B5
VID: M
C52
VID: E
P50
VID: D
34
C3
P25
P42
C4
VID: R
P30
B2
P24
P40
P32
P21
P23
P20
B3
C51
G.8021 nodal functional models for 2nd type E-Tree (2 domains) example
FF(R) FF(I)
B1
A A
P10
GG
P11
P20
35
P12
QQ
P13
FF(R) FF(I)
B2
B B
P P
P P
K K
L L
P21
P24
P25
G.8021 nodal functional models for 2nd type E-Tree (2 domains) example
FF(R) FF(I)
B3
F F
QQ
P30
P31
FF(R) FF(I)
B4
36
C C
K K
P40
P42
G.8021 nodal functional models for 2nd type E-Tree (2 domains) example
FF(R) FF(I)
B5
D D
L L
E E
P50
P52
P55
R1
G
L1
A
P11
B1
P10
Q
P13
P12
P31
P
B3
F
P21
L2
B
P30
B2
P20
P24 P25
K
P42
L4
P40
B4
L
P52
E
B5
P55
C
P50
D
37
L51
L52
L3
G.8021 nodal functional models for 3rd type E-Tree (2 domains) example
FF(R) FF(I)
B1
A A
P10
GGG
P11
P20
38
P12
QQ
P13
FF(R) FF(I)
B2
B B
P P R R
P P R R
P21
K K
P24
L L MM
P25
G.8021 nodal functional models for 3rd type E-Tree (2 domains) example
FF(R) FF(I)
B3
F F
QQ
P30
P31
FF(R) FF(I)
B4
39
C C
K K
P40
P42
G.8021 nodal functional models for 3rd type E-Tree (2 domains) example
FF(R) FF(I)
B5
D D
L L MM
E E E
P50
P52
P55
R1
G
L1
A
P11
B1
P10
Q
P13
P12
P
P31
R
B3
F
P21
L2
B
P20
P30
B2
P24 P25
K
P42
L4
P40
B4
L M
P52
P55
B5
C
E
P50
40
R5
D
L5
L3
G.8021 nodal functional models for 4th type E-Tree (2 domains) example
FF(R) FF(I)
FF(VG1)
B1
A A
P10
GGGG
P11
P20
41
P12
QQ T T
P13
FF(R) FF(I)
FF(VG1)
B2
B B
P P R R S S
P P R R S S
P21
K K N N
P24
L L MMOO
P25
G.8021 nodal functional models for 4th type E-Tree (2 domains) example
FF(R) FF(I)
FF(VG1)
B3
F F
QQ T T
J J J
P30
P31
P33
FF(R) FF(I)
FF(VG1)
B4
42
C C
K K N N
H HH
P40
P42
P41
G.8021 nodal functional models for 4th type E-Tree (2 domains) example
FF(R) FF(I)
FF(VG1)
B5
D D
L L MMOO
E E E E E
P50
P52
P55
L1
R1
G
A
LG13
P11
J
B1
P10
Q
T
P13
P12
P33
P31
P RS
B3
F
P21
L2
B
P20
B2
P24
K N
P42
L4
P40
B4
P25
O LM
P52
B5
P55
C
P50
P41
43
R5
E
H
LG14
P30
D
L5
L3
Interworking split-horizon port group
model with multi-vid model
44
E-LAN interworking example
Nodes designed according
to the split-horizon port
group model are able to
interwork with nodes
designed according to the
multi-vid model
C11
VID: G
C12
VID: A
P11
B1
SH
P10
P13
P12
VID: Q
P31
VID: P
C2
VID: B
P21
P23
B2
SH
P20
P32
VID: R
B3 P30
MV VID:
F
P24 P25
VID: K
C4
P40
P42
B4 P45
VID: L
P52
P54 B5
VID: SH VID: M
C
P55
MV
P50
VID: D
C51
45
VID: E
C52
C3
 Nodes B1, B2, B4 could
be using split-horizon port
groups (SH)
 Nodes B3, B5 could be
using multi-vid model (MV)
Both node types deploy a common
Local VID approach, which
guarantees interworking between
these two node types
Note – Any other combination of
SH and MV node types also
interworks
E-Tree, 2nd type interworking example
Nodes designed according to
the split-horizon port group
model are able to interwork
with nodes designed
according to the multi-vid
model
R1
G
L1
A
P10
P11
B1
SH
Q
P13
P12
P31
P
P21
L2
B
P20
B3
MV
P30
L3
F
B2
MV
P24 P25
K
P42
L4
P40
C
B4
SH
L
P52
B5
MV
E
P55
P50
D
L51
46
L52
 Nodes B1, B4 could be
using split-horizon port
groups (SH)
 Nodes B2, B3, B5 could be
using multi-vid model (MV)
Both node types deploy a common
Local VID approach, which
guarantees interworking between
these two node types
Note – Any other combination of
SH and MV node types also
interworks
E-Tree, 3rd and 4th types interworking
The 3rd and 4th type E-Tree cases can not be supported by
means of split-horizon port groups. As such, there is no
interworking requirement for multi-vid designs of those two ETree cases.
47