Dominating set identification for path computation based on directed acyclic graph membership
AssigneeCisco Technology, Inc.
InventorsPascal Thubert, Jean-Philippe Vasseur, Patrick Wetterwald
Life of this patent
Estimating the term…
Abstract
In one embodiment, a method comprises a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network; and the path computation device classifying each member network device belonging to a directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.
Claims20
A method comprising:
- a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network;
- and
- the path computation device classifying each member network device belonging to any directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.
An apparatus comprising:
- a network interface circuit configured for receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network;
- and
- a processor circuit configured for classifying each member network device belonging to any directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.
Logic encoded in one or more non-transitory tangible media for execution and when executed by a machine operable for:
- a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network;
- and
- the path computation device classifying each member network device belonging to any directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.
A method comprising:
- a network device in a low power lossy network joining a directed acyclic graph to a destination;
- and
- the network device sending device information to a path computation device in response to joining the directed acyclic graph, enabling the path computation device to add the network device to a dominating set of network devices based on membership in the directed acyclic graph, for generation by the path computation device of optimized routes for reaching any network device in the lower power lossy network via one or more of the network devices in the dominating set, the optimized routes distinct from any directed acyclic graph.
Logic encoded in one or more non-transitory tangible media for execution and when executed by a machine operable for:
- a network device in a low power lossy network joining a directed acyclic graph to a destination;
- and
- the network device sending device information to a path computation device in response to joining the directed acyclic graph, enabling the path computation device to add the network device to a dominating set of network devices based on membership in the directed acyclic graph, for generation by the path computation device of optimized routes for reaching any network device in the lower power lossy network via one or more of the network devices in the dominating set, the optimized routes distinct from any directed acyclic graph.
Dependencies are inferred from the claim text.