Late data detection in data center

• US 10,536,357 B2
• Filed: 02/10/2016
• Issued: 01/14/2020
• Est. Priority Date: 06/05/2015
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Deen, Khawar, Yadav, Navindra, Gupta, Anubhav, Gandham, Shashidhar, Prasad, Rohit Chandra, Singh, Abhishek Ranjan, Chang, Shih-Chun
• Primary Examiner(s): Anyan, Barbara B
• Application Number:
  US15/040,829
• Publication Number:
  US 20160359711A1
• Time in Patent Office: 1,434 Days
• CPC Class Codes: G06F 16/122 using management policies backup systems G06F11/1446; file migration policies for HSM systems G06F16/185
• CPC Class Codes: G06F 16/137 Hash-based content-based indexing of textual data G06F16/31
• CPC Class Codes: G06F 16/162 Delete operations erasing in storage systems G06F3/0652
• CPC Class Codes: G06F 16/17 Details of further file system functions
• CPC Class Codes: G06F 16/173 Customisation support for file systems, e.g. localisation, multi-language support, personalisation
• CPC Class Codes: G06F 16/174 Redundancy elimination performed by the file system management of the data involved in backup or backup restore using de-duplication of the data G06F11/14
• CPC Class Codes: G06F 16/1744 using compression, e.g. sparse files
• CPC Class Codes: G06F 16/1748 De-duplication implemented within the file system, e.g. based on file segments de-duplication techniques in storage systems for the management of data blocks G06F3/0641
• CPC Class Codes: G06F 16/2322 using timestamps
• CPC Class Codes: G06F 16/235 Update request formulation
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/288 Entity relationship models
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 2009/4557 Distribution of virtual machine instances; Migration and load balancing
• CPC Class Codes: G06F 2009/45587 Isolation or security of virtual machine instances
• CPC Class Codes: G06F 2009/45591 Monitoring or debugging support
• CPC Class Codes: G06F 2009/45595 : Network integration; Enabling network access in virtual machine instances
• CPC Class Codes: G06F 21/53 : by executing in a restricted environment, e.g. sandbox or secure virtual machine
• CPC Class Codes: G06F 21/552 : involving long-term monitoring or reporting
• CPC Class Codes: G06F 21/556 : involving covert channels, i.e. data leakage between processes inhibiting the analysis of circuitry or operation with measures against power attack G06F21/755
• CPC Class Codes: G06F 21/566 : Dynamic detection, i.e. detection performed at run-time, e.g. emulation, suspicious activities
• CPC Class Codes: G06F 2221/033 : Test or assess software
• CPC Class Codes: G06F 2221/2101 : Auditing as a secondary aspect
• CPC Class Codes: G06F 2221/2105 : Dual mode as a secondary aspect
• CPC Class Codes: G06F 2221/2111 : Location-sensitive, e.g. geographical location, GPS
• CPC Class Codes: G06F 2221/2115 : Third party
• CPC Class Codes: G06F 2221/2145 : Inheriting rights or properties, e.g., propagation of permissions or restrictions within a hierarchy
• CPC Class Codes: G06F 3/0482 : Interaction with lists of selectable items, e.g. menus
• CPC Class Codes: G06F 3/04842 : Selection of displayed objects or displayed text elements G06F3/0482 takes precedence
• CPC Class Codes: G06F 3/04847 : Interaction techniques to control parameter settings, e.g. interaction with sliders or dials
• CPC Class Codes: G06F 9/45558 : Hypervisor-specific management and integration aspects
• CPC Class Codes: G06N 20/00 : Machine learning
• CPC Class Codes: G06N 99/00 : Subject matter not provided for in other groups of this subclass
• CPC Class Codes: G06T 11/206 : Drawing of charts or graphs
• CPC Class Codes: H04J 3/0661 : using timestamps
• CPC Class Codes: H04J 3/14 : Monitoring arrangements for SDH/SONET rings H04J3/085
• CPC Class Codes: H04L 1/242 : by comparing a transmitted test signal with a locally generated replica
• CPC Class Codes: H04L 41/046 : comprising network management agents or mobile agents therefor
• CPC Class Codes: H04L 41/0668 : by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
• CPC Class Codes: H04L 41/0803 : Configuration setting
• CPC Class Codes: H04L 41/0806 : for initial configuration or provisioning, e.g. plug-and-play
• CPC Class Codes: H04L 41/0816 : the condition being an adaptation, e.g. in response to network events
• CPC Class Codes: H04L 41/0893 : Assignment of logical groups to network elements
• CPC Class Codes: H04L 41/0894 : Policy-based network configuration management
• CPC Class Codes: H04L 41/12 : Discovery or management of network topologies
• CPC Class Codes: H04L 41/16 : using machine learning or artificial intelligence
• CPC Class Codes: H04L 41/22 : comprising specially adapted graphical user interfaces [GUI]
• CPC Class Codes: H04L 41/40 : using virtualisation of network functions or resources, e.g. SDN or NFV entities
• CPC Class Codes: H04L 43/02 : Capturing of monitoring data
• CPC Class Codes: H04L 43/026 : using flow identification
• CPC Class Codes: H04L 43/04 : Processing captured monitoring data, e.g. for logfile generation
• CPC Class Codes: H04L 43/045 : for graphical visualisation of monitoring data
• CPC Class Codes: H04L 43/062 : related to network traffic
• CPC Class Codes: H04L 43/08 : Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
• CPC Class Codes: H04L 43/0805 : by checking availability
• CPC Class Codes: H04L 43/0811 : by checking connectivity
• CPC Class Codes: H04L 43/0829 : Packet loss
• CPC Class Codes: H04L 43/0841 : Round trip packet loss
• CPC Class Codes: H04L 43/0858 : One way delays
• CPC Class Codes: H04L 43/0864 : Round trip delays
• CPC Class Codes: H04L 43/0876 : Network utilisation, e.g. volume of load or congestion level
• CPC Class Codes: H04L 43/0882 : Utilisation of link capacity
• CPC Class Codes: H04L 43/0888 : Throughput
• CPC Class Codes: H04L 43/10 : Active monitoring, e.g. heartbeat, ping or trace-route
• CPC Class Codes: H04L 43/106 : using time related information in packets, e.g. by adding timestamps
• CPC Class Codes: H04L 43/12 : Network monitoring probes
• CPC Class Codes: H04L 43/16 : Threshold monitoring
• CPC Class Codes: H04L 43/20 : the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV
• CPC Class Codes: H04L 45/306 : Route determination based on the nature of the carried application
• CPC Class Codes: H04L 45/38 : Flow based routing
• CPC Class Codes: H04L 45/46 : Cluster building
• CPC Class Codes: H04L 45/507 : Label distribution
• CPC Class Codes: H04L 45/66 : Layer 2 routing, e.g. in Ethernet based MAN's
• CPC Class Codes: H04L 45/74 : Address processing for routing
• CPC Class Codes: H04L 47/11 : Identifying congestion
• CPC Class Codes: H04L 47/20 : Traffic policing
• CPC Class Codes: H04L 47/2441 : relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/2483 : involving identification of individual flows
• CPC Class Codes: H04L 47/28 : in relation to timing considerations
• CPC Class Codes: H04L 47/31 : by tagging of packets, e.g. using discard eligibility [DE] bits
• CPC Class Codes: H04L 47/32 : by discarding or delaying data units, e.g. packets or frames
• CPC Class Codes: H04L 61/5007 : Internet protocol [IP] addresses
• CPC Class Codes: H04L 63/0227 : Filtering policies mail message filtering H04L51/212
• CPC Class Codes: H04L 63/0263 : Rule management
• CPC Class Codes: H04L 63/06 : for supporting key management in a packet data network cryptographic mechanisms or cryptographic arrangements for key management H04L9/08
• CPC Class Codes: H04L 63/0876 : based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
• CPC Class Codes: H04L 63/1408 : by monitoring network traffic monitoring network traffic per se H04L43/00
• CPC Class Codes: H04L 63/1416 : Event detection, e.g. attack signature detection
• CPC Class Codes: H04L 63/1425 : Traffic logging, e.g. anomaly detection
• CPC Class Codes: H04L 63/1433 : Vulnerability analysis
• CPC Class Codes: H04L 63/1441 : Countermeasures against malicious traffic countermeasures against attacks on cryptographic mechanisms H04L9/002
• CPC Class Codes: H04L 63/145 : the attack involving the propagation of malware through the network, e.g. viruses, trojans or worms
• CPC Class Codes: H04L 63/1458 : Denial of Service
• CPC Class Codes: H04L 63/1466 : Active attacks involving interception, injection, modification, spoofing of data unit addresses, e.g. hijacking, packet injection or TCP sequence number attacks
• CPC Class Codes: H04L 63/16 : Implementing security features at a particular protocol layer
• CPC Class Codes: H04L 63/20 : for managing network security; network security policies in general filtering policies H04L63/0227
• CPC Class Codes: H04L 67/01 : Protocols
• CPC Class Codes: H04L 67/10 : in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/1001 : for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/12 : specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04L 67/51 : Discovery or management thereof, e.g. service location protocol [SLP] or web services
• CPC Class Codes: H04L 67/535 : Tracking the activity of the user network monitoring arrangements H04L43/00; recording of computer activity G06F11/34
• CPC Class Codes: H04L 67/75 : Indicating network or usage conditions on the user display
• CPC Class Codes: H04L 69/16 : Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
• CPC Class Codes: H04L 69/22 : Parsing or analysis of headers
• CPC Class Codes: H04L 7/10 : Arrangements for initial synchronisation
• CPC Class Codes: H04L 9/0866 : involving user or device identifiers, e.g. serial number, physical or biometrical information, DNA, hand-signature or measurable physical characteristics
• CPC Class Codes: H04L 9/3239 : involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
• CPC Class Codes: H04L 9/3242 : involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC
• CPC Class Codes: H04W 72/54 : based on quality criteria
• CPC Class Codes: H04W 84/18 : Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

