Traffic Grooming in Optical Mesh

Networks

Biswanath Mukherjee
Professor of Computer Science, UC Davis
mukherje@cs.ucdavis.edu

Acknowledgement: UC Davis Graduate Students and Alums:

Dr. Keyao Zhu, Dr. Canhui (Sam) Ou, Dr. Hui Zang,
Dr. Shun Yao, Hongyue Zhu, Narendra Singhal, et al.

Research Sponsors: NSF, Sprint, UC MICRO

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 1

Traffic Grooming in Optical Mesh Networks

References:
1. B. Mukherjee, et al. “Traffic grooming in mesh optical networks,” OFC-04,
March 2004 (Invited Paper) (for brief and broad review of the subject).
2. K. Zhu and B. Mukherjee, “A review of traffic grooming in WDM optical
networks: architectures and challenges,” Optical Networks Magazine, vol. 4,
no. 2, pp. 55–64, March/April 2002 (for general review of the subject).
3. K. Zhu and B. Mukherjee, “Traffic grooming in an optical WDM mesh
network,” IEEE J. Select. Areas Commun., vol. 20, no. 1, pp. 122–133, Jan.
2002 (for a network-design problem; static traffic).
4. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, “A novel, generic graph model for
traffic grooming in heterogeneous WDM mesh networks,” IEEE/ACM Trans.
Networking, vol. 11, no. 2, pp. 285–299, Apr. 2003 (for a versatile model).
5. K. Zhu, H. Zhu, and B. Mukherjee, “Traffic Engineering in Multi-granularity
Heterogeneous WDM Optical Mesh Networks Through Dynamic Traffic
Grooming,” IEEE Network Magazine, Special issue on "Traffic Engineering in
Optical Networks", vol. 17, no. 2, pp. 8-15, March/April 2003 (for a traffic-engg.
problem; dynamic traffic).
6. K. Zhu, H. Zang, and B. Mukherjee, “A comprehensive study on next-
generation optical grooming switches, “IEEE J. Select. Areas Commun., vol.
21, no. 7, pp. 1173-1186, Sept. 2003 (for a review of grooming switches).

(Please see the last slide for additional papers.)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 2

1
 Telecom Network Hierarchy

Long haul
- 100s-1000s km
- Mesh

Metro (interoffice)
- 10s of km
- Rings

Access
- a few km
- Hubbed rings, PONs

Users The “Last” Mile

“First”

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 3

Why Traffic Grooming?

• Capacity of a wavelength channel
– Today: OC-192 (10Gbps)
– Tomorrow: OC-768 (40Gbps)

• Bandwidth requirement of a single connection

– Diverse: STS-1, STS-3, STS-12, STS-48, STS-192

• Bandwidth mismatch results in the need for

traffic grooming
– Efficiently mux/demux (i.e., “pack” and “unpack”) low-
speed connections onto/from high-capacity channel
– Intelligently switch traffic at intermediate nodes

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 4

2
 Outline
• Grooming node architectures
• Grooming policies
• A novel generic graph model
• Survivable traffic grooming
• Hierarchical grooming
• Source-node grooming

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 5

Traffic Grooming: Ring and Mesh

• SONET/WDM ring networks
– Architecture: OADM and S-ADM

• Evolution of topologies of backbone networks

– From interconnected rings to arbitrary, irregular
mesh topologies

• WDM mesh networks

– Grooming optical cross-connect (OXC)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 6

3
 Wavelength-Routed WDM Network

• Lightpath: B C
– End-to-end wavelength circuit
(with or w/o O-E conversion) Wavelength 1 1 2
– Spans single or multiple fiber

Wavelength 2
links
A 0 5 F
– Routed by intermediate nodes
– Provides service for upper
3 4
layers (IP, ATM, etc.) Fiber Link

– Wavelength-continuity E
D
constraint (without
wavelength conversion) Access station

Switch: Optical crossconnect

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 7

Traffic-Grooming Example
• An illustrative example:
- One tunable transmitter and one tunable receiver at each node.
- 3 connections -- (0,2), (2,4) and (0,4) -- with STS-48 bandwidth request.
- Each fiber link has 2 wavelengths. Capacity of each wavelength is OC-192.

