Optimizing Deadline-Driven Bulk-Data Transfer to Revitalize Spectrum Fragments in EONs [Invited]

Wei Lu; Zuqing Zhu; Biswanath Mukherjee

doi:10.1364/JOCN.7.00B173

Dynamic Service Provisioning for Hybrid FO-Rs/DO-Rs

1 Phase I: (Network Initialization)

2 for all

s - d

pairs in

G (V, E)

,

s, d \in V

do

3 calculate

K

-shortest routing path candidates;

4 store them in set

{p_{s, d}^{k} : k = 1,2, \dots, K}

;

5 end

6 End

7 Phase II: (Dynamic Network Operation)

8 for

t_{c} \in [1, T]

do

9 serve all FO-Rs arriving at

t_{c}

;

10 get set

{C_{e, t} : e \in E, t \in [t_{c}, T]}

;

11 sort pending DO-Rs, including both old and new ones in ascending order of

{t_{e}^{r}}

;

12 for each DO-R

r

do

13 find

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

at

t_{c}

;

14 configure lightpath for data transfer;

15 if DO-R

r

is fully served or blocked then

16 remove DO-R

r

from pending DO-R set;

17 end

18 end

19 end

20 End

MTDG Service Provisioning for DO-R r

Input:

t_{e}^{r}

,

t_{c}

,

{C_{e, t} : e \in E, t \in [t_{c}, T]}

,

N_{\min}^{r}

,

m^{r}

,

F_{u}^{r}

,

{ϑ_{t_{c} - 1}^{r}, p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

,

{p_{s^{r}, d^{r}}^{k}}

;

Output:

m^{r}

,

F_{u}^{r}

,

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

;

1 if

m^{r} < t_{e}^{r} - t_{c} + 1

then

2 if

ϑ_{t_{c} - 1}^{r} = 1

and

{p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

is still available at

t_{c}

then

3

ϑ_{t_{c}}^{r} = 1

,

m^{r} = m^{r}

;

4

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}, t_{c} - 1}

;

5

[f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}] = [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]

;

6

F_{u}^{r} = \max (F_{u}^{r} - (f_{e, t_{c} - 1}^{r} - f_{s, t_{c} - 1}^{r} + 1), 0)

;

7 else

8 if

m^{r} > 0

then

9 find the largest available FS block over all the path candidates with Eq. (20);

10 if the FS block’s size is larger than

\min (N_{\min}^{r}, F_{u}^{r})

then

11 tailor a just-enough FS block with first fit and use it for the data transfer;

12 set

{p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

accordingly;

13

ϑ_{t_{c}}^{r} = 1

,

m^{r} = m^{r} - 1

;

14

F_{u}^{r} = F_{u}^{r} - (f_{e, t_{c}}^{r} - f_{s, t_{c}}^{r} + 1)

;

15 else

16 pause the data transfer;

17

ϑ_{t_{c}}^{r} = 0

,

m^{r} = m^{r}

,

F_{u}^{r} = F_{u}^{r}

;

18 end

19 else

20 if

F_{u}^{r} > 0

then

21

ϑ_{t_{c}}^{r} = 0

,

m^{r} = m^{r}

,

F_{u}^{r} = F_{u}^{r}

;

22 report DO-R

r

as incomplete;

23 return;

24 end

25 end

26 end

27 else

28 choose the largest available FS block over all the path candidates with Eq. (20);

29 tailor a just-enough FS block with first fit and use it for the data transfer;

30 set

{p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

accordingly;

31

ϑ_{t_{c}}^{r} = 1

,

m^{r} = m^{r} - 1

;

32

F_{u}^{r} = F_{u}^{r} - (f_{e, t_{c}}^{r} - f_{s, t_{c}}^{r} + 1)

;

33 end

34 if

F_{u}^{r} = 0

then

35 report the DO-R as served completely;

36 return;

37 else

38 if

t_{c} = t_{e}^{r}

then

39 report the DO-R as incomplete;

40 return;

41 end

42 end

Blocking-Aware RSA for DO-Rs

Input:

t_{c}

,

{C_{e, t} : e \in E, t \in [t_{c}, T]}

,

t_{a}^{r}

,

t_{e}^{r}

,

m^{r}

,

{ϑ_{t_{c} - 1}^{r}, p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

,

F^{r}

,

F_{u}^{r}

,

{p_{s^{r}, d^{r}}^{k}}

,

{ϖ_{t, t_{e}^{r}, m^{r}}, ϖ_{t, t_{e}^{r}, m^{r} - 1} : t \in [t_{c}, t_{e}^{r}]}

;

Output:

m^{r}

,

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

,

F_{u}^{r}

;

1

i = 0

;

2 if

t_{c} > t_{a}^{r}

, and

ϑ_{t_{c} - 1}^{r} = 1

, and

{p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

is still available at

t_{c}

then

3

i = i + 1

;

4

F_{u, i}^{r} = \max (F_{u}^{r} - (f_{e, t_{c} - 1}^{r} - f_{s, t_{c} - 1}^{r} + 1), 0)

;

5 if

F_{u, i}^{r} = 0

then

6

ϑ_{t_{c}}^{r} = 1

,

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}, t_{c} - 1}

;

7

[f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}] = [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]

;

8 report DO-R

r

as served completely;

9 return;

10 else

11

p_{s^{r}, d^{r}, t_{c}, i} = p_{s^{r}, d^{r}, t_{c} - 1}

;

12

[f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}] = [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]

