发明名称 Method and system to calculate multiple shortest path first trees
摘要 An example method is provided in accordance with one embodiment and includes identifying distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network. The method can also include applying the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node. Additionally, the method can include establishing a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree.
申请公布号 US9264312(B2) 申请公布日期 2016.02.16
申请号 US201314042347 申请日期 2013.09.30
申请人 CISCO TECHNOLOGY, INC. 发明人 Shah Varun;Anand Madhukar
分类号 H04L12/24;H04L12/733;H04L12/753;H04L12/761 主分类号 H04L12/24
代理机构 Patent Capital Group 代理人 Patent Capital Group
主权项 1. A method comprising: identifying by a switch, distances for a sub-tree of a leaf node of a plurality of leaf nodes in a network; applying, by the switch, the distances for the sub-tree of the leaf node to a plurality of root nodes connected to the leaf node; and establishing, by the switch, a plurality of shortest path distances for the plurality of root nodes using the distances for the sub-tree; generate, by the switch, a plurality of shortest path trees (SPTs) for the network based, at least in part, on the plurality of shortest path distances, wherein each of the plurality of leaf nodes has a corresponding shortest path tree in the plurality of shortest path trees; receive, by the switch, an indication that one or more of the plurality of leaf nodes is to receive traffic corresponding to a group interest, wherein the switch receives the indication as a Border Gateway Protocol message transmitted from a route reflector in the network; and transmitting from the switch, the traffic to the one or more of the plurality of leaf nodes, wherein the traffic is multicast to each of the one or more of the plurality of leaf nodes using the corresponding shortest path tree.
地址 San Jose CA US
您可能感兴趣的专利