Techniques for determining network topologies

• US 9,979,615 B2
• Filed: 04/21/2016
• Issued: 05/22/2018
• 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: Kulshreshtha, Ashutosh, Vu, Hai Trong, Watts, Michael Standish, Pang, Jackson Ngoc Ki, Yadav, Navindra, Deen, Khawar
• Primary Examiner(s): Eskandarnia, Arvin
• Application Number:
  US15/135,331
• Publication Number:
  US 20160359677A1
• Time in Patent Office: 761 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

In one embodiment, a monitoring device (or module) monitors messages exchanged between nodes in a communication network. The monitoring device further determines, based on time stamp data associated with each message, one or more latency distributions of paired response times between the nodes, and determines a node topology consistent with each of the one or more latency distributions of paired response times between the nodes. In some embodiments, the monitoring device also generates a graph of the node topology showing one or more communication links between the nodes, and annotates each communication link of the one or more communication links with at least one of a mean response time or a median response time based on at least one of the latency distributions.

Claims

1. A method, comprising:

monitoring, by a monitoring device in a communication network, messages exchanged between at least a first node, a second node, and a third node;

determining, based on time stamp data associated with each message, one or more latency distributions of paired response times between the first node, the second node, and the third node, the one or more latency distributions include at least a first latency distribution corresponding to response times between the first node and the second node, a second latency distribution corresponding to response times between the first node and the third node, and a third latency distribution corresponding to response times between the second node and the third node;

determining a node topology consistent with the first latency distribution, the second latency distribution, and the third latency distribution;

generating a graph of the node topology showing one or more communication links between one or more of the first node, the second node, or the third node; and

annotating each communication link of the one or more communication links with at least one of a mean response time or a median response time based on at least one of the first latency distribution, the second latency distribution, or the third latency distribution.

2. The method of claim 1, wherein determining the node topology further comprises:

comparing an aggregated latency distribution of the first latency distribution and the second latency distribution to the third latency distribution to determine a position in the node topology for each of the first node, the second node, and the third node.

3. The method of claim 2, further comprising:

determining the second node is disposed between the first node and the second node in the node topology when the aggregated latency distribution substantially matches the third latency distribution.

4. The method of claim 1, wherein the monitoring device includes a plurality of distributed monitoring modules operable by one or more of the first node, the second node, and the third node.

5. The method of claim 4, further comprising:

receiving, by the monitoring device, the time stamp data associated with each message from the plurality of monitoring modules.

6. The method of claim 1, further comprising:

determine, by the monitoring device, the time stamp data associated with each message based on a unique message identifier, and

wherein, determining the one or more latency distributions, further comprises determining, based on the time stamp data associated with each message and the unique identifier associated with each message, the one or more latency distributions of paired response times for the messages exchanged between the first node, the second node, and the third node.

7. The method of claim 6, wherein the unique message identifier includes at least one of a packet header, a sequence number, an acknowledgement number, a type, or a size of the message.

8. The method of claim 1, wherein the first latency distribution represents a first paired response time distribution for the messages exchanged between the first node and the second node, the second latency distribution represents a second paired response time distribution for the messages exchanged between the first node and the third node, and the third latency distribution represents a third paired response time distribution for the messages exchanged between the second node and the third node.

9. The method of claim 1, further comprising:

determining at least one of the average response time or the median response time for each latency distribution, including the first latency distribution, the second latency distribution, and the third latency distribution, and

wherein, determining the node topology further comprises determining the node topology consistent with the at least one of the average response time or the median response time for each latency distribution.

10. The method of claim 1, wherein determining the node topology, further comprises:

identifying one or more outlier response times in each latency distribution, including the first latency distribution, the second latency distribution, and the third latency distribution;

removing the one or more outlier response times from each latency distribution; and

generating the at least one of the median response time or the mean response time for each latency distribution after removing the one or more outlier response times.