Systems, methods, and non-transitory computer-readable storage media for synchronizing timestamps of a sensor report to the clock of a device. In one embodiment, the device receives a report from a sensor of a node. The report can include a network activity of the node captured by the sensor and a first timestamp relative to the clock of the node. The device can then determine a second timestamp relative to the clock of the collector indicating receipt of the report by the device and from the sensor at the node. The device can also determine a delta between the first timestamp and the second timestamp, and a communication latency associated with a communication channel between the device and the sensor. Next, the device can adjust the delta based on the communication latency, and generate a third timestamp based on the adjusted delta.

Claims

1. A method comprising:

receiving, by a device from a first sensor at a first node, a first report comprising a network activity of which the first node was at least one of a source or a destination of the network activity and a first timestamp relative to a first clock of the first node;

receiving, by the device from a second sensor at a second node, a second report comprising the network activity of which the second node was a hop of the network activity and a second timestamp relative to a second clock of the second node;

determining, by the device, a first clock skew between a third clock of the device and the first clock of the first node based on the first timestamp and when the device received the first report from the first sensor at the first node and a second clock skew between the third clock and the second clock of the second node based on the second timestamp and when the device received the second report from the second sensor at the second node;

determining, by the device, a first communication latency associated with a first communication channel between the device and the first sensor and a second communication latency associated with a second communication channel between the device and the second sensor;

