Traffic Grooming in Generic Graph Model for Traffic

Heterogeneous Networks Grooming

• “Novel Generic Graph Model for Traffic Grooming in Heterogeneous • Construct auxiliary graph
WDM Mesh Networks,” IEEE/ACM Transactions on Networking, vol. 11,
no. 2, April 2003. – Add vertices and edges corresponding to network elements
• Mukherjee, Chapter 13 • Physical links
• Can be applied to static or dynamic traffic grooming problem • Logical links
• Each node characterized by various parameters • Wavelength converters
– Optical switching/multiplexing capabilities – wavelength/waveband/fiber • Electronic ports (transmitters/receivers)
– Electronic switching/multiplexing/grooming capabilities – Assign costs to links based on objective
– Availability of wavelength conversion
– Number of transmitters/receivers • Run shortest-path algorithm
• Traffic grooming problem may have various objectives
– Minimize cost (transmitters/receivers)
– Minimize overall traffic load
– Minimize maximum traffic on any lightpath
– Minimize maximum wavelengths on any fiber

Auxiliary Graph - Vertices Auxiliary Graph - Edges

• Wavelength Bypass Edges (WBE)
– From each input to output port on a given wavelength layer
– Optical wavelength switching capability
• Input and output vertex for each wavelength layer at each node
• Grooming Edges (GrmE)
• Input and output vertex for lightpath layer at each node – From input to output port on access layer if grooming is available
• Input and output vertex for access layer at each node – Electronic switching capability
• Mux Edges (MuxE)
– From output port on access layer to output port on lightpath layer
• Demux Edges (DmxE)
– From input port on lightpath layer to input port on access layer

Auxiliary Graph - Edges Auxiliary Graph - Edges

• Transmitter Edges (TxE)
– From output port on access layer to output port on wavelength
• Wavelength-Link Edges (WLE)
layer if transmitter is available
– From output port on wavelength layer l at node i to input port on
• Receiver Edges (RxE) wavelength layer l at node j if wavelength l is available on the
– From input port on wavelength layer to input port on access layer if physical link between i and j
receiver is available
• Lightpath Edges (LPE)
• Converter Edges (CvtE) – From output port on the lightpath layer at node i to the input port
– From input port on wavelength layer λ1 to output port on of the lightpath layer at node j if there is a lightpath from node i to
wavelength layer λ2 if optical wavelength conversion is available node j

1
 Integrated Grooming Based on
Example
the Auxiliary Graph (IGABAG)

• Traffic demand: T(s,d,g,m) • Wavelength capacity: OC-48

– s: source • Each node has 2 transmitters/receivers
– d: destination
• Granularity: OC-12
– g: granularity
– m: amount of traffic in units of g • Request 1: T(1, 0, OC-12, 2) -> Lightpath on λ1 from N1 to N0
• Step 1: Delete edges with capacity less than g • Request 2: T(2, 0, OC-12, 1)
• Step 2: Find shortest path p from output port on the access layer of s • Request 3: T(1, 0, OC-48, 1)
to the input port on the access layer of d
• Step 3: If p contains wavelength-link edges, set up corresponding
lightpaths
• Step 4: Route traffic demand along path p. If the capacity of
lightpaths along p is less than m, route the maximum amount possible
• Step 5: Restore edges deleted in Step 1
• Step 6: Update graph G

Example – Single-Hop Grooming Example – Multihop Grooming

• Request 2: T(2, 0, OC-12, 1) • Request 2: T(2, 0, OC-12, 1)

– New lightpath on λ2 from N2-N1-N0 – New lightpath on λ1 from N2-N1
• Request 3: T(1, 0, OC-48, 1) – Existing lightpath on λ1 from N1-N0
• Request 3: T(1, 0, OC-48, 1)

Grooming Operations Grooming Policies

• Minimize the Number of Traffic Hops (MinTH)

– Attempt Operation 1
– Attempt Operation 3
Add new lightpath(s) Single-hop or multihop
– Between Operation 2 and 4, choose the one with fewest logical
grooming
hops
Operation 1 No Single-hop • Minimize the Number of Lightpaths (MinLP)
– Attempt Operation 1
Operation 2 No Multihop
– Attempt Operation 2
Operation 3 Yes Single-hop – Attempt Operation 3 or 4
• Minimize the Number of Wavelength-Links (MinWL)
Operation 4 Yes Multihop – Attempt Operation 1
– Attempt Operation 2
– Between Operation 3 and 4, choose the one with fewer wavelength
links

2
 Comparison of Policies Ordering of Requests for Static Case

• Least Cost First (LCF)

– Establish least-cost request first
– Cost = (weight of shortest path for demand)/(amount of traffic)
• Maximum Utilization First (MUF)
– Select connection with maximum utilization first
– Utilization = (amount of traffic)/(number of hops on physical
topology)
• Maximum Amount First (MAF)
– Select connection with largest traffic demand first

Comparison of Ordering Schemes Grooming Architectures

• “A Comprehensive Study on Next-Generation Optical Grooming

Switches,” IEEE J. Selected Areas in Communications, vol. 21,
no. 7, Sept. 2003.
• Different nodes have different grooming capabilities
– Wavelength-granularity switching
– Sub-wavelength-granularity multiplexing/demultiplexing
– Sub-wavelength-granularity switching

Node Types Characteristics of Grooming OXCs

• Non-grooming OXC
– Wavelength granularity switching capabilities
– No electronic switching at sub-wavelength granularity
• Single-hop grooming OXC
– Wavelength granularity switching capabilities
– Allows lower-rate electronic traffic streams to be multiplexed and added
– No electronic switching at sub-wavelength granularity
• Multi-hop partial grooming OXC
– Wavelength granularity switching capabilities
– Electronic switching at sub-wavelength granularity
– Only a few wavelength channels may be demultiplexed to allow switching at
sub-wavelength granularity
• Multi-hop full grooming OXC
– Wavelength granularity switching capabilities
– Electronic switching at sub-wavelength granularity
– All incoming wavelengths can be demultiplexed into lower-rate traffic
streams for switching at sub-wavelength granularity
• Light-tree-based source node grooming
– Light-tree: all-optical single-source multi-destination connection
– Low-rate electronic streams groomed at source and are sent to all
destinations of light-tree

3
 Auxiliary Graph Representations Edge Types
• Wavelength link (i,j)
– Output of wavelength layer at i to input of wavelength layer at j
• Multi-hop ungroomable lightpath
– Output of mux layer at i to input of mux layer at j
– No electronic grooming capabilities at endpoints
– Lightpath (i,j) can only carry traffic between node pair (i,j)
• Source-groomable lightpath
– Output of grooming layer at i to input of mux layer at j
– Electronic grooming capability at source of lightpath
– For lightpath (i,j), traffic is aggregated at node i, but all traffic must be
destined for node j
• Destination-groomable lightpath
– Output of mux layer at i to input of grooming layer at j
– Electronic grooming capability at destination of lightpath
– For lightpath (i,j), all traffic must originate at node i, but may be forwarded
to different destinations after reaching node j
• Full-groomable lightpath
– Output of grooming layer at i to input of grooming layer at j
– Electronic grooming capability at source and destination
– For lightpath (i,j), traffic at node i may be from different origins, and traffic
reaching node j may be forwarded to different destinations

Example Different Routes for 1->2 Request

Free wavelength • Multihop

channels • Single-hop

Established
lightpaths

• Node 0: multihop partial grooming OXC

• Nodes 1 and 2: single-hop grooming OXCs
• Consider request from Node 1 to Node 2

Route for 2->0 Request?