| 发明名称 |
Dominating set identification for path computation based on directed acyclic graph membership |
| 摘要 |
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. |
| 申请公布号 |
US9344256(B2) |
申请公布日期 |
2016.05.17 |
| 申请号 |
US201314030949 |
申请日期 |
2013.09.18 |
| 申请人 |
Cisco Technology, Inc. |
发明人 |
Thubert Pascal;Vasseur Jean-Philippe;Wetterwald Patrick |
| 分类号 |
H04L5/00;H04L12/721;H04W40/12;H04L12/717;H04W84/18 |
主分类号 |
H04L5/00 |
| 代理机构 |
|
代理人 |
Turkevich Leon R. |
| 主权项 |
1. 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. |
| 地址 |
San Jose CA US |
