OPTICAL MULTICAST

ROUTING

1
 Outlines
• Introduction
• Multicast Routing Problem
• Node Architecture
• OMMP
• Multicast Routing Problem

2
 Introduction
• Traditional communication models have been
– one-to-one or unicast, and
– one-to-all or broadcast.
• Between these two extremes lies multicast,
– the targeting of a data stream to a selected set of receivers.
• This model is used to characterize the
communication patterns in a wide spectrum of
applications such as
– replicated databases,
– command and control systems,
– distributed games,
– audio/video conferencing, and
– distributed interactive simulation.

3
 Introduction
• The following are some applications that make use
of multicast communication.
– Multimedia: A number of users "tune in" to a video or audio
transmission from a multimedia source station.
– Teleconferencing: A group of workstations forms a
multicast group so that a transmission from any member is
received by all other group members.
– Databases: All copies of a replicated file or database are
updated at the same time.
– Distributed computation: Intermediate results are sent to all
participants in a distributed computation.
– Real-time workgroups: Files, graphics, and messages are
exchanged among active group members in real time.

4
 Introduction
• A good communication network which provides a
multicast transmission system should have
properties such as
– high probability of delivery of information,
– low delay between source and destinations, and
– Information hiding from intermediate routers.
• These properties can be achieved by using optical
signals instead of electrical signals to transfer the
information.
• The optical medium will also provide enormous
bandwidth (tens of terahertz). It is very difficult to
exploit such a high bandwidth as a single channel.
Hence the complete bandwidth is channelized, with
different wavelengths using WDM.
5
 Introduction
• Among the WDM optical networks, wavelength routed networks
are becoming popular for wide area networks.
• To support multicasting, in wavelength routed networks, the
routing nodes should have the capability of optical splitting.
• If it is assumed that every node in the network has optical
splitting capability and wavelength conversion capability, then
the problem of multicast routing boils down to the problem of
multicast routing in electronic networks.
• However, split-capable nodes are costlier than wavelength
routing nodes without split capability.
• Hence it is suggested that only a few nodes in the network be
allowed to have splitting capability.
• The multicast routing problem in wavelength routed networks
is addressed in this chapter.

6
 Multicast Routing Problem
• A WDM network employing wavelength routing
consists of optical wavelength routing nodes
interconnected by point to point fiber links in an
arbitrary topology.
• The optical routing nodes do have the capability of
switching a wavelength individually.
• A wavelength routing node may have the capability
to tap a small amount of optical power from the
wavelength channel which is forwarded by that node.
• The tapped optical power may be used by the local
node. This type of node is called as a drop and
continue node (DaC node) (Tap and Continuous) [5],
[197].

7
 Conventional v.s. WDM
• To support multicasting, in a conventional network
(electronic network), all nodes are assumed to have
the capability of buffering an incoming message and
transmitting it onto more than one output link.
• To support multicasting in a WDM network, nodes in
the network need to have light (optical) splitting
capability.
• A node with splitting capability can forward an
incoming message to more than one output link.
• If a network has splitting capability at all nodes, then
it is referred to as a network with full splitting
capability.
• In a network with full splitting capability, a single tree
can be generated to include all the destinations of a
multicast session, as in a conventional electronic
network [124], [151]. 8
 sparse splitting capability
• A tree refers to a set of destinations connected together with a
source as the root.
• The source needs to transmit a message only once to
communicate to all the destinations belonging to the same tree.
• A split-capable node is very expensive due to its complex
architecture [197]. Hence only a subset of the nodes in a
network are assumed to be split-capable nodes.
• A network with a few split-capable nodes is called a network
with sparse splitting capability [92].
• In a network with sparse splitting capability, it may not be
possible to include all destinations of a session in one
multicast tree.
• Hence a set of trees is constructed to include all destinations of
a multicast session.
• This means that the source needs to transmit the multicast data
onto more than one channel, maybe on different fibers or on
different wavelengths.
• The set of trees corresponding to a single multicast session is
called a multicast forest [92], [159], [197]. 9
10
 Multicast Routing Problem
