LIGHTWEIGHT STORING MODE FOR CONSTRAINED COMPUTER NETWORKS
First Claim
1. A method, comprising:
- communicating as a device within a directed acyclic graph (DAG) in a computer network;
storing Internet Protocol (IP) routes at the device corresponding to upward traffic from the device directed toward a root of the DAG;
IP-routing upward traffic based on the IP routes;
storing labels at the device corresponding to downward traffic from the device directed away from the root of the DAG; and
label-switching downward traffic based on the labels.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a management device, such as a root node, monitors Internet Protocol (IP) overhead (e.g., IP header sizes during source-routing or route table sizes) within a directed acyclic graph (DAG) in a computer network. If it is determined that the IP overhead is above a configured threshold, then in response, a trigger is initiated to have devices within the DAG label-switch downward traffic directed away from the root node within the DAG. In another embodiment, a device communicating within a DAG stores IP routes corresponding to upward traffic from the device directed toward a root of the DAG, and IP-routes upward traffic based on the IP routes. Conversely, the device also stores labels corresponding to downward traffic from the device directed away from the root of the DAG, and label-switches downward traffic based on the labels, accordingly.
34 Citations
24 Claims
-
1. A method, comprising:
-
communicating as a device within a directed acyclic graph (DAG) in a computer network; storing Internet Protocol (IP) routes at the device corresponding to upward traffic from the device directed toward a root of the DAG; IP-routing upward traffic based on the IP routes; storing labels at the device corresponding to downward traffic from the device directed away from the root of the DAG; and label-switching downward traffic based on the labels. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. An apparatus, comprising:
-
one or more network interfaces to communicate within a directed acyclic graph (DAG) in a computer network; 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; store Internet Protocol (IP) routes corresponding to upward traffic from the apparatus directed toward a root of the DAG; IP-route upward traffic based on the IP routes; store labels corresponding to downward traffic from the apparatus directed away from the root of the DAG; and label-switch downward traffic based on the labels. - View Dependent Claims (11, 12, 13, 14)
-
-
15. A method, comprising:
-
monitoring Internet Protocol (IP) overhead within a directed acyclic graph (DAG) in a computer network; determining whether the IP overhead is above a configured threshold; and in response to the IP overhead being above the configured threshold, initiating a trigger to label-switch downward traffic directed away from a root node within the DAG. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
-
22. An apparatus, comprising:
-
one or more network interfaces to communicate with a directed acyclic graph (DAG) in a computer network; 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; monitor Internet Protocol (IP) overhead within the DAG; determine whether the IP overhead is above a configured threshold; and in response to the IP overhead being above the configured threshold, initiate a trigger to label-switch downward traffic directed away from a root node within the DAG. - View Dependent Claims (23, 24)
-
Specification