From: On the performance of online and offline green path establishment techniques
L S P q | s | d | bw | k shortest paths | ||
---|---|---|---|---|---|---|
1 | R3 | R1 | 14 | [ R3,R1] | [ R3,R2,R1] | [ R3,R4,R2,R1] |
2 | R4 | R2 | 41 | [ R4,R2] | [ R4,R3,R2] | [ R4,R3,R1,R2] |
3 | R2 | R4 | 40 | [ R2,R4] | [ R2,R3,R4] | [ R2,R1,R3,R4] |