• A network with sparse wavelength conversion and
sparse splitting capability consists of nodes with different
capabilities.
• A node may have splitting capability and/or wavelength
conversion capability.
• In general, a node with split capability is called a
multicast-capable node (MC node).
• A node with only splitting capability is called a split node,
and
• A DaC node with wavelength conversion capability is
termed a wavelength conversion node (WC node).
• A node having both splitting and wavelength conversion
capabilities is called a virtual source (VS). A VS node
can transmit an incoming message to any number of
output links on any wavelength. 11
 Multicast Routing Problem
• A split node and a VS node are used for expanding the tree.
• A part of the tree which is expanded from a split node or VS node is
called a subtree.
• The difference between a split node and a VS node is that a
split node cannot support more than one connection on the
same outgoing link, whereas a VS does support by using
different wavelengths.
• This means that the subtree spawned from a VS may use the same
physical link which is used by the existing connection but on a
different wavelength.
• A node without splitting capability is called a multicast-
incapable node (MI node).
– An MI node may have the capability of drop and continue or it may
have no such capability.
– A node without any capability is an ordinary wavelength router,
and it can either drop a message or can switch a message, but not
both operations simultaneously.
– Hence, for consistency, such a node can be called a drop or continue
node (DoC node). 12
Node Architecture of MC nodes

13
 Node Architecture of MC nodes
• An MC node consists of optical power
splitters.
• To support multicast, the input signal needs
to be transmitted onto various output
connections. These connections may be on
different links connected to the node or on
different wavelength channels of the same
fiber.
• If a node has n input links with a single fiber
per link, and each fiber consists of W number
of wavelengths, then to support multicast the
input signal needs to be selected by n x W
number of switches. 14
 MC nodes
• However, this wavelength conversion stage is an
optional one. An MC node need not perform
wavelength conversion.
• Finally, for each output link, one multiplexer is
present so that the signals on various wavelengths
are multiplexed and transmitted onto the same fiber.
• In general, for an MC node with n input links, m
output links, and W wavelengths per fiber, there are
n number of 1 x m splitters, n x m number of 1 x W
optical splitters, m x W number of n x 1 SD switches,
m x W number of TFs and wavelength converters,
and m multiplexers.
• Power amplification is required to compensate for
the power loss due to splitting operation.
15
 Architecture of an MI Node
• A node without splitting capability is called a
multicast-incapable node or an MI node.
• MI nodes may tap (or drop) a small fraction of signal
and switch the remaining signal to one of its
neighbor nodes. The tapped (dropped) signal may be
used by the local station.
• This type of node which can tap or drop the signal
passing through it is called as a DaC node.
• The architecture of a DaC node is shown in Fig. 8.3.
Here, the input signal is demultiplexed and each of
these demultiplexed signals is fed as input to the
"tap" (drop) module which taps 5% of signal.
• Then, as in a conventional wavelength routed node,
the signal is switched using SD switches.

16
17
 MULTICAST TREE GENERATION
• Multicasting is the process of transmitting data
by a source to a set of destinations.
• Instead of transmitting packets from a sender to
each receiver, the routes between source and
receivers can share some links.
• In conventional networks, multicast route
determination is traditionally formulated as a
problem related to tree construction [161].

18
 Tree construction
• The reasons for adapting tree structure
for multicast communication are listed
below.
– The source need not send a packet to
individual destinations.
– The packets are transmitted in parallel to
various destinations.
– The tree structure minimizes data replication,
since the packet is replicated optically by
routers only at branch points in the tree.
19
 Overview
• In a network with full splitting capability, a single tree can
be generated to include all the destinations of a multicast
session, as in a conventional electronic network [124],
[151], [152].
• Hence, in a network with full splitting capability, the
constraints to generate a multicast tree would be
minimizing the number of transceivers and wavelengths
in a fiber.
• In a network with sparse splitting capability, it may not be
possible to include all the destinations of a session in
one multicast tree.
• Hence, a set of trees is constructed to include all the
destinations of a multicast session. This means that the
source needs to transmit the multicast data onto more
than one channel and maybe on different fibers or on
different wavelengths. The set of trees corresponding to
a single session is called a multicast forest. 20
 DaC network
• In a densely connected network, the number of splitters
required in a node is high. Hence it is difficult and also
expensive to fabricate such a node.
• Also, the optical power splitting causes loss in the optical
signal and hence optical amplifiers are required.
• In [5], a new tree generation algorithm is proposed which
uses only DaC capability of a node.
• First, a directed graph is constructed for the given
network. Then, an optimal trail, which starts from the
source of a multicast session and visits all destinations,
is computed.

