公开(公告)号：US20150124820A1

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

申请号：US14472148

申请日：2014-08-28

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Navindra Yadav ,  Satyam Sinha ,  Thomas J. Edsall ,  Kit Chiu Chu

IPC: H04L12/743 ,  H04L12/947

CPC classification number: H04L47/50 ,  H04L45/74 ,  H04L45/7453 ,  H04L47/125 ,  H04L47/56 ,  H04L49/25 ,  H04L49/254 ,  H04L61/103 ,  H04L61/2084 ,  H04L61/6004 ,  H04L61/6095 ,  H04L67/22 ,  H04L67/322 ,  H04L69/167 ,  H04L69/22

Abstract: Various embodiments of the present disclosure provide methods for randomly mapping entries in a suitable lookup table across multiple switch devices and/or multiple switch chipsets in each of the multiple switch devices by using two or more independent hash functions. In some embodiments, the number of entries in the lookup table is equal to be the least common multiple of all possible M (i.e., a number of switch devices) choosing R values (i.e., a desired redundancy level).

Abstract translation: 本公开的各种实施例提供了通过使用两个或多个独立散列函数在多个交换设备中的多个交换设备和/或多个交换机设备中的多个交换机芯片组中随机映射合适的查找表中的条目的方法。 在一些实施例中，查找表中的条目数量等于选择R值的所有可能的M（即，多个交换设备）的最小公倍数（即，期望的冗余级别）。

公开(公告)号：US20150124614A1

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

申请号：US14448934

申请日：2014-07-31

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Sha Ma ,  Thomas J. Edsall

IPC: H04L12/863 ,  H04L12/803

CPC classification number: H04L47/50 ,  H04L45/74 ,  H04L45/7453 ,  H04L47/125 ,  H04L47/56 ,  H04L49/25 ,  H04L49/254 ,  H04L61/103 ,  H04L61/2084 ,  H04L61/6004 ,  H04L61/6095 ,  H04L67/22 ,  H04L67/322 ,  H04L69/167 ,  H04L69/22

Abstract: Systems, methods, and non-transitory computer-readable storage media for per-packet load balancing in a port channel. The system first maps an incoming traffic flow to queues containing packets to be transmitted through a port channel at the system, the port channel including ports grouped into a single virtual port. Next, the system assigns a port from the port channel to a queue for a predetermined period of time, wherein the port is assigned to the queue based on at least one of a port state and a service history associated with the queue. The system then de-queues at least a portion of the packets in the queue through the port for the predetermined period of time. This load balancing can ensure that traffic is efficiently and fairly load balanced across the links of the port channel, and packets of each queue are not reordered.

Abstract translation: 用于端口通道中每个数据包负载均衡的系统，方法和非暂时的计算机可读存储介质。 系统首先将进入的流量映射到包含要通过系统端口通道发送的数据包的队列，端口通道包括分组为单个虚拟端口的端口。 接下来，系统将端口从端口信道分配到队列预定的时间段，其中基于与队列相关联的端口状态和服务历史中的至少一个将端口分配给队列。 然后，系统通过端口在队列中的至少一部分分组排队预定时间段。 这种负载均衡可以确保流量在端口通道的链路之间高效，平衡地负载平衡，并且每个队列的数据包不重新排序。

公开(公告)号：US20240163216A1

公开(公告)日：2024-05-16

申请号：US18418169

申请日：2024-01-19

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Thomas J. Edsall ,  Sarang M. Dharmapurikar ,  Janakiramanan Vaidyanathan

IPC: H04L47/125 ,  H04L45/00

CPC classification number: H04L47/125 ,  H04L45/38

Abstract: In accordance with one embodiment, a source leaf device receives a packet.
The source leaf device identifies a flowlet associated with the packet and a destination leaf device to which the packet is to be transmitted. The source leaf device may determine whether the flowlet is a new flowlet. The source leaf device may select an uplink of the source leaf device via which to transmit the flowlet to the destination leaf device according to whether the flowlet is a new flowlet. The source leaf device may then transmit the packet to the destination leaf device via the uplink.

公开(公告)号：US20230088185A1

公开(公告)日：2023-03-23

申请号：US18059713

申请日：2022-11-29

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Thomas J. Edsall ,  Sarang M. Dharmapurikar ,  Janakiramanan Vaidyanathan

IPC: H04L47/125 ,  H04L45/00

Abstract: In accordance with one embodiment, a source leaf device receives a packet. The source leaf device identifies a flowlet associated with the packet and a destination leaf device to which the packet is to be transmitted. The source leaf device may determine whether the flowlet is a new flowlet. The source leaf device may select an uplink of the source leaf device via which to transmit the flowlet to the destination leaf device according to whether the flowlet is a new flowlet. The source leaf device may then transmit the packet to the destination leaf device via the uplink.

公开(公告)号：US20210243093A1

公开(公告)日：2021-08-05

申请号：US17238193

申请日：2021-04-22

Applicant: Cisco Technology, Inc.

