IP Library Granted Patent US 10,623,284
Granted Patent B2
US 10,623,284 · App. 16/403,797 · Granted Apr 14, 2020

Determining a reputation of a network entity

Inventors: Navindra Yadav (Cupertino, CA); Supreeth Hosur Nagesh Rao (Cupertino, CA); Ashutosh Kulshreshtha (Cupertino, CA); Omid Madani (San Carlos, CA); Jackson Ngoc Ki Pang (Sunnyvale, CA); Khawar Deen (Sunnyvale, CA); Ellen Christine Scheib (Mountain View, CA)
Assignee: CISCO TECHNOLOGY, INC.
H04L43/045G06F3/0482G06F3/04842G06F3/04847G06F9/45558G06F16/122G06F16/137G06F16/162G06F16/17G06F16/173G06F16/174G06F16/1744G06F16/1748G06F16/235G06F16/2322G06F16/2365G06F16/248G06F16/24578G06F16/285G06F16/288G06F16/29G06F16/9535G06F21/53G06F21/552G06F21/566G06N20/00G06N99/00G06T11/206H04J3/0661H04J3/14H04L1/242H04L9/0866H04L9/3239H04L9/3242H04L41/046H04L41/0668H04L41/0803H04L41/0806H04L41/0816H04L41/0893H04L41/12H04L41/16H04L41/22H04L43/02H04L43/04H04L43/062H04L43/08H04L43/0805H04L43/0811H04L43/0829H04L43/0841H04L43/0858H04L43/0864H04L43/0876H04L43/0882H04L43/0888H04L43/10H04L43/106H04L43/12H04L43/16H04L45/306H04L45/38H04L45/46H04L45/507H04L45/66H04L45/74H04L47/11H04L47/20H04L47/2441H04L47/2483H04L47/28H04L47/31H04L47/32H04L61/2007H04L63/0227H04L63/0263H04L63/06H04L63/0876H04L63/145H04L63/1408H04L63/1416H04L63/1425H04L63/1433H04L63/1441H04L63/1458H04L63/1466H04L63/16H04L63/20H04L67/10H04L67/1002H04L67/12H04L67/16H04L67/36H04L67/42H04L69/16H04L69/22H04W72/08H04W84/18G06F2009/4557G06F2009/45587G06F2009/45591G06F2009/45595G06F2221/033G06F2221/2101G06F2221/2105G06F2221/2111G06F2221/2115G06F2221/2145H04L67/22
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,623,284
App. No.
16/403,797
Granted
Apr 14, 2020
Kind
B2
Abstract

An example method can include monitoring a network to identify flows between nodes in the network. Once flows have been identified, the flows can be tagged and labelled according to the type of traffic they represent. If a flow represents malicious or otherwise undesirable traffic, it can be tagged accordingly. A request can then be made for a reputation score of an entity which can identify one or more nodes of the network.

Claims (66)

1. A computer-implemented method, comprising:

identifying a type of traffic for one or more flows associated with one or more nodes;

determining a reputation score of one or more nodes based on the type of traffic through the one or more nodes; and

blocking a node of the one or more nodes from sending traffic in response to the reputation score for that node being below a predetermined threshold;

wherein the reputation score is calculated by:

Reputation Score=Σ i= 1 n Value i +(Recovery i *[TimecurrentTime i ])

where:

n is the number of events identified during the identifying;

Value i is an initial relative impact of the type of traffic of an ith event on the reputation score, where Value i is different for at least two different values of i;

Recovery i is a constant for the type of traffic of the ith event, wherein the Recovery for at least one event is non-zero, and the recovery for at least one other event is zero;

TiMe current is a time value based on a current time;

Time i is a time value based on a time of the ith event.

2. The computer-implemented method of claim 1 , further comprising, before the determining, analyzing network traffic data to classify a type of traffic for each flow of a plurality of flows.

3. The computer-implemented method of claim 2 , wherein analyzing the network traffic data to classify a type of traffic for each flow includes:

matching the flow to a known pattern of traffic.

4. The computer-implemented method of claim 3 , wherein the known pattern of traffic corresponds to at least one of a DDOS attack, a FIN scan, or a port knock.

5. The computer-implemented method of claim 2 , wherein analyzing the network traffic data to classify a type of traffic for each flow includes:

identifying one or more network policies associated with the flow; and

determining whether the flow complies with the one or more network policies.

6. The computer-implemented method of claim 1 , wherein the reputation score is associated with at least one of an endpoint, an endpoint group, a pair of endpoints, a pair of endpoint groups, an endpoint and an endpoint group, a user name for a process, a process, or a path for a process of a network.