21
 multiple-destination minimum-
cost trail [MDMCT])
• A trail is a path where nodes are allowed to be visited more than
once.
• A node, if it is a destination, taps a small amount of optical signal. In
[5],
• it is stated that constructing a trail with an objective of minimizing the
number of directed edges (also referred to as multiple-destination
minimum-cost trail [MDMCT]) is an NP-complete problem.
• Hence a heuristic is presented in which first a Steiner tree is
constructed using a minimum path heuristic [168], then a trail is
computed around the Steiner tree.
• Even though this method of constructing a multicast tree avoids
using optical split at the nodes, it requires more number of
wavelength channels.
• This is because every link in the Steiner tree is traversed twice, once
in each direction.

22
 Multicast Tree Generation
• Full Splitting Capability: all nodes in the network
have split capability.
• Hence, a single tree can be generated to route
multicast traffic.
• The tree generation is similar to the tree generation
in conventional networks. Apart from finding a path,
in a conventional network it is necessary to allocate
bandwidth and buffers.
• But in optical networks, the constraints are number
of transceivers and wavelengths. Hence, the tree
generation algorithm should consider the availability
of these resources while generating a multicast tree.

23
 Light-tree
• In [151], the problem of minimizing the number of transmitters
and receivers that are required to generate a multicast tree is
considered. It introduces the concept of a light-tree.
• A light-tree is a point-to-multipoint optical path established in
the network created by allocating the same wavelength on
every link of the tree.
• The concept of light-trees can be implemented by incorporating
optical multicasting (splitting) capability at all nodes of a
network in order to reduce the average packet hop distance
and the total number of transceivers in a network.
• Thus, a light-tree provides single-hop communication between
a source node and a set of destination nodes.
• A solution is provided in [151] for routing unicast traffic and
broadcast traffic using light-trees.
• To carry unicast traffic, the virtual topology design problem is
formulated based on the light-tree concept.

24
• The proposed optimization problem has one of the
following objective functions:
– Minimize the network-wide average packet hop
distance.
– Minimize the total number of transceivers in the
network.
• In [151] it is demonstrated that the average packet hop
distance for a virtual topology based on light-trees is
less than that of a virtual topology based on the
lightpath concept.
• It is also demonstrated that the number of transmitters
and receivers required for the virtual topology based
on light-trees is less than the number of transmitters
and receivers required for the virtual topology
designed based on the lightpath concept.
• For broadcast traffic, minimization of the number of
transceivers is considered the objective function.
• The light-tree concept can also be applied to multicast
traffic. 25
26
27
Genetic Algorithms for Multiple
Multicast Problem on WDM Ring

28
 Problem Definition
• Ring network G(V,E)
– V: the set of nodes
– E: the set of links
– bi-directional link
– W wavelengths per link。

29
 Problem Definition
• r groups of multicasts，
– Mi={si, Di}，i=1, 2, …, r, 1≦ki≦n；where
– Di={d1i, d2i, …, dkii } be the destination
– si :source
– For each multicast Mi={si, Di}，a multicast
tree MTi is need
– Construct a multicast forest MF=Ui=1,2,…r
MTi。
– Construct MF with wavelength continuity
constraint, such the number of used
wavelengths is minimized。 30
 OMMP
• Optimal multiple multicast problem, OMMP
• 給定一個WDM網路與r個多點傳送的需求所
成的集合M={Mi={si, Di}，i=1, 2, …, r,
1≦ki≦n}，建立一個多點傳送樹林，並決定每
一個多點傳送樹之波長通道指派，使的所需
求的波長通道為最少。
• OMMP is a NP-hard problem
• Since RWA(NP-hard) is a special case of
OMMP
• RWA on Ring is a NP-hard problem.

31
Example

32
Possible Assignment of Example

33
 Observation
• Each MTi can be constructed by：
– 建立一個順時針方向的路徑：Pc(si, dl-1i)
– 建立一個逆時針方向的路徑：Pr(si, dl+1i)
– 建立兩個路徑，一個順時針與逆時針之路徑
Pr(si, dl’i) 與Pc(si, dl’i)，對某一個l’D。

34
 Model
Objective : Min  y w
wW

