×

Dynamic Reroute Scheduling in a Directed Acyclic Graph (DAG)

  • US 20120155329A1
  • Filed: 12/17/2010
  • Published: 06/21/2012
  • Est. Priority Date: 12/17/2010
  • Status: Active Grant
First Claim
Patent Images

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 being lower than the parent node and higher than child nodes of the particular node;

    detecting a trigger for a routing change in the DAG;

    in response, delaying the routing change by the particular node based on the grade such that 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;

    in response to expiration of the delay, determining if the trigger for the routing change is still valid; and

    if valid, performing the routing change by the particular node.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×