Receiver

Wavelength 1
Fiber Link:
1 2 2
Lightpath:
Wavelength 2

0
0 5

Transmitter
3 4
3 4
Fiber Link

(a) (b)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 8

4
 Traffic-Grooming Example
• An illustrative example:
- One tunable transmitter and one tunable receiver at each node.
- 3 connections -- (0,2), (2,4) and (0,4) -- with STS-48 bandwidth request.
- Each fiber link has 2 wavelengths. Capacity of each wavelength is OC-192.

Receiver

Wavelength 1
Fiber Link:
1 2 2
Lightpath:
Wavelength 2

Connection 1:
0 5 0

Transmitter
3 4
3 4
Fiber Link

(a) (b)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 9

Traffic-Grooming Example
• An illustrative example:
- One tunable transmitter and one tunable receiver at each node.
- 3 connections -- (0,2), (2,4) and (0,4) -- with STS-48 bandwidth request.
- Each fiber link has 2 wavelengths. Capacity of each wavelength is OC-192.

Receiver

Wavelength 1
Fiber Link:
1 2 2
Lightpath:
Wavelength 2

Connection 1:
0
0 5
Connection 2:
Transmitter
3 4
3 4
Fiber Link

(a) (b)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 10

5
 Traffic-Grooming Example
• An illustrative example:
- One tunable transmitter and one tunable receiver at each node.
- 3 connections -- (0,2), (2,4) and (0,4) -- with STS-48 bandwidth request.
- Each fiber link has 2 wavelengths. Capacity of each wavelength is OC-192.

Receiver

Wavelength 1
Fiber Link:
1 2 2
Lightpath:
Wavelength 2

Connection 1:
0 5 0
Connection 2:

3 4 Connection 3:
3 4
Fiber Link

(a) (b)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 11

Traffic-Grooming Example
• An illustrative example:
- One tunable transmitter and one tunable receiver at each node.
- 3 connections -- (0,2), (2,4) and (0,4) -- with STS-48 bandwidth request.
- Each fiber link has 2 wavelengths. Capacity of each wavelength is OC-192.

Receiver

Wavelength 1
Fiber Link:
1 2 2
Lightpath:
Wavelength 2

Connection 1:
0
0 5
Connection 2:

3 4 Connection 3:
3 4
Fiber Link

(a) (b)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 12

6
 Traffic-Grooming Example
• An illustrative example:
- One tunable transmitter and one tunable receiver at each node.
- 3 connections -- (0,2), (2,4) and (0,4) -- with STS-48 bandwidth request.
- Each fiber link has 2 wavelengths. Capacity of each wavelength is OC-192.

Receiver

Wavelength 1
Fiber Link:
1 2 2
Lightpath:
Wavelength 2

Connection 1:
0 5 0
Connection 2:
Transmitter
3 4 Connection 3:
3 4
Fiber Link

(a) (b)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 13

TE vs. NE vs. NP
• Traffic Engineering (TE)
– “Put the traffic where the bandwidth is”

• Network Engineering (NE)

– “Put the bandwidth where the traffic is”

• Network Planning (NP)

– “Put the bandwidth where the traffic is forecasted to be”

• TE – online, dynamic, provisioning problem, ms time scale

• NE – intermediate problem, months time scale
• NP – offline, static, dimensioning problem, 5-yr time scale

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 14

7
 Traffic Models
• Static traffic
– Maximize throughput (using limited resources)
– Minimize cost (while satisfying all requests)
– Can be part of network-design problem

• Dynamic traffic
– Minimize blocking probability
– Traffic-engineering problem

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 15

Grooming Node Architecture

• Single-hop grooming OXC
– Switch at wavelength granularity
– Low-data-rate ports for local add/drop

• Multi-hop partial-grooming OXC

– Only a few wavelength channels can be
switched at sub-wavelength granularity

• Multi-hop full-grooming OXC

– All wavelength channels can be switched at
sub-wavelength granularity

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 16

8
 Multi-hop Partial-Grooming OXC