;

13

m_{i}^{r} = m^{r}, ϑ_{t_{c}, i}^{r} = 1

;

14 calculate

Δ_{i}^{r}

with Algorithm 4;

15 end

16 end

17

i = i + 1

;

18 set

m_{i}^{r}

,

{ϑ_{t_{c}, i}^{r}, p_{s^{r}, d^{r}, t_{c}, i}, [f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}]}

,

F_{u, i}^{r}

according to the outputs of DPM when calculating

ϖ_{t_{c}, t_{e}^{r}, m^{r}}

;

19 if

F_{u, i}^{r} = 0

then

20

ϑ_{t_{c}}^{r} = 1

,

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}, t_{c}, i}

;

21

f_{s, t_{c}}^{r} = f_{s, t_{c}, i}^{r}, f_{e, t_{c}}^{r} = f_{s, t_{c}, i}^{r} + F_{u}^{r} - 1

;

22 report the DO-R as served completely;

23 return;

24 else

25 calculate

Δ_{i}^{r}

with Algorithm 4;

26 end

27 if

m^{r} > 0

then

28 for each

p_{s^{r}, d^{r}}^{k}

in ascending order of hop count do

29 find all the available FS blocks on

p_{s^{r}, d^{r}}^{k}

and store them in set

{[f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}, n}^{r, k}]}

;

30 for each

[f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}, n}^{r, k}]

do

31

i = i + 1

;

32

F_{u, i}^{r} = \max (F_{u}^{r} - (f_{e, t_{c} - 1}^{r} - f_{s, t_{c} - 1}^{r} + 1), 0)

;

33 if

F_{u, i}^{r} = 0

then

34

ϑ_{t_{c}}^{r} = 1

,

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}}^{k}

;

35

f_{s, t_{c}}^{r} = f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}}^{r} = f_{s, t_{c}}^{r} + F_{u}^{r} - 1

;

36 report the DO-R as served completely;

37 return;

38 else

39

p_{s^{r}, d^{r}, t_{c}, i} = p_{s^{r}, d^{r}}^{k}

;

40

[f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}] = [f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}, n}^{r, k}]

;

41

m_{i}^{r} = m^{r} - 1, ϑ_{t_{c}, i}^{r} = 1

;

42 calculate

Δ_{i}^{r}

with Algorithm 4;

43 end

44 end

45 end

46 end

47 select the RSA candidate with the largest

Δ_{i}^{r}

;

48 set

m^{r}

,

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

,

F_{u}^{r}

accordingly;

Results From Simulations for Offline Optimization

	Incompletion Ratio of DO-Rs				Average Percentage $η^{T}$				Average Running Time (s)
			MTDG				MTDG				MTDG
$\| D \|$	MILP	AC + BA	$γ = 0$	$γ = 0.6$	MILP	AC + BA	$γ = 0$	$γ = 0.6$	MILP	AC + BA	$γ = 0$	$γ = 0.6$
1	0.00%	0.00%	0.00%	100.00%	100.00%	100.00%	100.00%	72.14%	0.2467	0.0374	0.0128	0.0119
2	50.00%	50.00%	50.00%	50.00%	89.29%	50.00%	89.29%	75.00%	0.5461	0.0459	0.0143	0.0136
3	33.33%	33.33%	33.33%	33.33%	82.98%	66.67%	79.14%	77.57%	2.3383	0.0464	0.0163	0.0146
4	50.00%	50.00%	75.00%	100.00%	72.46%	50.00%	67.46%	60.55%	428.6296	0.0646	0.0171	0.0182