Inventor： Mohammadreza Alizadeh Attar ,  Navindra Yadav ,  Abhishek Ranjan Singh ,  Vimalkumar Jeyakumar ,  Shashidhar Gandham ,  Roberto Fernando Spadaro

IPC: H04L12/26 ,  H04L29/06 ,  G06F9/455 ,  G06N20/00 ,  G06F21/55 ,  G06F21/56 ,  G06F16/28 ,  G06F16/2457 ,  G06F16/248 ,  G06F16/29 ,  G06F16/16 ,  G06F16/17 ,  G06F16/11 ,  G06F16/13 ,  G06F16/174 ,  G06F16/23 ,  G06F16/9535 ,  G06N99/00 ,  H04L9/32 ,  H04L12/24 ,  H04L12/715 ,  H04L12/723 ,  H04L29/08 ,  H04L12/851 ,  H04W84/18 ,  G06F21/53 ,  G06F3/0484 ,  H04L1/24 ,  H04W72/08 ,  H04L9/08 ,  H04J3/06 ,  H04J3/14 ,  H04L29/12 ,  H04L12/813 ,  H04L12/823 ,  H04L12/801 ,  H04L12/741 ,  H04L12/833 ,  H04L12/721 ,  G06F3/0482 ,  G06T11/20 ,  H04L12/841 ,  H04L12/725

Abstract: Systems, methods, and computer-readable media are provided for determining a packet's round trip time (RTT) in a network. A system can receive information of a packet sent by a component of the network and further determine an expected acknowledgement (ACK) sequence number associated with the packet based upon received information of the packet. The system can receive information of a subsequent packet received by the component and determine an ACK sequence number and a receiving time of the subsequent packet. In response to determining that the ACK sequence number of the subsequent TCP packet matches the expected ACK sequence number, the system can determine a round trip time (RTT) of the packet based upon the received information of the packet and the received information of the subsequent packet.

公开(公告)号：US10917319B2

公开(公告)日：2021-02-09

申请号：US16443122

申请日：2019-06-17

Applicant: Cisco Technology, Inc.

Inventor： Ellen Christine Scheib ,  Ali Parandehgheibi ,  Omid Madani ,  Vimalkumar Jeyakumar ,  Navindra Yadav ,  Mohammadreza Alizadeh Attar

IPC: H04L12/24 ,  H04L12/26 ,  H04L29/06 ,  G06F9/455 ,  G06N20/00 ,  G06F21/55 ,  G06F21/56 ,  G06F16/28 ,  G06F16/2457 ,  G06F16/248 ,  G06F16/29 ,  G06F16/16 ,  G06F16/17 ,  G06F16/11 ,  G06F16/13 ,  G06F16/174 ,  G06F16/23 ,  G06F16/9535 ,  G06N99/00 ,  H04L9/32 ,  H04L12/715 ,  H04L12/723 ,  H04L29/08 ,  H04L12/851 ,  H04W84/18 ,  G06F21/53 ,  G06F3/0484 ,  H04L1/24 ,  H04W72/08 ,  H04L9/08 ,  H04J3/06 ,  H04J3/14 ,  H04L29/12 ,  H04L12/813 ,  H04L12/823 ,  H04L12/801 ,  H04L12/741 ,  H04L12/833 ,  H04L12/721 ,  G06F3/0482 ,  G06T11/20 ,  H04L12/841 ,  H04L12/725

Abstract: Systems and methods are provided for automatically discovering applications/clusters in a network and mapping dependencies between the applications/clusters. A network monitoring system can capture network flow data using sensors executing on physical and/or virtual servers of the network and sensors executing on networking devices connected to the servers. The system can determine a graph including nodes, representing at least the servers, and edges, between pairs of the nodes of the graph indicating the network flow data includes one or more observed flows between pairs of the servers represented by the pairs of the nodes. The system can determine a dependency map, including representations of clusters of the servers and representations of dependencies between the clusters, based on the graph. The system can display a first representation of a first cluster of the dependency map and information indicating a confidence level of identifying the first cluster.

公开(公告)号：US10728119B2

公开(公告)日：2020-07-28

申请号：US15145493

申请日：2016-05-03

Applicant: Cisco Technology, Inc.

Inventor： Ali Parandehgheibi ,  Omid Madani ,  Vimalkumar Jeyakumar ,  Ellen Christine Scheib ,  Navindra Yadav ,  Mohammadreza Alizadeh Attar

IPC: H04L12/26 ,  H04L29/06 ,  G06F16/29 ,  G06F16/28 ,  H04L12/24 ,  H04L29/08 ,  G06F9/455 ,  G06N20/00 ,  G06F16/248 ,  G06F16/9535 ,  G06F16/2457 ,  G06F21/55 ,  G06F21/56 ,  H04L12/851 ,  H04W84/18 ,  G06F21/53 ,  H04L12/723 ,  G06F3/0484 ,  H04L1/24 ,  H04W72/08 ,  H04L9/08 ,  H04L9/32 ,  H04J3/06 ,  H04J3/14 ,  H04L29/12 ,  H04L12/813 ,  H04L12/823 ,  H04L12/801 ,  H04L12/741 ,  H04L12/833 ,  H04L12/721 ,  G06F3/0482 ,  G06T11/20 ,  H04L12/841 ,  H04L12/725 ,  H04L12/715 ,  G06F16/16 ,  G06F16/17 ,  G06F16/11 ,  G06F16/13 ,  G06N99/00 ,  G06F16/174 ,  G06F16/23

