Table 2 Offline-MO example. L S P 1 has a request <R3, R1, 14 Mb >, and three candidate paths: [ R3,R1],[ R3,R2,R1],[ R3,R4,R2,R1]
From: On the performance of online and offline green path establishment techniques
L S P q | \({p^{1}_{q}}\) links | \({p^{2}_{q}}\) links | \({p^{3}_{q}}\) links | |||
|---|---|---|---|---|---|---|
2 | R4−R2 | R4−R3 | R3−R2 | R4−R3 | R3−R1 | R1−R2 |
\({p^{3}_{1}}\) | \({p^{2}_{1}}\) | \({p^{1}_{1}}\) | ||||
3 | R2−R4 | R2−R3 | R3−R4 | R2−R1 | R1−R3 | R3−R4 |
\({p^{3}_{1}}\) | \({p^{2}_{1}}\) | \({p^{3}_{1}}\) | ||||
\({p^{3}_{1}}\) | ||||||