Alternate down paths for directed acyclic graph (DAG) routing
US8363662B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 19, 2010 |
| Grant date | Jan 29, 2013 |
| Priority date | — |
| Expiry date | Mar 2, 2031 |
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 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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.