Table 3 Offline-R example. L S P 1 has a request <R3, R1, 14 Mb >, and L S P 2, <R4, R2, 41 Mb >, and three candidate paths: [ R3,R1], [ R3,R2,R1], [ R3,R4,R2,R1], and [ R4,R2], [ R4,R3,R2], [ R4,R3,R1,R2], respectively
From: On the performance of online and offline green path establishment techniques
L S P q | links_used | k paths | score | new_links_number | R a t i o off | Selected path k |
|---|---|---|---|---|---|---|
1 | {} | [ R3,R1] | 1 | 1 | 1 | [ R3,R4,R2,R1] |
[ R3,R2,R1] | 2 | 2 | 1 | |||
[ R3,R4,R2,R1] | 4 | 3 | 1.33 | |||
2 | R3−R4 | [ R4,R2] | 1 | 0 | 1 | [ R4,R2] |
R4−R2 | [ R4,R3,R2] | 0 | 2 | 0 | ||
R2−R1 | [ R4,R3,R1,R2] | 1 | 3 | 0.33 |