this presentation was just a classwork made from a IEEE journal.

2. Presented to: Dr. Rashid Hussain
Dynamic Traffic Grooming in Elastic
Optical Networks
Project members: Anees Ahmed Awan BETL/H/F10/0102
Abdur Rehman BSTN/H/F10/0101
Imtiaz Ali BSTN/H/F10/0102

3. Contents
Hamdard Institute of information & technology
Abstract Introduction Dynamic Traffic
Grooming
Auxialiary
Graph,Algori
thim,Policies
Illustrative
Numerical
Examples
Spectrum
Reservation
(SR) Scheme

4. Abstract
Hamdard Institute of information & technology

5.  when provisioning new connection in an
elastic optical network, control plane has to
solve two problems.
 The electrical layer routing
 The optical layer routing and spectrum
assignment
 Here in this presentation ,we propose a multi
layer auxiliary graph to solve both these routing
problems.
 We also propose a spectrum reservation
scheme to tackle the bandwidth problem.
Abstract

6. Introduction
Hamdard Institute of information & technology

7. WhatisDynamicTraffic
Grooming?  WDM divides the optical spectrum of a fiber into
separate channels with a spacing of 50 or 100 GHz.
 Optical transponders support fixed rate of typically
10,40,or 100 Gbps.
 This leads to inefficient utilization of resources.
 To handle this situation we use traffic grooming i.e.
effectively increasing the efficiency of traffic utilization.

8. Archetecture of elastic optical
network:-
It uses different technologies like..
 Bandwidth-variable transponders
 ROADMs (reconfigurable optical add-drop
multiplexers)
 WSSs (bandwidth-variable wavelength
selective switches)

9. Dynamic Traffic Grooming
Hamdard Institute of information & technology

10.  In Dynamic Traffic Grooming ,a connection request arrive one at a
time & hold for certain time
A connection request is represented by r(s,d,b)
s= source
d= destination
b=requested bandwidth
Dynamic Traffic Grooming

11. Auxiliary Graph,
Algorithim, Policies
Hamdard Institute of information & technology

12.  Auxiliary graph is constructed each time a
connection request arrive
 The node in the auxiliary graph represent
a node in the physical topology
 There is one electrical layer and three
optical layers as in example in the fig.
 There are three kinds of edges in the
auxiliary graph: lightpath, spectrum &
transponder edges.
Auxiliary Graph

13. 1. When a connection request r(s,d,b) arrives:
2. Construct the auxiliary graph
3. Run Djikstra’s shortest path algorithim
4. If no path is found
5. block the connection request
6. If path contains transponder edges &
spectrum edges then
7. Establish the new lightpath
8. end if
9. If path contains lightpath edges
10. route request along exiting lightpaths
11. end if
12. update network
13. End if
14. When connection termionates
15. Tear down all lightpaths
16. Update network state
General Dynamic Traffic-Grooming
Algorithim

15. Spectrum Reservation
(SR) Scheme
Hamdard Institute of information & technology

16.  Due to large transmission capacity,
a light path carrying small traffic is
under utilized.
 Like in the example in the fig. two
paths carrying different spectrum
width through the same wire.
 We can also reserve spectrum for
high-capacity transponders
Spectrum Reservation
Scheme
Spectrum
Usage Of The
Two Lightpaths

17. Illustrative Numerical
Examples
Hamdard Institute of information & technology