CYCLE-FREE MULTI-TOPOLOGY ROUTING
First Claim
Patent Images
1. A method, comprising:
- determining a first directed acyclic graph (DAG) topology in a shared-media communication network, the first DAG topology having a particular direction; and
determining a second DAG topology in the shared-media communication network based on the first DAG topology, the second DAG topology sharing the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a node in a shared-media communication network may determine a first directed acyclic graph (DAG) topology, wherein the first DAG topology has a particular direction. The node may determine a second DAG topology in the shared-media communication network based on the first DAG topology. The second DAG topology may share the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies.
-
Citations
20 Claims
-
1. A method, comprising:
-
determining a first directed acyclic graph (DAG) topology in a shared-media communication network, the first DAG topology having a particular direction; and determining a second DAG topology in the shared-media communication network based on the first DAG topology, the second DAG topology sharing the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. An apparatus, comprising:
-
one or more network interfaces to communicate with a shared-media communication network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; determine a first directed acyclic graph (DAG) topology in a shared-media communication network, the first DAG topology having a particular direction; and determine a second DAG topology in the shared-media communication network based on the first DAG topology, the second DAG topology sharing the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies. - View Dependent Claims (14, 15, 16, 17, 18, 19)
-
-
20. A tangible, non-transitory, computer-readable media having software encoded thereon, the software when executed by a processor operable to:
-
determine a first directed acyclic graph (DAG) topology in a shared-media communication network, the first DAG topology having a particular direction; and determine a second DAG topology in the shared-media communication network based on the first DAG topology, the second DAG topology sharing the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies.
-
Specification