Alternate down paths for directed acyclic graph (DAG) routing
US8817665B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 18, 2013 |
| Grant date | Aug 26, 2014 |
| Priority date | — |
| Expiry date | Jan 18, 2033 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY04S40/00
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.