s.t.
x
wW
k
wc  1, e  P k
c

 wr
x
wW
k
 1, e  Pk
r

 k
xwc   wr  yw , w  W , e  E
x k

wM ec wM er

x , x  {0,1}, c  M
k
wc
k
wr

y w  {0,1}, w  W
35
 Genetic Algorithm

Begin
Initialize population;
while (not terminal condition) do
Begin
choose parents from population; /* Selection */
construct offspring by combining parents; /* Crossover */
optimize (offspring); /* Mutation */
if suited (offspring) then
replace worst fit (population) with better offspring;
/* Survival of the fittest */
End;
End.
36
 Genetic Algorithm
• Chromosome Encoding
• Objective Function
• Penalty Function
• Crossover
• Mutation
• Selection

37
 Chromosome Encoding
• routing gene
• MGi={mgik, i=1,...,r; k=1,2} AGi={agik, i=1,...,r;
k=1,2}
• r: number of connections. r=4

7 1 2 7 ... 3 8 1 2 2 2 3 4

mg11 mg12 mg 12 mg 22 ... 1 2

mg1r mg r2 ag1 ag1 ag 12 ag 22 ... ag 1r ag r2
38
Example of chromosome encoding

1
8 2

7 3

6 4
5 39
 Wavelength gene

 if (there is one element ag ik , such ag ik  j ) and (mgik  si );

1
y j   for i  1,2,..., r; k  1,2)
0
 otherwise
40
 Objective Function
• Objective function
W
Objective function   y j
j 1
• The assignment represented by the connection may
not constraint-satisfy, thus, a penalty function
should be included in objective function.

41
 Penalty Function
• Assume both connections c1=(1,2) and c2=(1,4)
are assigned to wavelength 1 with clockwise
direction, then conflict occurred.
• Penalty should be defined.
• How to detect the conflict in a connection gene?
• A conflict-detection algorithm should be
developed.
• O(M2) pairs of connections should be examined.
• The conflict between two connections can be
detected in constant time O(1).
42
 Graph AA

c4
c1 c2 c3 c4
1
5 c3 2
c1
c2
4 3 c1 c2 c3 c4

c =(1,4) , c2=(2,4) , c3=(1,2) , c4=(5,2)

 1
43
 Crossover Operators
• Single point crossover (SPC)
• Single point wavelength crossover
(SPWC)
• Single point routing path crossover
(SPWC)
• Single assigning wavelength
exchanging operator (SAWEO)
• Wavelength exchanging operator (WEO)
44
 Mutations
• Single Routing Path Mutations (SRPM)
• Multiple Routing Paths Mutations
(MRPM)
• Single wavelength assignment
mutation (SWAM)
• Multiple wavelength assignment
mutation (MWAM)
• Multicast assignment mutation (MAM)

45
 Heuristic Algorithms
• 2-phase algorithm
– Routing phase
• Maximal-Gap Routing
• Minimal Load Routing
– Assignment Phase
• Greedy Wavelength Assign

46
 Extended Genetic Algorithm
• Produce only feasible solutions
• No need for the penalty function
• The wavelength assigned to the multicast
is determined by the greedy wavelength
assign algorithm.

47
 Chromosome Encoding
• routing gene
• MGi={mgik, i=1,...,r; k=1,2}

7 1 2 7 ... 3 8 1 2 2 2 3 4

mg11 mg12 mg 12 mg 22 ... 1 2

mg1r mg r2 ag1 ag1 ag 12 ag 22 ... ag 1r ag r2
48
 Objective Function
• Objective function
W
Objective function   y j
j 1

49
 Operators
• Crossover:
– single point crossover
• Mutation:
– Single routing path mutation (SRPM)
– Multiple routing paths mutation (MRPM)

50
 Hybrid Genetic Algorithm
• To speed up algorithm
• Heuristic routing algorithms are used.
• HGA1 =heuristics + SGA
• HGA2 =heuristics + EGA

51
 Experiments
• Run on PC with a Pentium III 1GHz CPU
and 512MB RAM.
• For nodes n=100, 200, 300
• Two sets of multicast requests are randomly
generated.
– Specific
– Random
• MAXM={5, 10} : the maximal number
destinations in D.
52
 Specific Set
1
n

4n/5+1
n/5
4n/5 n/5+1

