ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING
First Claim
1. A method, comprising:
- selecting, by a node N within a computer network utilizing directed acyclic graph (DAG) routing, a parent node P within the DAG;
in response to P not being a root of the DAG, determining, by N, a grandparent node GP as a parent node to the parent node P;
selecting, by N, an alternate parent node P′
that has connectivity to GP and N; and
informing, from N, P and P′
about prefixes reachable via N and also about P′
as an alternate parent node to P to reach the prefixes reachable via N.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a node “N” within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node “P” within the DAG, and, where P is not a DAG root, may determine a grandparent node “GP” as a parent node to the parent node P. The node N may then also select an alternate parent node “P′” that has connectivity to GP and N. N may then inform P and P′ about prefixes reachable via N, and also about P′ as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P′ as an alternate parent node to P to reach the prefixes reachable via N, and P′ may be configured to store the prefixes reachable via N without informing other nodes about those prefixes.
-
Citations
23 Claims
-
1. A method, comprising:
-
selecting, by a node N within a computer network utilizing directed acyclic graph (DAG) routing, a parent node P within the DAG; in response to P not being a root of the DAG, determining, by N, a grandparent node GP as a parent node to the parent node P; selecting, by N, an alternate parent node P′
that has connectivity to GP and N; andinforming, from N, P and P′
about prefixes reachable via N and also about P′
as an alternate parent node to P to reach the prefixes reachable via N. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. An apparatus, comprising:
-
one or more network interfaces adapted to communicate with nodes of a computer network configured to utilize directed acyclic graph (DAG) routing; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory adapted to store a process executable by the processor, the process when executed operable to; select a parent node P within the DAG; determine a grandparent node GP as a parent node to the parent node P in response to P not being a root of the DAG; select an alternate parent node P′
that has connectivity to GP and the apparatus; andinform P and P′
about prefixes reachable via the apparatus and also about P′
as an alternate parent node to P to reach the prefixes reachable via the apparatus. - View Dependent Claims (14, 15, 16, 17, 18, 20)
-
-
19. A tangible computer-readable media having software encoded thereon, the software, when executed on a node N utilizing directed acyclic graph (DAG) routing, operable to:
-
select a parent node P within the DAG; determine a grandparent node GP as a parent node to the parent node P in response to P not being a root of the DAG; select an alternate parent node P′
that has connectivity to GP and N; andinform P and P′
about prefixes reachable via N and also about P′
as an alternate parent node to P to reach the prefixes reachable via N. - View Dependent Claims (21, 22, 23)
-
Specification