Directed graph based span computation and configuration dispatching
US10382529B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 29, 2016 |
| Grant date | Aug 13, 2019 |
| Priority date | — |
| Expiry date | Feb 1, 2038 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/64
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method of determining the span of logical entities in a network is provided. The method generates a directed graph. Each node of the graph corresponds to a logical network entity. Each edge of the graph has one or two directions. A direction from a first node to a second node identifies the first node as the source of span for the second node. The method determines the span of each node based on the direction of the edges of the directed graph. The method groups each set of nodes that are accessible by all other nodes in the set in a strongly connected group (SCC) sub-graph. The method generates a group node in a directed acyclic graph (DAG) to correspond to each SCC sub-graph in the directed graph. The method assigns the span of each SCC to the corresponding group node of the DAG.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.