3n/5+1
2n/5
3n/5 2n/5+1
53
 Specific Set
• Ranges Ai = { j | n*(i-1)/5+1 ≦ j ≦ n*i/5 }
• The source and destination nodes of
multicast Mi, i=1,2,...,r are randomly
selected from nodes in Ai and two of which
are n*(i-1)/5+1 and n*i/5.
• The lower bound of the minimal used
wavelengths of the set Mspecific is r/5.

54
Specific n=100 (MAXM =5 or 10)

55
Specific n=200 (MAXM =5 or 10)

56
Specific n=300 (MAXM =5 or 10)

57
58
Random n=100 (MAXM =5 or 10)

59
Random n=200 (MAXM =5 or 10)

60
Random n=300 (MAXM =5 or 10)

61
62
More Improvement

63
More Improvement

64
 Conclusion and Further Research
• Proposed
– Mathematic Model for multiple multicast problem on
WDM ring
– Several Heuristic Algorithms
– Genetic Algorithms
• Further Research in the problem
– Lower bound proof
– CPLEX package to found optimal solution
– Other Soft-computing method
• Simulated Annealing, Tabu search, Ant algorithm, Scatter
search
65
•
Multicast Problem on
Multicast is a point to multipoint
WDM
communication, by which a source node sends
messages to multiple destination nodes.
• A light-tree, as a point to multipoint extension
of a light-path, is a tree in the physical
topology and occupies the same wavelength in
all fiber links in the tree.
• Given an multicast request in a WDM network
system, compute a set of routing trees and
assign wavelengths to them such the cost is
minimized.

66
 s d1

Multicast Capable
WDM switch w1

continuous

w2
drop

d3 d2 67
 Assumptions
• Source node be the uniquely one has light-splitting
function (multicast capable).
• Each node of the tree is a multicast-Incapable
optical switch (MI node) (no light-splitting
function) .
• Each node can perform drop and continue function.
• Single-hop WDM network
• All Optical Network
• Static Traffic

68
 Introduction
• The problem is formalized as follows:
– Given a multicast request in a WDM network system,
compute a set of routing paths (light-trees) and assign
wavelengths to them such that the total cost in
minimized.
• The objective function has two components
– the number of used wavelengths
– the cost of light-tree
• The objective is minimize cost of light-tree plus the
cost α*(number of used wavelengths).

69
 System Models
• WDM network
– Connected and undirected graph
G(V, E, c, w)
– V: vertex-set
– E: edge-set
– Each edge e in E is associated with two weight
functions
• c(e): communication cost
– W: the number of wavelengths provided by
WDM network.
70
 System Models
• Cost of path P(u,v):
c( P(u, v))   c ( e)
eP ( u ,v )

• A multicast request in the system are given,

denoted by r (s, D)
– source s
– destination: D

71
 System Models

• Tk (s, Dk) be the routing tree for request r

(s, D) in wavelength k, where k<W.
• T=∪ k=1,2,...,WTk (s, Dk); D=∪ k=1,2,...,W Dk;
T is the light-forest, Di∩Dj =,for i≠j.
• The light signal is forwarded to
(continuous) the output port leading to its
child, which then transmit the signal to its
child until all nodes in the Dk receive it.
72
 Objective

• The cost of the light-tree Tk (s, Dk)

c(Tk (s, D k ))   c(e)
eTk (s,D k )

• The cost of the light-forest T is defined:

w
c(T)   c(Tk (s, D k ))
k 1
73
 Total cost
w
c(R(s, D))  c(T)     y k
k 1

• where yj =1 if wavelength j is used; yj=0, otherwise

• Special case:
– One objective of the multicast routing is to construct a
routing tree (or forest) which has the minimal cost. The
problem is regarded as the minimum Steiner tree
problem, which was proved to be NP-hard.
– Another objective is to minimize the number of
wavelengths used in the system. 74
 Example
s
4
2 3
Light-splitting 6
7 9 10 12
5
2 4 10 4 1
7
Light-splitting
14 3 1 8 4 9
11
3 5
5 2 4

2 6 11 3 3 1 13 8
5
3 6
2
15 2
7
1 3
16 17 6 destination node75
 Genetic Algorithm
• Basic idea: modified the GA of R-H Whang et
al.pto
1
WDM
p 2 pnetwork
3 p4 pi P|D|