determining, by the device, a first adjusted timestamp of the first report based on the first communication latency and the first clock skew and a second adjusted timestamp of the second report based on the second communication latency and the second clock skew; and

generating, by the device, a timeline of the network activity by correlating the network activity in the first report and the network activity in the second report based on the first adjusted timestamp and the second adjusted timestamp.

2. The method of claim 1, further comprising:

receiving, by the device from a third sensor at a third node, a third report comprising the network activity of which the third node was a second hop of the network activity and a third timestamp relative to a fourth clock associated with the third sensor;

determining, by the device, a third clock skew between the third clock of the device and the fourth clock associated with the third sensor based on the third timestamp and when the device received the third report from the third sensor;

determining, by the device, a third communication latency associated with a third communication channel between the device and the third sensor; and

determining, by the device, a third adjusted timestamp of the third report based on the third communication latency,

wherein the timeline is further generated by correlating the network activity in the first report, the network activity in the second report, and the network activity in the third report based on the first adjusted timestamp, the second adjusted timestamp, and the third adjusted timestamp.

3. The method of claim 2, wherein the timeline comprises a sequence of events reported in at least one of the first report and corresponding to the first adjusted timestamp, the second report and corresponding to the second adjusted timestamp, or the third report and corresponding to the third adjusted timestamp.

