公开(公告)号：US20140365418A1

公开(公告)日：2014-12-11

申请号：US13910182

申请日：2013-06-05

Applicant: Cisco Technology, Inc.

Inventor： Clinton Grant

IPC: H04L12/801

CPC classification number: H04L63/1441 ,  H04L45/38 ,  H04L47/2475

Abstract: Presented herein are probabilistic flow management techniques in which flow objects are probabilistically evaluated in view of the current contents of a flow table to determine if the flow object should be added to the flow table. An untrusted packet flow may be received at a feature or function of a networking device. The feature initiates addition of an untrusted flow object corresponding to the untrusted packet flow into a flow table. A probabilistic flow management mechanism determines if the number of untrusted flow objects in the flow table is below a predetermined lower limit. If the number of untrusted flow objects exceeds the lower limit and prior to addition of the untrusted flow object into the flow table, the probabilistic flow management mechanism probabilistically determines if the untrusted flow object may be added to the flow table.

Abstract translation: 这里呈现的是概率流管理技术，其中根据流表的当前内容来概率地评估流对象，以确定流对象是否应该添加到流表中。 可以在网络设备的特征或功能处接收不可信的分组流。 该特征启动了对应于不可信分组流的不可信流对象添加到流表中。 概率流管理机构确定流表中不可信流对象的数量是否低于预定的下限。 如果不可信流对象的数量超过下限，并且在将不可信流对象添加到流表中之前，概率流管理机制概率地确定是否可以将不可信流对象添加到流表中。

公开(公告)号：US10599672B2

公开(公告)日：2020-03-24

申请号：US15288140

申请日：2016-10-07

Applicant: Cisco Technology, Inc.

Inventor： Jeffrey Y. D. Lo ,  Pratap Pereira ,  Rajeev Kochhar ,  Vinit Rajan Kizhakkel ,  Clinton Grant

IPC: G06F17/30 ,  G06F16/27 ,  G06F16/23 ,  G06F16/22

Abstract: In one embodiment, a cursor management process inserts temporal references into a plurality of records written to a table of a shared database, the temporal references indicative of an order in which the records are written. A table write cursor points at a last-written record from among the plurality of records, and read cursors point to a last-read record of a corresponding application. The cursor management process may then provide, table updates to a particular application by determining a chain of one or more updated records of the table from the last-read record of the particular application to the last-written record based on walking a particular read cursor for the particular application through the temporal references of the one or more updated records until the particular read cursor points to the last-written record according to the table write cursor.

公开(公告)号：US20250086856A1

公开(公告)日：2025-03-13

申请号：US18244066

申请日：2023-09-08

Applicant: Cisco Technology, Inc.

Inventor： Clinton Grant

IPC: G06T11/20 ,  G06F3/04845 ,  G06T11/60 ,  H04L67/10

Abstract: In one implementation, a method herein comprises: identifying, by a device, compute nodes for a distributed application and services executed by the distributed application; identifying, by the device, inter-process connections between the services; generating, by the device, a graph with the inter-process connections as edges of the graph; and providing, by the device, the graph for display.

公开(公告)号：US20170147669A1

公开(公告)日：2017-05-25

申请号：US15288140

申请日：2016-10-07

Applicant: Cisco Technology, Inc.

Inventor： Jeffrey Y.D. Lo ,  Pratap Pereira ,  Rajeev Kochhar ,  Vinit Rajan Kizhakkel ,  Clinton Grant

IPC: G06F17/30

Abstract: In one embodiment, a cursor management process inserts temporal references into a plurality of records written to a table of a shared database, the temporal references indicative of an order in which the records are written. A table write cursor points at a last-written record from among the plurality of records, and read cursors point to a last-read record of a corresponding application. The cursor management process may then provide, table updates to a particular application by determining a chain of one or more updated records of the table from the last-read record of the particular application to the last-written record based on walking a particular read cursor for the particular application through the temporal references of the one or more updated records until the particular read cursor points to the last-written record according to the table write cursor.

公开(公告)号：US09191404B2

公开(公告)日：2015-11-17

申请号：US13910182

申请日：2013-06-05

Applicant: Cisco Technology, Inc.

Inventor： Clinton Grant

IPC: G06F9/44 ,  G06N7/02 ,  G06N7/06 ,  H04L29/06 ,  H04L12/721 ,  H04L12/859

CPC classification number: H04L63/1441 ,  H04L45/38 ,  H04L47/2475

Abstract: Presented herein are probabilistic flow management techniques in which flow objects are probabilistically evaluated in view of the current contents of a flow table to determine if the flow object should be added to the flow table. An untrusted packet flow may be received at a feature or function of a networking device. The feature initiates addition of an untrusted flow object corresponding to the untrusted packet flow into a flow table. A probabilistic flow management mechanism determines if the number of untrusted flow objects in the flow table is below a predetermined lower limit. If the number of untrusted flow objects exceeds the lower limit and prior to addition of the untrusted flow object into the flow table, the probabilistic flow management mechanism probabilistically determines if the untrusted flow object may be added to the flow table.

Abstract translation: 这里呈现的是概率流管理技术，其中根据流表的当前内容来概率地评估流对象，以确定流对象是否应该添加到流表中。 可以在网络设备的特征或功能处接收不可信的分组流。 该特征启动了对应于不可信分组流的不可信流对象添加到流表中。 概率流管理机构确定流表中不可信流对象的数量是否低于预定的下限。 如果不可信流对象的数量超过下限，并且在将不可信流对象添加到流表中之前，概率流管理机制概率地确定是否可以将不可信流对象添加到流表中。