pi is between 1 and Ri, i=1,2,...,|D|, where Ri is the number of

candidate path from s to di 76
 Chromosome Encoding
p1 p2 p3 p4 pi P|D|

77
 Light-Forest Construct Algorithm(LFCA)

• Path by path construct

– Integrated the path and wavelength in single phase
• Step 1: Sort paths in increasing order
according to the cost of each path O(|D| log |D|)
time. Assume that p1,p2,...., p|D| be the new
index.
• Step 2: p1 is assigned to wavelength 1,w=1,
T1={p1}, T2= ...=Tk=ø. O(n)
78
 Light-Forest Construct Algorithm

• Step 3: For i= 2 to |D] do

• Begin
– j=1
– while j≦w do
• {
• if pi is not conflict with Tj
– then
» {assigned pi to Tj
» Tj=Tj ∪pi
» flag=TRUE}
– else j=j+1
• }
• if flag is not TRUE
– then
» w=w+1
» Tw=Tw ∪ pi
– End
Time complexity: O(|D|2*n) 79
 Example
p1=s7 1 (10) s
p2=s7 14 2 (13) 4
p3=s9 13 3 (15) 6 3
p4=s10 4 (8) 7 9 10 6 12
p5=s10 4 5 (12) 5
p6=s9 13 5 6 (26) 2 4 10 4 1
7
14 3 1 8 4 9
11
2 5 4
5

2 6 11 3 3 1 13 8 5
3 6
2 15 12
cost=8+10+4+15+13+26+2*α 7
16 1 17 3 6
80
 Conflict Test
• light-tree is represented by a directed tree root
at s.
• O(n) time: add path into a directed tree, then
test the out-degree of the visited vertex, if the
out-degree >1 then conflict occurred.

81
 Fitness Function
• The light-forest construct a feasible solution of
the WDM network, thus, there is no need for the
penalty function
• Minimized
W W
Cost   cost (T j )     y j
j 1 j 1

• Transform to maximization form

Fitness = Cmax - Cost
• where Cmax denotes the maximum value observer
so far of the cost function in the population. 82
 Crossover Operator
• single point crossover
• multiple point crossover

83
 Single point Crossover

2 3 1 4 1 3 1 2 2 3 2 1

2 3 1 4 2 1 1 2 2 3 1 3

After crossover, the light-forest should be reconstructed

84
 Multiple point Crossover

2 3 1 4 1 3 1 2 2 3 2 1

2 3 2 3 1 3 1 2 1 4 2 1

•After crossover, the light-forest should be reconstructed

85
 Mutation Operator
• single point mutation
• heuristic mutation

86
 Single point mutation
• After single point mutation, the light-forest
may be changed.
• The old path is traversed backward from di to s
– The edge we traversed are removed If the use(e)=1
until the following saturations occurred,
• reach s
• reach destination node dl in D which pl is assigned to
the same wavelength
• reach a node with out-degree > 1.

87
 Example of single point mutation

p1=s7 1 (10) s
p3=s9 13 3 (15) 4
p4=s10 4 (8) 6 3
p5=s10 4 5 (12) 7 9 10 6 12
5
2 4 10 4 1
7
14 3 1 8 4 9
11
2 5 4
5

2 6 11 3 3 1 13 8 5
3 6
2 15 12
7
16 1 17 3 6 88
 Example of single point mutation

p1=s7 1 (10) s
p3=s9 13 3 (15) 4
p4=s10 4 (8) 6 3
p5=s10 4 5 (12) 7 9 10 6 12
5
if p5 is mutated to p5=s85 2 4 10 4 1
then the old path 4 5 is removed 7
and new path is tested 14 3 1 8 4 9
whether is conflict to current 11
2 5 4
light-tree or not. 5
if no then assign
new path to current 2 6 11 3 3 1 13 8 5
wavelength. 6
3
otherwise, another light-tree of
2 15 12
different wavelength is tested and selected
to assign. 7
16 1 17 3 6 89
 Example of single point mutation

