IP Library Granted Patent US 10,305,757
Granted Patent B2
US 10,305,757 · App. 15/132,086 · Granted May 28, 2019

Determining a reputation of a network entity

Inventors: Navindra Yadav (Cupertino, CA); Supreeth Hosur Nagesh Rao (Cupertino, CA); Ashutosh Kulshreshtha (Fremont, CA); Omid Madani (San Jose, 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/248G06F16/24578G06F16/285G06F16/288G06F16/29G06F16/9535G06F17/3053G06F17/30241G06F17/30554G06F17/30598G06F17/30604G06F17/30867G06F21/53G06F21/552G06F21/566G06N20/00G06N99/005G06T11/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,305,757
App. No.
15/132,086
Granted
May 28, 2019
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 (77)

1. A computer-implemented method, comprising:

monitoring, by a network traffic monitoring system, network traffic data for a plurality of nodes of a network;

analyzing, by the network traffic monitoring system, the network traffic data to classify a type of traffic for each flow of a plurality of flows;

receiving, to the network traffic monitoring system from a requestor, a request for a reputation score associated with one or more nodes of the network;

identifying, by the network traffic monitoring system, the type of traffic for one or more flows associated with the one or more nodes, each identified flow defining an event;

determining, by the network monitoring system, the reputation score associated with the one or more nodes based on the type of traffic for the one or more flows associated with the one or more nodes; and

sending, by the network traffic monitoring system, the reputation score to the requestor; 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 *[Time current −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.

2. The computer-implemented method of claim 1 , 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.

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

4. The computer-implemented method of claim 1 , 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.

5. The computer-implemented method of claim 1 , wherein the requestor is a requesting node on the network and the method further includes receiving a request to transmit data to one of the one or more nodes.

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 the 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. The computer-implemented method of claim 1 , wherein the requestor is a presentation module of the network monitoring system and the method further comprises:

generating a network status report containing the reputation score.

9. A non-transitory computer-readable medium having computer readable instructions that, when executed by a processor of a computer, cause the computer to:

monitor, by a network traffic monitoring system, network traffic data for a plurality of nodes of a network;

analyze, by the network traffic monitoring system, the network traffic data to classify a type of traffic for each flow of a plurality of flows;

receive, to the network traffic monitoring system from a requestor, a request for a reputation score associated with one or more nodes of the network;

identify, by the network traffic monitoring system, the type of traffic for one or more flows associated with the one or more nodes, each identified flow defining an event;

determine, by the network monitoring system, the reputation score associated with the one or more nodes based on the type of traffic for the one or more flows associated with the one or more nodes;

send, by the network traffic monitoring system, the reputation score to the requestor; and

block 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 *[Time current −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.

10. The non-transitory computer-readable medium of claim 9 , wherein the instructions that cause the computer to analyze the network traffic data to classify a type of traffic for each flow further cause the computer to:

match the flow to a known pattern of traffic.

11. The non-transitory computer-readable medium of claim 10 , wherein the known pattern of traffic corresponds to at least one of a DDOS attack, a FIN scan, or port knock.

12. The non-transitory computer-readable medium of claim 9 , wherein the instructions that cause the computer to analyze the network traffic data to classify a type of traffic for each flow further cause the computer to:

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

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

13. The non-transitory computer-readable medium of claim 9 , 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 the network.

14. A system comprising:

a processor;

memory including instructions that when executed by the processor, cause the system to:

monitor, by a network traffic monitoring system, network traffic data for a plurality of nodes of a network;

analyze, by the network traffic monitoring system, the network traffic data to classify a type of traffic for each flow of a plurality of flows;

receive, to the network traffic monitoring system from a requestor, a request for a reputation score associated with one or more nodes of the network;

identify, by the network traffic monitoring system, the type of traffic for one or more flows associated with the one or more nodes, each identified flow defining an event;

determine, by the network monitoring system, the reputation score associated with the one or more nodes based on the type of traffic for the one or more flows associated with the one or more nodes;

send, by the network traffic monitoring system, the reputation score to the requestor; and

block 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 *[Time current −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.

15. The system of claim 14 , wherein the instructions that cause the system to analyze the network traffic data to classify a type of traffic for each flow further cause the system to:

match the flow to a known pattern of traffic.

16. The system of claim 14 , wherein the instructions that cause the system to analyze the network traffic data to classify a type of traffic for each flow further cause the system to:

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

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

17. The system of claim 14 , wherein the requestor includes at least one of a presentation module, an analytics module, or a policy engine of the network traffic monitoring system.

18. The system of claim 14 , 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 the network.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 18, 2016
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 038309/0879 →
Continuity (2)
Provisional Application 62171899 · Jun 5, 2015
Related Publication 20160359897A1 · Dec 8, 2016
Cited By (3)
US 12,255,804 US 12,513,073 US 12,519,857