Invention Grant
- Patent Title: Method and system for deploying maximally redundant trees in a data network
-
Application No.: US14601225Application Date: 2015-01-20
-
Publication No.: US09614726B2Publication Date: 2017-04-04
- Inventor: János Farkas , Gábor Sándor Enyedi
- Applicant: Telefonaktiebolaget L M Ericsson (publ)
- Applicant Address: SE Stockholm
- Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
- Current Assignee: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
- Current Assignee Address: SE Stockholm
- Agency: Nicholson De Vos Webster & Elliott LLP
- Main IPC: H04L12/24
- IPC: H04L12/24 ; H04L12/753 ; H04L12/28 ; H04L12/735 ; H04L12/715 ; H04L12/751 ; H04L12/703 ; H04L12/717

Abstract:
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 events such that traffic outage is avoided or minimized.
Public/Granted literature
- US20150207671A1 METHOD AND SYSTEM FOR DEPLOYING MAXIMALLY REDUNDANT TREES IN A DATA NETWORK Public/Granted day:2015-07-23
Information query