首页>
外国专利>
Directed graph based span computation and configuration dispatching
Directed graph based span computation and configuration dispatching
展开▼
机译:基于跨度计算和配置调度的定向图
展开▼
页面导航
摘要
著录项
相似文献
摘要
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.
展开▼