Internati
o
nal
Journal of Ele
c
trical
and Computer
Engineering
(IJE
CE)
V
o
l.
6, N
o
. 2
,
A
p
r
il
201
6, p
p
.
70
0
~
70
7
I
S
SN
: 208
8-8
7
0
8
,
D
O
I
:
10.115
91
/ij
ece.v6
i
2.8
055
7
00
Jo
urn
a
l
h
o
me
pa
ge
: h
ttp
://iaesjo
u
r
na
l.com/
o
n
lin
e/ind
e
x.ph
p
/
IJECE
Novel ROADM modelling with
WSS and OBS to Improve
Routing Performance
in Optical Network
Ka
vi
th
a
G.
R*
, Ind
u
m
a
thi
T
.
S.
**
*
Dept. of
Telecommunication Engin
eer
ing, Dr.
Ambedkar Institute of
Technolo
g
y
, Bang
alor
e, I
ndia
** Dept. of D
i
gital Electronics
and Communication S
y
stem, V.I
.
A.T, V.T.U Muddena Halli,
Chickballapur
District, Ind
i
a
Article Info
A
B
STRAC
T
Article histo
r
y:
Received
May 12, 2015
Rev
i
sed
D
ec 13
, 20
15
Accepte
d Ja
n
3, 2016
The ar
ea of optical n
e
twork is o
n
cons
tant point
of focus among the resear
ch
com
m
unities owing to poten
ti
al
advant
age of lo
ng distanc
e
com
m
unicatio
n
as
well
as
th
e ro
uting is
s
u
es
as
s
o
cia
t
ed wi
th i
t
. M
a
jorit
y
of
the
im
plem
ented
techn
i
ques calls for using expensiv
e hardw
a
re or adoptin
g narrowed
techn
i
ca
l as
s
u
m
p
tions
, for whi
c
h reas
on th
e routing performance couldn’t be
optimized to
a large
exten
t
.
The presen
t manuscript propo
ses a novel
techn
i
que
called
as Optimized Ro
uting fo
r Peak Traffic under
the
scenario
o
f
uncertainties in
the existing traff
i
c s
cenario.
The proposed solution presents
some potential
principle that is
incorporated in the ROADM
design for
enhancing the capabi
liti
es of the propos
ed sy
st
em
. The s
y
stem
is evaluat
e
d
under m
u
ltipl
e
scenar
ios of anal
y
s
is using block
i
ng probabi
lit
ies
,
OSNR, bit
error rat
e
,
ite
rat
i
on et
c. Th
e out
com
e
of the pro
pos
ed s
y
s
t
em
is
com
p
are
d
with th
e on
e of
the ex
isting sign
ifican
t stud
y
to b
e
nchmark it.
Keyword:
B
l
ocki
n
g
Per
f
o
r
m
a
nce
OBS
Optical Net
w
o
r
k
ROADM
WSS
Copyright ©
201
6 Institut
e
o
f
Ad
vanced
Engin
eer
ing and S
c
i
e
nce.
All rights re
se
rve
d
.
Co
rresp
ond
i
ng
Autho
r
:
Kav
ith
a G.R,
Depa
rt
m
e
nt
of
Tel
ecom
m
uni
cat
i
on E
n
gi
nee
r
i
n
g
,
Dr.
Am
b
e
dk
ar In
stitu
te o
f
Tech
no
log
y
B
a
ngal
o
re,
I
n
d
i
a,
Em
a
il: k
a
v
i
g
r
@g
m
a
il.co
m
1.
INTRODUCTION
Opt
i
cal
net
w
or
k i
s
t
h
e a
r
ea
of
com
m
uni
cat
i
on t
h
at
de
pl
oy
s
t
h
e t
r
a
n
sm
i
t
t
e
d si
g
n
al
i
n
t
h
e
f
o
rm
of
l
i
ght
am
ong t
h
e
var
i
ous n
o
d
es i
n
t
h
e t
e
l
ecom
m
u
n
i
cat
i
on n
e
t
w
o
r
k [
1
]
.
Thi
s
i
s
t
h
e
m
o
st
upc
om
i
ng form
of t
h
e
teleco
mm
u
n
i
ca
tio
n
n
e
t
w
ork
t
h
at will fin
d
s its h
i
g
h
e
r techn
i
cal ad
op
t in
n
ear
fu
t
u
re
[2
]
.
W
ith
th
e massiv
e
gr
owt
h
of t
h
e req
u
i
r
em
ent
of c
h
a
nnel
capaci
t
y
wi
t
h
t
h
e g
r
o
w
i
n
g
cust
om
er, Wavel
e
ngt
h
Di
vi
si
o
n
Mu
ltip
lex
i
ng
(WDM
) tech
nolo
g
y
is b
e
ing
freq
u
e
n
tly ad
op
ted
to
cro
s
s-co
un
ter th
is ch
allen
g
e
. Th
e
o
p
tical
net
w
or
k i
s
req
u
i
r
e
d
t
o
be hi
ghl
y
fl
exi
b
l
e
, sust
ai
na
bl
e, as
wel
l
as cont
r
o
l
l
a
bl
e [3]
.
He
nce, m
a
jori
t
y
of t
h
e
research
atte
mp
ts are in
th
e
d
i
rec
tion
of mitig
atin
g
th
e issu
es of op
tical n
e
twork
p
e
rtain
i
n
g
t
o
m
a
k
e
th
e
n
e
two
r
k
i
ng
syste
m
m
o
re v
e
rsatile. On
e o
f
the i
m
p
o
r
tan
t
and
h
i
gh
ly d
e
m
a
n
d
i
n
g
fact
o
r
s
of th
e o
p
tical n
e
twork
is to
p
o
sses the cap
ab
ility to
in
stan
tiate an
d p
r
ov
id
es b
e
ttered
conn
ectiv
ity with
h
i
g
h
e
r d
i
m
e
n
s
io
n
a
lity
o
f
the
n
e
two
r
k
su
stai
n
a
n
c
e. Network
in
tero
p
e
rab
i
l
ity as
well
as
scalab
ility
is a
n
o
t
h
e
r sign
ifican
t issu
e in
op
tical
n
e
two
r
k
,
wh
ich
are yet to
be seen
with
st
an
d
a
rd
so
lu
tion
in
research
co
mm
u
n
ity. In th
e design
o
f
op
tical
n
e
two
r
k
,
recon
f
i
g
urab
le
o
p
t
i
cal ad
d
o
r
d
r
o
p
m
u
ltip
lex
e
r (ROADM
) p
l
ays a cru
c
ial ro
le. R
O
ADM
(also
rep
r
ese
n
t
e
d
by
no
de
) i
s
basi
ca
l
l
y
an o
p
t
i
cal
s
u
b
-
sy
st
em
t
h
at
area ca
pabl
e
o
f
sel
ect
i
n
g
(a
ddi
ng
)
or
r
e
m
ovi
n
g
of
a p
a
rticu
l
ar
wav
e
leng
th
p
r
esen
t in
an
op
tical cab
le [4
]. So
me o
f
th
e sign
ifi
can
t
charecte
r
istics of the ROADM
m
o
d
e
l are i) sp
on
tan
e
ou
sly m
o
n
ito
rs po
wer of th
e sign
al
, ii) p
e
rfo
r
m
s
eq
u
a
lization
of p
o
wer, and
iii) h
i
gh
er
degree
of s
u
pporta
b
ility of all data
rates, m
odulation
form
ats,
as well
as prot
ocols.
T
h
is pape
r disc
usse
s
about
a n
ovel
a
p
pr
oa
ch t
h
at
uses t
h
e refi
ned
ve
rsi
o
n
o
f
t
h
e
R
O
A
D
M
m
odel
.
Th
e eval
uat
i
o
n
of
t
h
e st
u
d
y
has
been
per
f
o
r
m
e
d usi
ng
WSS a
n
d OB
S. T
h
e p
r
o
pos
ed st
u
d
y
h
a
s consi
d
ere
d
som
e
of t
h
e cri
t
i
cal
const
r
ai
nt
s an
d
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
6, No
. 2, A
p
ri
l
20
16
:
70
0 – 7
0
7
70
1
consideration
for ens
u
ring that prop
o
s
ed
st
udy
can e
n
s
u
re
pea
k
t
r
af
fi
c consi
d
erat
i
o
n. T
h
e di
sc
uss
i
on
o
f
i
n
t
r
o
d
u
ct
i
on i
n
Sect
i
on 1 i
s
f
o
l
l
o
we
d by
Se
ct
i
on 1.
1 t
h
at
hi
g
h
l
i
ght
s a
b
o
u
t
back
g
r
o
u
n
d
of st
u
d
y
fol
l
o
wed
b
y
pr
o
b
l
e
m
di
scu
ssi
on i
n
Sect
i
on
1.
2. Sect
i
o
n 1
.
3 i
n
t
r
o
d
u
c
e
s t
h
e pr
o
p
o
s
ed m
odel
fol
l
o
we
d
by
el
aborat
e
d
di
scussi
o
n
o
f
r
e
search
m
e
t
hodol
ogy
i
n
Sect
i
on
2.
Sect
i
o
n
3
di
scusse
s ab
out
t
h
e R
e
s
u
l
t
and
di
sc
ussi
o
n
bei
n
g
accom
p
lished
from
the study along
w
ith perform
a
nce
com
p
ara
tive analysis that is furthe
r followed
by
concl
u
si
o
n
i
n
Sect
i
on 4.
1.
1. B
a
ck
gr
ou
nd
There a
r
e subs
tantial am
ount of literatures that has
been i
n
troduce
d
in the
last decade for enhanci
ng
t
h
e net
w
or
k
p
e
rf
orm
a
nce of
opt
i
cal
net
w
o
r
k
.
C
h
a
u
et
al
. [5]
ha
ve
pre
s
ent
e
d a m
a
t
h
em
at
i
cal
m
odel
for
hi
erarc
h
i
cal
o
p
t
i
cal
pat
h
net
w
or
ks f
o
c
u
si
n
g
on
pr
o
b
l
e
m
of wave
ba
nd a
d
d/
d
r
o
p
rat
i
o
c
o
nst
r
ai
nt
.
Gi
anl
u
i
g
i
et
al. [6
] h
a
v
e
used
n
e
t
w
ork
g
l
ob
al ex
p
ectatio
n
m
o
d
e
l for en
han
c
i
n
g
scalab
ility an
al
ysis o
f
W
SS
b
a
sed
ROADMs. Roy et al. [7
] h
a
v
e
u
s
ed
Dig
ital Gro
o
m
in
g
fo
r
An
alyzing
th
e
Mu
ltilayer switch
i
n
g
. Karam
i
tso
s
et
al. [8] ha
ve
us
ed LMS algori
thm
for Res
ource Rese
rv
ation
Mech
an
ism
for
OBS.
Usa
g
e of
Mach-Z
ehnde
r
in
terfero
m
e
ters was seen
in
work
o
f
Miller et al. [9
]. Lu
o
et al. [10
]
h
a
v
e
used
M
a
rkov
ch
ain
fo
r th
e
d
i
stribu
tio
n focu
sing
on
issues of Blo
c
k
i
ng Prob
ab
ility
o
f
Mu
ltifib
er
WDM op
tical n
e
twork
s
.
Gang
aya et al.
[11
]
h
a
v
e
u
s
ed
Bernou
lli an
d
Po
isson
Sp
li
ttin
g
Mo
d
e
l fo
r enh
a
n
c
ing
Blo
c
k
i
ng
probab
ility b
a
sed
o
n
th
e
Net
w
or
k a
n
d
Phy
s
i
cal
Lay
e
r
.
C
h
u et
al
. [
1
2]
ha
ve
use
d
i
)
Pas
s
i
v
e
rer
o
ut
i
n
g
wi
t
h
f
u
l
l
wa
vel
e
n
g
t
h
a
n
d
i
i
)
Passi
ve rer
o
ut
i
ng wi
t
h
out
w
a
vel
e
n
g
t
h
f
o
r im
pro
v
i
n
g
t
h
e
bl
oc
ki
n
g
pe
rf
orm
a
nce
i
n
Li
ght
pat
h
rer
o
ut
i
n
g
i
n
opt
i
cal
WDM
net
w
or
ks. B
a
hl
eda et
al
.
[1
3]
ha
ve u
s
e
d
B
a
r
r
y
an
d
Hum
b
l
e
t
for
enha
nci
n
g B
l
ocki
ng
p
r
ob
ab
ility. An
sari et al. [14] h
a
v
e
u
s
ed
ran
d
o
m
wav
e
leng
th
assign
m
e
n
t
and
fi
rst fit al
g
o
rith
m
wh
ile
J.Jeno
Jasm
i
n
e et
al
. [
15]
ha
ve
used
feed
bac
k
r
o
ut
i
n
g
al
g
o
ri
t
h
m
.
Zha
n
g
et
al
.
[1
6]
ha
ve
use
d
D
i
jkst
ra
’s al
go
ri
t
h
m
t
o
st
udy
t
h
e
pr
o
b
l
em
of Sem
i
-l
ight
pat
h
i
n
a w
a
vel
e
n
g
t
h
ro
ut
ed o
p
t
i
cal
net
w
o
r
k
s
. L
u
et
a
l
. [1
7]
ha
ve
us
ed D
I
R
an
d
SIR for
st
u
d
y
ing
b
l
o
c
k
i
n
g
prob
ab
ility.
Howev
e
r,
clos
er loo
k
s in
to
th
e wo
rk
are
fo
und
with
fo
llo
wi
ng
issues i.e. i) Less consi
d
erati
on
of the real-tim
e
cons
train
t
s in
o
p
tical n
e
twork, ii) Rely
in
g
on
conv
entio
n
a
l
ROADM with sig
n
i
fican
t issu
es of op
ti
m
i
zatio
n
still
u
n
a
d
d
ressed
,
iii) Usag
e of exp
e
nsiv
e h
a
rdware or
pr
o
p
ri
et
ary
t
o
ol
s posi
n
g a nat
u
ral
l
i
m
i
t
a
ti
on o
f
nar
r
o
w
e
d eval
uat
i
o
n,
i
v
) No co
nsi
d
erat
i
o
n o
f
re
al
-t
im
e
unce
r
t
a
i
n
t
y
i
n
t
r
affi
c
be
havi
o
u
r
bee
n
e
v
e
n
c
onsi
d
ere
d
or at
te
m
p
ted
to
m
o
d
e
l,
v
)
No
sign
ifican
t
or ex
ten
d
e
d
m
o
d
e
llin
g
techn
i
qu
e to
en
su
re op
ti
m
a
l ro
u
tin
g in
p
eak traffic con
d
ition
,
vi) Traffic
b
a
sed
m
o
d
e
llin
g
b
a
sed
on
OSNR, ROADM,
WSS, and
p
r
o
b
a
b
ility t
h
eory was n
e
ve
r attem
p
ted
before.
Hen
ce,
th
e propo
sed
syste
m
h
a
v
e
id
en
tif
ied th
ese
r
e
sear
ch
g
a
ps an
d pr
oposed
a m
o
d
e
l f
o
r
ad
dr
essing
t
h
e sam
e
.
1.
2. Pro
b
lem
I
d
entific
a
ti
on
Th
e i
d
en
tified
p
r
ob
lem
s
of the study are:
Less c
onsi
d
era
tion
of the
real
-tim
e
const
r
ai
n
t
s i
n
opt
i
cal
net
w
o
r
k
.
Relyin
g
on
conv
en
tion
a
l R
O
ADM with sign
i
f
ican
t issu
es
o
f
op
ti
m
i
zatio
n
still u
n
a
dd
ressed
.
Usag
e
of e
x
pe
nsi
v
e
ha
rd
wa
re
o
r
pr
op
ri
et
ary
t
ool
s
p
o
si
n
g
a
nat
u
ral
l
i
m
i
t
a
tion
o
f
nar
r
o
we
d
eval
uat
i
on
.
No
c
o
n
s
i
d
e
r
at
i
on of real
-t
i
m
e
unce
r
tain
ty in
traffic b
e
h
a
v
i
ou
r
b
een
even
con
s
id
ered o
r
attem
p
ted
to
m
odel
.
No sign
ifican
t
o
r
ex
ten
d
e
d
m
o
d
e
lling
tech
n
i
q
u
e
to
en
su
re op
ti
m
a
l ro
u
ting
in
p
e
ak
t
r
affic
co
nd
itio
n.
Traffic b
a
sed
m
o
d
e
llin
g
b
a
sed
on
OSNR
,
ROADM,
WS
S, and
pro
b
a
b
i
lity
th
eo
ry was n
e
v
e
r attem
p
t
e
d
bef
o
re
.
1.
3. Pro
p
ose
d
Sol
u
ti
on
Our in
itial stud
y [1
8
]
h
a
s rev
i
ewed
v
a
rious scien
tif
ic app
r
o
a
ch
es d
i
scussed
b
y
prio
r
au
tho
r
s. Th
e
m
a
t
h
em
at
i
c
al
app
r
oach
of
o
u
r
pri
o
r EC
O
N
m
odel
[1
9]
has p
r
ove
d t
h
a
t
i
t
i
s
possi
bl
e t
o
re-
d
efi
n
e R
O
A
D
M
and e
nha
nce t
h
e t
h
ro
u
g
h
p
u
t
o
f
t
h
e net
w
o
r
ki
ng sy
st
em
i
nvol
ve
d i
n
R
O
A
D
M
.
H
o
we
ve
r,
t
h
e st
udy
carr
i
ed out
by
Pan et
al
. [20]
d
o
es
n’t
ha
ve any
co
nsi
d
e
r
at
i
on o
f
R
O
A
D
M
m
odul
e,
whi
c
h was t
h
e
m
a
i
n
di
st
i
n
ct
i
on fact
o
r
wi
t
h
EC
O
N
m
odel
t
h
at
has use
d
a si
m
p
l
i
s
t
i
c
desi
gn
o
f
R
O
ADM
t
o
enha
nce t
h
e
OS
NR
. It
was
m
o
re
im
port
a
nt
t
h
at
desi
g
n
o
f
R
O
A
D
M
m
odul
e t
o
be t
e
st
ed
m
o
re effect
i
v
el
y
usi
n
g
m
o
re st
and
a
r
d
t
e
c
hni
cal
param
e
t
e
rs for
un
derst
a
ndi
ng
t
h
e opt
i
m
al
perf
orm
a
nces of
opt
i
cal
net
w
or
k. T
h
e archi
t
e
c
t
ure o
f
t
h
e p
r
o
p
so
e
d
sy
st
em
i
s
as sh
ow
n i
n
Fi
gu
re
1.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
No
vel ROADM mo
d
e
lling
with
WSS
a
n
d
OBS
to Imp
r
o
v
e Ro
u
ting
Perfo
r
ma
n
c
e in
…
(
K
a
v
i
t
ha G.R)
70
2
Fi
gu
re
1.
Pr
o
p
o
se
d St
udy
Ar
chi
t
ect
ure
2.
RESEARCH METHO
D
OL
OGY
Th
e pro
p
o
s
ed
stu
d
y
of ORPT (Figu
r
e
1
)
is based
on
th
e
p
o
t
en
tial
m
u
ltip
le
x
i
ng
cap
ab
iliti
es o
f
WDM
as wel
l
as r
o
u
t
i
ng
based
o
n
wavel
e
ngt
hs i
n
m
i
ti
gat
i
ng t
h
e
peak t
r
af
fi
c i
ssues i
n
o
p
t
i
cal
net
w
or
k.
F
o
r t
h
e
pu
r
pose
of des
i
gni
n
g
a bet
t
e
r
com
m
uni
cati
on sy
st
em
consi
d
eri
n
g t
h
e co
nst
r
ai
nt
o
f
m
o
del
l
i
ng t
h
e dy
nam
i
c
user
be
ha
vi
o
u
r
,
t
h
e l
i
g
ht
pat
h
t
h
at
carri
es a
s
i
ngl
e
wave
leng
th
h
a
s t
o
b
e
estab
lish
e
d b
e
t
w
een th
e tran
smit
tin
g
as
w
e
ll
as r
e
ceiv
in
g
n
o
d
e
in o
p
tical n
e
tw
or
k. Th
e pr
oposed
stud
y co
nsist o
f
tw
o
w
a
v
e
leng
th
assign
m
e
n
t
p
o
licy e.g
.
i)
Arb
itra
r
y
:
sel
ect
i
on
of
wa
vel
e
n
g
t
h
base
d o
n
a
r
bi
t
r
a
r
y
sel
ect
i
on
o
f
avai
l
a
bl
e
wavel
e
ngt
h a
nd i
i
)
Best Value
:
sel
ect
i
on o
f
best
wavel
e
ngt
h fr
o
m
t
h
e avai
l
a
bl
e wavel
e
n
g
t
h
f
o
r
per
f
o
r
m
i
ng com
m
uni
cat
i
on. T
h
e
pr
o
pose
d
sy
st
e
m
consi
d
ers
de
si
gni
ng
R
O
AD
M
base
d
on
f
o
l
l
owi
n
g
p
r
i
n
ci
pl
es:
1.
Each a
d
d o
r
dr
op
p
o
rt
s
o
f
R
O
ADM
n
ode
sh
oul
d
not
be s
p
eci
fi
c t
o
a
n
y
w
a
vel
e
n
g
t
h
sel
ect
i
on.
The
st
u
d
y
co
nsid
ers th
at
ad
d
i
n
g
or
d
r
opp
ing
o
f
an
y
w
a
v
e
leng
th
subj
ected
at an
y po
rts o
f
ROA
D
M
.
2.
The ad
d
or
dr
op
p
o
rt
s o
f
an
y
no
de sh
o
u
l
d
not
be speci
fi
c
for a
n
y
de
gre
e
. The st
u
d
y
c
onsi
d
er
s t
h
at
any
chan
nel
s
t
o
be
ad
de
d
on
a
p
o
r
t
can
be act
ua
l
l
y
di
rect
ed t
o
out
goi
ng
no
de
de
gree
a
n
d
an
y
cha
nnel
t
o
b
e
dr
o
ppe
d
o
n
a
p
o
rt
ca
n
be
di
re
ct
ed t
o
i
n
g
o
i
n
g
n
ode
de
g
r
ee.
3.
H
i
gh
er pro
b
a
bilit
y o
f
cro
s
s
co
nn
ection
w
i
th
in
t
h
e
n
o
d
e
b
e
t
w
een node d
e
g
r
ees
(both
in
co
m
i
n
g
&
out
goi
ng
) a
n
d
add
o
r
dr
o
p
po
rt
s i
n
R
O
ADM
.
The proposed
ORPT
considers designing a
triple
degre
e
of ROADM node
arc
h
itecture t
h
at i
s
subjecte
d
to c
o
lor and di
rections at
each a
dd/
drop ports.
For t
h
is purpos
e, we select the desi
gn
of a
rraye
d
wav
e
gu
id
e gratin
g
as a
m
u
lt
ip
lex
e
r fo
r
fine tu
n
i
ng
th
e cap
ab
ilities o
f
ROADM. Th
e p
r
opo
sed
ROADM
m
odul
e, exhi
bi
t
e
d i
n
Fi
gu
re
2, i
s
basi
cal
l
y
hi
g
h
l
y
enha
nc
ed ve
rsi
o
n fr
o
m
our p
r
evi
o
u
s
R
O
A
D
M
m
odel
i
n
ECON
[19]. T
h
e evolution of the pr
oposed ROADM m
o
del is- Initially,
th
e wavele
ngth selective swi
t
ching
substitutes the
arrayed wa
ve
gui
de grating
on t
h
e
drop
po
rt,
while the
couple c
o
m
ponent is s
u
bstitutes the
arrayed
wav
e
gu
id
e grating
on
th
e add
po
rt for sup
portab
ility o
f
1
st
pri
n
ci
pl
e of R
O
AD
M
desi
gn
. Ho
weve
r
,
b
y
do
ing th
is, th
e R
O
ADM
m
o
d
e
l do
esn’t g
u
a
ran
t
ee to co
m
p
ly with 2
nd
and
3
rd
principle. In t
h
e final
t
h
o
u
g
h
t
s
of
de
si
gn
p
h
ase, t
h
e
st
udy
c
h
ose t
o
i
n
c
o
r
p
orat
e
a n
u
m
b
er of
a
dd
o
r
dr
op
p
o
r
t
s t
h
at
are
uni
versal
l
y
share
d
by
al
l
t
h
e n
odal
de
gree
s.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
6, No
. 2, A
p
ri
l
20
16
:
70
0 – 7
0
7
70
3
Fi
gu
re
2.
Pr
o
p
o
se
d R
O
A
D
M
m
odul
e
Fi
gu
re 2 e
x
hi
b
i
t
s
t
h
e enha
nce
d
R
O
ADM
m
odel
desi
g
n
e
d
o
n
t
h
e EC
O
N
f
r
a
m
e
wor
k
[
1
9]
. The desi
g
n
pri
n
ci
pl
e
of t
h
e
ab
ove
m
e
nt
i
oned
p
r
op
ose
d
R
O
A
D
M
m
o
d
u
l
e
i
s
i
n
c
o
r
p
or
at
ed wi
t
h
f
o
l
l
o
wi
n
g
c
h
arect
e
r
i
s
t
i
c
s:
Th
e system
will n
o
t
con
s
id
er
an
y add
/
d
r
o
p
po
rt
for t
h
e R
O
ADM
m
o
d
e
l to
b
e
p
a
rticu
l
ar
for an
y selection
of
wa
vel
e
n
g
t
h
.
It
ca
n
be a
ppl
i
cabl
e
f
o
r
al
l
t
h
e ge
neral
p
o
rt
s
avai
l
a
bl
e i
n
R
O
A
D
M
m
odel
.
Th
e system w
i
ll n
o
t
co
n
s
ider
an
y p
a
r
ticu
l
ar
d
e
gr
ee fo
r
an
y
ad
d
/
d
r
op
po
r
t
s o
f
ROAD
M
mo
d
e
l. Th
e study
fu
rt
he
r ens
u
res
t
h
at
added c
h
annel
s
ca
n be
ro
ut
ed t
o
t
h
e
o
u
t
g
oi
n
g
cha
n
n
e
l
s
whi
l
e
dr
op
ped c
h
an
nel
s
c
a
n
be
ro
ut
ed
t
o
t
h
e i
n
com
i
ng c
h
a
nnel
s
.
Th
e system co
n
s
id
ers h
i
g
h
e
r feasib
ility o
f
th
e cro
ss co
n
n
ectio
n
with
in
the ro
u
t
ed
ch
annels an
d
no
de in
th
e ROADM
m
o
d
e
l.
The
pr
op
ose
d
R
O
A
D
M
m
odel
uses t
h
e P
o
i
sso
n i
n
t
e
r
-
ar
ri
val
co
ncept
fo
r n
o
rm
al
i
z
i
ng t
h
e i
n
c
o
m
i
ng
traffic t
h
at is mathem
atically represe
n
ted as,
0
)
(
0
.
)
(
!
!
.
!
)
(
p
p
i
i
i
m
i
i
k
p
L
L
l
D
A
l
(
1
)
Th
e
v
a
riab
les
o
f
eq(1) are lik
elih
ood
l
λ
on
th
e
λ
wavele
ngths t
h
at are
deployed on t
h
e
i
th
l
i
nk, t
h
e
hol
di
n
g
t
i
m
e l
λ
Th
e system
th
en
co
nsid
ers the prob
ab
ility o
f
d
i
stribu
ted
li
n
k
s
o
f
op
tical ch
ann
e
l
for all
o
cated
wavel
e
ngt
hs at
l
i
nks
p
and
q
t
o
b
e
m
u
tu
ally in
d
e
p
e
n
d
e
n
t
t
h
at is m
a
th
e
m
atic
ally rep
r
esen
ted
as,
q
q
p
p
n
n
n
n
P
)
(
(
2
)
The above eq.(2) c
o
nsiders
n
p
and
n
q
are th
e
q
u
a
n
tity o
f
freely av
ailab
l
e wav
e
leng
th
o
n
ho
p
p
a
nd
q
.
η
is th
e am
o
unt o
f
th
e wav
e
len
g
t
h
i
n
o
n
e
o
p
tical fib
r
e. Th
e system
th
en
ap
p
lies t
h
e
p
r
ovisio
n
a
l co
nd
itio
n of
p
r
ob
ab
ility
for ev
alu
a
ting
t
h
e d
i
stribu
tio
n
of b
u
s
y wav
e
length
s
o
v
e
r
th
e
two
h
o
p
s
ch
ann
e
l
as:
00
)
2
(
)
1
(
)
2
(
.
)
,
|
(
ij
j
i
l
l
j
i
P
m
(
3
)
The ne
xt
p
h
as
e of t
h
e st
u
d
y
i
s
focu
sed
on i
m
pl
em
ent
i
ng o
u
r
pr
op
ose
d
q
u
eui
ng
net
w
or
k m
odel
for
opt
i
m
i
z
i
ng bot
h i
n
com
i
ng an
d o
u
t
g
oi
n
g
t
r
a
ffi
c usi
ng C
T
M
P
(C
o
n
t
i
n
u
o
u
s Ti
m
e
M
A
R
K
O
V
Pr
ocess
)
[1
2]
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
No
vel ROADM mo
d
e
lling
with
WSS
a
n
d
OBS
to Imp
r
o
v
e Ro
u
ting
Perfo
r
ma
n
c
e in
…
(
K
a
v
i
t
ha G.R)
70
4
Hen
c
e, ap
p
l
ying
th
e CTMP prin
cip
l
e (M/M/c),
we
exp
l
ore t
h
e pro
b
a
b
ility o
f
i
d
le wav
e
len
g
t
h
s
(
λ
idle
) available
on
t
h
e i
th
ho
p
as:
)
0
(
.
)
(
)...
2
(
).
1
(
)
1
)...(
1
(
)
(
i
idle
i
i
i
idle
idle
i
m
n
n
n
m
(
4
)
In t
h
e ab
o
v
e e
q
.
(4
), t
h
e val
u
e of i
d
l
e
wa
vel
e
ngt
hs (
λ
idle
) is
considered t
o
be 1,
2,…
.
n
, where
n is the
h
i
gh
est nu
m
b
er
of
th
e av
ail
a
b
l
e w
a
v
e
length
in
o
n
e
ho
p (
n
ϵη
). Also
, th
e
prob
ab
ility
v
a
lu
e of
m
i
(0
)
i
s
com
puted as
,
1
1
]
)
(
)...
2
(
).
1
(
)
1
)...(
1
(
1
[
)
0
(
idle
i
i
i
idle
n
i
n
n
n
m
idle
(
5
)
The proposed syste
m
ther
efore form
ulates
an algorithm
for ch
ec
ki
n
g
t
h
e com
put
at
i
o
n
o
f
bl
oc
ki
n
g
p
r
ob
ab
ility o
f
th
e propo
sed syste
m
. Th
e traffic m
o
d
e
l o
f
t
h
e proposed
system
c
o
n
s
i
d
ers th
e si
m
p
lex
co
nn
ectiv
ity fo
r estab
lish
i
ng lig
h
t
p
a
t
h
b
e
tween th
e
n
u
m
ber
of s
o
urces
and de
stination base
d
on the call
arrival
rate. T
h
e algorithm
choos
es t
o
assi
gn wa
velength
ran
d
o
m
ly after co
m
p
u
tin
g th
e
bu
sy an
d free
ho
p
s
in
the availa
ble c
h
annel.
3.
RESULT ANALYSIS
The
outcom
e of the
propose
d
syste
m
ORPT
is com
p
ar
ed with the Bat
hula
et
al.
[21]. Ba
thula et al
.
[2
1]
ha
s at
t
e
m
p
t
e
d
t
o
e
n
hanc
e t
h
e
pe
rf
orm
a
nce
of
o
p
t
i
cal
net
w
or
k
fr
om
Qo
S
vi
ew
poi
nt
usi
n
g
OB
S
ne
t
w
o
r
k
for th
e pu
rpo
s
e o
f
m
i
n
i
mizi
n
g
th
e m
u
lti-co
n
s
t
r
ain
t
m
a
n
y
cast issu
es i
n
op
tical n
e
twork. Th
e stud
y h
a
s
form
u
l
ated
an
alg
o
rith
m
mai
n
ly u
s
ing
sh
ortest p
a
th
tree to so
lv
e it con
s
i
d
eri
n
g
BER,
OSNR, an
d
d
e
lay. Th
e
aut
h
ors
h
a
ve
s
t
udi
ed
t
h
e
o
u
t
c
om
e usi
n
g
t
w
o
pe
rf
orm
a
nce
param
e
t
e
rs e.g
.
i
)
N
o
.
o
f
Ad
d/
D
r
o
p
Po
rt
s
Deg
r
ee
an
d ii) BER.
Th
e
o
u
t
co
m
e
o
f
th
e stud
y is illustrated
b
e
low:
Fi
gu
re
3.
N
o
.
o
f
A
d
d/
D
r
o
p
Po
rt
De
gree
v
s
It
erat
i
o
n
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
6, No
. 2, A
p
ri
l
20
16
:
70
0 – 7
0
7
70
5
Fig
u
re
4
.
An
al
ysis o
f
Bit Error Rate Vs
OSNR
C
onsi
d
eri
ng si
m
i
l
a
r st
udy
pa
ram
e
t
e
rs, t
h
e out
c
o
m
e
i
s
eval
uat
e
d. T
h
e
r
e
sul
t
ex
hi
bi
t
s
t
h
e ave
r
age
bl
oc
ki
n
g
per
f
o
r
m
a
nce
of b
o
t
h
t
h
e sy
st
em
co
nsid
eri
n
g two serv
ice thresho
l
ds i.e.
θ
1
(
σ
th
=4.25,
γ
th
=0
.9
,
τ
th
=1
0n
s) an
d
θ
2
(
σ
th
=4
.2
5,
γ
th
=0.8,
τ
th
=
1
0ns
)
re
spectively,
whe
r
e
σ
th
re
pr
esent
s
noi
se
fa
ct
ors,
γ
th
re
pre
s
ents
reliab
ility fact
o
r
, and
τ
th
re
pr
esent
s
p
r
opa
ga
t
i
on del
a
y
.
R
e
t
a
i
n
i
ng
si
m
i
l
a
r
val
u
es
fo
r n
o
i
s
e and
del
a
y
fac
t
or, t
h
e
o
u
t
co
m
e
ex
h
i
bited
in
Figu
re
2
and
Fi
g
u
re
3 shows t
h
at
wi
th
th
e d
e
crease of t
h
e
reliab
ility facto
r
fro
m
0
.
9
t
o
0.
8
have
n
o
i
m
pact
s
on t
h
e
pr
op
ose
d
sy
st
em
as com
p
ared
t
o
B
a
t
hul
a et
al
.
[2
1]
ap
pr
oac
h
.
In
fact
t
h
e
p
r
o
pos
ed
syste
m
h
a
s n
e
g
a
tiv
e b
l
o
c
k
i
ng
prob
ab
ility
ti
ll 0
.
1
5
l
o
ad
s
i
n
Erlang
. Th
e
p
r
im
e reaso
n
beh
i
nd
th
is ou
tco
m
e
is
t
h
at
B
a
t
hul
a et
al
. [
21]
a
p
p
r
oa
ch
has a
d
opt
e
d
g
r
ap
h-
base
d t
e
chni
que
t
h
at
d
o
es
n’t
e
ffect
i
v
el
y
add
r
ess t
h
e
del
a
y
co
nstrain
t
of th
e bu
rst.
Hen
c
e,
m
i
n
i
m
i
za
tio
n
o
f
reliab
ility
co
n
s
trai
n
t
was fou
n
d
w
ith
increase in
av
erag
e call
bl
oc
ki
n
g
.
H
o
w
e
ver
,
t
h
e
pr
op
ose
d
sy
st
em
i
n
t
r
o
duce
d
e
n
ha
nced
R
O
A
D
M
m
odel
usi
n
g
wavel
e
ngt
h sel
ect
i
v
e
switch
i
ng
and can
m
itig
ate
th
e d
e
lay as
well as reliab
i
lity
co
n
s
train
t
to
a g
r
eater
ex
ten
t
. Hen
ce, o
p
tim
al
o
u
t
co
m
e
o
f
av
erag
e
requ
est
b
l
o
c
k
i
ng
p
r
ob
ab
ility is re
co
rd
ed
fo
r prop
o
s
ed
stud
y.
Fig
u
re
4
ex
h
i
b
its th
e
bl
oc
ki
n
g
pe
rf
o
r
m
a
nce for 7/
4
m
a
ny
cast
confi
g
urat
i
o
n u
n
d
e
r sim
i
l
a
r servi
ce t
h
resh
ol
d
θ
1
(
σ
th
=4.25,
γ
th
=0
.9,
τ
th
=1
0n
s).
It can
b
e
seen
th
at with
th
e in
crease in
the
service re
quest, t
h
ere is
al
so a
n
increase
in a
v
erage
requ
est
b
l
o
c
k
i
n
g
on bo
th th
e
syste
m
. Co
n
s
i
d
ering
th
e limits
of
p
r
ob
ab
ility, it was seen
that Bath
u
l
a et
al. [21
]
approach was seen with
e
x
p
o
n
ent
i
a
l
i
n
c
r
eas
e i
n
bl
ocki
ng
a
s
com
p
ared t
o
pr
o
pose
d
OR
P
T
schem
e
. The
pri
m
e
reaso
n
be
hi
n
d
t
h
i
s
o
u
t
c
om
e i
s
t
h
at
B
a
t
h
ul
a
et
al
.
[2
1]
h
a
s at
t
e
m
p
t
e
d t
o
m
i
nim
i
ze t
h
e Q
o
S
bl
ocki
ng
usi
n
g
sho
r
t
e
st
pat
h
t
r
ee. U
n
f
o
rt
unat
e
l
y
, t
h
e t
echni
que
gi
ves
ri
se t
o
ran
d
o
m
cont
ent
i
on
on eac
h o
p
t
i
cal
pat
h
i
n
case
of a
n
y
o
n
e
of
t
h
e dest
i
n
at
i
o
n
no
de i
s
un
rea
c
habl
e.
It
al
so
has a
dve
rse e
f
fect
o
n
t
h
e e
n
t
i
re m
a
ny
cast
reque
st
t
oo.
H
o
weve
r,
i
n
t
h
e
p
r
o
p
o
se
d sy
st
em
, i
t
adopt
s
OB
S
m
e
chani
s
m
i
n
di
f
f
e
r
ent
way
Evaluation Warning : The document was created with Spire.PDF for Python.
I
J
ECE
I
S
SN
:
208
8-8
7
0
8
No
vel ROADM mo
d
e
lling
with
WSS
a
n
d
OBS
to Imp
r
o
v
e Ro
u
ting
Perfo
r
ma
n
c
e in
…
(
K
a
v
i
t
ha G.R)
70
6
Fig
u
re
5
.
An
al
ysis o
f
Bl
o
c
k
i
ng
Prob
ab
ility Vs
OSNR
Whi
l
e
B
a
t
h
ul
a
et
al
. [
21]
ha
ve
det
e
rm
i
n
i
s
t
i
cal
l
y
used
OB
S;
pr
o
p
o
s
ed
t
echni
que
u
s
es a
co
ncept
o
f
OBS on
d
e
man
d
. Th
e concep
t en
su
res th
at th
e su
b-wav
e
leng
th
gran
u
l
arity is h
i
g
h
l
y p
r
ov
isioned
for
al
l
o
cat
i
ng t
h
e
si
gni
fi
e
d
wa
ve
l
e
ngt
h i
n
t
o
t
h
e
bu
rst
.
He
nce,
bet
t
e
r pr
ocess
i
ng o
f
co
nt
r
o
l
packet
s as w
e
l
l
as
reser
v
i
n
g res
o
urces
fo
r f
o
r
w
ardi
ng t
h
e
bu
r
s
t
and co
nt
r
o
l
m
e
ssage can be ensured. Thi
s
is th
e so
le reason
of
enha
nce
d
bl
oc
ki
n
g
pe
rf
orm
a
nce o
f
t
h
e
pr
o
p
o
se
d st
u
d
y
.
He
nce, i
t
can
be s
a
i
d
t
h
at
p
r
o
p
o
s
e
d st
u
d
y
i
n
t
r
od
uces a
co
st-effectiv
e, si
m
p
le,
and
rob
u
s
t
ro
u
ting
perfo
r
m
a
n
ce
that can
m
o
d
e
l t
h
e
p
eak traffic con
d
ition
o
f
o
p
tical
net
w
or
k a
n
d e
n
su
re
bet
t
e
r
da
t
a
del
i
v
ery
am
on
g t
h
e
no
des
even
i
n
a
d
vers
e t
r
af
fi
c co
n
d
i
t
i
on.
4.
CO
NCL
USI
O
N
The
pr
o
pose
d
sy
st
em
i
s
an ext
e
nsi
on
o
f
t
h
e
EC
O
N
m
odel
t
h
at
was
di
sc
u
ssed i
n
o
u
r
pre
v
i
o
us
wo
r
k
.
Th
e
ECON mo
d
e
l
was m
a
in
ly a m
a
th
e
m
atical approach t
o
e
n
hance
th
e O
S
N
R
w
h
er
eas
th
e pr
opo
sed
m
o
d
e
l
OR
PT
di
sc
uss
e
d i
n
t
h
i
s
pa
pe
r
ho
we
ver i
n
c
o
r
p
orat
es a
n
o
v
el
de
si
g
n
of
R
O
A
D
M
,
WS
S, as
wel
l
as
q
u
eui
n
g
net
w
or
k m
odel
t
o
en
hance t
h
e
net
w
or
k pe
rf
o
r
m
a
nce i
n
t
e
r
m
s of
ro
ut
i
n
g be
havi
ou
r i
n
opt
i
cal
net
w
o
r
k. T
e
st
ed
with
m
a
ssiv
e
m
u
l
t
i
m
ed
ia fil
e
s, th
e propo
sed
system is si
m
u
la
ted
u
n
d
e
r v
a
riou
s en
v
i
ro
n
m
en
ts to
see th
at it
p
e
rform
s
o
p
timal ro
u
tin
g
an
d
h
a
v
e
th
e cap
a
b
ility o
f
mitig
atin
g
th
e un
certain
traffic b
e
h
a
v
i
ou
r i
n
o
p
tical
net
w
or
k.
It
i
s
k
n
o
w
n t
h
at
o
p
t
i
cal
net
w
o
r
ki
n
g
i
s
an u
p
com
i
ng t
o
pi
c of
rese
arch a
n
d i
n
cl
u
d
es va
ri
o
u
s
har
d
wa
re
com
pone
nt
s t
o
m
a
ke i
t
oper
a
t
i
onal
.
O
u
r s
t
udy
ha
s at
t
e
m
p
t
e
d t
o
i
n
t
r
od
uce a c
o
m
put
at
i
onal
m
e
t
hod
of
o
p
tim
izin
g
th
e
rou
ting
p
e
rforman
ce in
p
e
ak
traffic con
d
ition
in op
tical n
e
t
w
ork.
REFERE
NC
ES
[1]
J.
M.
Simmons,
“
O
ptic
al Ne
twork
Design and
Plan
ning”,
Springer-
Technology &
E
ngineering
, 529
pages, 2014
.
[2]
C. Kachr
i
s, K. B
e
rgman, I
.
Tomk
os,
“Optical Interconnects for Fu
ture Data
C
e
nter
Networks”,
Springer Science &
Business Media, Comput
ers, 188
pages, 2012
.
[3]
P.V. Blanc, S. Figuerola, X. Chen,
“Bringing
Optical Network
s
to the Cloud:
An Architectu
r
e for a Sustainab
l
e
Future Internet”,
Springer- uture
Internet Assembly
,
LNCS 6656, p
p
. 307–320
, 201
1.
[4]
J
.
Z
y
s
k
ind, A.
S
r
ivas
tava
, “
O
ptic
all
y
Am
plifi
e
d W
D
M
Networks
: P
r
incipl
es
and P
r
act
ic
es
”,
Academ
ic P
r
es
s
,
Techno
log
y
& Engineer
ing -
512
pages, 2011
.
[5]
L.
H.
Chau,
H.
Hasegawa,
K.
Sato,
“H
ierar
c
hic
a
l
Optical Pa
th Network
Design Algorithm Considering Waveb
a
nd
Add/Drop Ratio
Constraint”,
IEEE-Proceedings o
f
COIN
, 2008
.
[6]
G. Notam
i
cola
, G. Rizze
lli
, G. Maier, A. Patt
a
v
ina, “
S
calab
ili
t
y
Anal
ys
is
of W
S
S
-
bas
e
d ROADM
s
”
,
IEEE-17
th
European Conference on
Networ
ks and Optical C
o
mmunication
, p
p
.1-6, 2012.
[7]
S. Ro
y, A.
Ma
lik,
A. Deor
e,
“
E
valuat
ing Eff
i
ci
enc
y
of
Mult
i-La
ye
r Switch
i
ng in Future
Optic
al
Transport
Networks”,
IE
EE- Opt
i
cal
F
i
ber Communica
tion Conf
erence and E
x
position
and th
e Na
tio
nal F
i
ber Opti
c
Engineers Conference
, pp.1-3
,
20
13.
[8]
I. Karamitsos and C. Bowerman, “A
Resource Reservation Pr
otocol with
L
i
n
ear T
r
affi
c P
r
ed
iction
for OBS
Networks”,
Hin
dawi Publishing
Corporation Ad
vances in
Opti
cal Technologies
, A
r
ticle ID
425372
, 6
pages, 2013
.
[9]
D.A.B. Mi
ller
,
“
R
econfigur
able
add-drop m
u
ltip
l
e
xer fo
r spat
ial
m
odes”,
Opti
cs
Expr
es
s
, Vol. 21
, No. 17, 2013.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
SN
:
2
088
-87
08
IJEC
E V
o
l
.
6, No
. 2, A
p
ri
l
20
16
:
70
0 – 7
0
7
70
7
[10]
Y. Luo, N. Ansari, “
A
Com
put
ation
a
l Model for Estim
ating Blocking Probabil
ities of Multifib
er W
D
M Optic
a
l
Networks”,
I
E
E
E
communica
tio
ns
let
t
er
s
, vo
l. 8, no. 1, Januar
y
2
004.
[11]
B.B. Gangay
a
, S. Talab
a
thula,
and
P. Rajappa
,
“
E
stim
ating
Blocking Probability
base
d on Network Lay
e
r and
Ph
y
s
ical Lay
e
r Constraints
for
High S
p
eed Opt
i
cal
Networks
”,
Photonics
2006.
[12]
X. Chu, T. Bu
,
X-Y Li, “A Study
of
Ligh
tpath
Rerou
ting Sch
e
m
e
s in W
a
veleng
th
-R
outed WDM Networks”, IEEE-
International Co
nference on
Co
mmunication, pp
.2400-2405, 200
7.
[13]
M. Bahleda, K. Blunar
,
I
.
Bridova
, “Th
e
Blo
c
king Probab
ility
Model in
All-Optical Networ
ks for Limited
Wavelength
Co
nversion”,
Journal of Computer
System
s, N
e
two
r
ks, and Communications
, Article ID 289690
, 10
pages, 2008
.
[14]
S.
Ansari and A.
Ansari,
“Comparative Analy
s
is of Routing
and Wa
velength Assign
ment Algorithms used in
W
D
M
Optical
Networks
”,
Res
e
arch Journal
of App
lied
Sc
iences, Engin
eer
ing and Techno
logy
,
v
o
l
.
7,
I
ss.
13
,
pp.2646-2654, 2
014.
[15]
J. JenoJasmine, J. Sutha, “Feedback Rout
ing
Algorithm
in o
p
tic
al W
D
M Networks”,
In
tern
ational Journal
of
Computer Scien
ce
&
Engineering Technolog
y
, Vol. 4
No. 10 Oct
2013.
[16]
B. Zhang, J. Zh
eng, H. T. Mouf
tah,
“Fast Routing Algorithms f
o
r Lightpath
Establishment in Wavelength-Routed
Optica
l
Network
s
”,
Journal of Light
wave Technology
, vo
l. 26, no.
13, 2008
.
[17]
K.
Lu,
G.
Xiao, I.
Chlamtac,
“
A
naly
sis of Blo
c
king Probability
for Distribu
ted Lightpa
thEst
a
blishm
ent in W
D
M
Optical Network
s
”, IEEE/ACM
Transactions on
Networking,
vol. 13, no. 1, Febru
a
r
y
2005.
[18]
G.R. Kavitha, T.S. Indumathi, “Revie
w of Challenges and Stand
a
rd Research
Co
ntribution in Op
tical Networks”,
International Jo
urnal of S
c
ien
tific
and Research
Publica
tions
, Vol.4, Iss.1, Januar
y
2014.
[19]
G.R. Kav
itha,
T.S. Indum
athi, “Enhanced C
onstraint-b
ased
Optic
al Networ
k for Improvin
g
OSNR using
ROADM”,
International
Journal of Application o
r
Innovation in
Engineering
&
Management
, Vol.3,
Iss.3, March
2014.
[20]
Y
.
P
a
n, T
.
A
l
pca
n
, L. P
a
v
e
l
,
“
A
Sys
t
em
P
e
rform
a
n
ce
Approach
to
OSNR Optim
iz
ation in Opt
i
c
a
l
Networks”,
IEEE
Transactions on
Communications
, Vol. 58(4)
, pp
.
1193-1200, 201
0.
[21]
B.G. Bathu
l
a,
V.M. Vokkaran
e
, “Q
oS-Based Man
y
casting
Over Optical
Burst-Switched (
O
BS) Networks”,
IEEE/ACM Tran
sactions on N
e
tworking
, vo
l. 18, no. 1, 2010.
BIOGRAP
HI
ES OF
AUTH
ORS
Kavitha G.R. h
a
s
receiv
e
d Bac
h
elor of Engine
ering in Ele
c
tro
n
ics
and com
m
unica
tion and
Master of Tech
nolog
y
in Optical Communicat
ion Networking from Visvesvar
a
y
a
Technical
University
, India.
She is curr
ently pursuing Ph.D
degree in
Telecommunication Engin
eer
ing from Dr.Ambedkar
Institute of
Tech
nolog
y
aff
ili
at
ed
to Visv
esvaray
a
Technologi
cal
Universit
y
, Indi
a.
Her research Interest includ
es performanance analy
s
is
of ROADM
optical Networks,
P
e
rform
anance
a
n
al
y
s
is
of W
S
S
and OBS
.
Dr. Indumathi T.S. has receiv
e
d
B.E & M.E fro
m
Bangalore Un
iversity
and Ph.D. degree fro
m
Visvesvaray
a
Tec
hnological University
, India in
2011.
She is currently working as Professor and P.G.
Coordinator
,
B
a
ngalor
e
region
, Visvesvaray
a
Techn
i
cnolog
ical University
, M
uddenahalli, Chickaballapur
District
, Karnatak
a,
India. She has
23
y
ears of Teaching Experience and 10 y
ears of
Res
earch Ex
perien
ce in the
field of optic
al
Engineering
and
Communication
Networks.
Her prim
ar
y ar
e
a
s
of res
e
a
r
ch
ar
e Optic
al F
i
b
e
r
Com
m
unication,
S
y
s
t
em
and R
e
configurab
ili
t
y
in Opti
cal
Netw
orks.
Evaluation Warning : The document was created with Spire.PDF for Python.