Push-based short-cut requests within a directed acyclic graph
First Claim
Patent Images
1. A method, comprising:
- determining, at a root of a directed acyclic graph (DAG), transmission of critical traffic from a first device to a second device in a computer network using the DAG;
determining a maximum tolerable delay of the critical traffic;
computing, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay; and
informing the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.
-
Citations
22 Claims
-
1. A method, comprising:
-
determining, at a root of a directed acyclic graph (DAG), transmission of critical traffic from a first device to a second device in a computer network using the DAG; determining a maximum tolerable delay of the critical traffic; computing, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay; and informing the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. An apparatus, comprising:
-
one or more network interfaces to communicate as a root of a directed acyclic graph (DAG) within 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; determining transmission of critical traffic from a first device to a second device in a computer network using the DAG; determining a maximum tolerable delay of the critical traffic; computing, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay; and informing the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20)
-
-
21. A method, comprising:
-
determining, at a first device, transmission of critical traffic from the first device to a second device in a computer network, the critical traffic associated with a maximum tolerable delay; sending a request to a root of a directed acyclic graph (DAG) to compute a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay; receiving the P2P path to the second device; and using the P2P path for the critical traffic.
-
-
22. An apparatus, comprising:
-
one or more network interfaces to communicate within a directed acyclic graph (DAG) within 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; determine, as a first device, transmission of critical traffic from the first device to a second device in a computer network, the critical traffic associated with a maximum tolerable delay; send a request to a root of a directed acyclic graph (DAG) to compute a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay; receive the P2P path to the second device; and use the P2P path for the critical traffic.
-
Specification