公开(公告)号：US20140269330A1

公开(公告)日：2014-09-18

申请号：US13842195

申请日：2013-03-15

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Ramkumar Parameswaran ,  Ayan Banerjee ,  Francois Edouard Tallet ,  Varun Chandulal Shah

IPC: H04L12/801

CPC classification number: H04L47/125 ,  H04L12/185 ,  H04L12/1886 ,  H04L45/123 ,  H04L45/48

Abstract: Embodiments provide a method, network device, and computer program product for optimizing traffic in a link-state network distributed across a plurality of sites. The method, network device, and computer program product include receiving a multi-destination message at a first node within the link-state network. Additionally, the method, network device, and computer program product include identifying a plurality of multi-destination trees within the network, each tree having a respective root node. The method, network device, and computer program product determine a plurality of cost values corresponding to each of the plurality of multi-destination trees, based on one or more links along a shortest path from the first node to the respective root node of each tree. Based on the determined cost values, the method, network device, and computer program product select one or more of the multi-destination trees and transmit the multi-destination message using the selected tree.

Abstract translation: 实施例提供了一种用于优化分布在多个站点上的链路状态网络中的业务的方法，网络设备和计算机程序产品。 该方法，网络设备和计算机程序产品包括在链路状态网络内的第一节点处接收多目的地消息。 此外，方法，网络设备和计算机程序产品包括识别网络内的多个多目的地树，每个树具有相应的根节点。 所述方法，网络设备和计算机程序产品基于沿着从每个树的第一节点到相应根节点的最短路径的一个或多个链路来确定与所述多个目的地树中的每一个对应的多个成本值 。 基于确定的成本值，方法，网络设备和计算机程序产品选择多目的地树中的一个或多个并且使用所选择的树发送多目的地消息。

公开(公告)号：US09203744B2

公开(公告)日：2015-12-01

申请号：US14038525

申请日：2013-09-26

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Lester C. Ginsberg ,  Varun Shah ,  Lakshmi Priya Sarma ,  Ramkumar Parameswaran

IPC: H04J1/16 ,  H04L12/753 ,  H04L12/761

CPC classification number: H04L45/48 ,  H04L45/16

Abstract: An example method for convergence of multi-destination traffic in a network environment is provided and includes receiving a first type-length-value (TLV) message from a true broadcast root in a Transparent Interconnection of Lots of Links (TRILL) network, where the first TLV message indicates a first subset of multi-destination trees in the TRILL network, receiving a second TLV message from the true broadcast root indicating a second subset of multi-destination trees in the TRILL network, such that a union of the first subset and the second subset indicates at least one inactive multi-destination tree in the TRILL network, and deleting the inactive tree from a hash table of active trees.

Abstract translation: 提供了一种用于在网络环境中的多目的地业务的收敛的示例性方法，并且包括在多个链路（TRILL）网络的透明互连中从真实广播根接收第一类型长度值（TLV）消息，其中 第一TLV消息指示TRILL网络中的多目的地树的第一子集，从真实广播根接收指示TRILL网络中的多目的地树的第二子集的第二TLV消息，使得第一子集和 第二子集指示TRILL网络中的至少一个非活动多目的地树，以及从活动树的哈希表中删除不活动树。

公开(公告)号：US09306856B2

公开(公告)日：2016-04-05

申请号：US13842195

申请日：2013-03-15

Applicant: Cisco Technology, Inc.

Inventor： Ramkumar Parameswaran ,  Ayan Banerjee ,  Francois Edouard Tallet ,  Varun Chandulal Shah

IPC: H04L12/801 ,  H04L12/803 ,  H04L12/753 ,  H04L12/18 ,  H04L12/721

CPC classification number: H04L47/125 ,  H04L12/185 ,  H04L12/1886 ,  H04L45/123 ,  H04L45/48

Abstract: Embodiments provide a method, network device, and computer program product for optimizing traffic in a link-state network distributed across a plurality of sites. The method, network device, and computer program product include receiving a multi-destination message at a first node within the link-state network. Additionally, the method, network device, and computer program product include identifying a plurality of multi-destination trees within the network, each tree having a respective root node. The method, network device, and computer program product determine a plurality of cost values corresponding to each of the plurality of multi-destination trees, based on one or more links along a shortest path from the first node to the respective root node of each tree. Based on the determined cost values, the method, network device, and computer program product select one or more of the multi-destination trees and transmit the multi-destination message using the selected tree.

Abstract translation: 实施例提供了一种用于优化分布在多个站点上的链路状态网络中的业务的方法，网络设备和计算机程序产品。 该方法，网络设备和计算机程序产品包括在链路状态网络内的第一节点处接收多目的地消息。 此外，方法，网络设备和计算机程序产品包括识别网络内的多个多目的地树，每个树具有相应的根节点。 所述方法，网络设备和计算机程序产品基于沿着从每个树的第一节点到相应根节点的最短路径的一个或多个链路来确定与所述多个目的地树中的每一个对应的多个成本值 。 基于确定的成本值，方法，网络设备和计算机程序产品选择多目的地树中的一个或多个并且使用所选择的树发送多目的地消息。

公开(公告)号：US20150085706A1

公开(公告)日：2015-03-26

申请号：US14038525

申请日：2013-09-26

Applicant: CISCO TECHNOLOGY, INC.

Inventor： Lester C. Ginsberg ,  Varun Shah ,  Lakshmi Priya Sarma ,  Ramkumar Parameswaran

IPC: H04L12/751 ,  H04L12/753 ,  H04L12/761

CPC classification number: H04L45/48 ,  H04L45/16

Abstract: An example method for convergence of multi-destination traffic in a network environment is provided and includes receiving a first type-length-value (TLV) message from a true broadcast root in a Transparent Interconnection of Lots of Links (TRILL) network, where the first TLV message indicates a first subset of multi-destination trees in the TRILL network, receiving a second TLV message from the true broadcast root indicating a second subset of multi-destination trees in the TRILL network, such that a union of the first subset and the second subset indicates at least one inactive multi-destination tree in the TRILL network, and deleting the inactive tree from a hash table of active trees.

Abstract translation: 提供了一种用于在网络环境中的多目的地业务的收敛的示例性方法，并且包括在多个链路（TRILL）网络的透明互连中从真实广播根接收第一类型长度值（TLV）消息，其中 第一TLV消息指示TRILL网络中的多目的地树的第一子集，从真实广播根接收指示TRILL网络中的多目的地树的第二子集的第二TLV消息，使得第一子集和 第二子集指示TRILL网络中的至少一个非活动多目的地树，以及从活动树的哈希表中删除非活动树。