tewg-9----Page:5
1 2 3 4 5 6 7 8 9 10
|
Scenario 2: distributed path computation server AS1 ASBR2 ASBR4 ASBR1 AS3 ASBR3 B A ASBR5 AS2 ASBR6 ASBR8 ASBR7 * * * ASBR1 build a virtual SPT (the shortest path is built using a backward recursive computation) Virtual SPT draft-vasseur-inter-AS-TE-01.txt IETF-57 Vienna |