Abstract: Application dependency mapping (ADM) can be automated in a network. The network can determine whether certain nodes form a cluster of a tier of an application. The network can monitor network data and process data for traffic passing through the network using a sensor network that provides multiple perspectives for the traffic. The network can analyze the network data and process data to determine respective feature vectors for nodes. A feature vector may represent a combination of the features corresponding to the network data and the features corresponding to the process data of a node. The network can compare the similarity of the respective feature vectors and determine each node's cluster based on similarity measures between nodes.

公开(公告)号：US10516612B2

公开(公告)日：2019-12-24

申请号：US15792587

申请日：2017-10-24

Applicant: Cisco Technology, Inc.

Inventor： Sarang M. Dharmapurikar ,  Mohammadreza Alizadeh Attar ,  Kit Chiu Chu ,  Francisco M. Matus ,  Adam Hutchin ,  Janakiramanan Vaidyanathan

IPC: H04L12/743 ,  G11C15/04 ,  H04L12/707 ,  H04L12/803 ,  G11C11/4096 ,  G06K15/10 ,  G06F9/30 ,  G11C15/00

Abstract: Apparatus, systems and methods may be used to monitor data flows and to select and track particularly large data flows. A method of tracking data flows and identifying large-data (“elephant”) flows comprises extracting fields from a packet of data to construct a flow key, computing a hash value on the flow key to provide a hashed flow signature, entering and/or comparing the hashed flow signature with entries in a flow hash table. Each hash table entry includes a byte count for a respective flow. When the byte count for a flow exceeds a threshold value, the flow is added to a large-data flow (“elephant”) table and the flow is then tracked in the large-data flow table.

公开(公告)号：US10326672B2

公开(公告)日：2019-06-18

申请号：US15145666

申请日：2016-05-03

Applicant: Cisco Technology, Inc.

Inventor： Ellen Christine Scheib ,  Ali Parandehgheibi ,  Omid Madani ,  Vimalkumar Jeyakumar ,  Navindra Yadav ,  Mohammadreza Alizadeh Attar

IPC: H04L12/26 ,  H04L29/06 ,  G06F9/455 ,  G06N20/00 ,  G06F16/29 ,  G06F16/248 ,  G06F16/28 ,  G06F16/9535 ,  G06F16/2457 ,  H04L12/851 ,  H04L12/24 ,  H04W84/18 ,  H04L29/08 ,  G06F21/53 ,  H04L12/723 ,  G06F3/0484 ,  H04L1/24 ,  H04W72/08 ,  H04L9/08 ,  H04L9/32 ,  H04J3/06 ,  H04J3/14 ,  H04L29/12 ,  H04L12/813 ,  H04L12/823 ,  H04L12/801 ,  H04L12/741 ,  H04L12/833 ,  H04L12/721 ,  G06F3/0482 ,  G06T11/20 ,  H04L12/841 ,  H04L12/725 ,  H04L12/715 ,  G06F21/55 ,  G06F21/56 ,  G06F16/16 ,  G06F16/17 ,  G06F16/11 ,  G06F16/13 ,  G06N99/00 ,  G06F16/174 ,  G06F16/23

Abstract: Application dependency mapping (ADM) can be automated in a network. The network can determine an optimum number of clusters for the network using the minimum description length principle (MDL). The network can capture network and associated data using a sensor network that provides multiple perspectives and generate a graph therefrom. The nodes of the graph can include sources, destinations, and destination ports identified in the captured data, and the edges of the graph can include observed flows from the sources to the destinations at the destination ports. Each clustering can be evaluated according to an MDL score. The optimum number of clusters for the network may correspond to the number of clusters of the clustering associated with the minimum MDL score.

公开(公告)号：US20180139138A1

公开(公告)日：2018-05-17

申请号：US15869531

申请日：2018-01-12

Applicant: Cisco Technology, Inc.

Inventor： Erico Vanini ,  Rong Pan ,  Mohammadreza Alizadeh Attar ,  Thomas J. Edsall

IPC: H04L12/803 ,  H04L12/911 ,  H04L12/707 ,  H04L12/923

CPC classification number: H04L47/125 ,  H04L45/24 ,  H04L47/122 ,  H04L47/762 ,  H04L47/822

Abstract: A first flowlet of a flow from a source network device to a destination network device is assigned to a first path of a plurality of paths between the source device and the destination device. The assignment of the first flowlet to the first path is made by a network connected device. A second flowlet is detected in response to an interruption in transmission of the flow due to congestion along the first path, wherein the interruption is longer in duration than a difference in a transmission time between the source network device and the destination network device along each of the plurality of paths. The second flowlet is assigned to a second path of the plurality of paths by the network connected device. According to some example embodiments, the second path is randomly selected from the plurality of paths.