Affecting Node Association Through Load Partitioning
First Claim
1. A method, comprising:
- requesting, by a particular node, to join a parent node in a directed acyclic graph (DAG) in a computer network;
notifying the parent node of a load associated with the request;
notifying the parent node as to whether the particular node has any other parent node options;
receiving a response to the request from the parent node, the response being one of either an acceptance or a denial; and
in response to a denial;
dividing the load into first and second portions; and
re-requesting to join the parent node with the load of the first portion.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a node may request to join a parent node in a directed acyclic graph (DAG) in a computer network, and may also notify the parent node of a load associated with the request and whether the node has any other parent node options. The requesting node may then receive a response from the parent node that is either an acceptance or a denial. While the node may join the parent node in response to an acceptance, if a denial is received, the node may divide the load into first and second portions, and may re-request to join the parent node with the load of the first portion. In this manner, by partitioning the load, a load balancing mode of operation across multiple is parents in a DAG is provided.
-
Citations
23 Claims
-
1. A method, comprising:
-
requesting, by a particular node, to join a parent node in a directed acyclic graph (DAG) in a computer network; notifying the parent node of a load associated with the request; notifying the parent node as to whether the particular node has any other parent node options; receiving a response to the request from the parent node, the response being one of either an acceptance or a denial; and in response to a denial; dividing the load into first and second portions; and re-requesting to join the parent node with the load of the first portion. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. An apparatus, comprising:
-
one or more network interfaces; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; request to join a parent node in a directed acyclic graph (DAG) in a computer network; notify the parent node of a load associated with the request; notify the parent node as to whether the apparatus has any other parent node options; receive a response to the request from the parent node, the response being one of either an acceptance or a denial; and in response to a denial; divide the load into first and second portions; and re-request to join the parent node with the load of the first portion. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A tangible, non-transitory computer readable media having software encoded thereon, the software when executed by a processor of a particular node operable to:
-
request that the particular node join a parent node in a directed acyclic graph (DAG) in a computer network; notify the parent node of a load associated with the request; notify the parent node as to whether the particular node has any other parent node options; receive a response to the request from the parent node, the response being one of either an acceptance or a denial; and in response to a denial; divide the load into first and second portions; and re-request to join the parent node with the load of the first portion.
-
Specification