Stateless Best Effort Multicast SimulationsIndependentBoston, MAUSAhchen.ietf@gmail.comIndependent2386 Panoramic CircleApopka, FL32703USA+1-508-333-2270d3e3e3@gmail.comFutureweimichael.mcbride@futurewei.comCasa SystemsUSAyfan@casa-systems.comVerizon13101 Columbia PikeSilver SpringMD 20904USA 301 502-1347gyan.s.mishra@verizon.comChina Mobileliuyisong@chinamobile.comChina TelecomBeiqijia Town, Changping DistrictBeijing102209Chinawangaj3@chinatelecom.cnIBM CorporationUSAxufeng.liu.ietf@gmail.comFujitsuUSAliulei.kddi@gmail.comThis document describes simulations of
stateless best effort Multicasts and lists
a set of simulation results for
different large network sizes and different tree sizes.
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in
when, and only when, they appear in all
capitals, as shown here.For a tree given by its root/ingress and leaves/egresses,
a few of solutions are proposed to multicast
data from the ingress to the egresses
using the shortest IGP paths to the egresses.
They include:
Stateless Best Effort Multicast Using MRH
.Multicast Using Bit Index Explicit Replication
.RGB (Replication through Global Bitstring) Segment
for Multicast Source Routing over IPv6
.This document describes simulations of
stateless best effort Multicasts and lists
a set of simulation results for
different large network sizes and different tree sizes.
The following acronyms are used in this document:
Customer edge/equipment.Multicast Routing Header.Point 2 Multi-Point.Provider Edge.A simulation of a BE Multicast means
a computation of the encoding of a tree in a given network
according to the BE Multicast.
The tree has a number of egresses/leaves,
which is the size of the tree.
The network has a number of nodes,
which is the size of the network.
For a given network size (i.e., a number of nodes in the network),
we assume that half of the nodes are PEs.
For a given tree size (i.e., a number of leaves/egresses) T,
we select T egress nodes from the PEs randomly first.
And then we compute the encoding of the tree with these T
selected egress nodes.
The computation results include the total size of the encoding
of the tree and the number of packet copies that the ingress/root
of the tree will encapsulate and send.
For simulating Stateless Best Effort Multicast Using MRH (BEM-MRH)
defined in ,
we compute the encoding according to BE-MRH
for each of the trees with different tree sizes in
each of the networks with different network sizes.
Suppose that we have a set of network sizes
netSizes = {4096, 8192, 16384} and a set of tree sizes
treeSizes = {16, 24, 32, 48, 64, 80, 96, 128}.
We simulate the BEM-MRH and BIER for each tree size in treeSizes
for each network size in netSizes.
For BIER, we use BitString length 256 (bits).
shows the results of simulating the BEM-MRH and BIER for
every tree size for network size 4096.
From the simulation results of BEM-MRH in the figure,
we see that the number of packet copies is 1 for any tree size
(refer to the third column of the table).
This indicates that
after receiving a multicast packet from a traffic source
such as a CE, the ingress/root of the tree can encapsulate
one packet copy and send the packet to the egress/leaf
nodes of the tree through using BEM-MRH.
From the simulation results of BIER in the figure,
we see that the number of packet copies is 7 for tree size 16
and 8 for any other tree size
(refer to the last column of the table).
This indicates that
after receiving a multicast packet from a traffic source
such as a CE, the ingress/root of the tree need to make
7/8 packet copies, encapsulate each of the copies
and send the packet copies to the egress/leaf
nodes of the tree through using BIER.
From the simulation results of BEM-MRH in the figure,
we see that the total size of the encoding tree is
32 (bytes) for a tree with 16 leaves/egresses,
47 (bytes) for a tree with 24 leaves/egresses,
...,
196 (bytes) for a tree with 128 leaves/egresses
(refer to the second column of the table).
The total size of the encoding tree is always less than
or equal to two times the tree size.
From the simulation results of BIER in the figure,
we see that the total size of the encoding tree is
224 (bytes) for a tree with 16 leaves/egresses,
and 256 (bytes) for any other tree size
(refer to the fourth column of the table).
shows the results of simulating the BEM-MRH and BIER for
every tree size for network size 8192.
From the simulation results of BEM-MRH in the figure,
we see that the number of packet copies is 1 for any tree size
(refer to the third column of the table).
This indicates that
after receiving a multicast packet from a traffic source
such as a CE, the ingress/root of the tree can encapsulate
one packet copy and send the packet to the egress/leaf
nodes of the tree through using BEM-MRH.
From the simulation results of BIER in the figure,
we see that the number of packet copies is from 10 to 16 for tree size
from 16 to 128
(refer to the last column of the table).
This indicates that
after receiving a multicast packet from a traffic source
such as a CE, the ingress/root of the tree need to make
10 to 16 packet copies, encapsulate each of the copies
and send the packet copies to the egress/leaf
nodes of the tree through using BIER.
From the simulation results of BEM-MRH in the figure,
we see that the total size of the encoding tree is
32 (bytes) for a tree with 16 leaves/egresses,
48 (bytes) for a tree with 24 leaves/egresses,
...,
235 (bytes) for a tree with 128 leaves/egresses
(refer to the second column of the table).
The total size of the encoding tree is always less than
or equal to two times the tree size.
From the simulation results of BIER in the figure,
we see that the total size of the encoding tree is
from 320 to 512 (bytes) for a tree with size from 16 to 128
(leaves/egresses)
(refer to the fourth column of the table).
shows the results of simulating the BEM-MRH and BIER for
every tree size for network size 16384.
From the simulation results of BEM-MRH in the figure,
we see that the number of packet copies is 1 for any tree size
(refer to the third column of the table).
This indicates that
after receiving a multicast packet from a traffic source
such as a CE, the ingress/root of the tree can encapsulate
one packet copy and send the packet to the egress/leaf
nodes of the tree through using BEM-MRH.
From the simulation results of BIER in the figure,
we see that the number of packet copies is from 12 to 32 for tree size
from 16 to 128
(refer to the last column of the table).
This indicates that
after receiving a multicast packet from a traffic source
such as a CE, the ingress/root of the tree need to make
12 to 32 packet copies, encapsulate each of the copies
and send the packet copies to the egress/leaf
nodes of the tree through using BIER.
From the simulation results of BEM-MRH in the figure,
we see that the total size of the encoding tree is
32 (bytes) for a tree with 16 leaves/egresses,
48 (bytes) for a tree with 24 leaves/egresses,
...,
256 (bytes) for a tree with 128 leaves/egresses
(refer to the second column of the table).
The total size of the encoding tree is always less than
or equal to two times the tree size.
From the simulation results of BIER in the figure,
we see that the total size of the encoding tree is
from 384 to 1024 (bytes) for a tree with size from 16 to 128
(leaves/egresses)
(refer to the fourth column of the table).
No.No IANA is requested.TBD