Algorithm 1

Dynamic Service Provisioning for Hybrid FO-Rs/DO-Rs

1 Phase I: (Network Initialization)

2 for all

s - d

pairs in

G (V, E)

,

s, d \in V

do

3 calculate

K

-shortest routing path candidates;

4 store them in set

{p_{s, d}^{k} : k = 1,2, \dots, K}

;

5 end

6 End

7 Phase II: (Dynamic Network Operation)

8 for

t_{c} \in [1, T]

do

9 serve all FO-Rs arriving at

t_{c}

;

10 get set

{C_{e, t} : e \in E, t \in [t_{c}, T]}

;

11 sort pending DO-Rs, including both old and new ones in ascending order of

{t_{e}^{r}}

;

12 for each DO-R

r

do

13 find

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

at

t_{c}

;

14 configure lightpath for data transfer;

15 if DO-R

r

is fully served or blocked then

16 remove DO-R

r

from pending DO-R set;

17 end

18 end

19 end

20 End

Algorithm 2

MTDG Service Provisioning for DO-R r

Input:

t_{e}^{r}

,

t_{c}

,

{C_{e, t} : e \in E, t \in [t_{c}, T]}

,

N_{\min}^{r}

,

m^{r}

,

F_{u}^{r}

,

{ϑ_{t_{c} - 1}^{r}, p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

,

{p_{s^{r}, d^{r}}^{k}}

;

Output:

m^{r}

,

F_{u}^{r}

,

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

;

1 if

m^{r} < t_{e}^{r} - t_{c} + 1

then

2 if

ϑ_{t_{c} - 1}^{r} = 1

and

{p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

is still available at

t_{c}

then

3

ϑ_{t_{c}}^{r} = 1

,

m^{r} = m^{r}

;

4

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}, t_{c} - 1}

;

5

[f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}] = [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]

;

6

F_{u}^{r} = \max (F_{u}^{r} - (f_{e, t_{c} - 1}^{r} - f_{s, t_{c} - 1}^{r} + 1), 0)

;

7 else

8 if

m^{r} > 0

then

9 find the largest available FS block over all the path candidates with Eq. (20);

10 if the FS block’s size is larger than

\min (N_{\min}^{r}, F_{u}^{r})

then

11 tailor a just-enough FS block with first fit and use it for the data transfer;

12 set

