I
nd
o
ne
s
ia
n J
o
urna
l o
f
E
lect
rica
l En
g
ineering
a
nd
Co
m
p
u
t
er
Science
Vo
l.
19
,
No
.
2
,
A
u
g
u
s
t
20
20
,
p
p
.
8
4
7
~
8
5
4
I
SS
N:
2
5
02
-
4
7
5
2
,
DOI
: 1
0
.
1
1
5
9
1
/i
j
ee
cs.v
1
9
.i
2
.
p
p
8
4
7
-
8
5
4
847
J
o
ur
na
l ho
m
ep
a
g
e
:
h
ttp
:
/
/
ijee
cs.ia
esco
r
e.
co
m
Bes
t
ca
ndida
te
ro
uting a
lg
o
rith
m
s i
ntegra
ted
w
ith
m
i
ni
m
u
m
pro
cess
ing
t
i
m
e a
nd low
block
ing
p
ro
ba
bility for
m
o
dern
pa
ra
llel co
m
p
utin
g
sy
ste
m
s
Aa
del M
.
Ala
t
w
i
1
,
Ah
m
e
d N
a
bih
Z
a
k
i R
a
s
hed
2
,
Ah
m
ed
M
.
E
l
-
E
ra
ki
3
,
I
S A
m
iri
4
1
El
e
c
tri
c
a
l
En
g
in
e
e
rin
g
De
p
a
rtm
e
n
t,
F
a
c
u
lt
y
o
f
En
g
in
e
e
rin
g
,
T
a
b
u
k
Un
iv
e
rsity
,
S
a
u
d
i
A
ra
b
ia
2
El
e
c
tro
n
ics
a
n
d
El
e
c
tri
c
a
l
Co
m
m
u
n
ica
ti
o
n
s E
n
g
in
e
e
rin
g
De
p
a
rtm
e
n
t
,
F
a
c
u
lt
y
o
f
El
e
c
tro
n
ic E
n
g
in
e
e
r
in
g
,
M
e
n
o
u
f
ia Un
iv
e
rsit
y
,
E
g
y
p
t
3
F
a
c
u
lt
y
o
f
En
g
in
e
e
rin
g
,
T
e
le
c
o
m
m
u
n
ica
ti
o
n
De
p
a
rtm
e
n
t
,
Eg
y
p
ti
a
n
Ru
ss
ian
Un
iv
e
rsity
,
Eg
y
p
t
4
Co
m
p
u
tatio
n
a
l
O
p
ti
c
s Re
se
a
rc
h
G
ro
u
p
,
A
d
v
a
n
c
e
d
In
stit
u
te o
f
M
a
teria
ls
S
c
ien
c
e
,
T
o
n
Du
c
T
h
a
n
g
Un
iv
e
rsity
,
Ho
Ch
i
M
in
h
Cit
y
,
V
iet
n
a
m
4
F
a
c
u
lt
y
o
f
A
p
p
li
e
d
S
c
ien
c
e
s,
T
o
n
Du
c
T
h
a
n
g
Un
iv
e
rsity
,
Ho
Ch
i
M
in
h
Cit
y
,
V
ietn
a
m
Art
icle
I
nfo
AB
ST
RAC
T
A
r
ticle
his
to
r
y:
R
ec
eiv
ed
J
an
1
0
,
2
0
2
0
R
ev
i
s
ed
Mar
1
1
,
2
0
2
0
A
cc
ep
ted
Mar
2
5
,
2
0
2
0
T
h
is
stu
d
y
h
a
s
c
larif
ied
th
e
b
e
st
c
a
n
d
id
a
te
r
o
u
ti
n
g
a
lg
o
rit
h
m
s
in
teg
ra
ted
w
it
h
m
in
i
m
u
m
p
ro
c
e
ss
in
g
ti
m
e
s
a
n
d
lo
w
b
l
o
c
k
in
g
p
ro
b
a
b
il
i
ti
e
s
f
o
r
m
o
d
e
rn
p
a
ra
ll
e
l
c
o
m
p
u
ti
n
g
sy
ste
m
s.
Diffe
re
n
t
m
e
th
o
d
s
w
e
re
e
m
p
lo
y
e
d
,
su
c
h
a
s
t
h
e
f
a
st
w
in
d
o
w
m
e
th
o
d
(F
W
M
),
f
a
st
b
it
w
ise
w
in
d
o
w
m
e
th
o
d
(F
BW
M
),
a
n
d
f
a
st
im
p
ro
v
e
d
w
in
d
o
w
m
e
th
o
d
(F
I
W
M
),
to
u
p
g
ra
d
e
t
h
e
p
ro
c
e
ss
in
g
ti
m
e
a
n
d
re
d
u
c
e
th
e
n
e
tw
o
rk
d
e
l
a
y
ti
m
e
.
In
a
d
d
it
i
o
n
,
d
if
f
e
r
e
n
t
a
lg
o
rit
h
m
s
we
re
stu
d
ied
su
c
h
a
s
th
e
f
a
st
w
in
d
o
w
a
sc
e
n
d
in
g
,
th
e
f
a
st
w
in
d
o
w
d
e
sc
e
n
d
in
g
,
th
e
f
a
st
w
in
d
o
w
se
q
u
e
n
ti
a
l
a
lg
o
rit
h
m
,
a
n
d
t
h
e
f
a
st
w
in
d
o
w
se
q
u
e
n
ti
a
l
d
o
w
n
a
lg
o
rit
h
m
s;
th
e
se
w
e
r
e
stu
d
ied
to
sh
o
w
th
e
n
u
m
e
rica
l
re
su
lt
s
o
f
th
e
n
e
tw
o
rk
s’
b
lo
c
k
in
g
p
r
o
b
a
b
il
it
ies
,
p
ro
c
e
ss
in
g
ti
m
e
s,
a
n
d
d
e
lay
ti
m
e
s.
K
ey
w
o
r
d
s
:
B
lo
ck
in
g
p
r
o
b
ab
ilit
y
Net
w
o
r
k
d
ela
y
ti
m
e
P
r
o
ce
s
s
in
g
ti
m
e
R
o
u
ti
n
g
alg
o
r
it
h
m
s
Co
p
y
rig
h
t
©
2
0
2
0
In
stit
u
te o
f
A
d
v
a
n
c
e
d
E
n
g
i
n
e
e
rin
g
a
n
d
S
c
ien
c
e
.
Al
l
rig
h
ts
re
se
rv
e
d
.
C
o
r
r
e
s
p
o
nd
ing
A
uth
o
r
:
I
S Am
ir
i
,
T
o
n
Du
c
T
h
an
g
Un
iv
er
s
it
y
,
Ho
C
h
i M
i
n
h
C
it
y
,
Viet
n
a
m
.
E
-
m
a
il:
ir
aj
s
ad
eg
h
a
m
ir
i
@
td
t
u
.
ed
u
.
v
n
1.
RE
L
AT
E
D
WO
RK
S
O
p
t
i
c
a
l
c
o
m
m
u
n
i
c
a
t
i
o
n
n
e
t
w
o
r
k
s
f
o
r
o
p
t
i
c
a
l
c
o
m
p
u
t
i
n
g
s
y
s
t
e
m
s
h
a
v
e
h
a
d
a
n
i
m
p
o
r
t
a
n
t
r
o
l
e
in
r
e
s
e
a
r
c
h
i
n
g
o
p
t
i
c
s
,
o
n
c
e
t
h
e
f
i
b
e
r
o
p
t
i
c
b
a
n
d
w
i
d
t
h
c
a
p
a
c
i
t
y
a
d
v
a
n
t
a
g
e
s
o
f
t
h
e
o
p
t
i
c
a
l
d
o
m
a
i
n
b
e
c
a
m
e
e
v
i
d
e
n
t
[
1
-
5
]
.
S
u
p
p
o
r
t
e
d
b
y
t
h
e
p
r
e
v
i
o
u
s
r
e
s
e
a
r
c
h
i
n
t
h
e
f
i
b
e
r
o
p
t
i
c
f
i
e
l
d
o
f
h
i
g
h
-
s
p
e
e
d
o
p
t
i
c
a
l
c
o
m
m
u
n
i
c
a
t
i
o
n
a
n
d
c
o
m
p
u
t
i
n
g
n
e
t
w
o
r
k
s
,
h
i
g
h
-
p
e
r
f
o
r
m
a
n
c
e
p
a
r
a
l
l
e
l
c
o
m
p
u
t
i
n
g
s
y
s
t
e
m
s
c
o
u
l
d
a
c
h
i
e
v
e
l
o
w
n
e
tw
o
r
k
l
a
t
e
n
c
i
e
s
[6
-
1
0
]
,
l
o
w
p
r
o
c
e
s
s
i
n
g
t
i
m
e
s
,
a
n
d
h
i
g
h
t
h
r
o
u
g
h
p
u
t
o
r
t
r
a
n
s
m
i
s
s
i
o
n
d
a
t
a
r
a
t
e
s
o
f
i
n
t
e
r
c
o
n
n
e
c
t
i
v
i
t
y
b
e
tw
e
e
n
p
r
o
c
e
s
s
i
n
g
e
l
e
m
e
n
t
s
[
1
1
-
1
5
]
.
T
h
e
b
a
s
i
c
r
e
q
u
i
r
e
m
e
n
t
s
o
f
t
h
e
n
ew
h
i
g
h
f
i
b
e
r
o
p
t
i
c
b
a
n
d
w
i
d
t
h
a
p
p
l
i
c
a
t
i
o
n
s
,
s
u
c
h
a
s
m
e
d
i
c
a
l
i
m
a
g
i
n
g
,
v
i
d
e
o
s
e
r
v
i
c
e
s
[
1
6
-
1
8
]
,
a
n
d
d
i
s
t
r
i
b
u
t
e
d
c
e
n
t
r
a
l
p
r
o
c
e
s
s
i
n
g
u
n
i
t
i
n
t
e
r
c
o
n
n
e
c
t
i
o
n
s
,
r
e
q
u
i
r
e
b
a
s
i
c
r
e
c
e
n
t
o
r
m
o
d
e
r
n
s
o
l
u
t
i
o
n
s
w
i
t
h
h
i
g
h
t
r
a
n
s
m
i
s
s
i
o
n
b
i
t
r
a
t
e
s
o
r
t
h
r
o
u
g
h
p
u
t
s
.
T
h
e
s
e
s
o
l
u
t
i
o
n
s
e
m
u
l
a
t
e
t
h
e
n
e
e
d
s
o
f
t
h
e
r
e
c
e
n
t
f
i
b
e
r
o
p
t
i
c
c
o
m
m
u
n
i
c
a
t
i
o
n
s
y
s
t
e
m
s
w
h
i
c
h
r
e
a
c
h
t
h
e
l
i
m
i
t
s
o
f
t
e
r
a
b
i
t
s
p
e
r
s
e
c
o
n
d
f
o
r
a
c
h
i
e
v
i
n
g
h
i
g
h
-
s
p
e
e
d
p
e
r
f
o
r
m
a
n
c
e
f
o
r
o
p
t
i
c
a
l
c
o
m
p
u
t
i
n
g
n
e
tw
o
r
k
s
w
i
t
h
m
i
n
i
m
u
m
b
l
o
c
k
i
n
g
p
r
o
b
a
b
i
l
i
t
i
e
s
[
1
9
-
2
5
]
.
2.
M
O
DE
L
DE
SCR
I
P
T
I
O
N
A
ND
RE
S
E
ARCH
M
E
T
H
O
D
T
h
er
e
ar
e
m
an
y
t
y
p
es
o
f
r
o
u
t
in
g
:
f
i
x
ed
r
o
u
ti
n
g
,
ad
ap
tiv
e
r
o
u
tin
g
,
a
n
d
alter
n
ate
r
o
u
t
in
g
.
T
h
e
b
asic
ad
v
an
ta
g
e
o
f
f
ix
ed
r
o
u
tin
g
i
s
t
h
e
lac
k
o
f
a
ce
n
tr
al
p
r
o
ce
s
s
i
n
g
u
n
it
f
o
r
r
o
u
te
s
elec
t
io
n
[
2
0
]
.
T
h
e
m
ain
d
r
a
w
b
ac
k
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
5
0
2
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
19
,
No
.
2
,
A
u
g
u
s
t
20
20
:
8
4
7
-
854
848
o
f
f
i
x
ed
r
o
u
tin
g
i
s
th
e
in
cr
ea
s
ed
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
b
ec
au
s
e
o
f
its
co
n
v
er
g
en
ce
.
T
h
e
m
a
in
ad
v
an
ta
g
e
o
f
th
e
ad
ap
tiv
e
alg
o
r
it
h
m
is
to
a
v
o
id
a
h
i
g
h
l
y
-
lo
ad
ed
r
o
u
te,
b
u
t
it
s
m
ai
n
d
r
a
w
b
ac
k
is
th
e
n
ec
e
s
s
it
y
f
o
r
th
e
li
n
k
-
s
tat
e
in
f
o
r
m
a
tio
n
ex
c
h
a
n
g
e
[
2
1
-
2
4
]
.
T
h
e
b
asic
ad
v
an
tag
e
o
f
alter
n
ate
alg
o
r
it
h
m
s
i
s
to
ca
r
r
y
r
etr
y
o
th
er
r
o
u
tes
if
th
e
estab
lis
h
m
e
n
t
f
ail
s
,
b
u
t its
m
ai
n
d
r
a
w
b
ac
k
ar
e
r
es
u
lts
i
n
t
h
e
w
r
o
n
g
r
o
u
te
s
elec
tio
n
[
2
6
-
3
1
]
.
W
e
h
av
e
s
t
u
d
ied
th
e
f
ast
w
i
n
d
o
w
m
et
h
o
d
(
FW
M)
,
f
ast
b
it
w
i
s
e
w
i
n
d
o
w
m
et
h
o
d
(
FB
W
M)
,
an
d
f
ast
i
m
p
r
o
v
ed
w
in
d
o
w
m
et
h
o
d
(
FIW
M)
.
I
n
ad
d
itio
n
to
th
e
f
a
s
t
w
i
n
d
o
w
asce
n
d
in
g
al
g
o
r
ith
m
,
th
e
f
ast
w
i
n
d
o
w
d
escen
d
in
g
,
f
a
s
t
w
i
n
d
o
w
s
eq
u
en
t
ial,
an
d
f
a
s
t
w
i
n
d
o
w
s
eq
u
en
t
ial
d
o
w
n
alg
o
r
it
h
m
s
w
er
e
ar
e
also
s
tu
d
ied
.
A
ll
o
f
th
e
p
r
o
p
o
s
ed
f
ast
w
i
n
d
o
w
m
et
h
o
d
s
an
d
r
o
u
tin
g
al
g
o
r
ith
m
s
ar
e
clar
if
ied
in
th
e
n
u
m
er
ica
l
r
esu
lt
s
to
s
h
o
w
th
e
n
et
w
o
r
k
p
r
o
ce
s
s
i
n
g
ti
m
e,
n
e
t
w
o
r
k
d
ela
y
ti
m
e,
an
d
f
i
n
al
n
et
w
o
r
k
b
lo
ck
i
n
g
p
r
o
b
ab
ilit
y
.
A
ll
o
f
th
e
n
u
m
er
ical
r
es
u
lt
s
ar
e
co
m
p
ar
ed
w
it
h
th
e
p
r
ev
io
u
s
co
n
v
e
n
tio
n
al
w
i
n
d
o
w
m
et
h
o
d
s
an
d
tr
ad
itio
n
al
r
o
u
tin
g
alg
o
r
ith
m
s
.
3.
P
E
RF
O
RM
ANCE AN
AL
YS
I
S WI
T
H
DI
SCUS
SI
O
NS
Fig
u
r
e
1
p
r
esen
ts
t
h
e
p
r
o
ce
s
s
in
g
t
i
m
e
a
n
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
ar
ia
tio
n
s
a
g
ai
n
s
t
t
h
e
n
e
t
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
w
i
n
d
o
w
m
et
h
o
d
,
an
d
it
p
r
o
p
o
s
es
a
f
ast
w
i
n
d
o
w
m
et
h
o
d
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
w
i
n
d
o
w
m
eth
o
d
is
0
.
3
5
m
s
,
a
n
d
th
e
p
r
o
ce
s
s
i
n
g
t
i
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
W
M
is
0
.
0
9
m
s
f
o
r
th
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
w
in
d
o
w
m
eth
o
d
is
1
8
.
1
3
m
s
,
an
d
th
e
p
r
o
ce
s
s
i
n
g
t
i
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
W
M
is
1
.
2
m
s
f
o
r
th
e
m
ed
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
w
i
n
d
o
w
m
et
h
o
d
is
1
3
9
2
m
s
,
a
n
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
W
M
i
s
1
4
8
.
5
m
s
f
o
r
th
e
l
ar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
I
n
th
e
s
a
m
e
w
a
y
,
t
h
e
n
et
wo
r
k
d
ela
y
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
w
in
d
o
w
m
et
h
o
d
is
2
.
5
m
s
,
an
d
t
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
as
t
W
M
is
1
.
5
m
s
f
o
r
th
e
s
m
all
n
et
w
o
r
k
s
ize
v
a
lu
e
o
f
8
.
Ho
w
ev
er
,
t
h
e
n
e
t
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
win
d
o
w
m
et
h
o
d
is
4
0
m
s
,
a
n
d
th
e
n
e
t
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
W
M
is
2
4
m
s
f
o
r
th
e
m
ed
i
u
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
w
i
n
d
o
w
m
e
th
o
d
is
3
2
0
m
s
,
an
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast W
M
is
1
8
8
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
0
200
400
600
800
1000
1200
1400
1600
8
16
32
64
128
256
512
1024
N
e
t
w
o
r
k
S
i
z
e
P
r
o
c
e
s
s
i
n
g
t
i
m
e
(
m
s
)
0
50
100
150
200
250
300
350
Ne
t
w
o
r
k
d
e
l
a
y
t
i
m
e
(
m
s
)
T
r
a
d
i
t
i
o
n
a
l
W
M
[
5
]
P
r
o
p
o
s
e
d
F
a
s
t
W
M
T
r
a
d
i
t
i
o
n
a
l
W
M
[
5
]
P
r
o
p
o
s
e
d
F
a
s
t
W
M
Fig
u
r
e
1
.
P
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
a
r
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
w
i
n
d
o
w
m
et
h
o
d
an
d
th
e
p
r
o
p
o
s
ed
f
ast
w
i
n
d
o
w
m
et
h
o
d
Fig
u
r
e
2
in
d
icate
s
th
e
r
elati
o
n
b
et
w
ee
n
t
h
e
p
r
o
ce
s
s
i
n
g
t
i
m
e
a
n
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iat
io
n
s
f
o
r
th
e
p
r
ev
io
u
s
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
eth
o
d
a
n
d
t
h
e
p
r
o
p
o
s
ed
f
ast,
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
et
h
o
d
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
t
h
e
tr
ad
itio
n
al
i
m
p
r
o
v
ed
w
in
d
o
w
m
e
th
o
d
is
0
.
1
8
m
s
,
an
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
i
m
p
r
o
v
ed
W
M
is
0
.
0
3
m
s
f
o
r
th
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
eth
o
d
is
3
0
.
3
5
m
s
,
a
n
d
t
h
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
i
m
p
r
o
v
ed
W
M
is
1
.
8
7
m
s
f
o
r
th
e
m
ed
i
u
m
n
e
t
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
et
h
o
d
is
1
2
2
8
m
s
,
a
n
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
i
m
p
r
o
v
e
d
W
M
is
1
5
0
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
a
lu
e
o
f
1
0
2
4
.
I
n
th
e
s
a
m
e
w
a
y
,
t
h
e
n
et
w
o
r
k
d
elay
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
et
h
o
d
is
5
m
s
,
a
n
d
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
i
m
p
r
o
v
ed
W
M
is
3
m
s
f
o
r
th
e
s
m
a
ll
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
Ho
wev
er
,
th
e
n
et
w
o
r
k
d
ela
y
t
i
m
e
f
o
r
th
e
tr
ad
itio
n
al
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
et
h
o
d
is
8
0
m
s
,
an
d
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
i
m
p
r
o
v
ed
W
M
is
4
8
m
s
f
o
r
th
e
m
ed
i
u
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
n
et
w
o
r
k
d
elay
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
et
h
o
d
is
5
0
0
m
s
,
an
d
t
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
i
m
p
r
o
v
ed
W
M
is
3
2
7
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci
I
SS
N:
2502
-
4752
B
est ca
n
d
id
a
te
r
o
u
tin
g
a
lg
o
r
ith
ms in
teg
r
a
ted
w
ith
min
imu
m
p
r
o
ce
s
s
in
g
time
a
n
d
lo
w
...
(
A
a
d
el
M.
A
la
tw
i
)
849
Fig
u
r
e
3
s
h
o
w
s
th
e
r
elatio
n
b
et
w
ee
n
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
a
n
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
iati
o
n
s
ag
ai
n
s
t
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
t
h
e
p
r
ev
io
u
s
b
it
w
i
s
e
w
i
n
d
o
w
m
eth
o
d
an
d
th
e
p
r
o
p
o
s
ed
f
ast
b
it
w
is
e
w
i
n
d
o
w
m
et
h
o
d
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
b
it
w
is
e
w
i
n
d
o
w
m
et
h
o
d
is
0
.
2
8
m
s
,
an
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
b
it
w
is
e
W
M
is
0
.
1
5
m
s
f
o
r
th
e
s
m
a
ll
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
b
it
w
is
e
w
i
n
d
o
w
m
eth
o
d
is
5
0
.
3
5
m
s
,
an
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
b
it
w
is
e
W
M
is
3
0
m
s
f
o
r
th
e
m
ed
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
Fig
u
r
e
2
.
P
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
ar
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
i
m
p
r
o
v
ed
w
in
d
o
w
m
e
th
o
d
an
d
th
e
p
r
o
p
o
s
ed
f
ast,
i
m
p
r
o
v
ed
w
i
n
d
o
w
m
et
h
o
d
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
tr
ad
itio
n
al
b
it
w
is
e
w
in
d
o
w
m
et
h
o
d
is
1
5
6
4
m
s
,
an
d
t
h
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
b
it
w
is
e
W
M
is
6
5
7
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
I
n
th
e
s
a
m
e
w
a
y
,
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
tr
ad
itio
n
al
b
it
w
i
s
e
w
i
n
d
o
w
m
et
h
o
d
is
0
.
3
6
m
s
,
an
d
t
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
b
it
w
i
s
e
W
M
is
0
.
1
m
s
f
o
r
t
h
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
n
et
w
o
r
k
d
elay
ti
m
e
f
o
r
t
h
e
tr
ad
itio
n
al
b
it
w
i
s
e
w
i
n
d
o
w
m
eth
o
d
is
5
.
6
5
m
s
,
a
n
d
t
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
a
s
t
b
it
w
i
s
e
W
M
is
1
.
6
m
s
f
o
r
t
h
e
m
ed
i
u
m
n
e
t
w
o
r
k
s
ize
v
alu
e
o
f
1
2
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
t
h
e
tr
ad
itio
n
al
b
it
w
i
s
e
w
i
n
d
o
w
m
et
h
o
d
is
4
0
.
6
5
m
s
,
an
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
b
it
w
i
s
e
W
M
is
1
3
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
Fig
u
r
e
3.
P
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
ar
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iat
io
n
s
f
o
r
th
e
p
r
ev
io
u
s
b
it
w
i
s
e
w
i
n
d
o
w
m
et
h
o
d
an
d
th
e
p
r
o
p
o
s
ed
f
ast b
it
w
i
s
e
w
i
n
d
o
w
m
eth
o
d
Fig
u
r
e
4
illu
s
tr
ates
t
h
e
r
elatio
n
b
et
w
ee
n
t
h
e
p
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
iatio
n
s
ag
ain
s
t
t
h
e
n
et
w
o
r
k
s
ize
v
ar
i
atio
n
s
f
o
r
th
e
p
r
ev
io
u
s
Asce
n
d
in
g
al
g
o
r
it
h
m
an
d
t
h
e
p
r
o
p
o
s
ed
f
ast
asce
n
d
i
n
g
w
i
n
d
o
w
m
et
h
o
d
.
T
h
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
t
h
e
Asce
n
d
in
g
a
lg
o
r
ith
m
is
0
.
0
1
3
m
s
,
a
n
d
t
h
e
p
r
o
ce
s
s
in
g
t
i
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
A
s
ce
n
d
in
g
W
M
is
0
.
0
0
5
2
m
s
f
o
r
t
h
e
s
m
al
l
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
Ascen
d
i
n
g
al
g
o
r
ith
m
is
1
.
7
4
2
m
s
,
a
n
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
A
s
ce
n
d
in
g
W
M
is
0
.
2
1
7
m
s
f
o
r
t
h
e
m
ed
iu
m
n
et
w
o
r
k
s
i
ze
v
al
u
e
o
f
1
2
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
A
s
ce
n
d
in
g
a
lg
o
r
ith
m
is
4
.
7
5
3
m
s
,
an
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
A
s
ce
n
d
i
n
g
W
M
is
0
.
3
1
9
m
s
f
o
r
t
h
e
lar
g
e
n
e
t
w
o
r
k
s
ize
v
al
u
e
o
f
0
100
200
300
400
500
600
0
200
400
600
800
1000
1200
1400
8
16
32
64
128
256
512
1024
Net
wo
r
k
d
el
ay
t
im
e
(
m
s)
P
r
o
ce
ss
in
g
t
im
e
(
m
s)
Net
wo
r
k
S
ize
T
r
ad
i
ti
o
n
al
I
W
M
[
5]
Pr
o
p
o
sed
F
ast
I
W
M
T
r
ad
i
ti
o
n
al
I
W
M
[
5]
Pr
o
p
o
sed
F
ast
I
W
M
0
5
10
15
20
25
30
35
40
45
0
200
400
600
800
1000
1200
1400
1600
8
16
32
64
128
256
512
1024
N
e
t
w
ork
delay
t
i
m
e
(
m
s
)
P
roc
e
s
s
i
ng
t
i
m
e
(
m
s
)
N
e
t
w
ork
S
i
z
e
T
r
ad
it
io
n
al BW
M
[
5]
P
r
o
p
o
sed
F
ast
BW
M
T
r
ad
it
io
n
al BW
M
[
5]
P
r
o
p
o
sed
F
ast
BW
M
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
5
0
2
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
19
,
No
.
2
,
A
u
g
u
s
t
20
20
:
8
4
7
-
854
850
1
0
2
4
.
I
n
th
e
s
a
m
e
w
a
y
,
t
h
e
n
e
t
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
A
s
ce
n
d
in
g
al
g
o
r
ith
m
is
0
.
2
m
s
,
an
d
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
Ascen
d
i
n
g
W
M
is
0
.
0
5
m
s
f
o
r
th
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
Ho
w
ev
er
,
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
t
h
e
Asce
n
d
in
g
al
g
o
r
ith
m
i
s
3
.
2
m
s
,
a
n
d
t
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
A
s
ce
n
d
in
g
W
M
i
s
0
.
8
m
s
f
o
r
t
h
e
m
ed
iu
m
n
et
w
o
r
k
s
iz
e
v
al
u
e
o
f
1
2
8
.
T
h
e
n
et
w
o
r
k
d
elay
ti
m
e
f
o
r
th
e
Ascen
d
i
n
g
a
lg
o
r
it
h
m
is
2
5
m
s
,
an
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
A
s
ce
n
d
in
g
W
M
is
6
.
6
5
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
Fig
u
r
e
4
.
P
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
ar
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
Ascen
d
i
n
g
al
g
o
r
ith
m
a
n
d
th
e
p
r
o
p
o
s
ed
f
ast asce
n
d
in
g
w
i
n
d
o
w
m
eth
o
d
Fig
u
r
e
5
clar
if
ie
s
th
e
r
elatio
n
b
et
w
ee
n
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
a
n
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
ia
ti
o
n
s
ag
a
in
s
t
th
e
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
d
esce
n
d
in
g
al
g
o
r
ith
m
a
n
d
t
h
e
p
r
o
p
o
s
ed
f
ast
d
escen
d
in
g
w
i
n
d
o
w
m
et
h
o
d
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
d
escen
d
i
n
g
al
g
o
r
ith
m
is
0
.
0
1
6
m
s
,
a
n
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast d
esce
n
d
in
g
W
M
is
0
.
0
0
4
9
m
s
f
o
r
th
e
s
m
all
n
et
w
o
r
k
s
ize
v
a
lu
e
o
f
8
.
T
h
e
p
r
o
c
ess
i
n
g
t
i
m
e
f
o
r
th
e
d
escen
d
in
g
al
g
o
r
ith
m
is
0
.
6
7
1
5
m
s
,
a
n
d
t
h
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
d
e
s
c
en
d
in
g
W
M
i
s
0
.
1
4
5
m
s
f
o
r
t
h
e
m
ed
iu
m
n
et
w
o
r
k
s
i
ze
v
al
u
e
o
f
1
2
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
d
escen
d
i
n
g
al
g
o
r
ith
m
is
1
.
2
4
3
m
s
,
an
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
d
esce
n
d
in
g
W
M
is
0
.
3
4
2
m
s
f
o
r
th
e
lar
g
e
n
e
t
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
I
n
th
e
s
a
m
e
w
a
y
,
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
d
escen
d
in
g
alg
o
r
it
h
m
i
s
0
.
0
3
1
m
s
,
an
d
th
e
n
et
w
o
r
k
d
elay
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
a
s
t
d
esce
n
d
in
g
W
M
is
0
.
0
2
7
m
s
f
o
r
t
h
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
d
esce
n
d
in
g
al
g
o
r
ith
m
i
s
0
.
8
6
2
m
s
,
a
n
d
th
e
n
et
w
o
r
k
d
elay
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
d
esce
n
d
i
n
g
W
M
is
0
.
4
3
1
m
s
f
o
r
t
h
e
m
ed
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
d
escen
d
i
n
g
alg
o
r
i
th
m
i
s
1
.
5
1
m
s
,
an
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
a
s
t
d
escen
d
in
g
W
M
is
0
.
7
4
6
m
s
f
o
r
th
e
lar
g
e
n
et
wo
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
Fig
u
r
e
5
.
P
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
ar
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
d
escen
d
in
g
al
g
o
r
ith
m
an
d
t
h
e
p
r
o
p
o
s
e
d
f
ast d
escen
d
i
n
g
w
i
n
d
o
w
m
et
h
o
d
0
5
10
15
20
25
30
0
0
,
5
1
1
,
5
2
2
,
5
3
3
,
5
4
4
,
5
5
8
16
32
64
128
256
512
1024
N
e
t
w
ork
delay
t
i
m
e
(
m
s
)
P
roc
e
s
s
i
ng
t
i
m
e
(
m
s
)
N
e
t
w
ork
S
i
z
e
Asce
n
d
in
g
Alg
o
r
it
h
m
[
7]
P
r
o
p
o
sed
F
ast
W
M
-
Asce
n
d
Asce
n
d
in
g
Alg
o
r
it
h
m
[
7]
P
r
o
p
o
sed
F
ast
W
M
-
Asce
n
d
0
0,
2
0,
4
0,
6
0,
8
1
1,
2
1,
4
1,
6
0
0,
2
0,
4
0,
6
0,
8
1
1,
2
1,
4
8
16
32
64
128
256
512
1024
N
et
w
o
r
k
d
el
ay
t
i
m
e
(
m
s)
P
r
o
ces
si
n
g
t
i
m
e
(
m
s)
N
et
w
o
r
k
S
i
ze
D
e
s
c
e
nd
i
ng
A
l
go
r
i
t
hm
[
7
]
P
rop
os
e
d
Fa
s
t
W
M
-
D
e
s
c
e
nd
i
ng
D
e
s
c
e
nd
i
ng
A
l
go
r
i
t
hm
[
7
]
P
rop
os
e
d
Fa
s
t
W
M
-
D
e
s
c
e
nd
i
ng
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci
I
SS
N:
2502
-
4752
B
est ca
n
d
id
a
te
r
o
u
tin
g
a
lg
o
r
ith
ms in
teg
r
a
ted
w
ith
min
imu
m
p
r
o
ce
s
s
in
g
time
a
n
d
lo
w
...
(
A
a
d
el
M.
A
la
tw
i
)
851
Fig
u
r
e
6
s
h
o
w
s
th
e
r
elatio
n
b
et
w
ee
n
p
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
iat
io
n
s
ag
ain
s
t
th
e
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
s
eq
u
en
tial
alg
o
r
i
th
m
a
n
d
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
en
tial
w
i
n
d
o
w
m
et
h
o
d
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
s
eq
u
en
tial
alg
o
r
it
h
m
is
0
.
0
1
m
s
,
an
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
tial
W
M
is
0
.
0
0
5
m
s
f
o
r
t
h
e
s
m
al
l
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
t
h
e
s
eq
u
en
tial
al
g
o
r
ith
m
is
1
.
4
2
5
m
s
,
a
n
d
th
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
tia
l
W
M
is
0
.
2
2
5
m
s
f
o
r
th
e
m
ed
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
s
eq
u
e
n
tia
l
al
g
o
r
ith
m
is
3
.
6
2
5
m
s
,
an
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
tia
l
W
M
is
0
.
3
2
8
m
s
f
o
r
t
h
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
I
n
th
e
s
a
m
e
w
a
y
,
t
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
s
eq
u
en
t
ial
alg
o
r
it
h
m
i
s
0
.
1
2
5
m
s
,
an
d
th
e
n
et
w
o
r
k
d
elay
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
a
s
t
s
eq
u
e
n
tial
W
M
i
s
0
.
0
8
5
m
s
f
o
r
t
h
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
s
e
q
u
en
tial
al
g
o
r
ith
m
i
s
3
.
7
1
m
s
,
an
d
t
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
en
tial
W
M
is
0
.
3
8
7
m
s
f
o
r
th
e
m
ed
i
u
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
s
eq
u
e
n
tial
alg
o
r
ith
m
is
6
.
4
1
3
m
s
,
an
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
tial
W
M
is
0
.
5
9
5
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
Fig
u
r
e
6
.
P
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
ar
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
s
eq
u
en
tial a
l
g
o
r
ith
m
an
d
t
h
e
p
r
o
p
o
s
e
d
f
ast s
eq
u
en
t
ial
w
i
n
d
o
w
m
et
h
o
d
Fig
u
r
e
7
illu
s
tr
ates
t
h
e
r
elatio
n
b
et
w
ee
n
p
r
o
ce
s
s
in
g
ti
m
e
a
n
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
iatio
n
s
ag
ai
n
s
t
th
e
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
s
eq
u
en
tia
l
d
o
w
n
alg
o
r
ith
m
an
d
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
tial
d
o
w
n
w
i
n
d
o
w
m
eth
o
d
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
s
eq
u
en
tial
d
o
wn
al
g
o
r
ith
m
i
s
0
.
0
1
4
m
s
,
an
d
t
h
e
p
r
o
ce
s
s
i
n
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
ti
al
d
o
w
n
W
M
is
0
.
0
0
4
m
s
f
o
r
t
h
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
s
eq
u
en
tial
d
o
w
n
alg
o
r
ith
m
i
s
0
.
6
8
m
s
,
an
d
t
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
en
tial
d
o
w
n
W
M
i
s
0
.
1
5
4
m
s
f
o
r
th
e
m
ed
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
s
eq
u
e
n
tial
d
o
w
n
a
lg
o
r
it
h
m
is
1
.
2
5
6
m
s
,
a
n
d
th
e
p
r
o
ce
s
s
in
g
t
i
m
e
f
o
r
t
h
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
tial
d
o
w
n
W
M
is
0
.
3
0
8
9
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
I
n
th
e
s
a
m
e
w
a
y
,
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
t
h
e
s
eq
u
e
n
tial
d
o
w
n
alg
o
r
ith
m
is
0
.
0
3
1
m
s
,
an
d
t
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
e
n
tial
d
o
w
n
W
M
is
0
.
0
2
5
m
s
f
o
r
th
e
s
m
al
l
n
e
t
w
o
r
k
s
ize
v
alu
e
o
f
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
s
eq
u
e
n
tia
l
d
o
w
n
al
g
o
r
ith
m
is
0
.
8
7
3
m
s
,
an
d
th
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
en
t
ial
d
o
w
n
W
M
i
s
0
.
3
0
3
m
s
f
o
r
th
e
m
ed
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
n
et
w
o
r
k
d
ela
y
ti
m
e
f
o
r
th
e
s
eq
u
e
n
tia
l
d
o
w
n
alg
o
r
it
h
m
i
s
1
.
5
8
m
s
,
an
d
th
e
p
r
o
ce
s
s
in
g
ti
m
e
f
o
r
th
e
p
r
o
p
o
s
ed
f
ast
s
eq
u
en
t
ial
d
o
w
n
W
M
is
0
.
5
0
7
m
s
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
Fig
u
r
e
7
.
P
r
o
ce
s
s
in
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
t
i
m
e
v
ar
iatio
n
s
ag
ain
s
t
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
th
e
p
r
ev
io
u
s
s
eq
u
en
tial d
o
w
n
al
g
o
r
ith
m
an
d
th
e
p
r
o
p
o
s
ed
f
as
t seq
u
en
tia
l d
o
w
n
w
i
n
d
o
w
m
et
h
o
d
0
1
2
3
4
5
6
7
0
0,
5
1
1,
5
2
2,
5
3
3,
5
4
8
16
32
64
128
256
512
1024
Net
wo
r
k
d
el
ay
t
im
e
(
m
s)
P
r
o
ce
ss
in
g
t
im
e
(
m
s)
Net
wo
r
k
S
ize
Seq
.
A
l
g
o
r
i
th
m
[7]
Pr
o
p
o
s
ed
F
ast
W
M
-
Seq
Seq
.
A
l
g
o
r
i
th
m
[7]
Pr
o
p
o
s
ed
F
ast
W
M
-
Seq
0
0
,5
1
1
,5
2
0
0
,2
0
,4
0
,6
0
,8
1
1
,2
1
,4
8
16
32
64
128
256
512
1024
Netw
ork
de
la
y
ti
m
e
Proc
e
s
s
in
g
tim
e
(m
s
)
Netw
ork
Siz
e
Seq
D
n
A
l
g
o
r
i
th
m
[7]
Pr
o
p
o
sed
F
ast
W
M
-Seq
D
n
Seq
D
n
A
l
g
o
r
i
th
m
[7]
Pr
o
p
o
sed
F
ast
W
M
-Seq
D
n
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
5
0
2
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
19
,
No
.
2
,
A
u
g
u
s
t
20
20
:
8
4
7
-
854
852
T
h
e
n
et
w
o
r
k
b
lo
ck
in
g
p
r
o
b
ab
i
lit
y
v
ar
iatio
n
s
v
er
s
u
s
n
et
w
o
r
k
s
ize
v
ar
iatio
n
s
f
o
r
v
ar
io
u
s
f
a
s
t
w
i
n
d
o
w
m
et
h
o
d
s
an
d
p
r
o
p
o
s
ed
r
o
u
tin
g
alg
o
r
it
h
m
s
i
s
s
h
o
w
n
in
Fig
u
r
e
8
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
th
e
W
M
i
s
0
.
0
0
0
9
f
o
r
th
e
s
m
al
l
n
et
w
o
r
k
s
ize
v
alu
e
o
f
8
.
T
h
e
b
lo
ck
i
n
g
p
r
o
b
a
b
ilit
y
f
o
r
th
e
W
M
is
0
.
0
0
5
4
f
o
r
th
e
m
ed
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
th
e
W
M
is
0
.
0
0
9
8
f
o
r
th
e
lar
g
e
n
e
t
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
i
m
p
r
o
v
ed
W
M
i
s
0
.
0
0
0
3
f
o
r
th
e
s
m
al
l
n
e
t
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
th
e
i
m
p
r
o
v
ed
W
M
is
0
.
0
0
5
8
f
o
r
th
e
m
ed
i
u
m
n
et
w
o
r
k
s
ize
v
alu
e
o
f
1
2
8
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
th
e
i
m
p
r
o
v
ed
W
M
is
0
.
0
9
8
7
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
i
ze
v
alu
e
o
f
1
0
2
4
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
B
W
M
is
0
.
0
0
1
5
f
o
r
th
e
s
m
all
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
il
ity
f
o
r
B
W
M
is
0
.
2
5
4
f
o
r
th
e
m
e
d
iu
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
B
W
M
is
0
.
3
3
2
1
f
o
r
th
e
h
i
g
h
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
f
a
s
t
asce
n
d
in
g
W
M
is
0
.
0
0
5
2
f
o
r
th
e
s
m
al
l
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
f
ast
asce
n
d
in
g
W
M
is
0
.
2
1
7
f
o
r
th
e
m
ed
i
u
m
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
2
8
,
w
h
ile
t
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
f
as
t
ascen
d
i
n
g
W
M
is
0
.
3
1
9
f
o
r
th
e
lar
g
e
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
T
h
e
b
lo
ck
i
n
g
p
r
o
b
ab
ilit
y
f
o
r
f
as
t
d
escen
d
i
n
g
W
M
is
0
.
0
0
4
f
o
r
th
e
s
m
a
ll
n
et
w
o
r
k
s
ize
v
al
u
e
o
f
8
,
b
u
t
th
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
th
e
f
a
s
t
d
escen
d
i
n
g
W
M
is
0
.
1
4
5
f
o
r
th
e
m
ed
iu
m
n
e
t
w
o
r
k
s
ize
v
a
lu
e
o
f
1
2
8
.
Me
an
w
h
ile,
th
e
b
lo
ck
i
n
g
p
r
o
b
ab
ilit
y
f
o
r
f
ast
d
escen
d
i
n
g
W
M
is
0
.
3
4
2
f
o
r
th
elar
g
e
n
et
w
o
r
k
s
ize
v
alu
e
o
f
1
0
2
4
.
T
h
e
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
f
o
r
t
h
e
f
as
t
s
e
q
u
en
tial
W
M
is
0
.
0
0
5
f
o
r
th
e
s
m
al
l
n
e
t
w
o
r
k
s
ize
v
alu
e
o
f
8
,
b
u
t
t
h
e
b
lo
ck
i
n
g
p
r
o
b
ab
ilit
y
f
o
r
f
a
s
t
s
eq
u
e
n
tial
W
M
is
0
.
2
2
5
f
o
r
th
e
m
ed
i
u
m
n
et
w
o
r
k
s
ize
v
a
lu
e
o
f
1
2
8
.
Me
an
w
h
ile,
t
h
e
b
lo
ck
i
n
g
p
r
o
b
a
b
ilit
y
f
o
r
f
ast
s
eq
u
e
n
tial
W
M
is
0
.
3
2
8
f
o
r
th
e
lar
g
e
n
e
t
w
o
r
k
s
ize
v
al
u
e
o
f
1
0
2
4
.
T
h
e
b
l
o
c
k
in
g
p
r
o
b
a
b
i
li
ty
f
o
r
th
e
f
a
s
t
s
e
q
u
e
n
t
i
al
d
o
w
n
W
M
i
s
0
.
0
0
4
6
f
o
r
th
e
s
m
al
l
n
etw
o
r
k
s
i
z
e
v
al
u
e
o
f
8
,
b
u
t
th
e
b
l
o
ck
i
n
g
p
r
o
b
a
b
i
l
i
ty
f
o
r
f
as
t
s
e
q
u
en
t
i
a
l
d
o
w
n
W
M
is
0
.
1
5
4
2
f
o
r
th
e
m
e
d
iu
m
n
etw
o
r
k
s
i
ze
v
a
lu
e
o
f
1
2
8
.
T
h
e
b
l
o
c
k
in
g
p
r
o
b
a
b
i
l
ity
f
o
r
t
h
e
f
as
t
s
e
q
u
en
t
i
al
d
o
w
n
W
M
is
0
.
3
0
8
9
f
o
r
t
h
e
la
r
g
e
n
e
tw
o
r
k
s
iz
e
v
al
u
e
o
f
1
0
2
4
.
Fig
u
r
e
8
.
B
lo
ck
in
g
P
r
o
b
ab
ilit
y
v
ar
iatio
n
s
v
er
s
u
s
n
et
w
o
r
k
s
iz
e
v
ar
iatio
n
s
f
o
r
v
ar
io
u
s
f
a
s
t
w
i
n
d
o
w
m
et
h
o
d
s
an
d
th
e
p
r
o
p
o
s
ed
r
o
u
tin
g
alg
o
r
it
h
m
s
4.
CO
NCLU
SI
O
N
W
e
h
av
e
s
tu
d
ied
v
ar
io
u
s
r
o
u
t
in
g
alg
o
r
it
h
m
s
a
n
d
d
if
f
er
en
t
f
ast
w
i
n
d
o
w
m
et
h
o
d
s
f
o
r
u
p
g
r
ad
in
g
t
h
e
p
er
f
o
r
m
a
n
ce
o
f
o
p
tical
co
m
p
u
tin
g
n
et
w
o
r
k
s
.
T
h
e
p
r
o
ce
s
s
i
n
g
ti
m
e
an
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
iatio
n
s
a
g
ai
n
s
t
th
e
n
et
w
o
r
k
s
ize
v
ar
iat
io
n
s
f
o
r
th
e
p
r
ev
io
u
s
r
o
u
ti
n
g
a
lg
o
r
ith
m
s
a
n
d
t
h
e
p
r
o
p
o
s
ed
r
o
u
tin
g
a
lg
o
r
it
h
m
s
h
av
e
b
ee
n
m
ea
s
u
r
ed
.
I
n
t
h
e
s
a
m
e
wa
y
,
t
h
e
P
r
o
ce
s
s
in
g
ti
m
e
a
n
d
n
et
w
o
r
k
d
ela
y
ti
m
e
v
ar
iatio
n
s
a
g
ain
s
t
th
e
n
et
w
o
r
k
s
ize
v
ar
iat
io
n
s
f
o
r
t
h
e
tr
ad
itio
n
al
w
i
n
d
o
w
m
eth
o
d
s
a
n
d
t
h
e
p
r
o
p
o
s
ed
f
ast
w
i
n
d
o
w
m
et
h
o
d
s
h
av
e
b
ee
n
v
er
if
ied
.
T
h
e
p
r
o
p
o
s
ed
f
ast
w
i
n
d
o
w
m
et
h
o
d
s
an
d
r
o
u
tin
g
al
g
o
r
ith
m
s
p
r
esen
ted
a
b
etter
n
et
w
o
r
k
p
er
f
o
r
m
an
c
e
ef
f
icien
c
y
t
h
an
t
h
e
tr
ad
itio
n
al
w
i
n
d
o
w
m
et
h
o
d
s
an
d
th
e
co
n
v
e
n
tio
n
al
r
o
u
ti
n
g
al
g
o
r
ith
m
s
.
T
h
e
f
ast
w
in
d
o
w
m
et
h
o
d
p
r
esen
ted
th
e
lo
w
es
t
n
et
w
o
r
k
b
lo
ck
in
g
p
r
o
b
ab
ilit
y
c
o
m
p
ar
ed
to
th
e
o
th
er
p
r
o
p
o
s
ed
w
i
n
d
o
w
m
et
h
o
d
s
.
RE
F
E
R
E
NC
E
S
[1
]
O.
L
.
L
a
d
o
u
c
e
u
r,
“
Bre
a
k
th
ro
u
g
h
s
in
P
h
o
t
o
n
ics
2
0
1
4
:
Op
t
ica
l
In
t
e
rc
o
n
n
e
c
ti
o
n
Ne
tw
o
rk
s”
IEE
E
p
h
o
t
o
n
ic
jo
u
rn
a
l
,
v
o
l.
7
,
n
o
.
3
,
p
p
.
7
5
1
–
7
5
6
J
u
n
e
2
0
1
5
.
[2
]
M
a
n
ish
a
,
a
n
d
V
.
M
a
li
k
,
“
Eff
e
c
t
o
f
Cro
ss
talk
in
Op
ti
c
a
l
Co
m
p
o
n
e
n
t
”
,
In
ter
n
a
t
io
n
a
l
J
o
u
rn
a
l
f
o
r
Res
e
a
rc
h
in
Ap
p
li
e
d
S
c
ien
c
e
&
En
g
in
e
e
rin
g
T
e
c
h
n
o
lo
g
y
(
IJ
RA
S
ET
)
,
v
o
l.
3
,
n
o
.
5
,
p
p
.
4
5
6
-
4
5
9
,
M
a
y
2
0
1
5
.
[3
]
R.
R.
A
g
g
a
r
wa
l
e
t
a
l.
,
“
M
u
lt
istag
e
In
terc
o
n
n
e
c
ti
o
n
Ne
tw
o
rk
s:
A
tr
a
n
siti
o
n
f
ro
m
El
e
c
tro
n
ic
to
Op
ti
c
a
l,
”
J
o
u
rn
a
l
o
f
Eme
rg
in
g
T
e
c
h
n
o
lo
g
ies
in
W
e
b
I
n
telli
g
e
n
c
e
,
v
o
l.
2
,
n
o
.
2
,
p
p
.
1
4
2
-
1
4
7
,
M
a
y
2
0
1
0
.
[4
]
N.
A
.
Yu
n
u
s,
a
n
d
M
.
Oth
m
a
n
“
Re
li
a
b
il
it
y
Ev
a
lu
a
ti
o
n
a
n
d
R
o
u
ti
n
g
In
teg
ra
ti
o
n
in
S
h
u
f
f
le
E
x
c
h
a
n
g
e
O
m
e
g
a
Ne
tw
o
rk
”
,
J
o
u
rn
a
l
o
f
Ne
two
rk
s
,
v
o
l.
9
,
n
o
.
7
,
p
p
.
1
7
3
2
-
1
7
3
7
,
Ju
l.
2
0
1
4
.
0
0,
0
5
0,
1
0,
1
5
0,
2
0,
2
5
0,
3
0,
3
5
8
16
32
64
128
256
512
10
2
4
Blo
ck
in
g
P
r
o
b
ab
ili
t
y
Net
wo
r
k
S
ize
Fa
s
t
W
M
-
S
e
qD
n
Fa
s
t
W
M
-
S
e
q
Fa
s
t
W
M
-
D
e
s
c
e
nd
i
ng
Fa
s
t
W
M
-
A
s
c
e
nd
Fa
s
t
B
W
M
Fa
s
t
I
W
M
Fa
s
t
W
M
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci
I
SS
N:
2502
-
4752
B
est ca
n
d
id
a
te
r
o
u
tin
g
a
lg
o
r
ith
ms in
teg
r
a
ted
w
ith
min
imu
m
p
r
o
ce
s
s
in
g
time
a
n
d
lo
w
...
(
A
a
d
el
M.
A
la
tw
i
)
853
[5
]
S
.
C.
Ch
a
u
e
t
a
l.
,
“
Ro
u
ti
n
g
a
n
d
S
c
h
e
d
u
l
in
g
f
o
r
a
N
o
v
e
l
Op
ti
c
a
l
M
u
lt
istag
e
In
terc
o
n
n
e
c
ti
o
n
Ne
tw
o
rk
s,”
Eu
ro
-
P
a
r
2
0
0
5
P
a
ra
l
lel
Pro
c
e
ss
in
g
,
L
e
c
tu
r
e
No
tes
in
C
o
mp
u
ter
S
c
ien
c
e
,
v
o
l.
3
6
4
8
,
n
o
.
9
,
p
p
.
9
8
4
-
9
9
3
,
2
0
0
5
.
[6
]
C.
Qia
o
,
a
n
d
R.
M
e
l
h
e
m
,
“
A
Ti
m
e
Do
m
a
in
A
p
p
ro
a
c
h
f
o
r
A
v
o
i
d
in
g
Cro
ss
talk
in
O
p
ti
c
a
l
Blo
c
k
in
g
M
u
lt
istag
e
In
terc
o
n
n
e
c
ti
o
n
Ne
tw
o
rk
s”
,
J
o
u
rn
a
l
o
f
L
ig
h
twa
v
e
T
e
c
h
n
o
l
o
g
y
,
v
o
l
.
1
2
.
n
o
.
1
0
,
p
p
.
1
8
5
4
-
1
8
6
2
,
1
9
9
4
.
[7
]
T
.
D.
S
h
a
h
id
a
e
t
a
l.
,
“
F
a
st
Zero
x
a
lg
o
rit
h
m
f
o
r
ro
u
ti
n
g
in
o
p
ti
c
a
l
M
u
lt
istag
e
in
terc
o
n
n
e
c
ti
o
n
n
e
tw
o
rk
s”
,
II
UM
En
g
i
n
e
e
rin
g
J
o
u
rn
a
l
,
v
o
l.
1
1
,
n
o
.
1
,
p
p
.
2
8
-
3
9
,
2
0
1
0
.
[8
]
A
.
K.
Ka
t
a
n
g
u
r
e
t
a
l.
,
“
A
n
a
l
y
z
in
g
th
e
p
e
rf
o
r
m
a
n
c
e
o
f
o
p
ti
c
a
l
m
u
lt
istag
e
in
terc
o
n
n
e
c
ti
o
n
n
e
tw
o
rk
s
w
it
h
li
m
it
e
d
c
ro
ss
talk
”
,
Clu
ste
r Co
mp
u
t
in
g
,
v
o
l.
1
0
,
n
o
.
7
,
p
p
.
2
4
1
-
2
5
0
,
M
a
r.
2
0
0
7
.
[9
]
F
.
A
b
e
d
a
n
d
M
.
Oth
m
a
n
,
“
F
a
st
m
e
th
o
d
to
f
in
d
c
o
n
f
li
c
ts
in
o
p
ti
c
a
l
m
u
lt
istag
e
in
terc
o
n
n
e
c
ti
o
n
n
e
tw
o
rk
s,”
In
ter
n
a
t
io
n
a
l
J
o
u
rn
a
l
o
f
T
h
e
Co
m
p
u
ter
In
ter
n
e
t
a
n
d
M
a
n
a
g
e
me
n
t
,
v
o
l.
1
6
,
n
o
.
1
,
p
p
.
1
8
-
2
5
,
2
0
0
8
.
[1
0
]
M
.
A
b
d
u
ll
a
h
e
t
a
l.
,
“
A
n
e
ff
icie
n
t
a
p
p
ro
a
c
h
f
o
r
m
e
ss
a
g
e
ro
u
ti
n
g
in
o
p
ti
c
a
l
o
m
e
g
a
n
e
t
w
o
rk
”
,
In
ter
n
a
t
io
n
a
l
J
o
u
rn
a
l
o
f
T
h
e
Co
m
p
u
ter
In
ter
n
e
t
a
n
d
M
a
n
a
g
e
me
n
t
,
v
o
l.
1
4
,
n
o
.
1
,
p
p
.
5
0
-
6
0
,
2
0
0
6
.
[1
1
]
M
.
A
.
A
l
-
S
h
a
b
i,
“
Zero
X
A
lg
o
rit
h
m
s
w
it
h
F
re
e
c
ro
ss
talk
in
Op
ti
c
a
l
M
u
lt
istag
e
In
terc
o
n
n
e
c
ti
o
n
Ne
tw
o
rk
”
In
ter
n
a
t
io
n
a
l
J
o
u
rn
a
l
o
f
A
d
v
a
n
c
e
d
Co
m
p
u
ter
S
c
ie
n
c
e
a
n
d
A
p
p
li
c
a
t
io
n
s
,
v
o
l.
4
,
n
o
.
2
,
p
p
.
1
5
6
-
1
6
0
,
2
0
1
3
.
[1
2
]
IS
Am
iri
e
t
a
l.
,
“
No
n
li
n
e
a
r
Eff
e
c
ts
w
it
h
S
e
m
ico
n
d
u
c
t
o
r
Op
ti
c
a
l
Am
p
li
f
iers
,
”
J
o
u
rn
a
l
o
f
Op
ti
c
a
l
C
o
mm
u
n
ic
a
ti
o
n
s
,
V
o
l
.
0
,
Iss
u
e
0
,
P
u
b
li
sh
e
d
O
n
li
n
e
:
1
2
A
p
ril
2
0
1
9
,
h
tt
p
s:/
/d
o
i.
o
rg
/
1
0
.
1
5
1
5
/j
o
c
-
2
0
1
9
-
0
0
5
3
.
[1
3
]
R
a
m
n
i
w
a
s
,
a
n
d
L
.
L
o
d
h
a
“
R
e
d
u
c
e
t
h
e
C
r
o
s
s
T
a
l
k
i
n
O
m
e
g
a
N
e
t
w
o
r
k
b
y
U
s
i
n
g
W
i
n
d
o
w
i
n
g
T
e
c
h
n
i
q
u
e
s
”
,
I
n
t
e
r
n
a
t
i
o
n
a
l
J
o
u
r
n
a
l
o
n
R
e
c
e
n
t
a
n
d
I
n
n
o
v
a
t
i
o
n
T
r
e
n
d
s
i
n
C
o
m
p
u
t
i
n
g
a
n
d
C
o
m
m
u
n
i
c
a
t
i
o
n
,
v
o
l
.
4
,
n
o
.
6
,
p
p
.
5
4
-
5
7
,
J
u
n
.
2
0
1
6
.
[1
4
]
U.
Ch
o
u
d
h
u
ry
,
a
n
d
A
.
S
a
n
g
io
v
a
n
n
i
-
V
i
n
c
e
n
telli
,
“
Co
n
stra
in
t
-
B
a
se
d
Ch
a
n
n
e
l
Ro
u
ti
n
g
f
o
r
A
n
a
lo
g
a
n
d
M
ix
e
d
A
n
a
lo
g
/Dig
it
a
l
Circu
it
s,”
IEE
E
T
ra
n
sa
c
ti
o
n
s
o
n
Co
mp
u
ter
-
Ai
d
e
d
De
sig
n
o
f
In
teg
ra
ted
Circ
u
it
s
a
n
d
S
y
ste
ms
,
v
o
l
.
1
2
,
n
o
.
4
,
p
p
.
4
9
7
-
5
1
0
,
A
p
ril
1
9
9
3
.
[1
5
]
A
h
m
e
d
Na
b
ih
Zak
i
Ra
sh
e
d
e
t
a
l.
,
“
T
h
e
s
w
it
c
h
in
g
o
f
o
p
to
e
lec
tro
n
i
c
s
to
f
u
ll
o
p
ti
c
a
l
c
o
m
p
u
ti
n
g
o
p
e
r
a
ti
o
n
s
b
a
se
d
o
n
n
o
n
li
n
e
a
r
m
e
ta
m
a
teria
ls,
”
Res
u
lt
s
in
Ph
y
sic
s
,
Vo
l.
1
3
,
A
rti
c
le
1
0
2
1
5
2
,
Ju
n
e
2
0
1
9
,
h
tt
p
s:
/
/d
o
i.
o
rg
/1
0
.
1
0
1
6
/j
.
ri
n
p
.
2
0
1
9
.
0
2
.
0
8
8
.
[1
6
]
P
.
S
a
x
e
n
a
,
a
n
d
C
.
L
.
L
i
u
,
“
A
P
o
s
t
p
r
o
c
e
s
s
i
n
g
A
lg
o
r
i
t
h
m
f
o
r
C
r
o
ss
t
a
lk
-
D
r
iv
e
n
W
i
re
P
e
r
t
u
r
b
a
t
i
o
n
,
”
I
E
EE
T
r
a
n
s
a
c
t
i
o
n
s
o
n
C
o
m
p
u
t
e
r
-
A
i
d
e
d
D
e
s
i
g
n
o
f
I
n
t
e
g
r
a
t
e
d
C
i
r
c
u
i
t
s
a
n
d
S
y
s
t
e
m
s
,
v
o
l
.
1
9
,
n
o
.
6
,
p
p
.
6
9
1
-
7
0
2
,
J
u
n
e
2
0
0
0
.
[1
7
]
T
.
Ga
o
,
a
n
d
C.
L
.
L
iu
,
“
M
in
im
u
m
Cro
ss
talk
Ch
a
n
n
e
l
R
o
u
ti
n
g
,
”
IEE
E
T
ra
n
sa
c
ti
o
n
s
o
n
C
o
mp
u
ter
-
Ai
d
e
d
De
sig
n
,
v
o
l
.
1
5
,
n
o
.
5
,
p
p
.
4
6
5
-
4
7
4
,
M
a
y
1
9
9
6
.
[1
8
]
H.
Zh
o
u
,
a
n
d
D.F
.
W
o
n
g
,
“
A
n
Op
ti
m
a
l
A
l
g
o
rit
h
m
f
o
r
Riv
e
r
Ro
u
ti
n
g
w
it
h
Cro
ss
talk
Co
n
stra
in
ts,
”
Pro
c
e
e
d
in
g
s
o
f
th
e
In
ter
n
a
ti
o
n
a
l
C
o
n
fer
e
n
c
e
o
n
Co
mp
u
ter
-
Ai
d
e
d
De
sig
n
,
p
p
.
3
1
0
-
3
1
5
,
No
v
.
1
9
9
6
.
[1
9
]
A
h
m
e
d
N
a
b
ih
Zak
i
Ra
sh
e
d
e
t
a
l
.
,
“
P
e
rf
o
rm
a
n
c
e
Ev
a
lu
a
ti
o
n
o
f
S
A
C
-
OC
DMA
S
y
ste
m
in
F
re
e
S
p
a
c
e
Op
ti
c
s
a
n
d
Op
ti
c
a
l
F
ib
e
r
S
y
ste
m
Ba
se
d
o
n
Diff
e
r
e
n
t
Ty
p
e
s
o
f
Co
d
e
s”
W
ire
l
e
ss
Per
so
n
a
l
Co
mm
u
n
ica
ti
o
n
s
J
o
u
rn
a
l
,
S
p
rin
g
e
r
P
u
b
l
ish
e
r,
P
u
b
li
sh
e
d
o
n
li
n
e
1
7
M
a
y
2
0
1
7
,
V
o
l
.
9
6
,
N
o
.
2
,
p
p
.
2
8
4
3
-
2
8
6
1
,
S
e
p
.
2
0
1
7
.
[2
0
]
K.
Jh
a
n
g
e
t
a
l.
,
“
CO
P
:
A
Cro
ss
talk
Op
ti
m
iz
e
r
f
o
r
G
rid
d
e
d
Ch
a
n
n
e
l
Ro
u
ti
n
g
”
,
IEE
E
T
ra
n
sa
c
ti
o
n
s
o
n
C
o
mp
u
ter
-
Ai
d
e
d
De
sig
n
o
f
In
teg
ra
te
d
Circ
u
it
s a
n
d
S
y
ste
ms
,
v
o
l.
1
5
,
n
o
.
4
,
p
p
.
4
2
4
-
4
2
9
,
A
p
ril
1
9
9
6
.
[2
1
]
M
.
M
o
u
d
ia,
M
.
Ot
h
m
a
n
,
“
G
r
e
e
d
y
Z
e
ro
A
lg
o
rit
h
m
s
f
o
r
Co
n
f
li
c
t
-
F
re
e
S
c
h
e
d
u
li
n
g
in
L
o
w
S
tag
e
I
n
terc
o
n
n
e
c
ti
o
n
Ne
tw
o
rk
,
”
Pro
c
e
d
ia
Co
mp
u
ter
S
c
ien
c
e
,
Vo
l.
5
9
,
p
p
.
1
0
6
-
1
1
4
,
2
0
1
5
.
[
2
2
]
G
.
S
h
a
n
m
u
g
a
m
,
e
t
a
l.
,
“
M
e
ta
h
e
u
risti
c
a
lg
o
rit
h
m
s
f
o
r
v
e
h
icle
ro
u
ti
n
g
p
ro
b
lem
w
it
h
sto
c
h
a
stic d
e
m
a
n
d
s,”
J
o
u
rn
a
l
o
f
Co
mp
u
ter
S
c
ien
c
e
,
V
o
l.
7
,
p
p
.
5
3
3
-
5
4
2
,
2
0
1
1
.
[2
3
]
M
.
A
l
-
S
h
a
b
i,
M
.
Oth
m
a
n
,
“
A
n
e
w
a
lg
o
rit
h
m
f
o
r
ro
u
ti
n
g
a
n
d
sc
h
e
d
u
li
n
g
in
o
p
ti
c
a
l
o
m
e
g
a
n
e
tw
o
rk
,
”
In
ter
n
a
ti
o
n
a
l
J
o
u
rn
a
l
o
f
A
d
v
a
n
c
e
d
C
o
mp
u
ter
S
c
ien
c
e
a
n
d
Ap
p
li
c
a
t
io
n
s
,
V
o
l
.
1
6
,
No
.
1
,
p
p
.
2
6
-
3
1
,
2
0
0
8
.
[2
4
]
R.
Ba
sh
iro
v
R,
T
.
Ka
ra
n
ll
e
r,
“
On
p
a
th
d
e
p
e
n
d
e
n
t
lo
ss
a
n
d
s
w
it
c
h
c
ro
ss
talk
re
d
u
c
ti
o
n
i
n
o
p
ti
c
a
l
n
e
tw
o
rk
s,”
In
fo
rm
a
t
io
n
S
c
ien
c
e
s
,
Vo
l.
1
8
0
,
N
o
.
6
,
p
p
.
1
0
4
0
-
1
0
5
0
,
2
0
1
0
.
[2
5
]
M
.
M
o
u
d
i,
M
.
Oth
m
a
n
,
“
A
Co
st
-
Eff
e
c
ti
v
e
A
rc
h
it
e
c
tu
re
f
o
r
Op
ti
c
a
l
M
u
lt
istag
e
In
terc
o
n
n
e
c
ti
o
n
Ne
t
w
o
rk
,
”
J
o
u
rn
a
l
o
f
Ne
two
rk
s
,
V
o
l.
8
,
No
.
2
,
p
p
.
3
4
5
-
3
5
0
,
2
0
1
3
.
[2
6
]
IS
Am
iri
e
t
a
l.
,
“
Hig
h
-
S
p
e
e
d
L
ig
h
t
S
o
u
rc
e
s
in
Hig
h
-
S
p
e
e
d
Op
ti
c
a
l
P
a
ss
iv
e
L
o
c
a
l
A
re
a
Co
m
m
u
n
ica
ti
o
n
Ne
tw
o
rk
s,”
J
o
u
rn
a
l
o
f
Op
t
ica
l
C
o
mm
u
n
ica
ti
o
n
s
,
Vo
l.
0
,
Iss
u
e
0
,
P
u
b
li
s
h
e
d
O
n
li
n
e
:
2
0
A
p
ril
2
0
1
9
,
h
tt
p
s://
d
o
i.
o
rg
/1
0
.
1
5
1
5
/j
o
c
-
2
0
1
9
-
0
0
7
0
.
[
2
7
]
IS
A
m
iri
e
t
a
l.
,
“
S
p
a
t
ial
Co
n
ti
n
u
o
u
s
W
a
v
e
L
a
se
r
a
n
d
S
p
a
ti
o
tem
p
o
ra
l
V
CS
EL
f
o
r
Hig
h
-
S
p
e
e
d
L
o
n
g
Ha
u
l
Op
ti
c
a
l
W
irele
ss
Co
m
m
u
n
ica
ti
o
n
Ch
a
n
n
e
ls,
”
J
o
u
rn
a
l
o
f
Op
ti
c
a
l
Co
mm
u
n
ica
ti
o
n
s
,
V
o
l.
0
,
Iss
u
e
0
,
P
u
b
li
sh
e
d
On
li
n
e
:
2
4
A
p
ril
2
0
1
9
,
h
tt
p
s://
d
o
i.
o
rg
/1
0
.
1
5
1
5
/j
o
c
-
2019
-
0061
.
[
2
8
]
IS
A
m
iri
e
t
a
l.
,
“
In
f
lu
e
n
c
e
o
f
L
o
a
d
in
g
,
Re
g
e
n
e
ra
ti
o
n
a
n
d
Re
c
a
ll
in
g
El
e
m
e
n
ts
P
ro
c
e
ss
e
s
o
n
th
e
S
y
ste
m
Be
h
a
v
io
r
o
f
A
ll
Op
ti
c
a
l
Da
ta
Bu
s
L
in
e
S
y
ste
m
Ra
n
d
o
m
A
c
c
e
ss
M
e
m
o
ry
,
”
J
o
u
rn
a
l
o
f
Op
ti
c
a
l
Co
mm
u
n
ica
ti
o
n
s
,
V
o
l.
0
,
Iss
u
e
0
,
P
u
b
li
sh
e
d
On
li
n
e
:
1
5
A
u
g
u
st 2
0
1
9
,
h
tt
p
s://
d
o
i.
o
rg
/1
0
.
1
5
1
5
/j
o
c
-
2019
-
0163
.
[
2
9
]
IS
A
m
iri
e
t
a
l.
,
“
T
h
e
En
g
a
g
e
m
e
n
t
o
f
Hy
b
rid
Ultra
Hig
h
S
p
a
c
e
Div
isio
n
M
u
lt
ip
lex
in
g
w
it
h
M
a
x
im
u
m
T
im
e
Div
isio
n
M
u
lt
ip
lex
in
g
T
e
c
h
n
iq
u
e
s
f
o
r
Hig
h
-
S
p
e
e
d
S
in
g
le
-
M
o
d
e
F
ib
e
r
Ca
b
le
S
y
ste
m
s,”
J
o
u
rn
a
l
o
f
Op
ti
c
a
l
Co
mm
u
n
ica
ti
o
n
s
,
V
o
l.
0
,
Iss
u
e
0
,
P
u
b
li
sh
e
d
On
li
n
e
:
1
9
O
c
t.
2
0
1
9
,
h
tt
p
s://
d
o
i.
o
rg
/1
0
.
1
5
1
5
/j
o
c
-
2019
-
0205
.
[
3
0
]
IS
A
m
iri
e
t
a
l.
,
“
P
e
rf
o
rm
a
n
c
e
En
h
a
n
c
e
m
e
n
t
o
f
F
ib
e
r
Op
ti
c
a
n
d
Op
ti
c
a
l
W
irele
ss
Co
m
m
u
n
ica
ti
o
n
Ch
a
n
n
e
ls
b
y
Us
in
g
F
o
rw
a
rd
Err
o
r
Co
rre
c
ti
o
n
Co
d
e
s,”
J
o
u
r
n
a
l
o
f
Op
ti
c
a
l
Co
mm
u
n
ica
ti
o
n
s
,
V
o
l.
0
,
Iss
u
e
0
,
P
u
b
li
sh
e
d
On
li
n
e
:
2
4
De
c
.
2
0
1
9
,
h
tt
p
s://
d
o
i.
o
rg
/1
0
.
1
5
1
5
/j
o
c
-
2019
-
0191
.
[3
1
]
IS
Am
iri
e
t
a
l.
,
“
Co
m
p
a
ra
ti
v
e
S
im
u
latio
n
S
tu
d
y
o
f
M
u
lt
i
S
tag
e
H
y
b
rid
A
ll
Op
ti
c
a
l
F
ib
e
r
Am
p
li
f
iers
in
Op
ti
c
a
l
Co
m
m
u
n
ica
ti
o
n
s,”
J
o
u
r
n
a
l
o
f
Op
ti
c
a
l
C
o
mm
u
n
ica
ti
o
n
s
,
Vo
l.
0
,
Iss
u
e
0
,
P
u
b
li
s
h
e
d
On
li
n
e
:
4
F
e
b
.
2
0
2
0
,
h
tt
p
s:/
/d
o
i.
o
rg
/1
0
.
1
5
1
5
/j
o
c
-
2
0
1
9
-
0
1
3
2
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
2
5
0
2
-
4752
I
n
d
o
n
esia
n
J
E
lec
E
n
g
&
C
o
m
p
Sci,
Vo
l.
19
,
No
.
2
,
A
u
g
u
s
t
20
20
:
8
4
7
-
854
854
B
I
O
G
RAP
H
I
E
S O
F
AUTH
O
RS
Dr
.
Aa
d
e
l
Ala
tw
i
w
a
s
b
o
rn
i
n
T
a
b
u
k
,
S
a
u
d
i
A
ra
b
ia,
in
1
9
8
0
.
He
re
c
e
iv
e
d
th
e
B.
S
.
d
e
g
re
e
f
ro
m
Kin
g
A
b
d
u
l
-
A
z
iz
Un
iv
e
rsit
y
,
Je
d
d
a
h
,
S
a
u
d
i
A
ra
b
ia,
in
2
0
0
4
,
th
e
M
.
S
.
a
n
d
P
h
.
D
d
e
g
re
e
s
f
ro
m
G
ri
ff
it
h
Un
iv
e
rsity
,
Brisb
a
n
e
,
A
u
stra
li
a
,
in
2
0
0
8
a
n
d
2
0
1
8
re
sp
e
c
t
iv
e
l
y
,
b
o
th
in
c
o
m
m
u
n
ica
ti
o
n
e
n
g
in
e
e
rin
g
.
He
is
c
u
rre
n
tl
y
a
ss
istan
t
p
ro
f
e
ss
o
r
in
t
h
e
S
c
h
o
o
l
o
f
En
g
in
e
e
ri
n
g
a
t
T
a
b
u
k
Un
iv
e
rsit
y
,
T
a
b
u
k
,
S
a
u
d
i
A
r
a
b
ia.
His
c
u
rre
n
t
re
s
e
a
rc
h
in
tere
sts
in
c
lu
d
e
sp
e
e
c
h
c
o
d
in
g
,
sp
e
e
c
h
a
n
d
sp
e
a
k
e
r
re
c
o
g
n
it
io
n
,
sp
e
e
c
h
e
n
h
a
n
c
e
m
e
n
t,
fa
c
e
r
e
c
o
g
n
it
io
n
,
im
a
g
e
c
o
d
in
g
,
p
a
tt
e
rn
re
c
o
g
n
it
io
n
a
n
d
a
rti
f
icia
l
n
e
u
ra
l
n
e
tw
o
rk
s.
As
so
c
.
P
r
o
f.
A
h
m
e
d
N
a
b
i
h
Za
k
i
R
a
s
h
e
d
w
a
s
b
o
rn
in
M
e
n
o
u
f
c
it
y
,
M
e
n
o
u
f
ia
S
tate
,
Eg
y
p
t
c
o
u
n
try
in
2
3
Ju
ly
1
9
7
6
.
Re
c
e
iv
e
d
th
e
B.
S
c
.
,
M
.
S
c
.
,
a
n
d
P
h
.
D.
sc
ien
ti
f
ic
d
e
g
re
e
s
in
th
e
El
e
c
tro
n
ics
a
n
d
El
e
c
tri
c
a
l
Co
m
m
u
n
ica
ti
o
n
s
E
n
g
in
e
e
rin
g
De
p
a
rtm
e
n
t
f
ro
m
F
a
c
u
lt
y
o
f
El
e
c
tro
n
ic
En
g
in
e
e
rin
g
,
M
e
n
o
u
f
ia
Un
iv
e
r
sity
in
1
9
9
9
,
2
0
0
5
,
a
n
d
2
0
1
0
re
sp
e
c
ti
v
e
l
y
.
Cu
rre
n
tl
y
,
h
is
jo
b
c
a
rrier
is
a
sc
ien
ti
f
ic
lec
tu
re
r
in
El
e
c
tro
n
ics
a
n
d
El
e
c
tri
c
a
l
Co
m
m
u
n
ica
ti
o
n
s
En
g
i
n
e
e
rin
g
De
p
a
rtme
n
t,
F
a
c
u
lt
y
o
f
El
e
c
tro
n
ic
En
g
in
e
e
rin
g
,
M
e
n
o
u
f
ia
u
n
iv
e
rsity
,
M
e
n
o
u
f
.
P
o
sta
l
M
e
n
o
u
f
c
it
y
c
o
d
e
:
3
2
9
5
1
,
EG
YP
T
.
His
sc
ien
ti
f
ic
m
a
ste
r
s
c
ien
c
e
th
e
sis
h
a
s
f
o
c
u
se
d
o
n
p
o
ly
m
e
r
f
ib
e
rs
in
o
p
ti
c
a
l
a
c
c
e
ss
c
o
m
m
u
n
ica
ti
o
n
s
y
ste
m
s.
M
o
re
o
v
e
r,
h
is
sc
ien
ti
f
ic
P
h
.
D.
th
e
sis
h
a
s
f
o
c
u
se
d
o
n
re
c
e
n
t
a
p
p
li
c
a
ti
o
n
s
in
li
n
e
a
r
o
r
n
o
n
li
n
e
a
r
p
a
ss
iv
e
o
r
a
c
ti
v
e
in
o
p
ti
c
a
l
n
e
tw
o
rk
s.
H
is
in
tere
stin
g
re
se
a
rc
h
m
a
in
l
y
f
o
c
u
se
s
o
n
tran
s
m
issio
n
c
a
p
a
c
it
y
,
a
d
a
ta
ra
te
p
ro
d
u
c
t
a
n
d
l
o
n
g
tran
sm
issio
n
d
istan
c
e
s
o
f
p
a
ss
iv
e
a
n
d
a
c
ti
v
e
o
p
ti
c
a
l
c
o
m
m
u
n
ica
ti
o
n
n
e
tw
o
rk
s,
w
irele
ss
c
o
m
m
u
n
ica
ti
o
n
,
ra
d
i
o
o
v
e
r
f
ib
e
r
c
o
m
m
u
n
ica
ti
o
n
sy
ste
m
s,
a
n
d
o
p
t
ica
l
n
e
tw
o
rk
s
e
c
u
rit
y
a
n
d
m
a
n
a
g
e
m
e
n
t.
He
h
a
s
p
u
b
li
sh
e
d
m
o
re
th
a
n
2
2
0
p
u
b
li
sh
e
d
sc
ien
ti
f
ic
p
a
p
e
rs
in
in
ter
n
a
ti
o
n
a
l
jo
u
rn
a
ls
a
n
d
c
o
n
f
e
re
n
c
e
s.
He
h
a
s
p
u
b
li
sh
e
d
m
a
n
y
h
ig
h
sc
ie
n
ti
f
ic
re
se
a
rc
h
p
a
p
e
rs
in
h
ig
h
q
u
a
li
ty
a
n
d
tec
h
n
ica
l
in
tern
a
ti
o
n
a
l
jo
u
r
n
a
ls
in
th
e
f
ield
o
f
a
d
v
a
n
c
e
d
c
o
m
m
u
n
ica
ti
o
n
s
y
ste
m
s,
o
p
to
e
l
e
c
tro
n
ic
d
e
v
ice
s,
a
n
d
p
a
ss
iv
e
o
p
ti
c
a
l
a
c
c
e
ss
c
o
m
m
u
n
ica
ti
o
n
n
e
tw
o
rk
s.
His
a
re
a
s
o
f
in
tere
s
t
a
n
d
e
x
p
e
rien
c
e
in
o
p
ti
c
a
l
c
o
m
m
u
n
ica
ti
o
n
sy
st
e
m
s
a
d
v
a
n
c
e
d
o
p
t
ica
l
c
o
m
m
u
n
ica
ti
o
n
n
e
tw
o
rk
s,
w
irele
ss
o
p
ti
c
a
l
a
c
c
e
s
s
n
e
tw
o
rk
s,
a
n
a
lo
g
c
o
m
m
u
n
ica
ti
o
n
sy
st
e
m
s,
o
p
ti
c
a
l
f
il
ters
a
n
d
S
e
n
s
o
rs.
A
s
w
e
ll
a
s
h
e
is
e
d
it
o
r
ial
b
o
a
rd
m
e
m
b
e
r
in
h
ig
h
a
c
a
d
e
m
i
c
sc
ien
ti
f
ic
In
tern
a
ti
o
n
a
l
re
se
a
rc
h
Jo
u
rn
a
ls.
M
o
re
o
v
e
r,
h
e
is
a
re
v
ie
w
e
r
m
e
m
b
e
r
in
h
ig
h
i
m
p
a
c
t
sc
i
e
n
ti
f
ic
r
e
se
a
r
c
h
in
tern
a
ti
o
n
a
l
jo
u
rn
a
ls
in
th
e
f
ield
o
f
e
lec
tro
n
ics
,
e
lec
tri
c
a
l
c
o
m
m
u
n
ic
a
ti
o
n
sy
ste
m
s,
o
p
to
e
lec
tro
n
ics
,
in
f
o
rm
a
ti
o
n
tec
h
n
o
l
o
g
y
a
n
d
a
d
v
a
n
c
e
d
o
p
ti
c
a
l
c
o
m
m
u
n
ica
ti
o
n
s
y
ste
m
s
a
n
d
n
e
tw
o
rk
s.
His
p
e
r
so
n
a
l
e
lec
tro
n
ic
m
a
il
ID
(E
-
m
a
il
:ah
m
e
d
_
7
3
3
@y
a
h
o
o
.
c
o
m
).
His
p
u
b
li
sh
e
d
p
a
p
e
r
u
n
d
e
r
th
e
ti
tl
e
"
Hig
h
re
li
a
b
i
li
t
y
o
p
ti
c
a
l
in
terc
o
n
n
e
c
ti
o
n
s
f
o
r
sh
o
rt
ra
n
g
e
a
p
p
li
c
a
ti
o
n
s
in
h
ig
h
p
e
rf
o
r
m
a
n
c
e
o
p
ti
c
a
l
c
o
m
m
u
n
ica
ti
o
n
s
y
ste
m
s"
in
Op
ti
c
s
a
n
d
L
a
se
r
T
e
c
h
n
o
lo
g
y
,
El
se
v
ier
P
u
b
li
s
h
e
r
h
a
s
a
c
h
iev
e
d
m
o
st
p
o
p
u
lar
d
o
w
n
lo
a
d
a
rti
c
les
i
n
2
0
1
3
.
En
g
.
Ah
m
e
d
M
.
El
-
Er
a
k
i
wa
s
b
o
rn
i
n
E
l
-
Zag
a
z
ig
,
A
l
-
S
h
a
rk
y
a
,
Eg
y
p
t
in
1
2
M
a
rc
h
,
1
9
8
8
.
Re
c
e
iv
e
d
th
e
B.
S
c
.
sc
ien
ti
f
ic
d
e
g
re
e
in
th
e
El
e
c
tro
n
ics
a
n
d
Co
m
m
u
n
ica
ti
o
n
s
En
g
in
e
e
ri
n
g
De
p
a
rtme
n
t
f
ro
m
F
a
c
u
lt
y
o
f
e
n
g
in
e
e
rin
g
S
in
a
i
Un
iv
e
rsity
,
Eg
y
p
t
2
0
1
1
.
M
a
ste
r
De
g
re
e
in
El
e
c
tro
n
ics
a
n
d
C
o
m
m
u
n
ica
ti
o
n
s E
n
g
i
n
e
e
rin
g
De
p
a
rtm
e
n
t
f
ro
m
F
a
c
u
lt
y
o
f
e
lec
tri
c
a
l
e
n
g
in
e
e
rin
g
M
e
n
o
u
f
,
M
e
n
o
f
ia
Un
iv
e
rsity
.
Cu
rre
n
t
ly
,
h
is
jo
b
c
a
rrier
is
T
e
a
c
h
e
r
A
s
sista
n
t
in
tele
c
o
m
m
u
n
ica
ti
o
n
s
En
g
in
e
e
rin
g
De
p
a
rt
m
e
n
t,
F
a
c
u
lt
y
o
f
En
g
in
e
e
rin
g
,
Eg
y
p
ti
a
n
Ru
ss
ian
u
n
iv
e
rsity
,
Ba
d
r
c
it
y
,
Ca
iro
Eg
y
p
t
.
Dr
.
IS
A
m
iri
h
a
s
b
e
e
n
d
o
i
n
g
re
se
a
r
c
h
o
n
se
v
e
ra
l
to
p
ics
su
c
h
a
s
th
e
o
p
t
ica
l
so
li
t
o
n
c
o
m
m
u
n
ica
ti
o
n
s,
las
e
r
p
h
y
sic
s
,
f
ib
e
r
las
e
rs,
f
ib
e
r
g
ra
ti
n
g
,
e
lec
tro
-
o
p
ti
c
a
l
m
o
d
u
lat
o
rs,
n
a
n
o
f
a
b
rica
ti
o
n
s,
se
m
ico
n
d
u
c
t
o
r
d
e
sig
n
a
n
d
m
o
d
e
ll
in
g
,
L
u
m
e
rica
l
m
o
d
e
ll
in
g
,
p
las
m
o
n
ics
p
h
o
to
n
ics
d
e
v
ice
s,
n
o
n
li
n
e
a
r
fib
e
r
o
p
t
ics
,
o
p
t
o
e
lec
tro
n
ics
d
e
v
ice
s
u
sin
g
2
D
m
a
teri
a
ls,
se
m
ico
n
d
u
c
to
r
w
a
v
e
g
u
id
e
d
e
sig
n
a
n
d
f
a
b
rica
ti
o
n
s
,
p
h
o
t
o
li
t
h
o
g
ra
p
h
y
f
a
b
rica
ti
o
n
s,
E
Be
a
m
li
th
o
g
ra
p
h
y
,
q
u
a
n
t
u
m
c
r
y
p
to
g
ra
p
h
y
a
n
d
n
a
n
o
tec
h
n
o
lo
g
y
e
n
g
in
e
e
ri
n
g
.
Evaluation Warning : The document was created with Spire.PDF for Python.