p1=s7 1 (10) s
p3=s9 13 3 (15) 4
p4=s10 4 (8) 6 3
p5=s10 4 5 (12) 7 9 10 6 12
5
if p4 is mutated to p4=s1012 4 2 4 10 4 1
then the old path 4 5 is not removed 7
and new path is tested 14 3 1 8 4 9
whether is conflict to current 11
2 5 4
light-tree or not. 5
if no then assign
new path to current 2 6 11 3 3 1 13 8 5
wavelength. 6
3
otherwise, another light-tree of
2 15 12
different wavelength is tested and selected
to assign. 7
16 1 17 3 6 90
Example of mutation
s
6 4
3
7 9 10 6 12
5
2 4 10 4 1
7
14 3 1 8 4 9
11
2 5 4
5

2 6 11 3 3 1 13 8 5
3 6
2 15 12
7
16 1 17 3 6
91
 Heuristic Initialization
• Farthest First
– To improve the performance of GA.
• Notations
– Edge(P(si,di))
• The set of edges that in path P(s,di) or edges that at least
one of its endpoints (not s) on P(s, di).
– G’=G-Edge(P(si,di))

92
 Example
• Edge(P(s,2))={(s,7), (7,14), (14,2), (1,7),
(1,14), (3,14), (2,11), (2,15), (2,16)}
s
2 4
3
7 9 10 6 12
5
2 4 10 4 1
7
14 3 1 8 4 9
11
5 3 2 5 4

2 6 11 3 3 1 13 8 5
3 6
2 15 2
7
16 1 17 3 6 93
destination node
 Sub-trees
• Let degree(s) be the degree of the source node s on tree P
(minimal cost tree).
• PT(vi) be the sub-tree rooted at node vi.
s PT(10)
2 4
3
PT(7) 7 9 10 6 12
5
2 4 10 4 1
7
14 3 1 8 4 9
11
5 3 2 5 4

2 6 11 3 3 1 13 8 5
3 6
2 15 2 PT(8)
7
16 1 17 3 6 94
destination node
 Properties of sub-tree
• If there are more than one destination on the leaves in
a sub-tree PT(vi), than violated the light-splitting
constraint.
• Thus, only one destination node on leaves can be
chosen to route by this sub-tree and the others should
be re-routed.
• To determined the rerouting paths of the destinations
in the leaves, some heuristics are proposed.

95
 Algorithm: Farthest-First
• For each sub-tree PT(vi), only the farthest
destination is routed by the path P(s, di).

s
2 4
Reroute 3
7 9 10 6 12
5
2 4 10 4 1
7
14 3 1 8 4 9
6 11
5 3 2 5 4

10 2 6 11 3 3 1 13 8 5
3 7 6
2 15 2
7
16 1 17 3 6 96
destination node
 Re-route
• How to re-route?
• The routed paths and nodes used by the farthest path
in each sub-tree cannot be used twice.
• The re-routing paths together with the exist paths can
not perform cycle(s) or violated the light-splitting
constraint.
• EDGE(P(s,v)) in each sub-trees should be removed.

97
 Remove EDGE(P(s,v))
s PT(10)
2 3
4 s G’
PT(7) 7 9 10 6 12 3
5 9 12
2 4 10 4 1
7 10
14 3 1 8 4 9
11 1
3 5 11
5 2 4 2
2 6 11 3 3 1 13 8 5 11 3 3 1 13
3 6 3
2 15 PT(8) 15
2
7 16 1 17
16 1 17 3 6 destination no
destination node

UNREACH={ 3, 1 } 98
 s s

3 3
12 12
9

10 10

1 1
11 11
2 2

11 3 3 1 13 11 3

3 3
15 15

1 16 1 17
16 17

99
 s
4
2 3
6
7 9 10 12
5
2 4 10 4 1
7

14 3 1 8 4 9
11
3 5
5 2 4

2 6 11 3 3 1 13 8
5
3 6
2
15 2
7
1 3
16 17 6 destination node
100
101
 Experimental
• PC Pentium III 1GMHz, 512MB RAM.
• Borland C++.
• Windows 2000.

102
 Result
n |D| α IA GA reduce
20 4 10 123 111 10.81%
20 6 10 134 123 8.94%
20 8 10 167 147 13.61%
40 4 10 167 144 15.97%
40 6 10 184 164 12.20%
40 8 10 208 195 6.67%
60 4 10 201 194 3.61%
60 6 10 237 221 7.24%
60 8 10 256 243 5.35%
103
average 9.38%
 Conclusions
• A genetic algorithm is proposed to solve the
Multicast routing on WDM network.

104