ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING
First Claim
1. A method, comprising:
- selecting, for a node N within a computer network that utilizes a directed acyclic graph (DAG) to route packets, a parent node P that is a parent to node N in the DAG;
determining a grandparent node GP within the computer network that is a parent of the parent node P in the DAG;
selecting an alternate parent node P′
within the computer network that has con-nectivity to the grandparent node GP and the node N; and
establishing a sibling connection within the computer network between the parent node P and the alternate parent node P′
, wherein the sibling connection provides a path for reaching prefixes reachable via the node N.
0 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, a node N, within a computer network that utilizes a directed acyclic graph (DAG) to route packets, may select a parent node P that is a parent to the node N in the DAG. The node N may determine a grandparent node GP within the computer network that is a parent of the parent node P in the DAG. The node N may select an alternate parent node P′ within the computer network that has connectivity to the grandparent node GP and the node N. A sibling connection may be established within the computer network between the parent node P and the alternate parent node P′. The sibling connection may provide a path for reaching prefixes reachable via the node N.
-
Citations
20 Claims
-
1. A method, comprising:
-
selecting, for a node N within a computer network that utilizes a directed acyclic graph (DAG) to route packets, a parent node P that is a parent to node N in the DAG; determining a grandparent node GP within the computer network that is a parent of the parent node P in the DAG; selecting an alternate parent node P′
within the computer network that has con-nectivity to the grandparent node GP and the node N; andestablishing a sibling connection within the computer network between the parent node P and the alternate parent node P′
, wherein the sibling connection provides a path for reaching prefixes reachable via the node N. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A node comprising:
-
one or more network interfaces configured to communicate with other nodes of a computer network that utilizes a directed acyclic graph (DAG) to route packets; a processor coupled to the one or more network interfaces and configured to exe-c cute one or more processes; and a memory configured to store a routing process executable by the processor, the routing process when executed operable to; select a parent node P within the computer network that is a parent of the node in the DAG; select an alternate parent node P′
within the computer network;determine an alternate node N′
within the computer network that has con-nectivity to the parent node P, the alternate parent node P′ and
a child node C within the computer network, the child node C being a child of the node in the DAG;is establish a sibling connection between the node and the alternate node N′
, the sibling connection providing a path for reaching prefixes reachable via the child node C. - View Dependent Claims (14, 15, 16, 17, 18)
-
-
19. A non-transitory computer readable medium having software encoded thereon, the software when executed operable to:
-
select, for a node N within a computer network that utilizes a directed acyclic graph (DAG) to route packets, a parent node P that is a parent to the node N in the DAG; determine a grandparent node GP within the computer network that is a parent of the parent node P in the DAG; select an alternate parent node P′
within the computer network that has connec-tivity to the grandparent node GP and the node N; andestablishing a sibling connection between the parent node P and the alternate par-ent node P′
within the computer network. - View Dependent Claims (20)
-
Specification