发明名称 DYNAMIC DIRECTED ACYCLIC GRAPH (DAG) ROOT BYPASS FOR COMPUTER NETWORKS
摘要 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.
申请公布号 US2013223218(A1) 申请公布日期 2013.08.29
申请号 US201213405828 申请日期 2012.02.27
申请人 VASSEUR JEAN-PHILIPPE;HUI JONATHAN W.;MAHAMUNI ATUL B.;CISCO TECHNOLOGY, INC. 发明人 VASSEUR JEAN-PHILIPPE;HUI JONATHAN W.;MAHAMUNI ATUL B.
分类号 H04L12/24 主分类号 H04L12/24
代理机构 代理人
主权项
地址