4. The method of claim 2, wherein the first node and the third node are different physical servers.

5. The method of claim 1, further comprising:

receiving, by the device and from the first sensor at the first node, a third report comprising a second network activity of which the first node captured by the sensor and a sixth was at least one of a source or a destination of the second network activity and a third timestamp relative to the first clock of the first node;

receiving, by the device from the second sensor at the second node, a fourth report comprising the second network activity of which the second node was a hop of the second network activity and a fourth timestamp relative to the second clock of the second node;

and

generating, by the device, a second timeline of the second network activity by correlating the second network activity in the third report and the second network activity in the fourth report based on the first adjusted timestamp and the second adjusted timestamp.

6. A non-transitory computer-readable medium having instructions stored on the non-transitory computer-readable medium that, when executed, are effective to cause a computing device to:

receive, from a first sensor at a first node, a first report comprising a network activity of which the first node was at least one of a source or a destination of the network activity and a first timestamp relative to a first clock of the first node;

receive, from a second sensor at a second node, a second report comprising the network activity of which the second node was a hop of the network activity and a second timestamp relative to a second clock of the second node;

determine a first clock skew between a third clock of the computing device and the first clock of the first node based on the first timestamp and when the computing device received the first report from the first sensor at the first node and a second clock skew between the third clock and the second clock of the second node based on the second timestamp and when the computing device received the second report from the second sensor at the second node;

determine a first communication latency associated with a first communication channel between the computing device and the first sensor and a second communication latency associated with a second communication channel between the computing device and the second sensor;

determine a first adjusted timestamp of the first report based on the first communication latency and the first clock skew and a second adjusted timestamp of the second report based on the second communication latency and the second clock skew; and

generate a timeline of the network activity by correlating the network activity in the first report and the network activity in the second report based on the first adjusted timestamp and the second adjusted timestamp.

7. The non-transitory computer-readable medium of claim 6, wherein the first communication latency is an average of multiple communication latencies associated with the first communication channel between the computing device and the first sensor.

8. The non-transitory computer-readable medium of claim 6, wherein the instructions further cause the computing device to:

receive, from a third sensor of a third node, a third report comprising the network activity of which the third node was a second hop of the network activity and a third timestamp relative to a fourth clock associated with the third sensor;

determine a third clock skew between the third clock of the computing device and the fourth clock associated with the third sensor based on the third timestamp and when the computing device received the third report from the third sensor;

determine a third communication latency associated with a third communication channel between the computing device and the third sensor; and

determine a third adjusted timestamp of the third report based on the third communication latency,

wherein the network activity in the third report correlates with the network activity in the first report based on the first adjusted timestamp and the third adjusted timestamp and the network activity in the third report correlates with the network activity in the second report based on the second adjusted timestamp and the third adjusted timestamp.

9. The non-transitory computer-readable medium of claim 8, wherein the timeline comprises a sequence of events reported in at least one of the first report and corresponding to the first adjusted timestamp, the second report and corresponding to the second adjusted timestamp, or the third report and corresponding to the third adjusted timestamp.

10. The non-transitory computer-readable medium of claim 8, wherein the first node and the third node are different physical servers.