... ..
.
. .
. Wavelength .
Fiber in
. .. Switch
.. . Fiber out
Fabric
. .
(W-Fabric)
Demux Mux

Grooming-add Grooming-drop
port T G-Fabric R port

Local add Local drop

… … … ...

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 17

Multi-hop Full-Grooming OXC

OXC

Demux Mux
.. Non-
..
. blocking .
Fiber in . . Fiber out
. Switch
.
.. fabric ..

… …

Local add Local drop

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 18

9
 Problems

• Traffic-Engineering Problem
• Network control and dynamic traffic provisioning
– Evaluate different system architecture (OXCs)
– Investigate different provisioning algorithms

• Network-Planning Problem
• Static traffic (network) optimization
– Maximum network throughput for given network
resources and static traffic requests

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 19

Traffic Grooming – An example

Single-hop grooming Multi-hop grooming

2 3

L1 (1,2) L2 (2,3) L3 (3,4)

C1 out
C1 in 1 5
4

L4 (1,5)
C2 C2
in out

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 20

10
How to Carry A Low-Speed Request?
• Grooming policy ( request R (s,d,r) )
• s = source; d = destination; r = b/w needed
1. Using existing lightpath between (s,d)
2. Establishing new lightpath between (s,d)
3. Using multiple existing lightpaths
4. Using both existing lightpaths as well as new
established lightpaths

• We need ….
– Uniform scheme to achieve different grooming policies
– Able to handle a heterogeneous network environment
– Easy to implement, scalable, effective

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 21

Grooming Policies
• For a given traffic demand, four operations can be used
to carry traffic without altering existing lightpaths
– Operation 1: Route the traffic onto an existing lightpath directly
connecting the source and the destination
– Operation 2: Route the traffic through multiple existing lightpaths
– Operation 3: Set up a new lightpath directly between the source
and the destination, and route the traffic onto this lightpath
– Operation 4: Set up one or more lightpaths that do not directly
connect the source and the destination, and route the traffic onto
these lightpaths and/or some existing lightpaths

• Grooming policies determines which operation should be

employed under which situation
– An adaptive grooming policy can be used for dynamic traffic

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 22

11
Traffic-Grooming in Mesh: Dynamic Traffic

Operation 1 s d

Operation 2 s i j d

Operation 3 s i d

Operation 4 s i j d

Operation 5(?)
s d j

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 23

Challenges
• Four correlated sub-problems:
– Determine set of lightpaths to use
– Route the lightpaths over physical topology
– Assign wavelengths to the lightpaths
– Route the low-speed connection requests over the set of lightpaths

• Heterogeneity in mesh networks

– Irregular topology
– Arbitrary traffic pattern
– Different node architecture
• Sparse and partial wavelength conversion
• Sparse and partial grooming capability
– Various grooming policies

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 24

12
 A Novel Generic Graph Model
• Construct an “auxiliary” graph to represent
the node architectures and network states
• Advantages
– Takes into account heterogeneity of networks
• Can represent different node architectures
• Easy to achieve various grooming policies
• Suitable for static and dynamic traffic
– Simple and uniform model
• Employs shortest-path computations

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 25

A Generic Graph Model

A single-hop A multi-hop A multi-hop
grooming partial- full-grooming
node grooming node node

I O I O I O
Access layer

Mux layer I O I O I O

Grooming
I O I O I O
layer

Wavelength I O I O I O
layer
(a) (b) (c)
Grooming (port) Link

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 26

13
 A Generic Graph Model
Node 0
0 Node 1 Node 2
I O
I O I O
Access layer

1 2
I O
(a) Mux layer I O I O

0 I O
Grooming
I O I O
layer

I O
1 2 Wavelength I O I O
layer
(b)
(c)
Wavelength Link
Lightpath Link

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 27

A Provisioning Example

Node 0
0 Node 1 Node 2
I O
I O I O
Access layer

1 2
I O
(a) Mux layer I O I O

0 I O
Grooming
I O I O
layer

I O
1 2 Wavelength I O I O
layer
(b)
(c)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 28

14
 A Provisioning Example

