公开(公告)号：US20160149751A1

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

申请号：US14550844

申请日：2014-11-21

Applicant: Cisco Technology, Inc.

Inventor： Ayaskant Pani ,  Saurabh Agarwal ,  Srinivas Tatikonda ,  Sarat Kamisetty

IPC: H04L12/24 ,  H04L12/937 ,  H04L12/707 ,  H04L12/713

CPC classification number: H04L41/0668 ,  H04L45/12 ,  H04L45/22 ,  H04L45/245 ,  H04L45/28 ,  H04L45/586 ,  H04L49/254 ,  Y02D50/30

Abstract: Systems, methods, and non-transitory computer-readable storage media for recovering from a partial failure of a virtual port chain (vPC) domain. The first and second vPC peers may be paired to create a vPC having a virtual address. An endpoint host may communicate with a network via the virtual port channel. The system may detect that the first virtual port channel peer is down. During or after the first vPC reboots, the reachability cost for the first vPC with regards to the virtual address can be set to an inflated value. The first vPC peer may also delay its bring up time while it synchronizes its vPC state information with the second vPC peer. The second vPC can continue to advertise the association between the endpoint host and the virtual address. Upon completion of the synchronization, the first vPC peer may bring up the link and restore the reachability cost.

Abstract translation: 用于从虚拟端口链（vPC）域的部分故障中恢复的系统，方法和非暂时的计算机可读存储介质。 第一和第二vPC对等体可以被配对以创建具有虚拟地址的vPC。 端点主机可以通过虚拟端口信道与网络进行通信。 系统可以检测到第一个虚拟端口信道对等体已经关闭。 在第一个vPC重新启动期间或之后，第一个vPC关于虚拟地址的可达性成本可以被设置为一个膨胀的值。 第一个vPC对等体也可以延迟其启动时间，同时将其vPC状态信息与第二个vPC对等体同步。 第二个vPC可以继续通告端点主机和虚拟地址之间的关联。 完成同步后，第一个vPC对等体可能会弹出链接并恢复可达性成本。

公开(公告)号：US20160112481A1

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

申请号：US14515590

申请日：2014-10-16

Applicant: Cisco Technology, Inc.

Inventor： Ayaskant Pani ,  Tianpei Zhang ,  Sanjay Thyamagundalu

IPC: H04L29/06 ,  H04L12/46

CPC classification number: H04L65/4076 ,  H04L12/4633 ,  H04L12/4645 ,  H04L45/16 ,  H04L45/48 ,  H04L69/22 ,  H04L2012/4629 ,  Y02D30/30

Abstract: An inner packet configured with a multicast address and configured to perform a traceroute operation through a network is encapsulated to form an encapsulated packet. The encapsulated packet is sent into a network, the encapsulated packet being forwarded along a multicast tree of the network for the multicast address. A plurality of responses are received from a plurality of network nodes comprising the multicast tree, wherein each response comprises an indication of a node of the plurality of nodes that sends the response and an indication of a node from which the node sending the response received the encapsulated packet.

Abstract translation: 配置有多播地址并被配置为通过网络执行跟踪路由操作的内部分组被封装以形成封装的分组。 封装的报文被发送到网络中，封装的报文沿组播地址的网络多播树转发。 从包括多播树的多个网络节点接收多个响应，其中每个响应包括发送响应的多个节点中的节点的指示以及发送响应的节点从其接收到的节点的指示 封装数据包。

公开(公告)号：US20160065449A1

公开(公告)日：2016-03-03

申请号：US14472573

申请日：2014-08-29

Applicant: Cisco Technology, Inc.

Inventor： Ayaskant Pani ,  Ayan Banerjee

IPC: H04L12/707 ,  H04L12/729

CPC classification number: H04L45/24 ,  H04L45/125

Abstract: A plurality of equal cost paths through a network from a source node to a destination node are determined. A maximum bandwidth capacity for each link of each of the plurality of equal cost paths is determined, and a smallest capacity link for each of the plurality of equal cost paths is determined from the maximum capacity bandwidths for each link. An aggregated maximum bandwidth from the source node to the destination node is determined by aggregating the smallest capacity links for each of the plurality of equal cost paths. Traffic is sent from the source node along each of the plurality of equal cost paths according to a value of a capacity for the smallest capacity link for each of the plurality of equal cost paths, wherein a total of the sent traffic does not exceed the aggregated maximum bandwidth.

Abstract translation: 确定通过网络从源节点到目的地节点的多条相同的成本路径。 确定多个相同成本路径中的每一个的每个链路的最大带宽容量，并且根据每个链路的最大容量带宽确定用于多个等价路径中的每一个的最小容量链路。 从源节点到目的地节点的聚合最大带宽通过聚合多个相等成本路径中的每一个的最小容量链路来确定。 根据多个等价路径中的每一个的最小容量链路的容量的值，从多个等价路径中的每一个向源节点发送流量，其中所发送的流量的总和不超过聚合的 最大带宽。

公开(公告)号：US20150124654A1

公开(公告)日：2015-05-07

申请号：US14333151

申请日：2014-07-16

Applicant: Cisco Technology, Inc.

Inventor： Ayaskant Pani

IPC: H04L12/24 ,  H04L12/18

CPC classification number: H04L12/18 ,  H04L12/4633 ,  H04L41/082 ,  H04L41/12 ,  H04L41/22 ,  H04L43/0811 ,  H04L43/50 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/18 ,  H04L45/20 ,  H04L45/28 ,  H04L45/48 ,  H04L45/64 ,  H04L49/201 ,  H04L49/25 ,  H04L61/103 ,  H04L61/2007 ,  H04L61/2061 ,  H04L61/6004 ,  H04L69/22

Abstract: Systems, methods and transitory computer-readable storage media for constructing a loop free multicast tree. The methods include observing a network topology transition affecting a first path from the particular node to a root node, calculating a second path from the particular node to the root node and sending a message to an upstream node requesting that the upstream node be a root port in the calculated second path. If the upstream node agrees to be the root port in the calculated second path, the method further includes creating a new FTAG tree topology view that includes the upstream node as the root port in the second path.

Abstract translation: 用于构建无循环组播树的系统，方法和暂时计算机可读存储介质。 这些方法包括观察影响从特定节点到根节点的第一路径的网络拓扑转换，计算从特定节点到根节点的第二路径，并向上游节点发送请求上游节点为根端口的消息 在计算的第二条路径。 如果上游节点同意在计算的第二路径中的根端口，则该方法还包括创建新的FTAG树拓扑视图，其包括作为第二路径中的根端口的上游节点。