11. The non-transitory computer-readable medium of claim 6, wherein the instructions further cause the computing device to:

receive, from the first sensor at the first node, a third report comprising a second network activity of which the first node was at least one of a source or a destination of the second network activity and a third timestamp relative to the first clock of the first node;

receive, from the second sensor at the second node, a fourth report comprising the second network activity of which the second node was a hop of the second network activity and a fourth timestamp relative to the second clock of the second node;

and

generate a second timeline of the second network activity by correlating the second network activity in the third report and the second network activity in the fourth report based on the first adjusted timestamp and the second adjusted timestamp.

12. A computing system comprising:

one or more processors; and

a memory containing instructions that, when executed by the one or more processors, cause the computing system to;

receive, from a first sensor at a first node, a first report comprising a network activity of which the first node was at least one of a source or a destination of the network activity and a first timestamp relative to a first clock of the first node;

receive, from a second sensor at a second node, a second report comprising the network activity of which the second node was a hop of the network activity and a second timestamp relative to a second clock of the second node;

determine a first clock skew between a third clock of the computing system and the first clock of the first node based on the first timestamp and when the computing system received the first report from the first sensor at the first node and a second clock skew between the third clock and the second clock of the second node based on the second timestamp and when the computing system received the second report from the second sensor at the second node;

determine a first communication latency associated with a first communication channel between the computing system and the first sensor and a second communication latency associated with a second communication channel between the computing system and the second sensor;

determine a first adjusted timestamp of the first report based on the first communication latency and the first clock skew and a second adjusted timestamp of the second report based on the second communication latency and the second clock skew; and

generate a timeline of the network activity by correlating the network activity in the first report and the network activity in the second report based on the first adjusted timestamp and the second adjusted timestamp.

13. The computing system of claim 12, wherein the first communication latency infer is a historical communication latency associated with the first communication channel between the computing system and the first sensor.

14. The computing system of claim 13, wherein the instructions further cause the computing system to:

receive from the first sensor, a third report comprising a second network activity of which the first node was at least one of a source or a destination of the network activity and a timestamp relative to the first clock of the first node;

receive, from the second sensor at the second node, a fourth report comprising the second network activity of which the second node was a hop of the second network activity and a fourth timestamp relative to the second clock of the second node; and

generate a second timeline of the second network activity by correlating the second network activity in the third report and the second network activity in the fourth report based on the first adjusted timestamp and the second adjusted timestamp.

15. The computing system of claim 14, wherein the instructions further cause the computing system to:

receive, from the first sensor at the first node, a third report comprising a second network activity of which the first node was at least one of a source or a destination of the second network activity and a third timestamp relative to the first clock of the first node;

receive, from the second sensor at the second node, a fourth report comprising the second network activity of which the second node was a hop of the second network activity and a fourth timestamp relative to the second clock of the second node;

generate a second timeline of the second network activity by correlating the second network activity in the third report and the second network activity in the fourth report based on the first adjusted timestamp and the second adjusted timestamp.

16. The computing system of claim 12, wherein the instructions further cause the computing system to:

receive, from a third sensor at a third node, a third report comprising the network activity of which the third node was a second hop of the network activity and a third timestamp relative to a fourth clock associated with the third sensor;

determine a third clock skew between the third clock of the computing system and the fourth clock associated with the third sensor based on the third timestamp and when the computing system received the third report from the third sensor; and

determine a third communication latency associated with a third communication channel between the computing system and the third sensor; and

determine a third adjusted timestamp of the third report based on the third communication latency

wherein the network activity in the third report correlates with the network activity in the first report based on the first adjusted timestamp and the third adjusted timestamp and the network activity in the third report correlates with the network activity in the second report based on the second adjusted timestamp and the third adjusted timestamp.

17. The computing system of claim 16, wherein the timeline comprises a sequence of events reported in at least one of the first report and corresponding to the first adjusted timestamp, the second report and corresponding to the second adjusted timestamp, or the third report and corresponding to the third adjusted timestamp.