Node 0
0 Node 1 Node 2
I O
I O I O
Access layer

1 2
I O
(a) Mux layer I O I O

0 I O
Grooming
I O I O
layer

I O
1 2 Wavelength I O I O
layer
(b)
(c)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 29

A Provisioning Example
Node 0
0 Node 1 Node 2
I O
I O I O
Access layer

1 2
I O
(a) Mux layer I O I O

0 I O
Grooming
I O I O
layer

I O
1 2 Wavelength I O I O
layer
(b)
(c)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 30

15
 A Provisioning Example

Node 0
0 Node 1 Node 2
I O
I O I O
Access layer

1 2
I O
(a) Mux layer I O I O

0 I O
Grooming
I O I O
layer

I O
1 2 Wavelength I O I O
layer
(b)
(c)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 31

A Provisioning Example

Node 0
0 Node 1 Node 2
I O
I O I O
Access layer

1 2
I O
(a) Mux layer I O I O

0 I O
Grooming
I O I O
layer

I O
1 2 Wavelength I O I O
layer
(b)
(c)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 32

16
 A Provisioning Example

Node 0
0 Node 1 Node 2
I O
I O I O
Access layer

1 2
I O
(a) Mux layer I O I O

0 I O
Grooming
I O I O
layer

I O
1 2 Wavelength I O I O
layer
(b)
(c)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 33

Advantages of the Model

• Provides an abstract view of network state

• Can achieve different grooming policies using a

simple shortest-path computation algorithm
– Through different link-weight (administrative cost)
assignment schemes

• Can find a solution if one exists

• Easy to implement

• Scalable
Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 34

17
How to Carry A Low-Speed Request?

Source node grooming – using “light-tree”

C3 out C2 out

3 5

C3 in
C2 in 1 2 4 6
C1 in

C1
Request: (1, 6), (1, 5), (1,3) out

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 35

A Multicast-Capable OXC

W-Fabric

Fiber in Fiber out

W-Fabric

Demux
… Mux
…

Local Add Local Drop

Electronic mux/demux

Optical Splitter

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 36

18
 Sample Network Topology
1 19
2,600
800 1,000 1,200
1,900
950
6 11 1,300
2 1,300
15 20
1,200 1,400
900
1,100 1,000 600 700
1,000 1,000
1,000 16 21
1,000 1,000 9 12
3 7 300
250 800 22
900 1,000
4 850 1,000 600
1,000 1,150 850
800 1,100
950 13 17
1,000
23
5 10
650
8 900 800
1,200 850 900
14
1,200
18 24
900

8 wavelengths per fiber

6 grooming ports per node

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 37

Illustrative Results

Connection bandwidth ratio (1:1:1:1:1)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 38

19
 Illustrative Results

Connection bandwidth ratio (1:1:1:1:1)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 39

Illustrative Results

Connection bandwidth ratio (1:1:1:1:1)

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 40

20
 Problems

• Traffic-Engineering Problem
• Network control and dynamic traffic provisioning
– Evaluate different system architecture (OXCs)
– Investigate different provisioning algorithms

• Network-Planning Problem
• Static traffic (network) optimization
– Maximum network throughput for given network
resources and static traffic requests

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 41

Static Traffic (Network) Optimization

OC-3 OC-48

???

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 42

21
 Static Traffic (Network) Optimization

Given:

• Physical topology G (V,E)

• Number of wavelength channels per fiber = W
• Capacity of a wavelength channel = C
• OXCs at each node (e.g., partial grooming OXC)
• Number of lasers (transmitters) and filters (receivers) at
each node, i.e., number of grooming ports

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 43

Static Traffic (Network) Optimization

Given:

• A set of N by N traffic matrices

– Each traffic matrix represents a particular low-speed for
connection requests supported by the network, such as
STS-1, STS-3, STS-12, etc.
– Each connection is associated with a ‘weight’
– A connection’s weight is related to:
• Bandwidth requirement
• Distance between end nodes
• Quality of service
• Protection requirement, etc.

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 44

22
 Static Traffic (Network) Optimization

Determine:

• A virtual (lightpath) topology G' = (V', E')