11. The method of claim 1, wherein at least one of the first node, the second node, or the third node includes one of a virtual machine, a hypervisor, a switch, or a router.

12. A monitoring device, comprising:

one or more network interfaces to communicate within a communication network;

a processor coupled to the network interfaces and adapted to execute one or more processes; and

a memory configured to store a process executable by the processor, the process when executed operable to;

monitor messages exchanged in the communication network between at least a first node, a second node, and a third node;

determine, based on time stamp data associated with each message, one or more latency distributions of paired response times between the first node, the second node, and the third node, the one or more latency distributions include at least a first latency distribution corresponding to response times between the first node and the second node, a second latency distribution corresponding to response times between the first node and the third node, and a third latency distribution corresponding to response times between the second node and the third node;

determine a node topology consistent with the first latency distribution, the second latency distribution, and the third latency distribution;

generate a graph of the node topology showing one or more communication links between one or more of the first node, the second node, or the third node; and

annotate each communication link of the one or more communication links with at least one of a mean response time or a median response time based on at least one of the first latency distribution, the second latency distribution, or the third latency distribution.

13. The monitoring device of claim 12, wherein the process, when executed to determine the node topology, is further operable to:

compare an aggregated latency distribution of the first latency distribution and the second latency distribution to the third latency distribution to determine a position in the node topology for each of the first node, the second node, and the third node.

14. The monitoring device of claim 13, wherein the process, when executed, is further operable to:

determine the second node is disposed between the first node and the second node in the node topology when the aggregated latency distribution substantially matches the third latency distribution.

15. The monitoring device of claim 12, further comprising:

a plurality of distributed monitoring modules operable by one or more of the first node, the second node, and the third node, and

wherein, the process, when executed, is further operable to receive the time stamp data associated with each message from the plurality of monitoring modules.

16. The monitoring device of claim 12, wherein the process, when executed, is further operable to:

determine the time stamp data associated with each message based on a unique message identifier, and

wherein, the process to determine the one or more latency distributions, when executed, is further operable to determine, based on the time stamp data associated with each message and the unique identifier associated with each message, the one or more latency distributions of paired response times for the messages exchanged between the first node, the second node, and the third node.

17. The monitoring device of claim 16, wherein the unique message identifier includes at least one of a packet header, a sequence number, an acknowledgement number, a type, or a size of the message.

18. The monitoring device of claim 12, wherein the process, when executed, is further operable to:

determine at least one of the average response time or the median response time for each latency distribution, including the first latency distribution, the second latency distribution, and the third latency distribution, and

wherein, the process to determine the node topology, when executed, is further operable to determine the node topology consistent with at least one of the average response time or the median response time for each latency distribution.

19. The monitoring device of claim 12, wherein the process to determine the node topology, when executed, is further operable to:

identify one or more outlier response times in each latency distribution, including the first latency distribution, the second latency distribution, and the third latency distribution;

remove the one or more outlier response times from each latency distribution; and

generate the at least one of the median response time or the mean response time for each latency distribution after removing the one or more outlier response times.

20. A tangible, non-transitory, computer-readable media having software encoded thereon, the software, when executed by a processor, operable to:

monitor messages exchanged in the communication network between at least a first node, a second node, and a third node;

determine, based on time stamp data associated with each message, one or more latency distributions of response times between the first node, the second node, and the third node based on time stamp data associated with each message, the one or more latency distributions include at least a first latency distribution corresponding to response times between the first node and the second node, a second latency distribution corresponding to response times between the first node and the third node, and a third latency distribution corresponding to response times between the second node and the third node;

determine a node topology consistent with the first latency distribution, the second latency distribution, and the third latency distribution;

generate a graph of the node topology showing one or more communication links between one or more of the first node, the second node, or the third node; and

annotate each communication link of the one or more communication links with at least one of a mean response time or a median response time based on at least one of the first latency distribution, the second latency distribution, or the third latency distribution.