DYNAMIC DIRECTED ACYCLIC GRAPH (DAG) ROOT BYPASS FOR COMPUTER NETWORKS
First Claim
1. A method, comprising:
- monitoring traffic flows through a root node of a primary directed acyclic graph (DAG) in a computer network;
detecting that a particular traffic flow of the monitored traffic flows is above a path cost threshold;
determining whether the particular traffic flow from a corresponding source device is point-to-point (P2P) or point-to-multipoint (P2MP);
in response to the particular traffic flow being P2P, computing and sending a source route to the source device to cause the source device to use the source route for the particular traffic flow; and
in response to the particular traffic flow being P2MP, instructing the source device to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, traffic flows through a root node of a primary directed acyclic graph (DAG) in a computer network are monitored to detect whether a particular traffic flow is above a path cost threshold. If so, then a corresponding source device may be instructed to cease using the primary DAG for the particular traffic flow, and specific action may be taken based on whether the particular traffic flow is point-to-point (P2P) or point-to-multipoint (P2MP). In particular, in response to the particular traffic flow being P2P, a source route may be computed and sent to the source device to cause the source device to use the source route for the particular traffic flow, while in response to the particular traffic flow being P2MP, the source device may be instructed to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root.
-
Citations
25 Claims
-
1. A method, comprising:
-
monitoring traffic flows through a root node of a primary directed acyclic graph (DAG) in a computer network; detecting that a particular traffic flow of the monitored traffic flows is above a path cost threshold; determining whether the particular traffic flow from a corresponding source device is point-to-point (P2P) or point-to-multipoint (P2MP); in response to the particular traffic flow being P2P, computing and sending a source route to the source device to cause the source device to use the source route for the particular traffic flow; and in response to the particular traffic flow being P2MP, instructing the source device to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A method, comprising:
-
sourcing one or more traffic flows through a root node of a primary directed acyclic graph (DAG) in a computer network; receiving instructions to cease sourcing a particular traffic flow of the traffic flows in response to the particular traffic flow being above a path cost threshold; in response to the particular traffic flow being point-to-point (P2P), receiving and using a source route for the particular traffic flow; and in response to the particular traffic flow being point-to-multipoint (P2MP), receiving and acting on instructions to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root. - View Dependent Claims (15, 16, 17, 18, 19)
-
-
20. An apparatus, comprising:
-
one or more network interfaces to communicate 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 traffic flows through a root node of the primary directed acyclic graph (DAG) in the computer network; detect that a particular traffic flow of the monitored traffic flows is above a path cost threshold; determine whether the particular traffic flow from a corresponding source device is point-to-point (P2P) or point-to-multipoint (P2MP); in response to the particular traffic flow being P2P, compute and send a source route to the source device to cause the source device to use the source route for the particular traffic flow; and in response to the particular traffic flow being P2MP, instruct the source device to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root. - View Dependent Claims (21)
-
-
22. An apparatus, comprising:
-
one or more network interfaces to communicate 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; source one or more traffic flows through a root node of a primary directed acyclic graph (DAG) in the computer network; receive instructions to cease sourcing a particular traffic flow of the traffic flows in response to the particular traffic flow being above a path cost threshold; in response to the particular traffic flow being point-to-point (P2P), receive and use a source route for the particular traffic flow; and in response to the particular traffic flow being point-to-multipoint (P2MP), receive and act on instructions to create a secondary DAG for the particular traffic flow with the apparatus as the secondary DAG root. - View Dependent Claims (23, 24, 25)
-
Specification