7. The computer-implemented method of claim 1 , wherein determining the reputation score includes:

determining at least one of the one or more flows is tagged as malicious or misconfigured; and

decreasing the reputation score.

8. A non-transitory computer readable media storing instructions which when executed by a system cause the system to perform operations comprising:

identifying a type of traffic for one or more flows associated with one or more nodes;

determining a reputation score of one or more nodes based on the type of traffic through the one or more nodes; and

blocking a node of the one or more nodes from sending traffic in response to the reputation score for that node being below a predetermined threshold;

wherein the reputation score is calculated by:

Reputation Score=Σ i= 1 n Value i +(Recovery i *[Timecurrent−Time i ])

where:

n is the number of events identified during the identifying;

Value i is an initial relative impact of the type of traffic of an ith event on the reputation score, where Value i is different for at least two different values of i;

Recovery i is a constant for the type of traffic of the ith event, wherein the Recovery for at least one event is non-zero, and the recovery for at least one other event is zero;

Time current is a time value based on a current time; Time i is a time value based on a time of the ith event.

9. The media of claim 8 , the operations further comprising, before the determining, analyzing network traffic data to classify a type of traffic for each flow of a plurality of flows.

10. The media of claim 9 , wherein analyzing network traffic data to classify a type of traffic for each flow includes: matching the flow to a known pattern of traffic.

11. The media of claim 10 , wherein the known pattern of traffic corresponds to at least one of a DDOS attack, a FIN scan, or a port knock.

12. The media of claim 8 , wherein analyzing network traffic data to classify a type of traffic for each flow includes:

identifying one or more network policies associated with the flow; and

determining whether the flow complies with the one or more network policies.

13. The media of claim 8 , wherein the reputation score is associated with at least one of an endpoint, an endpoint group, a pair of endpoints, a pair of endpoint groups, an endpoint and an endpoint group, a user name for a process, a process, or a path for a process of a network.

14. The media of claim 8 , wherein determining the reputation score includes:

determining at least one of the one or more flows is tagged as malicious or misconfigured; and

decreasing the reputation score.

15. A system, comprising:

a non-transitory computer readable media storing instructions;

a processor programmed to execute the instructions to perform operations comprising:

identifying a type of traffic for one or more flows associated with one or more;

determining a reputation score of one or more nodes based on the type of traffic through the one or more nodes; and

blocking a node of the one or more nodes from sending traffic in response to the reputation score for that node being below a predetermined threshold;

wherein the reputation score is calculated by:

Reputation Score=Σ i= 1 n Value i +(Recovery i *[Timecurrent−Time i ])

where:

n is the number of events identified during the identifying;

Value i is an initial relative impact of the type of traffic of an ith event on the reputation score, where Value i is different for at least two different values of i;

Recovery i is a constant for the type of traffic of the ith event, wherein the Recovery for at least one event is non-zero, and the recovery for at least one other event is zero;

Time current is a time value based on a current time;

Time i is a time value based on a time of the ith event.

16. The system of claim 15 , the operations further comprising, before the determining, analyzing network traffic data to classify a type of traffic for each flow of a plurality of flows.

17. The system of claim 16 , wherein analyzing the network traffic data to classify a type of traffic for each flow includes:

matching the flow to a known pattern of traffic.

18. The system of claim 17 , wherein the known pattern of traffic corresponds to at least one of a DDOS attack, a FIN scan, or a port knock.

19. The system of claim 16 , wherein analyzing the network traffic data to classify a type of traffic for each flow includes:

identifying one or more network policies associated with the flow; and

determining whether the flow complies with the one or more network policies.

20. The system of claim 15 , wherein the reputation score is associated with at least one of an endpoint, an endpoint group, a pair of endpoints, a pair of endpoint groups, an endpoint and an endpoint group, a user name for a process, a process, or a path for a process of a network.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 6, 2019
From: YADAV, NAVINDRA; RAO, SUPREETH HOSUR NAGESH; KULSHRESHTHA, ASHUTOSH; MADANI, OMID; PANG, JACKSON NGOC KI; DEEN, KHAWAR; SCHEIB, ELLEN CHRISTINE
To: CISCO TECHNOLOGY, INC.
Reel/Frame 049089/0675 →
Continuity (3)
Continuation 15132086 · Apr 18, 2016
Provisional Application 62171899 · Jun 5, 2015
Related Publication 20190260653A1 · Aug 22, 2019
Cited By (2)
US 12,206,690 US 12,641,127