{p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

accordingly;

13

ϑ_{t_{c}}^{r} = 1

,

m^{r} = m^{r} - 1

;

14

F_{u}^{r} = F_{u}^{r} - (f_{e, t_{c}}^{r} - f_{s, t_{c}}^{r} + 1)

;

15 else

16 pause the data transfer;

17

ϑ_{t_{c}}^{r} = 0

,

m^{r} = m^{r}

,

F_{u}^{r} = F_{u}^{r}

;

18 end

19 else

20 if

F_{u}^{r} > 0

then

21

ϑ_{t_{c}}^{r} = 0

,

m^{r} = m^{r}

,

F_{u}^{r} = F_{u}^{r}

;

22 report DO-R

r

as incomplete;

23 return;

24 end

25 end

26 end

27 else

28 choose the largest available FS block over all the path candidates with Eq. (20);

29 tailor a just-enough FS block with first fit and use it for the data transfer;

30 set

{p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

accordingly;

31

ϑ_{t_{c}}^{r} = 1

,

m^{r} = m^{r} - 1

;

32

F_{u}^{r} = F_{u}^{r} - (f_{e, t_{c}}^{r} - f_{s, t_{c}}^{r} + 1)

;

33 end

34 if

F_{u}^{r} = 0

then

35 report the DO-R as served completely;

36 return;

37 else

38 if

t_{c} = t_{e}^{r}

then

39 report the DO-R as incomplete;

40 return;

41 end

42 end

Algorithm 3

Admission Control for DO-Rs

Input:

t_{a}^{r}

,

t_{e}^{r}

,

t_{c}

,

{ϑ_{t_{c} - 1}^{r}, p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

,

{ϖ_{t, t_{e}^{r}, m^{r}} : t \in [t_{c}, t_{e}^{r}]}

,

F_{u}^{r}

;

1

Λ = {ϖ_{t_{c}, t_{e}^{r}, m^{r}}}

;

2 if

t_{c} > t_{a}^{r}

then

3 for

t \in [t_{c}, t_{e}^{r}]

do

4 if

ϑ_{t_{c} - 1}^{r} = 1

, and

{p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

is still available at

t

then

5

t^{'} = t + 1

;

6

ω = (f_{e, t_{c} - 1}^{r} - f_{s, t_{c} - 1}^{r} + 1) \cdot (t^{'} - t_{c})

;

7 if

t^{'} \leq t_{e}^{r}

then

8

Λ \leftarrow ϖ_{t^{'}, t_{e}^{r}, m^{r}} + ω

;

9 else

10

Λ \leftarrow ω

;

11 end

12 else

13 break;

14 end

15 end

16 end

17 if

\max (Λ) \geq F_{u}^{r}

then

18 report the DO-R as accepted;

19 else

20 report the DO-R as incompletable;

21 end

Algorithm 4

Calculating Maximum Redundancy Ratio

Input:

t_{e}^{r}

,

t_{c}

,

{ϑ_{t_{c}, i}^{r}, p_{s^{r}, d^{r}, t_{c}, i}, [f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}]}

,

F_{u, i}^{r}

,

{ϖ_{t, t_{e}^{r}, m_{i}^{r}} : t \in [t_{c}, t_{e}^{r}]}

;

Output:

Δ_{i}^{r}

;

1

Λ = {0}

;

2 if

t_{c} < t_{e}^{r}

then

3

Λ \leftarrow ϖ_{t_{c} + 1, t_{e}^{r}, m_{i}^{r}}

;

4 for

t \in [t_{c} + 1, t_{e}^{r}]

do

5 if

ϑ_{t_{c}, i}^{r} = 1

, and

{p_{s^{r}, d^{r}, t_{c}, i}, [f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}]}

is still available at

t

then

6

t^{'} = t + 1

;

7

ω = (f_{e, t_{c}, i}^{r} - f_{s, t_{c}, i}^{r} + 1) \cdot (t - t_{c})

;

8 if

t^{'} \leq t_{e}^{r}

then

9

Λ \leftarrow ϖ_{t^{'}, t_{e}^{r}, m_{i}^{r}} + ω

;

10 else

11

Λ \leftarrow ω

;

12 end

13 else

14 break;

15 end

16 end

17 end

18

Δ_{i}^{r} = \frac{\max (Λ)}{F_{u, i}^{r}}

;

Algorithm 5

Blocking-Aware RSA for DO-Rs

Input:

t_{c}

,

{C_{e, t} : e \in E, t \in [t_{c}, T]}

,

t_{a}^{r}

,

t_{e}^{r}

,

m^{r}

,

{ϑ_{t_{c} - 1}^{r}, p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

,

F^{r}

,

F_{u}^{r}

,

{p_{s^{r}, d^{r}}^{k}}

,

{ϖ_{t, t_{e}^{r}, m^{r}}, ϖ_{t, t_{e}^{r}, m^{r} - 1} : t \in [t_{c}, t_{e}^{r}]}

;

Output:

m^{r}

,

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

,

F_{u}^{r}

;

1

i = 0

;

2 if

t_{c} > t_{a}^{r}

, and

ϑ_{t_{c} - 1}^{r} = 1

, and

{p_{s^{r}, d^{r}, t_{c} - 1}, [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]}

is still available at

t_{c}

then

3

i = i + 1

;

4

F_{u, i}^{r} = \max (F_{u}^{r} - (f_{e, t_{c} - 1}^{r} - f_{s, t_{c} - 1}^{r} + 1), 0)

;

5 if

F_{u, i}^{r} = 0

then

6

ϑ_{t_{c}}^{r} = 1

,

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}, t_{c} - 1}

;

7

[f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}] = [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]

;

8 report DO-R

r

as served completely;

9 return;

10 else

11

p_{s^{r}, d^{r}, t_{c}, i} = p_{s^{r}, d^{r}, t_{c} - 1}

;

12

[f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}] = [f_{s, t_{c} - 1}^{r}, f_{e, t_{c} - 1}^{r}]

;

13

m_{i}^{r} = m^{r}, ϑ_{t_{c}, i}^{r} = 1

;

14 calculate

Δ_{i}^{r}

with Algorithm 4;

15 end

16 end

17

i = i + 1

;

18 set

m_{i}^{r}

,

{ϑ_{t_{c}, i}^{r}, p_{s^{r}, d^{r}, t_{c}, i}, [f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}]}

,

F_{u, i}^{r}

according to the outputs of DPM when calculating

ϖ_{t_{c}, t_{e}^{r}, m^{r}}

;

19 if

F_{u, i}^{r} = 0

then

20

ϑ_{t_{c}}^{r} = 1

,

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}, t_{c}, i}

;

21

f_{s, t_{c}}^{r} = f_{s, t_{c}, i}^{r}, f_{e, t_{c}}^{r} = f_{s, t_{c}, i}^{r} + F_{u}^{r} - 1

;

22 report the DO-R as served completely;

23 return;

24 else

25 calculate

Δ_{i}^{r}

with Algorithm 4;

26 end

27 if

m^{r} > 0

then

28 for each

p_{s^{r}, d^{r}}^{k}

in ascending order of hop count do

29 find all the available FS blocks on

p_{s^{r}, d^{r}}^{k}

and store them in set

{[f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}, n}^{r, k}]}

;

30 for each

[f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}, n}^{r, k}]

do

31

i = i + 1

;

32

F_{u, i}^{r} = \max (F_{u}^{r} - (f_{e, t_{c} - 1}^{r} - f_{s, t_{c} - 1}^{r} + 1), 0)

;

33 if

F_{u, i}^{r} = 0

then

34

ϑ_{t_{c}}^{r} = 1

,

p_{s^{r}, d^{r}, t_{c}} = p_{s^{r}, d^{r}}^{k}

;

35

f_{s, t_{c}}^{r} = f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}}^{r} = f_{s, t_{c}}^{r} + F_{u}^{r} - 1