• Routing the connection requests on G’, maximize the
total weighted throughput
– If we assume the connection weight is only related with
bandwidth requirement
– Our goal: Maximize throughput - Total traffic request
carried by the network.

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 45

Methodologies

• Integer linear program (ILP)

– Multicommodity flow
• ILP solver
– CPLEX, commercial software
– Ilpsolve, free software
• Optimization heuristic algorithms
– Greedy algorithm
– Simulated annealing algorithm
– Genetic algorithm
– Tabu search algorithm
– etc.

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 46

23
 Survivable Traffic Grooming
• Survivability is an important property
• Grooming with shared protection
– Traffic assumption
• Low-speed connections outnumber high-speed connections
– Node architecture: multi-hop partial-grooming OXC
– Two types of resource constraints
• Wavelength-links
• Grooming capacity (# of grooming ports)

• Approaches
– Protection-at-Lightpath (PAL) level
– Protection-at-Connection (PAC) level
• MPAC: working and backup paths mixed together
• SPAC: working and backup paths separated

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 47

Survivable Traffic Grooming

PAL MPAC SPAC

End-2-End Lightpath Connection Connection

Protection

W&B
Separate Mixed Separate
Traffic

Backup Fixed Fixed Fixed

Sharing routing routing &λ routing

Complexity Low High High

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 48

24
 Survivable Traffic Grooming
• Some significant research results
– Beneficial to groom working paths and backup paths
separately
– When grooming capacity is sufficient, beneficial to protect
each connection individually
– When grooming capacity is moderate or low, beneficial to
protect each lightpath

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 49

Hierarchical Node Architecture

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 50

25
 Hierarchical Grooming
• Traffic grooming in networks with hierarchical
node architecture
– Waveband path
– Possible different switching granularities
• Waveband switches
• Grooming switches
– Can be handled by the graph model

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 51

Inverse Multiplexing: An Example

• Benefits of Next-Gen SONET/SDH

SONET/SDH 7 STS-3c’s SONET/SDH

framer/mapper framer/mapper

Ethernet GbE VC SONET/SDH-enabled VC GbE Ethernet

GFP optical transport GFP
switch LCAS LCAS switch
network

Source Destination
STS-3c-7v STS-3c-7v

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 52

26
 Summary
• Grooming node architectures
• Grooming policies
• A novel generic graph model
• Survivable traffic grooming
• Hierarchical grooming
• Source-node grooming
• Inverse multiplexing
– Survivable Virtual Concatenation for
Next-Generation (NG) SONET/SDH

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 53

Bibliography: Additional References

1. C. Ou, K. Zhu, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, “Traffic
Grooming for Survivable WDM Networks—Shared Protection,” IEEE J.
Select. Areas Commun., vol. 21, no. 9, pp. 1367-1383, Nov. 2003 (for
survivable traffic grooming).
2. S. Yao, C. Ou, and B. Mukherjee, “Design of hybrid optical networks
with waveband and electrical TDM switching,” Proc., IEEE Globecom
2003, San Francisco, Dec. 2003 (for hierarchical traffic grooming using
wavebands).
3. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, “Dynamic Traffic Grooming
in WDM Mesh Networks Using a Novel Graph Model,” Optical Networks
Magazine, vol. 4, no. 3, pp. 65-75, May/June 2003 (for additional work on
dynamic grooming).
4. H. Zhu, K. Zhu, H. Zang, and B. Mukherjee, “Cost-Effective WDM
Backbone Network Design With OXCs of Different Bandwidth
Granularities,” IEEE Journal on Selected Areas in Communications, vol.
21, no. 9, pp. 1452-1466, Nov. 2003 (for a network design with
heterogeneous grooming switches).
5. L. H. Sahasrabuddhe and B. Mukherjee, “Light-Trees: Optical
Multicasting for Improved Performance in Wavelength-Routed
Networks,” IEEE Communications Magazine, vol. 37, no. 2, pp. 67-73,
Feb. 1999 (for material on “light-trees”).

Unit 7a: Traffic Grooming in Mesh Nets © B. Mukherjee: Optical Communication Networks Page 54

27