| 摘要 |
A method and system is disclosed to compute and distribute a generalized almost directed acyclic graph (GADAG). The method includes computing, by a network element, a GADAG for the network, where the GADAG is a graph abstraction of the network, where the plurality of network elements are the vertices of the GADAG and links connecting the plurality of network elements are the directed edges of the GADAG. The method continues with assembling a GADAG descriptor based on the computed GADAG, and distributing the GADAG descriptor to a plurality of network elements, where each of the plurality of network elements utilizes the GADAG descriptor to compute maximally redundant trees for forwarding traffic.The method also includes leveraging layer 2 attributes and features for layer 2 deployments and updating redundant trees upon topology change eventssuch that traffic outage is avoided or minimized. |
