Patent ID: 8937886
Filing Date: 2015-01-20
Classification: H04L

Abstract:
1. A method, comprising: joining, by a particular node, a directed acyclic graph (DAG) in a computer network at a parent node; determining a grade of the particular node based on a topology of the DAG, the grade of the particular node being lower than a grade of the parent node and higher than grades of child nodes of the particular node, wherein nodes with a larger number of children have a higher grade than nodes with fewer children; detecting a trigger for a routing change in the DAG; in response to detecting the trigger, delaying the routing change by the particular node based on the grade of the particular node, wherein the higher the grade, the longer the particular node waits to perform any routing change; in response to expiration of the delay, determining if the trigger for the routing change is still valid based on changes that have occurred during the delay to the particular node; and if valid, performing the routing change by the particular node, wherein the delay is longer than a first associated delay of at least some of the child nodes and shorter than a second associated delay of the parent node.