;

36 report the DO-R as served completely;

37 return;

38 else

39

p_{s^{r}, d^{r}, t_{c}, i} = p_{s^{r}, d^{r}}^{k}

;

40

[f_{s, t_{c}, i}^{r}, f_{e, t_{c}, i}^{r}] = [f_{s, t_{c}, n}^{r, k}, f_{e, t_{c}, n}^{r, k}]

;

41

m_{i}^{r} = m^{r} - 1, ϑ_{t_{c}, i}^{r} = 1

;

42 calculate

Δ_{i}^{r}

with Algorithm 4;

43 end

44 end

45 end

46 end

47 select the RSA candidate with the largest

Δ_{i}^{r}

;

48 set

m^{r}

,

{ϑ_{t_{c}}^{r}, p_{s^{r}, d^{r}, t_{c}}, [f_{s, t_{c}}^{r}, f_{e, t_{c}}^{r}]}

,

F_{u}^{r}

accordingly;

TABLE I

Simulation Parameters for Dynamic Network Operations

$T$ , Number of look-ahead TSs observed by operator	150
$B$ , Number of FSs on each fiber link	358
$\frac{λ_{f}}{μ_{f}}$ , Flow-oriented traffic load	[300, 750] Erlangs
$\frac{λ_{d}}{μ_{d}}$ , Data-oriented traffic load	120 Erlangs
Average service duration of DO-Rs	10 TSs
$F^{r}$ , Data size of a DO-R	[10, 100] FSs
$M$ , Maximum RSA reconfiguration times	[0, 5]
$K$ , Number of alternative path candidates	5

TABLE II

Results From Simulations for Offline Optimization

	Incompletion Ratio of DO-Rs				Average Percentage $η^{T}$				Average Running Time (s)
			MTDG				MTDG				MTDG
$\| D \|$	MILP	AC + BA	$γ = 0$	$γ = 0.6$	MILP	AC + BA	$γ = 0$	$γ = 0.6$	MILP	AC + BA	$γ = 0$	$γ = 0.6$
1	0.00%	0.00%	0.00%	100.00%	100.00%	100.00%	100.00%	72.14%	0.2467	0.0374	0.0128	0.0119
2	50.00%	50.00%	50.00%	50.00%	89.29%	50.00%	89.29%	75.00%	0.5461	0.0459	0.0143	0.0136
3	33.33%	33.33%	33.33%	33.33%	82.98%	66.67%	79.14%	77.57%	2.3383	0.0464	0.0163	0.0146
4	50.00%	50.00%	75.00%	100.00%	72.46%	50.00%	67.46%	60.55%	428.6296	0.0646	0.0171	0.0182

Optimizing Deadline-Driven Bulk-Data Transfer to Revitalize Spectrum Fragments in EONs [Invited]

Abstract

Cited By

Figures (5)

Tables (7)

Equations (21)

Journal of Optical Communications and Networking

Optimizing Deadline-Driven Bulk-Data Transfer to Revitalize Spectrum Fragments in EONs [Invited]

Author Affiliations

Abstract

Cited By

Figures (5)

Tables (7)

Equations (21)

Journal of Optical Communications and Networking