Dynamic monitoring and visualization for network health characteristics of network device pairs

Information

  • Patent Grant
  • 11336553
  • Patent Number
    11,336,553
  • Date Filed
    Friday, July 24, 2020
    3 years ago
  • Date Issued
    Tuesday, May 17, 2022
    2 years ago
Abstract
Disclosed is a system and method for the dynamic monitoring of network health characteristics via a visualization platform. The platform receives collected information regarding network health characteristics and applies a rule set defining at least one threshold to classify each of the network health characteristics for each network component over a time period. The classifications can be represented visually on a graphical user interface to a network administrator, allowing the administrator to quickly discern which aspects of the network are operating properly and which aspects are not.
Description
TECHNICAL FIELD

This disclosure relates generally to a visualization platform for the dynamic monitoring of network components throughout a communication network.


BACKGROUND

The approaches described in this section could be pursued, but are not necessarily approaches that have previously been conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.


The proliferation of network devices has become ubiquitous. There are network devices that serve as the backbone of a communications network, such as switches and routers. Also, network devices facilitate access to certain web-based applications, such as load balancers to facilitate access to a service over multiple servers. Furthermore, there are network devices for optimization of data transfer speed or quality across the network, encryption/decryption, etc., and network devices that make up an overlay network. Other types of network devices may also be present in a communication network.


As the number of these devices multiplies rapidly, dynamic monitoring of these devices becomes cumbersome for a human network administrator. Traditionally when a device malfunctioned, the network administrator received an alarm notifying him that a device is not operating properly. However, when there are hundreds or thousands of network devices deployed, having many simultaneous alarms triggered at the same time can be overwhelming and difficult to individually evaluate to discern the problematic activity or cause of the triggered alarms. Furthermore, the longer it takes to diagnose a problem, the longer it takes to fix it, which can result in real cost expenditures until a business can get their systems online again.


Further, there are many paths, both physical and virtual, that data packets can take as they travel through a communications network. The performance of the different paths may continually change based on numerous variables, such as load, physical connectivity, power loss, overheating, bad cables, low memory, software bugs, etc. Monitoring the performance of these paths can be important, especially when trying to find ways to increase network performance across the paths. Also, not all devices can measure characteristics of all of the paths, so there needs to be a way to characterize the performance of each path based on the data available.


Additionally, a provider of an overlay network cannot directly measure the health of core network routers, switches, or other devices, so measuring performance of paths over the network devices is one way to evaluate network performance.


There is a need for a way to characterize and evaluate performance of individual paths and devices within a network, so that a network administrator can quickly discern where a problem exists without sifting through reams of data points. Further, there is a need for a simple visualization platform for a network administrator to view and monitor network performance characteristics of a multitude of deployed network devices, paths, and tunnels across a communications network.


SUMMARY

This summary is provided to introduce a selection of concepts in a simplified form that are further described in the Detailed Description below. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.


A monitoring and visualization platform for the dynamic monitoring of network devices deployed in a communication network is disclosed. The network devices may be physical devices, or may consist of specialized software operating on other computing components. In various embodiments, A computer-implemented method for dynamically monitoring and displaying network performance of a plurality of network devices in a communications network via an interactive graphical user interface, the method comprising: receiving a plurality of collected metrics regarding at least one health characteristic for a plurality of network paths over a first period of time, each network path comprising a first network device at a first terminal end of the network path and a second network device at a second terminal end of the network path from the plurality of network devices in the communications network; receiving a selection from a user of a health characteristic from the at least one health characteristic to analyze for a second period of time, wherein the second period of time is a multiple of the first period of time; applying a first rule set defining at least one threshold to assign an aggregate first classification for each first network device and second network device pair associated with the plurality of network paths over the second period of time; and displaying to the user the aggregate first classification for each first network device and second network device pair via a selectable object on an interactive graphical user interface, wherein one selectable object of the interactive graphical user interface represents an aggregate network performance for all network paths utilizing the first network device and second network device pair, based on the collected metrics for the plurality of network paths over the first period of time.


In other embodiments, a system for dynamically monitoring and displaying network performance of a plurality of network devices in a communications network via an interactive graphical user interface, the system comprising: a network interface; one or more data storage devices; one or more processors communicably coupled to the network interface and the data storage devices; and a non-transitory computer-readable medium encoded with a computer program communicably coupled to the one or more processors to: receive a plurality of collected metrics regarding at least one health characteristic for a plurality of network paths over a first period of time, each network path comprising a first network device at a first terminal end of the network path and a second network device at a second terminal end of the network path, from the plurality of network devices in the communications network; receive a selection from a user of a health characteristic from the at least one health characteristic to analyze for a second period of time, wherein the second period of time is a multiple of the first period of time; apply a first rule set defining at least one threshold to assign an aggregate first classification for each first network device and second network device pair associated with the plurality of network paths over the second period of time; and display to the user the aggregate first classification for each first network device and second network device pair via a selectable object on an interactive graphical user interface, wherein one selectable object of the interactive graphical user interface represents an aggregate network performance for all network paths utilizing the first network device and second network device pair, based on the collected metrics for the plurality of network paths over the first period of time.


Other features, examples, and embodiments are described below.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments are illustrated by way of example, and not by limitation in the figures of the accompanying drawings, in which like references indicate similar elements.



FIG. 1A represents an exemplary grid depicting network health characteristics for a plurality of devices over a plurality of days.



FIG. 1B represents an exemplary screenshot of a graphical user interface displaying an exemplary grid such as grid of FIG. 1A.



FIG. 2 represents an exemplary graphical user interface for a network administrator to select which network health characteristics to view in the grid format.



FIG. 3A depicts an exemplary network for which data regarding network health characteristics may be collected, classified, and displayed.



FIG. 3B depicts an exemplary embodiment of four network nodes in communication with each other.



FIG. 3C depicts a table showing that four devices present in an exemplary network.



FIG. 3D depicts a table showing the device connection paths that are present in the exemplary network.



FIGS. 3E-3G are tables depicting how network characteristics may be classified for different levels of the network.



FIG. 4 depicts an exemplary processing system.



FIG. 5A depicts an exemplary embodiment for a network health characteristic for a device.



FIG. 5B depicts another exemplary embodiment for a network health characteristic for a device.



FIG. 6 represents an exemplary aggregate classification determination for a device.



FIG. 7 represents another exemplary aggregate classification determination for a device.



FIG. 8 represents an exemplary time series plot.



FIG. 9 represents an exemplary method for summing classification minutes.



FIG. 10 depicts an exemplary method for dynamically displaying network health characteristics of a plurality of network components on a communications network via a graphical user interface.



FIG. 11 depicts another exemplary method for dynamically displaying network health characteristics of a plurality of network components on a communications network via a graphical user interface.



FIG. 12 illustrates an exemplary implementation of a network service using multiple flows over a communications network.



FIG. 13A depicts an exemplary table showing classifications for the loss network characteristic.



FIG. 13B depicts an exemplary table showing classifications for the jitter network characteristic.



FIG. 13C depicts an exemplary aggregate classification for the loss and jitter characteristic combined.





DETAILED DESCRIPTION

The following detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show illustrations, in accordance with exemplary embodiments. These exemplary embodiments, which are also referred to herein as “examples,” are described in enough detail to enable those skilled in the art to practice the present subject matter. The embodiments can be combined, other embodiments can be utilized, or structural, logical, and electrical changes can be made without departing from the scope of what is claimed. The following detailed description is therefore not to be taken in a limiting sense, and the scope is defined by the appended claims and their equivalents. In this document, the terms “a” and “an” are used, as is common in patent documents, to include one or more than one. In this document, the term “or” is used to refer to a nonexclusive “or,” such that “A or B” includes “A but not B,” “B but not A,” and “A and B,” unless otherwise indicated.


The embodiments disclosed herein may be implemented using a variety of technologies. For example, the methods described herein may be implemented in software executing on a computer system containing one or more computers, or in hardware utilizing either a combination of microprocessors or other specially designed application-specific integrated circuits (ASICs), programmable logic devices, or various combinations thereof. In particular, the methods described herein may be implemented by a series of computer-executable instructions residing on a storage medium, such as a disk drive, or computer-readable medium.


The embodiments described herein relate to a classification scheme and visualization platform for the dynamic monitoring of network devices deployed in a communication network.



FIG. 1A depicts an exemplary grid 100 depicting network health characteristics for a plurality of devices over a plurality of days. In the exemplary grid 100 of FIG. 1A, the performance of one or more network health characteristics can be displayed, and those network health characteristic(s) can be compared across devices over time to allow a network administrator to compare performance across devices in a network. In various embodiments the devices may be part of an overlay network. Whiles devices 1-N are depicted in FIG. 1A, a network administrator may also compare a network health characteristic over network paths, flows, tunnels, or other network component. While the exemplary grid 100 of FIG. 1A depicts performance of a network health characteristic over days 1-5, any period of time can be displayed. For example, data can be viewed for each device for each minute, hour, day, week, month, year, etc.


In exemplary embodiments, network health characteristic performance can be classified into 4 classifications, with thresholds for each classification. Each of these classifications are represented visually on the grid to allow a network administrator to easily view network performance and know which aspect to investigate further. The classifications may be good, warning, bad, and not applicable. These may be represented by different colors on the grid, such as green for good, yellow for warning, red for bad, and gray for not applicable. In various embodiments, other color schemes may be used to represent each classification. Alternatively, classifications may be represented by different patterns on the grid. In the exemplary grid 100, 110 represents a classification of ‘good’, 120 represents a classification of ‘warning’, 130 represents a classification of ‘bad’, and 140 represents a classification of ‘not applicable’, ‘insufficient data’, ‘missing data’, or the like. While these four classifications are discussed in this exemplary embodiment, fewer or more classifications may be used to represent the data.


As depicted in FIG. 1A, a network administrator can view the grid 100 and see that device N has a classification of ‘good’ over the 5 day period being analyzed. However, device 6 has a classification of ‘good’ for day 4 but ‘bad’ for days 1-3. No other device has a classification of ‘bad’ for this time period. This indicates to the network administrator that there is a problem with the performance of the particular device, and not a broader problem throughout the network. The network administrator can then investigate the performance of device 6 specifically to pinpoint the problem and rectify it.


In exemplary grid 100, devices 1-2 both have a classification of ‘bad’ for day 4, but not for the surrounding days 1-3 and 5. This may indicate to the network administrator that there was a problem specific to the region where devices 1-2 are deployed on day 4, instead of a widespread problem throughout the entire network since the other devices are not classified as ‘bad’ on that day. Further, the problem at devices 1-2 on day 4 was not present because neither device is classified as ‘bad’ on day 5. The problem may have been fixed or a condition causing the negative performance (like overload) has ceased.


Multiple devices may underperform on a particular day due to a regional problem such as a power outage, or a problem with a communication network at a particular site, or over a particular Internet Service Provider. Multiple devices underperforming across a region at the same time can indicate to the network administrator that the problem lies not with the network devices, but rather with the network or at the site where the device is deployed.


Devices 1-3 all have a classification of ‘not applicable’ for day 1, but not for the subsequent days 2-5. A classification of ‘not applicable’ can occur when there is missing or insufficient data. This may indicate to the network administrator that there was a problem specific to the region where devices 1-3 are deployed on day 1 such that network health characteristic data was not received from these devices on day 1, instead of a widespread problem throughout the entire network since devices 4-N are not classified as ‘not applicable’ on that day. Further, the problem at devices 1-3 was rectified as data was received from these devices on subsequent days 2-5. Alternatively, devices 1-3 may have been purposefully taken offline on day 1 for any reason, and thus it is expected that there will be no network health characteristic performance for these devices on day 1.


The exemplary grid 100 can be used to display any network health characteristic or combination of characteristics that a network administrator may wish to investigate. For example, a grid can be generated for classifying performance of a network device regarding packet loss, packet delay, jitter, memory utilization, path performance, tunnel performance, or any other network health characteristic or combination thereof.


In exemplary embodiments, grid 100 can automatically grow and add an additional column as time passes. For example, after the end of day 5, another column can automatically be added to grid 100 to show the network health characteristic for each device on day 6. In this way, the grid 100 allows a network administrator to dynamically monitor and display network health characteristics of a plurality of network components, in substantially real time.


Each square of grid 100 may further be interactive such that a network administrator can select a square to obtain additional information regarding the network health characteristic for that network component over that time period. For example, the network administrator may select box 130 to see why device 2 was classified as ‘bad’ on day 4. Selecting box 130 may allow the administrator to see data for that network health characteristic for device 2 throughout day 4, so that the administrator can see whether the characteristic was classified as bad for device 2 throughout the entire day or for portions of the day. Selecting box 130 then allows the administrator to view another grid for a smaller time segment for a particular network component, such as that shown in FIG. 6. The administrator can then see if day 4 was classified as ‘bad’ because of one unusual hour, or if it was bad for a significant portion of the day.


The administrator can further select an individual box, such as box 610 of FIG. 6 to view the classifications for a smaller time period, such as minute data represented by FIG. 5A. In this way, the administrator can keep viewing more discrete time segments as needed to help diagnose any issues that may be present in the network component. Further, the administrator may be able to view a time series plot, such as exemplary plot 800 of FIG. 8 to view the origins of the classifications. By graphically viewing classifications, the administrator can more quickly and easily ascertain where any problems are present in the network without having to sort through reams of collected numerical value data, and attempt to comprehend what that data means for network performance. This analysis can be presented for any network health characteristic(s) for any network component, or network paths and combinations thereof.



FIG. 1B represents an exemplary screenshot of a graphical user interface displaying an exemplary grid such as grid 100 discussed above.



FIG. 2 represents an exemplary graphical user interface 200 for a network administrator to select which network health characteristics to view in the grid format. The exemplary GUI 200 depicts data regarding CPU utilization in column 210, jitter in column 220, out of order packets in column 230, and lost packets in column 240. In the exemplary GUI 200, the network administrator has chosen not to view CPU utilization or out of order packet performance, but has chosen to view a combination of jitter and lost packets across the network devices. Optionally, the thresholds for the classifications of each metric may also be depicted in the GUI 200. For example, a jitter of 0-10 milliseconds (ms) for the packets transmitted may be classified as ‘good’ or depicted as green on the grid. A jitter of 11-30 ms for the packets transmitted may be classified as ‘warning’ or depicted as yellow on the grid. A jitter of 31-50 for the packets transmitted may be classified as ‘bad’ or depicted as red on the grid. Finally, if 10% or more of the data points are missing, then the network health characteristic performance may be classified as ‘not applicable’ or depicted as black on the grid.


The threshold levels for each classification for each network health characteristic may be automatically set, or may be determined or adjusted by the network administrator. In exemplary embodiments, the classification of ‘not applicable’ is an optional classification to prevent skewing of averages based on insufficient data or false positives. For example, if packet loss is determined by the ratio of the number of packets dropped compared to the number of packets sent. If a network device sends a million data packets and drops 100 of them, then the loss rate for the network device is 0.1%. This is a low rate and indicates good performance. However, if the network device only sends three packets and loses two of them, the loss rate is 67% which indicates very bad performance by the device. However, the device may not actually have a serious problem and the loss rate looks higher than it actually is due to the fact that there were only three data points. As such, there is not really enough data to make a conclusion. Furthermore, the maximum and minimum points can be very skewed when there is not enough data. For this reason, it is advantageous to have a classification of ‘not applicable’.



FIG. 3A depicts an exemplary network 300 for which data regarding network health characteristics may be collected, classified, and displayed as discussed herein. The exemplary network 300 contains network nodes 320a-320h. While eight network nodes are depicted in FIG. 3A, there can actually be hundreds or thousands of network nodes deployed throughout a communications network. Although not depicted in the figure, each network node may be connected to every other network node. In FIG. 3A, network node 320c is located in San Francisco, and network node 320h is located in Boston. There can be multiple network paths for data to traverse between the two cities. While three network paths 330a-c are depicted in FIG. 3A, there can actually be hundreds of paths between each node, physical or virtual. Various network path may be managed by different Internet Service Providers. In various embodiments, network paths 330a-c can be physical paths containing routers and switches, or can be virtual paths or tunnels. The paths may be part of an overlay network traversing core network 310, also referred to as an underlay network. Devices may travel over one or more core networks. An overlay network is made up of network paths, and the core network that these paths go over is called the underlay.


In some embodiments, network paths 330a-c may represent tunnels for various devices to communicate with each other, or a mesh of tunnels between devices. There may also be parallel tunnels between each pair of devices, which can result in millions of tunnels throughout the communications network as a whole. Each tunnel may be any type of secure communications channel, such as a Generic Routing Encapsulation (GRE) or Internet Protocol Security (IPsec) tunnel, and facilitates data transfer between network devices, including by traversing firewalls.


In various embodiments, network health characteristic data may be collected for any node, device, path, tunnel, etc. in network 300. For example, packet loss, delay, or jitter information may be collected for data transmitted by any or all of network nodes 320a-320h of FIG. 3A, and/or for data transmitted over any or all of network paths 330a-330c of FIG. 3A. Network health characteristic data can be processed via exemplary processing system 400 of FIG. 4. In the exemplary embodiment depicted in FIG. 4, data from nodes 320a-320d is sent to data collection module 410. While only four nodes are depicted here, many devices or nodes in the network may send health characteristic data to data collection module 410, including via intervening devices, as would be understood by a person of ordinary skill in the art. Data collection module 410 is in communication with database 420 that organizes and stores the information. Database 420 may consist of one or more databases, tables, or other mechanism for storing and organizing data known in the art. Database 420 may be stored in a local hardware device, or be located in a cloud, or in any other central location accessible to all optimization devices connected to one another via an overlay network. Additionally, information from data collection module 410 may be maintained in other data structures other than a database, as understood by a person of ordinary skill in the art. Further, multiple computers may be used for each module to make the system scalable, especially for database 420 and data collection module 410. There can be multiple collection modules arranged hierarchically.


Database 420 is further in communication with aggregation module 430. Aggregation module 430 may analyze data from database 420 and apply one or more rule sets to the data to determine one or more classifications. For example, data may be collected on a per minute basis and aggregation module may distill the information to a different time period, such as per hour, per day, per month, etc. Optionally, data collection module 410 may perform the data analysis and aggregation operations.


The aggregated data may then be communicated back to database 420 for storage, which in turn communicates with visualization module 440 to generate the one or more grids and graphical user interface(s) to display to a network administrator over a user interface. In exemplary embodiments, the user interface is a web page on an internet or intranet. Aggregation module 430 may collect information regarding network health characteristics and apply a rule set to classify a particular characteristic over a particular period of time. In some embodiments, visualization module 440 can communicate directly with aggregation module 430.


Although FIG. 4 depicts three modules, fewer or more modules may be included in the processing system 400. Additionally, the various modules may be combined into a single module. For example, some of the aggregation may be performed on-demand in the visualization module 440, such as when a user selects an aggregate classification to be displayed. Parts of the visualization module 440 may operate in a user's web browser. Further, there can be multiple instances of visualization module 440, as multiple users can use the processing system 400 at the same time. The modules may be hardware components with one or more processors that execute instructions or software to implement the various functions described herein.



FIG. 3B depicts an exemplary embodiment of four network nodes in communication with each other. While four network nodes are depicted here for this example, any number of nodes may be present in the communications network. In the exemplary embodiment of FIG. 3B, nodes 320A-320D are network devices. Each device has one or more paths or tunnels connecting it to every other device. For example, there are three tunnels connecting device 320A with 320B, and these are shown as 330a1, 330a2 and 330a3. Similarly, there are two tunnels connecting device 320B with 320D, and these are shown as 330b1 and 330b2. The exemplary embodiment of FIG. 3B also depicts one path or tunnel connecting device 320A with 320C, shown as 330c. Two paths or tunnels connect device 320C with device 320D, shown as 330d1 and 330d2. One path or tunnel connects device 320A with device 320D, shown as 330e. One path or tunnel connects device 320C with device 320B, shown as 330f. While only a few paths or tunnels are depicted here, there can be a multitude of paths or tunnels between each device. Furthermore, in some parts of this disclosure, the terms tunnel and path may be used synonymously.



FIG. 3C depicts a table showing that four devices are present in the exemplary network of FIG. 3B. FIG. 3D depicts a table showing the device pairs that are present in the exemplary network of FIG. 3B. Some metrics (such as loss and jitter) can be measured separately for each direction of data flow, i.e. 320A→320B or 320B→320A.



FIGS. 3E-3G are tables depicting how network characteristics may be classified for different levels of the network, based on the same set of underlying statistical data collected regarding network characteristics. FIG. 3E is a partial table depicting some exemplary network characteristics for some tunnels in the network of FIG. 3B. For example, FIG. 3E shows that for the device pair of 320A-320B, there are three tunnels: 330a1, 330a2, and 330a3. The network characteristic for tunnel 330a1 is classified as “G” or “green” on Monday, Tuesday, and Wednesday. The network characteristic for tunnel 330a2 is classified “G” for Monday and Tuesday, but as “Y” or “yellow” for Wednesday. The network characteristic for tunnel 330a3 is classified as “G” for Monday and Wednesday, but as “R” or “red” for Tuesday.



FIG. 3F is a table depicting a second classification, also sometimes referred to herein as an aggregate classification, that is applied to the set of first classifications from FIG. 3E. As discussed herein, any rule set can be used with thresholds for generating the second classifications. For example, a rule set may be applied stating that if any characteristic is classified as “R” in the group, then an aggregate second classification should be “R”. If any characteristic is classified as “Y” and there is no “R” in the group, then an aggregate second classification should be “Y”. Applying this rule set to the table of FIG. 3E yields an exemplary set of classifications for each device pair, depicted in FIG. 3F.


For device pair 320A-320B, all three tunnels were “G” on Monday, thus yielding a second classification of “G” for all paths connecting the device pair. On Tuesday, two tunnels were “G” and one was “R”, thus the second classification is “R” for all paths connecting the device pair. On Wednesday two tunnels were “G” and one was “Y”, thus the second classification is “Y” for all paths connecting device pair 320A-320B. A similar analysis can be performed for every path in the network to derive an aggregate classification for each device pair.


From the classification of each device pair, the data may be aggregated once more to derive a classification for each device, as depicted in the exemplary table of FIG. 3G. In an exemplary embodiment, the classification for every device pair including device 320A is considered to derive an aggregate classification for device 320A. While exemplary table 3F only depicts device pair 320A-320B, device 320A is also part of the pair 320A-320C and 320A-320D in the exemplary network of FIG. 3B.


Since exemplary table 3F is a partial table, device 320A only appears on one row. Thus, the classifications on that row are applicable to device 320A, i.e. “G” on Monday, “R” on Tuesday and “Y” on Wednesday. For exemplary purposes, it is assumed that all other pairings not shown in table 3F are classified as “G”.


In table 3F, device 320B appears on two rows, as being a part of two device pairings. However, while not depicted in the exemplary table 3F for brevity's sake, device 320B is also part of pairing 320B-320C in the exemplary network of FIG. 3B. Data from each pairing is aggregated to derive a classification for the device. As discussed herein, any rule set defining any set of thresholds may be applied to arrive at this classification.


For exemplary purposes, a similar rule set applied to FIG. 3F is depicted as being applied to FIG. 3G, with the assumption that all pairings not depicted in table 3F are classified as “G”. Thus, on Monday, both device pairings including device B are classified as “G”, and it is assumed that all other device pairings including device B that are not depicted are also classified as “G”. Therefore, the aggregate classification for device 320B is “G”. On Tuesday, one path containing device 320B is “R” while the other is “G”. Since there is at least one “R”, device 320B is classified as “R”. On Wednesday, one path containing device 320B is “Y” while the other is “G”. Since there is at least one “Y” and no “R”, device 320B is classified as “Y” for the day.


In this way, multiple levels of classifications may be generated. Network characteristic data can be aggregated by characteristic (such as combining loss and jitter), as shown in FIGS. 13A-13C. Also, network characteristic data can be aggregated by paths, node pairs, and nodes as shown in FIGS. 3E-3G. Further, network characteristics can be aggregated by time, as shown in FIGS. 5-7. This allows for reams of data regarding network performance to be distilled and simplified into one visually representative color or pattern that is displayed to a network administrator.


As will be understood by persons of ordinary skill in the art, different classifications will result for the same network entity if a different rule set or thresholds are applied to the same data.



FIGS. 13A-13C depict an exemplary method for deriving an aggregate classification for two network characteristics. While only two network characteristics are aggregated in the exemplary figures, any number of characteristics can be aggregated.



FIG. 13A depicts an exemplary table showing classifications for the loss network characteristic for devices 1-4 over days 1-4. FIG. 13B depicts an exemplary table showing classifications for the jitter network characteristic for the same devices 1-4 over days 1-4. While four devices are shown here, any number of devices, paths, tunnels, etc. can be compared, as discussed herein. Furthermore, while days 1-4 are depicted here, any length of time can be compared in a similar manner.



FIG. 13C depicts an exemplary aggregate classification for the loss and jitter characteristic combined. Such an aggregate classification can be generated when a network administrator is interested in evaluating both of these network characteristics at the same time for the network devices. The aggregate classification can be generated by applying a rule set with defined thresholds. Any number of rule sets of thresholds can be applied. In the exemplary embodiment of FIG. 13C, a rule set is applied that the aggregate classification is the worst level classification present.


For example, device 1 is “G” on day 1 for both loss and jitter, and thus the aggregate classification is “G” for day 1 in FIG. 13C. Device 1 is “G” on day 2 for loss but “R” on day 2 for jitter. Thus, the aggregate classification for device 1 on day 2 is “R”, since that is the worst level of classification present. Device 1 is “R” for loss on day 3 and “G” for jitter on day 3. The aggregate classification on day 3 for device 1 is “R”, since that is the worst level of classification present. Device 1 is “G” again on day 4 for both loss and jitter, so the aggregation classification is “G” for that day in FIG. 13C. In this way, each device can be compared for each day to generate the aggregate classifications shown in FIG. 13C.



FIG. 5A depicts an exemplary embodiment for a network health characteristic for device 1. At 2:00 pm, box 510 shows that there is insufficient data for this characteristic for this device at this time. At 2:01 pm, box 520 shows that device 1 is classified as ‘warning’ for this characteristic. At 2:02 pm, box 530 shows that device 1 is classified as ‘good’ for this characteristic. Similarly, each minute's data for this characteristic for device 1 can be assigned a classification. Each minute's data can then be aggregated into one classification for a different time period using various rule sets and thresholds. In FIG. 5A, one aggregate classification is presented in box 540 to represent the network health characteristic for device 1 for the entire time span from 2-3 pm. Any number of rule sets or thresholds can be applied to determine the aggregate classification. In FIG. 5A, a rule set is applied that if any time period within the hour has insufficient data, then the entire hour is classified as insufficient data, thus making box 540 an aggregate classification of insufficient data.


In FIG. 5B a rule set is applied that the majority of minutes are classified as ‘good’, then the aggregate classification is also ‘good’, thus making the aggregate classification in box 550 for device 1 as ‘good’ for the time span from 2-3 pm. As known to a person of ordinary skill in the art, any number of rule sets may be applied to determine the aggregate classification.


In various embodiments, a classification of ‘bad’ may be considered an impaired minute for the network component since that network component is not operating as it should. By classifying network health characteristics for each minute, a network administrator can quickly view a number of impaired minutes for each network component. Similarly, for different time periods an administrator can view impaired time (such as hours, days, months, etc.). A number of impaired minutes can be counted in each week, month, or for any desired time segment. An “impaired” minute can be defined as any minute that is classified as ‘bad’, classified as ‘bad’ or ‘warning’, classified as ‘bad’, ‘warning’ or ‘not applicable’, or any other definition may be applied to determine an “impaired” minute of performance. Impaired minutes are further discussed with reference to FIG. 9.


Similarly, other classifications of minutes can be counted. For example, all minutes classified as ‘good’, may be considered good minutes, and the number of ‘good’ minutes in a time period may be counted. In other embodiments, minutes classified as ‘warning’ may be determined to represent “marginal” performance for a network component, and the number of “marginal” minutes of performance over a time period may be counted. In this way, any classification of minutes can be summed.



FIG. 6 represents an exemplary aggregate classification determination for device 1 for a network health characteristic over a different time span. Box 610 shows that from 12:00 am-12:59 am, the network health characteristic for device 1 was classified as ‘bad’. From 1:00 am-1:59 am, the network health characteristic for device 1 was classified as ‘warning’ in box 620. From 2:00 am-2:59 am, the network health characteristic for device 1 was classified as ‘good’ in box 630. A rule set may be applied to the individual classifications for each hour of a day to determine an aggregate classification for the day for the characteristic for device 1. Box 640 shows that an aggregate classification over the day is determined to be ‘bad’. In this embodiment, a rule set may be applied that if any classification is ‘bad’, then the aggregate classification is bad. Any number of rule sets may be applied to determine the aggregate classification.



FIG. 7 represents an exemplary aggregate classification determination for device 1 for a network health characteristic over another time span. From the same hourly classifications of boxes 610, 620, and 630 of FIG. 6, data may be aggregated on a monthly basis. An aggregate classification for the month 650 may be determined by applying a rule set to the individual classifications for each hour, for the network health characteristic for device 1. In exemplary FIG. 7, a rule set may be applied that if the majority of hours are ‘good’, then the aggregate classification is ‘good’. Although hierarchical aggregation is displayed here, it is clear that the monthly classification can be derived directly from minute or hourly data. Similarly, an aggregate classification can be derived from data for any discrete time period.


In various embodiments, data collected from each network component is collected on a minute basis. The collected data may be visually represented on a time series plot 800. The exemplary time series plot in FIG. 8 depicts a network health characteristic, percentage of packet loss, for a network component for each minute from 10:00 am to 10:15 am. Thresholds are applied to classify this data into green, yellow, and red categories representing ‘good’, ‘warning’, and ‘bad’ classifications. As discussed herein, although three categories are depicted in plot 800, any number of categories may be determined from the data. In this example, lower packet loss is better, so the lower values are classified as green, whereas the higher values are classified as red. For a different network health characteristic, higher values may be classified as green and lower values as red.



FIG. 8 shows that a packet loss of 10% or less is classified as green, a packet loss of 11-15% is classified as yellow, and a packet loss of 16% or more is classified as red. In one embodiment, a rule set may be applied to this time series plot 800 to determine a classification for the network component for the entire time period from 10:00 am-10:15 am. For example, a rule set may be that if any data point is over the ‘red’ threshold, then the classification is ‘red’ for this time period. FIG. 8 also shows that no packet loss data is available for this network component at 10:13 am. Thus, another rule set may be that if any data point is missing over the entire time period, then the classification for the time period is ‘black’. In this way, numerical data for an entire time period can be represented simply by one classification.


In various embodiments, individual minute data may be referred to as segments over the time period. Thus, one segment for the time period 10:00-10:15 am may be the time period from 10:00-10:01 am. In this characterization, 15 segments are present over the time period from 10:00-10:15 am depicted in FIG. 8.


In other embodiments, each minute's data may be classified first using a first rule set. FIG. 8 depicts 801a classifying data for 10:00 am as ‘Y’ since the data point for 10:00 am falls within the yellow range. 801b is a classification of ‘R’ since the data point for 10:01 am is in the red range. 801c is a classification of ‘G’ since the data point for 10:02 am is in the green range. In this way, each minute's data point is converted from its actual value into a classification, as shown in exemplary classifications 801a-801p in FIG. 8. In exemplary embodiments, once the data is converted from a numerical value into a classification, the original numerical value data is no longer necessary for evaluating the health characteristic for this network component.


A second rule set can then be applied to classifications 801a-801p to derive an aggregate classification to view packet loss performance for this network component over a broader time period, using a methodology discussed above with respect to FIGS. 5-7.


In other embodiments, a different methodology may be applied to each minute's data to arrive at an aggregate classification. The number of each type of classification may be counted. For example, from the time period 10:00-10:15 am in FIG. 8, there are a total of 5 red minutes, 1 black minute, 5 yellow minutes, and 5 green minutes. An aggregate classification may be determined by counting the number of minutes in each category, as explained further with reference to FIG. 9.



FIG. 9 depicts an exemplary methodology for determining a number of impaired minutes for a network component. A number of impaired minutes can be determined for a specific device, connection pair, tunnel or path, or other any network component being classified. In graph 910 of the exemplary embodiment depicted in FIG. 9, a classification for one or more network health characteristics is depicted graphically from 2:00 PM to 2:59 PM. The number of each type of classification can be summed for a day, week, month, or any time period, to arrive at an aggregate classification. For example, box 920 shows that the number of each type of classification is summed over the time period.


Table 930 shows each classification is summed for the hour depicted in graph 910. For example, table 930 shows that for the hour from 2:00 PM to 2:59 PM, there is one red minute (2:00 PM in graph 910), there are 7 yellow minutes, 52 green minutes, and 0 minutes classified as not applicable. From the first classifications depicted in graph 910, aggregate classifications can be determined for different time periods by applying a rule set to the summed data in table 930. As will be appreciated by persons of ordinary skill in the art, a number of different rule sets can be applied to the summed classifications to determine an aggregate classification.


Table 940 depicts an exemplary rule set applied to data over a day. Minute data for a whole day can be summed as in box 920 to determine a single aggregate classification depicting the performance of the network component for the day. In one day, there are 1,440 minutes (60 minutes/hour×24 hours/day=1,440 minutes/day), and thus 1,440 classifications can be determined for the performance of one or more network health characteristics for a network component over the day. That is, each of the 1,440 minutes can be classified as R, Y, G or N (or other designated classifications). The number of each type of classification can be summed for the day, and then a rule set such as the one depicted in table 940 can be applied to determine a single aggregate classification for the day. For example, if there are more than 10 R minutes in the day, then the aggregate classification for the day is R. If there are less than 10 R minutes but more than 100 Y minutes, then the aggregate classification for the day is Y. If there are over 1,000 N minutes for the day, then aggregate classification for the day is N. Otherwise, if none of the prior rules is true, then the day is classified as G. In this way, outlier data can be smoothed and a more accurate picture of network performance may be determined. Further, in this way 1,440 data points can be synthesized down to a single data point, for ease of analysis of a network component's performance.


Table 950 depicts an exemplary rule set applied to data over a month. Minute data for a whole month can be summed as in box 920 to determine a single aggregate classification depicting the performance of the network component for the month. In a 30-day month, there are 43,200 minutes (60 minutes/hour×24 hours/day×30 days/month=43,200 minutes/month). Thus, 43,200 classifications can be determined for the performance of one or more network health characteristics for a network component over the month. That is, each of the 43,200 minutes can be classified as R, Y, G or N (or other designated classifications). The number of each type of classification can be summed for the month, and then a rule set such as the one depicted in table 950 can be applied to determine a single aggregate classification for the month. For example, if there are more than 1000 R minutes in the month, then the aggregate classification for the month is R. If there are any R minutes or more than 10,000 Y minutes, then the aggregate classification for the month is Y. If there are over 10,000 N minutes for the month, then the aggregate classification for the month is N. Otherwise, if none of the prior rules is true, then the month is classified as G. In this way, outlier data can be smoothed and a more accurate picture of network performance may be determined. For example, a network administrator may decide that if a single minute out of 43,200 minutes is red, then the whole month should not be classified as red or ‘bad’ performance. Further, in this way 43,200 data points can be synthesized down to a single data point, for ease of analysis of a network component's performance.


Using the methodology described above, a number of impaired minutes can be determined for an hour, day, month, or any other time period. Any number of rule sets may be applied to classify a minute as “impaired”. For example, a minute can be impaired if it is R or if it is R or Y. Determining a number of impaired minutes, impaired days, impaired months, or any other time segment, can aid in the analysis of network performance for a network component.



FIG. 10 depicts an exemplary method 1000 for dynamically displaying network health characteristics of a plurality of network components on a communications network via a graphical user interface. In step 1010, collected information regarding one or more network health characteristics for each of the network components is received. In step 1020, a selection is received from a user regarding one or more network health characteristics to be evaluated from the plurality of network health characteristics received and stored. In exemplary embodiments, this selection may be received via a GUI similar to GUI 200 of FIG. 2. In step 1030 a rule set defining at least one threshold is applied to the collected information to assign a classification to the selected network health characteristic(s) for each of the network components over a set time period. The time period may be selected by the user or may be automatically selected. In step 1040 the classification for each network component is displayed to the user via a grid format on an interactive graphical user interface.



FIG. 11 depicts another exemplary method 1100 for dynamically displaying network health characteristics of a plurality of network components on a communications network via a graphical user interface. In step 1110, collected information regarding one or more network health characteristics for each of the network components is received. In step 1120, a selection is received from a user regarding one or more network health characteristic to be evaluated from the plurality of network health characteristics received and stored. In exemplary embodiments, this selection may be received via a GUI similar to GUI 200 of FIG. 2. In step 1130 a rule set defining at least one threshold is applied to the collected information to assign a classification to the selected network health characteristic for each of the network components for each individual segment of time within the time period of the collected information. The time period may be selected by the user or may be automatically selected. The segments of time may be selected by the user or may be automatically selected. In step 1140 a second rule set defining at least one threshold is applied to each of the first classifications for each segment of time to assign a second classification to the selected health characteristic(s) for each of the plurality of network components over the entire first period of time. The second classification is an aggregate classification, similar to that discussed above in reference to FIGS. 5-7 or FIG. 9. In step 1150 the second classification for each network component is displayed to the user via a grid format on an interactive graphical user interface.



FIG. 12 illustrates an exemplary implementation of a network service using multiple flows over a communications network. An environment 1200, as depicted in FIG. 12, may include certain similar elements as the network 300 discussed herein. Environment 1200 may comprise computers, a communication network, as well as the various routers (e.g., the local routers 1220, the edge routers 1260, and the core routers 1270). The environment 1200 also includes the first digital device 1210, which is positioned between computer 1 and one of the local routers 1220, and the second digital device 1230, which is positioned between computer 2 and the edge routers 1260.


In some embodiments, the first digital device 1210 may amend the packets 1280 received from computer 1 via one or more inter-computer flows to affect which network flow the packet is directed to, this resulting in an amended packet 1290. According to one embodiment, the packet 1280 is amended such that an additional header portion is added to the packet, while according to another embodiment, the packet 1280 is amended such that certain information in the header portion is altered or replaced. The amended packet 1290 may be restored to the packet 1280 upon receipt by the second digital device 1230. After which, the packet 1280 may be delivered to computer 2 on the inter-computer flow from which it originated. It is noted that the first digital device 1210 may be equivalent to, and interchangeable with, the second digital device 1230 in that any task or procedure carried out by the first digital device 1210 may be carried out by the second digital device 1230, and vice versa.


As shown in FIG. 12, the amended packets 1290 may advantageously be more heavily distributed to the flows having preferable flow metrics (e.g., the good flow 1240). The moderate flow 1250 may transfer less of the amended packets 1290, while the poor flow 1265 may transfer even fewer. Network health characteristics of each of these flows may be measured and tracked via the processing system 400, for visualization and display to a network administrator via the grid platform discussed herein. Additional information regarding how network health characteristics can be measured and tracked can be found in U.S. Pat. No. 8,743,683 issued Jun. 3, 2014 entitled “Quality of Service Using Multiple Flows”, which is incorporated herein by reference in its entirety.


Thus, methods and systems for a visualization platform for the dynamic monitoring of network devices deployed in a communication network are disclosed. Although embodiments have been described with reference to specific example embodiments, it will be evident that various modifications and changes can be made to these example embodiments without departing from the broader spirit and scope of the present application. Therefore, these and other variations upon the exemplary embodiments are intended to be covered by the present disclosure. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.

Claims
  • 1. A computer-implemented method for dynamically monitoring and displaying network performance of a plurality of network devices in a communications network via an interactive graphical user interface, the method comprising: receiving a plurality of collected metrics regarding at least one health characteristic for a plurality of network paths over a first period of time, each network path comprising a first network device at a first terminal end of the network path and a second network device at a second terminal end of the network path from the plurality of network devices in the communications network;receiving a selection from a user of a health characteristic from the at least one health characteristic to analyze for a second period of time, wherein the second period of time is a multiple of the first period of time;applying a first rule set defining at least one threshold to assign an aggregate first classification for each first network device and second network device pair associated with the plurality of network paths over the second period of time; anddisplaying to the user the aggregate first classification for each first network device and second network device pair via a selectable object on an interactive graphical user interface, wherein one selectable object of the interactive graphical user interface represents an aggregate network performance for all network paths utilizing the first network device and second network device pair, based on the collected metrics for the plurality of network paths over the first period of time.
  • 2. The computer-implemented method of claim 1, wherein, upon selection of the object by the user, a selectable object on the interactive graphical user interface is configured to display additional information regarding network performance for the first network device and second network device pair.
  • 3. The computer-implemented method of claim 1, wherein, upon selection of the object by the user, a selectable object associated with the first network device on the interactive graphical user interface is configured to display a histogram or time series plot displaying the collected metrics for the plurality of network paths associated with the first network device and second network device pair.
  • 4. The computer-implemented method of claim 1, wherein the first period of time is selected by the user.
  • 5. The computer-implemented method of claim 1, wherein the aggregate first classification is a qualitative classification.
  • 6. The computer-implemented method of claim 5, wherein at least one threshold to assign the aggregate first classification is determined by the user.
  • 7. The computer-implemented method of claim 1, wherein the plurality of collected metrics regarding at least one health characteristic includes at least one of network delay, lost packets, out of order packets, and jitter.
  • 8. The computer-implemented method of claim 1, wherein the interactive graphical user interface is a grid shape, and the selectable object on the interactive graphical user interface is a square on the grid shape.
  • 9. The computer-implemented method of claim 1, wherein the collected metrics are received in real-time.
  • 10. The computer-implemented method of claim 1, further comprising applying a second rule set defining at least one threshold to assign an aggregate second classification for each network device over the second period of time, the aggregate second classification comprising an aggregate classification for each network device associated with the first network device and second network device pairs and a corresponding plurality of network paths for each first network device and second network device pair; and displaying to the user the aggregate second classification for each network device on the interactive graphical user interface.
  • 11. The computer-implemented method of claim 10, wherein, upon selection of the object by the user, a selectable object associated with the first network device and second network device pair on the interactive graphical user interface is configured to display a second interactive graphical user interface displaying the aggregate second classifications for network device pairs associated with the first network device.
  • 12. The computer-implemented method of claim 10, wherein the aggregate second classification is a qualitative classification.
  • 13. A non-transitory computer readable medium storing instructions for executing a method performed by a computer processor to dynamically monitor and display network performance of a plurality of network devices in a communications network via an interactive graphical user interface, the method comprising: receiving a plurality of collected metrics regarding at least one health characteristic for a plurality of network paths, each network path comprising a first network device at a first terminal end of the network path and a second network device at a second terminal end of the network path from the plurality of network devices in the communications network;receive a selection from a user of a health characteristic from the at least one health characteristic to analyze for a second period of time, wherein the second period of time is a multiple of the first period of time;applying a first rule set defining at least one threshold to assign an aggregate first classification for each first network device and second network device pair associated with each network path over the second period of time;displaying to the user the aggregate first classification for each first network device and second network device pair via a selectable object on an interactive graphical user interface, wherein one selectable object of the interactive graphical user interface represents an aggregate network performance for all network paths utilizing the first network device and second network device pair, based on the collected metrics for the plurality of network paths over a first period of time.
  • 14. The non-transitory computer readable medium of claim 13, wherein the aggregate first classification and the aggregate second classification are qualitative classifications.
  • 15. The non-transitory computer readable medium of claim 13, wherein the plurality of collected metrics regarding at least one health characteristic includes at least one of network delay, lost packets, out of order packets, and jitter.
  • 16. The non-transitory computer readable medium of claim 13, further comprising: applying a second rule set defining at least one threshold to assign an aggregate second classification for each network device over the second period of time, the aggregate second classification comprising an aggregate classification for each network device associated with the first network device and second network device pairs and a corresponding plurality of network paths for each first network device and second network device pair; anddisplaying to the user the aggregate second classification for each network device on the interactive graphical user interface.
  • 17. A system for dynamically monitoring and displaying network performance of a plurality of network devices in a communications network via an interactive graphical user interface, the system comprising: a network interface;one or more data storage devices;one or more processors communicably coupled to the network interface and the one or more data storage devices; anda non-transitory computer-readable medium encoded with a computer program communicably coupled to the one or more processors to: receive a plurality of collected metrics regarding at least one health characteristic for a plurality of network paths over a first period of time, each network path comprising a first network device at a first terminal end of the network path and a second network device at a second terminal end of the network path, from the plurality of network devices in the communications network;receive a selection from a user of a health characteristic from the at least one health characteristic to analyze for a second period of time, wherein the second period of time is a multiple of the first period of time;apply a first rule set defining at least one threshold to assign an aggregate first classification for each first network device and second network device pair associated with the plurality of network paths over the second period of time; anddisplay to the user the aggregate first classification for each first network device and second network device pair via a selectable object on an interactive graphical user interface, wherein one selectable object of the interactive graphical user interface represents an aggregate network performance for all network paths utilizing the first network device and second network device pair, based on the collected metrics for the plurality of network paths over the first period of time.
  • 18. The system of claim 17, wherein the aggregate first classification is a qualitative classification.
  • 19. The system of claim 17, wherein the plurality of collected metrics regarding at least one health characteristic includes at least one of network delay, lost packets, out of order packets, and jitter.
  • 20. The system of claim 17, wherein the collected metrics are received in real-time.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of, and claims the priority benefit of, U.S. application Ser. No. 16/224,482 filed on Dec. 18, 2018, which in turn is a continuation of and claims the priority benefit of, U.S. application Ser. No. 14/981,814 filed on Dec. 28, 2015, now granted as U.S. Pat. No. 10,164,861 issued on Dec. 25, 2018. The disclosures of the above-referenced patents are hereby incorporated by reference in their entirety, for all purposes.

US Referenced Citations (565)
Number Name Date Kind
4494108 Langdon et al. Jan 1985 A
4558302 Welch Dec 1985 A
4612532 Bacon et al. Sep 1986 A
5023611 Chamzas et al. Jun 1991 A
5159452 Kinoshita et al. Oct 1992 A
5243341 Seroussi et al. Sep 1993 A
5307413 Denzer Apr 1994 A
5357250 Healey et al. Oct 1994 A
5359720 Tamura et al. Oct 1994 A
5373290 Lempel et al. Dec 1994 A
5483556 Pillan et al. Jan 1996 A
5532693 Winters et al. Jul 1996 A
5592613 Miyazawa et al. Jan 1997 A
5602831 Gaskill Feb 1997 A
5608540 Ogawa Mar 1997 A
5611049 Pitts Mar 1997 A
5627533 Clark May 1997 A
5635932 Shinagawa et al. Jun 1997 A
5652581 Furlan et al. Jul 1997 A
5659737 Matsuda Aug 1997 A
5675587 Okuyama et al. Oct 1997 A
5710562 Gormish et al. Jan 1998 A
5748122 Shinagawa et al. May 1998 A
5754774 Bittinger et al. May 1998 A
5802106 Packer Sep 1998 A
5805822 Long et al. Sep 1998 A
5883891 Libove et al. Mar 1999 A
5903230 Masenas May 1999 A
5955976 Heath Sep 1999 A
6000053 Levine et al. Dec 1999 A
6003087 Housel et al. Dec 1999 A
6054943 Lawrence Apr 2000 A
6081883 Popelka et al. Jun 2000 A
6084855 Soirinsuo et al. Jul 2000 A
6175944 Urbanke et al. Jan 2001 B1
6191710 Waletzki Feb 2001 B1
6240463 Benmohamed et al. May 2001 B1
6295541 Bodnar et al. Sep 2001 B1
6308148 Bruins et al. Oct 2001 B1
6311260 Stone et al. Oct 2001 B1
6339616 Kovalev Jan 2002 B1
6374266 Shnelvar Apr 2002 B1
6434191 Agrawal et al. Aug 2002 B1
6434641 Haupt et al. Aug 2002 B1
6434662 Greene et al. Aug 2002 B1
6438664 McGrath et al. Aug 2002 B1
6452915 Jorgensen Sep 2002 B1
6463001 Williams Oct 2002 B1
6489902 Heath Dec 2002 B2
6493698 Beylin Dec 2002 B1
6570511 Cooper May 2003 B1
6587985 Fukushima et al. Jul 2003 B1
6614368 Cooper Sep 2003 B1
6618397 Huang Sep 2003 B1
6633953 Stark Oct 2003 B2
6643259 Borella et al. Nov 2003 B1
6650644 Colley et al. Nov 2003 B1
6653954 Rijavec Nov 2003 B2
6667700 McCanne et al. Dec 2003 B1
6674769 Somnath Jan 2004 B1
6718361 Basani et al. Apr 2004 B1
6728840 Shatil et al. Apr 2004 B1
6738379 Balazinski et al. May 2004 B1
6754181 Elliott et al. Jun 2004 B1
6769048 Goldberg et al. Jul 2004 B2
6791945 Levenson et al. Sep 2004 B1
6823470 Smith et al. Nov 2004 B2
6839346 Kametani Jan 2005 B1
6842424 Key et al. Jan 2005 B1
6856651 Singh Feb 2005 B2
6859842 Nakamichi et al. Feb 2005 B1
6862602 Guha Mar 2005 B2
6910106 Securest et al. Jun 2005 B2
6963980 Mattsson Nov 2005 B1
6968374 Lemieux et al. Nov 2005 B2
6978384 Milliken Dec 2005 B1
7007044 Rafert et al. Feb 2006 B1
7020750 Thiyagarajan et al. Mar 2006 B2
7035214 Seddigh et al. Apr 2006 B1
7047281 Kausik May 2006 B1
7069268 Burns et al. Jun 2006 B1
7069342 Biederman Jun 2006 B1
7110407 Khanna Sep 2006 B1
7111005 Wessman Sep 2006 B1
7113962 Kee et al. Sep 2006 B1
7120666 McCanne et al. Oct 2006 B2
7145889 Zhang et al. Dec 2006 B1
7149953 Cameron et al. Dec 2006 B2
7177295 Sholander et al. Feb 2007 B1
7197597 Scheid et al. Mar 2007 B1
7200847 Straube et al. Apr 2007 B2
7215667 Davis May 2007 B1
7216283 Shen et al. May 2007 B2
7242681 Van et al. Jul 2007 B1
7243094 Tabellion et al. Jul 2007 B2
7249309 Glaise et al. Jul 2007 B2
7266645 Garg et al. Sep 2007 B2
7278016 Detrick et al. Oct 2007 B1
7318100 Demmer et al. Jan 2008 B2
7359393 Nalawade et al. Apr 2008 B1
7366829 Luttrell et al. Apr 2008 B1
7380006 Srinivas et al. May 2008 B2
7383329 Erickson Jun 2008 B2
7383348 Seki et al. Jun 2008 B2
7388844 Brown et al. Jun 2008 B1
7389357 Duffie et al. Jun 2008 B2
7389393 Karr et al. Jun 2008 B1
7417570 Srinivasan et al. Aug 2008 B2
7417991 Crawford et al. Aug 2008 B1
7420992 Fang et al. Sep 2008 B1
7428573 McCanne et al. Sep 2008 B2
7441039 Bhardwaj Oct 2008 B2
7451237 Takekawa et al. Nov 2008 B2
7453379 Plamondon Nov 2008 B2
7454443 Ram et al. Nov 2008 B2
7457315 Smith Nov 2008 B1
7460473 Kodama et al. Dec 2008 B1
7471629 Melpignano Dec 2008 B2
7496659 Coverdill et al. Feb 2009 B1
7532134 Samuels et al. May 2009 B2
7555484 Kulkarni et al. Jun 2009 B2
7571343 Xiang et al. Aug 2009 B1
7571344 Hughes et al. Aug 2009 B2
7587401 Yeo et al. Sep 2009 B2
7596802 Border et al. Sep 2009 B2
7617436 Wenger et al. Nov 2009 B2
7619545 Samuels et al. Nov 2009 B2
7620870 Srinivasan et al. Nov 2009 B2
7624333 Langner Nov 2009 B2
7624446 Wilhelm Nov 2009 B1
7630295 Hughes et al. Dec 2009 B2
7633942 Bearden et al. Dec 2009 B2
7639700 Nabhan et al. Dec 2009 B1
7643426 Lee et al. Jan 2010 B1
7644230 Hughes et al. Jan 2010 B1
7676554 Malmskog et al. Mar 2010 B1
7698431 Hughes Apr 2010 B1
7702843 Chen et al. Apr 2010 B1
7714747 Fallon May 2010 B2
7746781 Xiang Jun 2010 B1
7764606 Ferguson et al. Jul 2010 B1
7793193 Koch et al. Sep 2010 B2
7810155 Ravi Oct 2010 B1
7826798 Stephens et al. Nov 2010 B2
7827237 Plamondon Nov 2010 B2
7849134 McCanne et al. Dec 2010 B2
7853699 Wu et al. Dec 2010 B2
7873786 Singh et al. Jan 2011 B1
7917599 Gopalan et al. Mar 2011 B1
7924795 Wan et al. Apr 2011 B2
7925711 Gopalan et al. Apr 2011 B1
7941606 Pullela et al. May 2011 B1
7945736 Hughes et al. May 2011 B2
7948921 Hughes et al. May 2011 B1
7953869 Demmer et al. May 2011 B2
7957307 Qiu et al. Jun 2011 B2
7970898 Clubb et al. Jun 2011 B2
7975018 Unrau et al. Jul 2011 B2
7996747 Dell et al. Aug 2011 B2
8046667 Boyce Oct 2011 B2
8069225 McCanne et al. Nov 2011 B2
8072985 Golan et al. Dec 2011 B2
8090027 Schneider Jan 2012 B2
8090805 Chawla et al. Jan 2012 B1
8095774 Hughes et al. Jan 2012 B1
8140757 Singh et al. Mar 2012 B1
8171238 Hughes et al. May 2012 B1
8209334 Doerner Jun 2012 B1
8225072 Hughes et al. Jul 2012 B2
8271325 Silverman et al. Sep 2012 B2
8271847 Langner Sep 2012 B2
8307115 Hughes Nov 2012 B1
8312226 Hughes Nov 2012 B2
8352608 Keagy et al. Jan 2013 B1
8370583 Hughes Feb 2013 B2
8386797 Danilak Feb 2013 B1
8392684 Hughes Mar 2013 B2
8442052 Hughes May 2013 B1
8447740 Huang et al. May 2013 B1
8473714 Hughes et al. Jun 2013 B2
8489562 Hughes et al. Jul 2013 B1
8516158 Wu et al. Aug 2013 B1
8553757 Florencio et al. Oct 2013 B2
8565118 Shukla et al. Oct 2013 B2
8570869 Ojala et al. Oct 2013 B2
8576816 Lamy-Bergot et al. Nov 2013 B2
8595314 Hughes Nov 2013 B1
8613071 Day et al. Dec 2013 B2
8681614 McCanne et al. Mar 2014 B1
8699490 Zheng et al. Apr 2014 B2
8700771 Ramankutty et al. Apr 2014 B1
8706947 Pradeep Apr 2014 B1
8725988 Hughes et al. May 2014 B2
8732423 Hughes May 2014 B1
8738865 Hughes et al. May 2014 B1
8743683 Hughes Jun 2014 B1
8755381 Hughes et al. Jun 2014 B2
8775413 Brown et al. Jul 2014 B2
8811431 Hughes Aug 2014 B2
8843627 Baldi et al. Sep 2014 B1
8850324 Clemm et al. Sep 2014 B2
8885632 Hughes et al. Nov 2014 B2
8891554 Biehler Nov 2014 B2
8929380 Hughes et al. Jan 2015 B1
8929402 Hughes Jan 2015 B1
8930650 Hughes et al. Jan 2015 B1
9003541 Patidar Apr 2015 B1
9036662 Hughes May 2015 B1
9054876 Yagnik Jun 2015 B1
9092342 Hughes et al. Jul 2015 B2
9106530 Wang Aug 2015 B1
9130991 Hughes Sep 2015 B2
9131510 Wang Sep 2015 B2
9143455 Hughes Sep 2015 B1
9152574 Hughes et al. Oct 2015 B2
9171251 Camp et al. Oct 2015 B2
9191342 Hughes et al. Nov 2015 B2
9202304 Baenziger et al. Dec 2015 B1
9253277 Hughes et al. Feb 2016 B2
9306818 Aumann et al. Apr 2016 B2
9307442 Bachmann et al. Apr 2016 B2
9363248 Hughes Jun 2016 B1
9363309 Hughes Jun 2016 B2
9380094 Florencio et al. Jun 2016 B2
9397951 Hughes Jul 2016 B1
9438538 Hughes et al. Sep 2016 B2
9549048 Hughes Jan 2017 B1
9584403 Hughes et al. Feb 2017 B2
9584414 Sung et al. Feb 2017 B2
9613071 Hughes Apr 2017 B1
9626224 Hughes et al. Apr 2017 B2
9647949 Varki et al. May 2017 B2
9712463 Hughes et al. Jul 2017 B1
9716644 Wei et al. Jul 2017 B2
9717021 Hughes et al. Jul 2017 B2
9875344 Hughes et al. Jan 2018 B1
9906630 Hughes Feb 2018 B2
9948496 Hughes et al. Apr 2018 B1
9961010 Hughes et al. May 2018 B2
9967056 Hughes May 2018 B1
10091172 Hughes Oct 2018 B1
10164861 Hughes et al. Dec 2018 B2
10257082 Hughes Apr 2019 B2
10313930 Hughes et al. Jun 2019 B2
10326551 Hughes Jun 2019 B2
10432484 Hughes et al. Oct 2019 B2
10637721 Hughes et al. Apr 2020 B2
10719588 Hughes et al. Jul 2020 B2
10771370 Hughes Sep 2020 B2
20010026231 Satoh Oct 2001 A1
20010054084 Kosmynin Dec 2001 A1
20020007413 Garcia-Luna-Aceves et al. Jan 2002 A1
20020009079 Jungck et al. Jan 2002 A1
20020010702 Ajtai et al. Jan 2002 A1
20020010765 Border Jan 2002 A1
20020040475 Yap et al. Apr 2002 A1
20020061027 Abiru et al. May 2002 A1
20020065998 Buckland May 2002 A1
20020071436 Border et al. Jun 2002 A1
20020078242 Nanjundiah Jun 2002 A1
20020101822 Ayyagari et al. Aug 2002 A1
20020107988 Jordan Aug 2002 A1
20020116424 Radermacher et al. Aug 2002 A1
20020129158 Zhang et al. Sep 2002 A1
20020129260 Benfield et al. Sep 2002 A1
20020131434 Vukovic et al. Sep 2002 A1
20020150041 Reinshmidt et al. Oct 2002 A1
20020159454 Delmas Oct 2002 A1
20020163911 Wee et al. Nov 2002 A1
20020169818 Stewart et al. Nov 2002 A1
20020181494 Rhee Dec 2002 A1
20020188871 Noehring et al. Dec 2002 A1
20020194324 Guha Dec 2002 A1
20030002664 Anand Jan 2003 A1
20030009558 Ben-Yehezkel Jan 2003 A1
20030012400 Mcauliffe et al. Jan 2003 A1
20030033307 Davis et al. Feb 2003 A1
20030046572 Newman et al. Mar 2003 A1
20030048750 Kobayashi Mar 2003 A1
20030048785 Calvignac et al. Mar 2003 A1
20030067940 Edholm Apr 2003 A1
20030086425 Bearden May 2003 A1
20030091165 Bearden May 2003 A1
20030123481 Neale et al. Jul 2003 A1
20030123671 He et al. Jul 2003 A1
20030131079 Neale et al. Jul 2003 A1
20030133568 Stein et al. Jul 2003 A1
20030142658 Ofuji et al. Jul 2003 A1
20030149661 Mitchell et al. Aug 2003 A1
20030149869 Gleichauf Aug 2003 A1
20030204619 Bays Oct 2003 A1
20030214502 Park et al. Nov 2003 A1
20030214954 Oldak et al. Nov 2003 A1
20030233431 Reddy et al. Dec 2003 A1
20040008711 Lahti et al. Jan 2004 A1
20040047308 Kavanagh et al. Mar 2004 A1
20040083299 Dietz et al. Apr 2004 A1
20040085894 Wang et al. May 2004 A1
20040086114 Rarick May 2004 A1
20040088376 McCanne et al. May 2004 A1
20040114569 Naden et al. Jun 2004 A1
20040117571 Chang et al. Jun 2004 A1
20040123139 Aiello et al. Jun 2004 A1
20040158644 Albuquerque et al. Aug 2004 A1
20040179542 Murakami et al. Sep 2004 A1
20040181679 Dettinger et al. Sep 2004 A1
20040199771 Morten et al. Oct 2004 A1
20040202110 Kim Oct 2004 A1
20040203820 Billhartz Oct 2004 A1
20040205332 Bouchard et al. Oct 2004 A1
20040243571 Judd Dec 2004 A1
20040250027 Heflinger Dec 2004 A1
20040255048 Lev et al. Dec 2004 A1
20050010653 McCanne Jan 2005 A1
20050044270 Grove et al. Feb 2005 A1
20050053094 Cain et al. Mar 2005 A1
20050055372 Springer et al. Mar 2005 A1
20050055399 Savchuk Mar 2005 A1
20050060598 Klotz Mar 2005 A1
20050071453 Ellis et al. Mar 2005 A1
20050091234 Hsu et al. Apr 2005 A1
20050111460 Sahita May 2005 A1
20050131939 Douglis et al. Jun 2005 A1
20050132252 Fifer et al. Jun 2005 A1
20050141425 Foulds Jun 2005 A1
20050171937 Hughes et al. Aug 2005 A1
20050177603 Shavit Aug 2005 A1
20050182849 Chandrayana et al. Aug 2005 A1
20050190694 Ben-Nun et al. Sep 2005 A1
20050207443 Kawamura et al. Sep 2005 A1
20050210151 Abdo et al. Sep 2005 A1
20050220019 Melpignano Oct 2005 A1
20050220097 Swami et al. Oct 2005 A1
20050235119 Securest et al. Oct 2005 A1
20050240380 Jones Oct 2005 A1
20050243743 Kimura Nov 2005 A1
20050243835 Sharma et al. Nov 2005 A1
20050256972 Cochran et al. Nov 2005 A1
20050278459 Boucher et al. Dec 2005 A1
20050283355 Itani et al. Dec 2005 A1
20050286526 Sood et al. Dec 2005 A1
20060010243 Duree Jan 2006 A1
20060013210 Bordogna et al. Jan 2006 A1
20060026425 Douceur et al. Feb 2006 A1
20060031936 Nelson et al. Feb 2006 A1
20060036901 Yang et al. Feb 2006 A1
20060039354 Rao et al. Feb 2006 A1
20060045096 Farmer et al. Mar 2006 A1
20060059171 Borthakur et al. Mar 2006 A1
20060059173 Hirsch et al. Mar 2006 A1
20060109805 Malamal et al. May 2006 A1
20060117385 Mester et al. Jun 2006 A1
20060136913 Sameske Jun 2006 A1
20060143497 Zohar et al. Jun 2006 A1
20060193247 Naseh et al. Aug 2006 A1
20060195547 Sundarrajan et al. Aug 2006 A1
20060195840 Sundarrajan et al. Aug 2006 A1
20060212426 Shakara et al. Sep 2006 A1
20060218390 Loughran et al. Sep 2006 A1
20060227717 Van et al. Oct 2006 A1
20060250965 Irwin Nov 2006 A1
20060268932 Singh et al. Nov 2006 A1
20060280205 Cho Dec 2006 A1
20070002804 Xiong et al. Jan 2007 A1
20070008884 Tang Jan 2007 A1
20070011424 Sharma et al. Jan 2007 A1
20070038815 Hughes Feb 2007 A1
20070038816 Hughes et al. Feb 2007 A1
20070038858 Hughes Feb 2007 A1
20070050475 Hughes Mar 2007 A1
20070076693 Krishnaswamy Apr 2007 A1
20070076708 Kolakowski et al. Apr 2007 A1
20070081513 Torsner Apr 2007 A1
20070097874 Hughes et al. May 2007 A1
20070110046 Farrell et al. May 2007 A1
20070115812 Hughes May 2007 A1
20070127372 Khan et al. Jun 2007 A1
20070130114 Li et al. Jun 2007 A1
20070140129 Bauer et al. Jun 2007 A1
20070150497 De et al. Jun 2007 A1
20070160200 Ishikawa et al. Jul 2007 A1
20070174428 Lev et al. Jul 2007 A1
20070179900 Daase et al. Aug 2007 A1
20070192863 Kapoor et al. Aug 2007 A1
20070195702 Yuen et al. Aug 2007 A1
20070195789 Yao Aug 2007 A1
20070198523 Hayim Aug 2007 A1
20070226320 Hager et al. Sep 2007 A1
20070237104 Alon et al. Oct 2007 A1
20070244987 Pedersen et al. Oct 2007 A1
20070245079 Bhattacharjee et al. Oct 2007 A1
20070248084 Whitehead Oct 2007 A1
20070258468 Bennett Nov 2007 A1
20070260746 Mirtorabi et al. Nov 2007 A1
20070263554 Finn Nov 2007 A1
20070276983 Zohar et al. Nov 2007 A1
20070280245 Rosberg Dec 2007 A1
20080005156 Edwards et al. Jan 2008 A1
20080013532 Garner et al. Jan 2008 A1
20080016301 Chen Jan 2008 A1
20080028467 Kommareddy et al. Jan 2008 A1
20080031149 Hughes et al. Feb 2008 A1
20080031240 Hughes et al. Feb 2008 A1
20080037432 Cohen et al. Feb 2008 A1
20080071818 Apanowicz et al. Mar 2008 A1
20080095060 Yao Apr 2008 A1
20080133536 Bjorner et al. Jun 2008 A1
20080133561 Dubnicki et al. Jun 2008 A1
20080184081 Hama et al. Jul 2008 A1
20080205445 Kumar et al. Aug 2008 A1
20080222044 Gottlieb et al. Sep 2008 A1
20080229137 Samuels et al. Sep 2008 A1
20080243992 Jardeizky et al. Oct 2008 A1
20080267217 Colville et al. Oct 2008 A1
20080285463 Oran Nov 2008 A1
20080300887 Chen et al. Dec 2008 A1
20080313318 Vermeulen et al. Dec 2008 A1
20080320151 McCanne et al. Dec 2008 A1
20090006801 Shultz et al. Jan 2009 A1
20090024763 Stepin et al. Jan 2009 A1
20090037448 Thomas Feb 2009 A1
20090060198 Little Mar 2009 A1
20090063696 Wang et al. Mar 2009 A1
20090080460 Kronewitter et al. Mar 2009 A1
20090089048 Pouzin Apr 2009 A1
20090092137 Haigh et al. Apr 2009 A1
20090100483 McDowell Apr 2009 A1
20090158417 Khanna et al. Jun 2009 A1
20090168786 Sarkar et al. Jul 2009 A1
20090175172 Prytz et al. Jul 2009 A1
20090182864 Khan et al. Jul 2009 A1
20090204961 Dehaan et al. Aug 2009 A1
20090234966 Samuels et al. Sep 2009 A1
20090245114 Jayanth Oct 2009 A1
20090265707 Goodman et al. Oct 2009 A1
20090274294 Itani Nov 2009 A1
20090279550 Romrell et al. Nov 2009 A1
20090281984 Black Nov 2009 A1
20100005222 Brant et al. Jan 2010 A1
20100011125 Yang et al. Jan 2010 A1
20100020693 Thakur Jan 2010 A1
20100054142 Moiso et al. Mar 2010 A1
20100070605 Hughes et al. Mar 2010 A1
20100077251 Liu et al. Mar 2010 A1
20100082545 Bhattacharjee et al. Apr 2010 A1
20100085964 Weir et al. Apr 2010 A1
20100115137 Kim et al. May 2010 A1
20100121957 Roy et al. May 2010 A1
20100124239 Hughes May 2010 A1
20100131957 Kami May 2010 A1
20100150158 Cathey et al. Jun 2010 A1
20100169467 Shukla et al. Jul 2010 A1
20100177663 Johansson et al. Jul 2010 A1
20100225658 Coleman Sep 2010 A1
20100232443 Pandey Sep 2010 A1
20100242106 Harris et al. Sep 2010 A1
20100246584 Ferguson et al. Sep 2010 A1
20100290364 Black Nov 2010 A1
20100318892 Teevan et al. Dec 2010 A1
20100333212 Carpenter et al. Dec 2010 A1
20110002346 Wu Jan 2011 A1
20110022812 Van et al. Jan 2011 A1
20110113472 Fung et al. May 2011 A1
20110131411 Lin et al. Jun 2011 A1
20110154169 Gopal et al. Jun 2011 A1
20110154329 Arcese et al. Jun 2011 A1
20110181448 Koratagere Jul 2011 A1
20110219181 Hughes et al. Sep 2011 A1
20110225322 Demidov et al. Sep 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110276963 Wu et al. Nov 2011 A1
20110299537 Saraiya et al. Dec 2011 A1
20120036325 Mashtizadeh et al. Feb 2012 A1
20120069131 Abelow Mar 2012 A1
20120147894 Mulligan et al. Jun 2012 A1
20120173759 Agarwal et al. Jul 2012 A1
20120185775 Clemm et al. Jul 2012 A1
20120198346 Clemm et al. Aug 2012 A1
20120218130 Boettcher et al. Aug 2012 A1
20120221611 Watanabe et al. Aug 2012 A1
20120230345 Ovsiannikov Sep 2012 A1
20120239872 Hughes et al. Sep 2012 A1
20120290636 Kadous et al. Nov 2012 A1
20130018722 Libby Jan 2013 A1
20130018765 Fork et al. Jan 2013 A1
20130031642 Dwivedi et al. Jan 2013 A1
20130044751 Casado et al. Feb 2013 A1
20130058354 Casado et al. Mar 2013 A1
20130080619 Assuncao et al. Mar 2013 A1
20130083806 Suarez et al. Apr 2013 A1
20130086236 Baucke et al. Apr 2013 A1
20130086594 Cottrell Apr 2013 A1
20130094501 Hughes Apr 2013 A1
20130103655 Fanghaenel et al. Apr 2013 A1
20130117494 Hughes et al. May 2013 A1
20130121209 Padmanabhan et al. May 2013 A1
20130141259 Hazarika et al. Jun 2013 A1
20130142050 Luna Jun 2013 A1
20130163594 Sharma et al. Jun 2013 A1
20130250951 Koganti Sep 2013 A1
20130263125 Shamsee et al. Oct 2013 A1
20130266007 Kumbhare et al. Oct 2013 A1
20130282970 Hughes et al. Oct 2013 A1
20130325986 Brady et al. Dec 2013 A1
20130343191 Kim et al. Dec 2013 A1
20140052864 Van et al. Feb 2014 A1
20140075554 Cooley Mar 2014 A1
20140086069 Frey et al. Mar 2014 A1
20140101426 Senthurpandi Apr 2014 A1
20140108360 Kunath et al. Apr 2014 A1
20140114742 Lamontagne et al. Apr 2014 A1
20140123213 Vank et al. May 2014 A1
20140181381 Hughes et al. Jun 2014 A1
20140269705 Decusatis et al. Sep 2014 A1
20140279078 Nukala et al. Sep 2014 A1
20140321290 Jin et al. Oct 2014 A1
20140379937 Hughes et al. Dec 2014 A1
20150058488 Backholm Feb 2015 A1
20150074291 Hughes Mar 2015 A1
20150074361 Hughes et al. Mar 2015 A1
20150078397 Hughes et al. Mar 2015 A1
20150110113 Levy et al. Apr 2015 A1
20150120663 Le et al. Apr 2015 A1
20150127701 Chu et al. May 2015 A1
20150143505 Border et al. May 2015 A1
20150170221 Shah Jun 2015 A1
20150281099 Banavalikar Oct 2015 A1
20150281391 Hughes et al. Oct 2015 A1
20150312054 Barabash et al. Oct 2015 A1
20150334210 Hughes Nov 2015 A1
20150365293 Madrigal et al. Dec 2015 A1
20160014051 Hughes et al. Jan 2016 A1
20160034305 Shear et al. Feb 2016 A1
20160093193 Silvers et al. Mar 2016 A1
20160112255 Li Apr 2016 A1
20160218947 Hughes et al. Jul 2016 A1
20160255000 Gattani et al. Sep 2016 A1
20160255542 Hughes et al. Sep 2016 A1
20160359740 Parandehgheibi et al. Dec 2016 A1
20160380886 Blair et al. Dec 2016 A1
20170026467 Barsness et al. Jan 2017 A1
20170070445 Zhang et al. Mar 2017 A1
20170111692 An et al. Apr 2017 A1
20170149679 Hughes et al. May 2017 A1
20170187581 Hughes et al. Jun 2017 A1
20170359238 Hughes et al. Dec 2017 A1
20180089994 Dhondse et al. Mar 2018 A1
20180121634 Hughes et al. May 2018 A1
20180123861 Hughes et al. May 2018 A1
20180131711 Chen et al. May 2018 A1
20180205494 Hughes Jul 2018 A1
20180227216 Hughes Aug 2018 A1
20180227223 Hughes Aug 2018 A1
20190089620 Hefel et al. Mar 2019 A1
20190104207 Goel et al. Apr 2019 A1
20190149447 Hughes et al. May 2019 A1
20190230038 Hughes Jul 2019 A1
20190245771 Wu et al. Aug 2019 A1
20190253187 Hughes Aug 2019 A1
20190260683 Hughes Aug 2019 A1
20190274070 Hughes et al. Sep 2019 A1
20190280917 Hughes et al. Sep 2019 A1
20200021506 Hughes et al. Jan 2020 A1
20200213185 Hughes et al. Jul 2020 A1
Foreign Referenced Citations (3)
Number Date Country
1507353 Feb 2005 EP
05-061964 Mar 1993 JP
0135226 May 2001 WO
Non-Patent Literature Citations (24)
Entry
“You L. L. et al., ““Deep Store An Archival Storage System Architecture”” Data Engineering, 2005. ICDE 2005. Proceedings. 21st.inli Conf on Tokyo, Japan, Apr. 5-8, 2005, pp. 12”.
“You, L. L. and Karamanolis, C. 2004. ““Evaluation of effcient archival storage techniques””, In Proceedings of the 21st IEEE Symposium on Mass Storage Systems and Technologies (MSST)”.
A protocol-independent technique for eliminating redundant network traffic, ACM SIGCOMM Computer CommunicationReview, vol. 30, Issue 4 (Oct. 2000) pp. 87-95, Year of Publication: 2000.
Definition appliance, 2c, Webster's Third New International Dictionary, Unabridged (1993), available at <http://lionreference.chadwyck.com> (Dictionaries/Webster's Dictionary). Copy not provided in proceedings.
Final Written Decision, dated Dec. 30, 2014, Inter Parles Review Case No. IR2013-00402, pp. 1-37.
Final Written Decision, dated Dec. 30, 2014, Inter Partes Review Case No. IPR2013-00403.
Final Written Decision, dated Jun. 9, 2015, Inter Partes Review Case No. IPR2014-00245.
Hong, B et al. “Duplicate data elimination in a SAN file system”, In Proceedings of the 21st Symposium on Mass Storage Systems (M88 '04), Goddard, MD, Apr. 2004. IEEE.
Knutsson, Bjorn et al., “Transparent Proxy Signalling”, Journal of Communications and Networks, vol. 3, No. 2, Jun. 2001.
Newton, “Newton's Telecom Dictionary”, 17th Ed., 2001, pp. 38, 201, and 714.
Riverbed, “Riverbed Awarded Patent on Core WDS Technology” (available at: http://www.riverbed.com/about/news-articles/pressreleases/riverbed-awarded-patent-on-core-wds-technology.html (last visited Aug. 8, 2014)), 2 pages.
Riverbed, “Riverbed Introduces Market-Leading WDS Solutions for Disaster Recovery and Business Application Acceleration” (available at http://www.riverbed.com/about/news-articles/pressreleases/riverbed-introduces-market-leading-wds-solutions-fordisaster-recovery-and-business-application-acceleration.html (last visited Aug. 8, 2014)).
Riverbed, “The Riverbed Optimization System (RiOS) v4.0: A Technical Overview” (explaining “Data Security” through segmentation) (available at http://mediacms.riverbed.com/documents/TechOverview-Riverbed-RiOS_4_0.pdf (last visited Aug. 8, 2014)).
Shared LAN Cache Datasheel, 1996, http://www.lancache.com/slcdata.htm.
Silver Peak Systems, “The Benefits of Byte-level WAN Deduplication” (2008).
Singh et al.; “Future of Internet Security—IPSEC”; 2005; pp. 1-8.
Tseng, Josh, “When accelerating secure traffic is not secure” (available at http://www.riverbed.com/blogs/whenaccelerati.hlml?&isSearch=true&pageSize=3&page=2 (last visited Aug. 8, 2014)).
Zhao et al.; “Analysis and Improvement on IPSEC Anti-Replay Window Protocol”; 2003; IEEE' pp. 553-558
“Decision Granting Motion to Terminate”, Inter Partes Review Case No. IPR2014-00245, Feb. 7, 2018, 4 pages.
“Fred Douglis and Arun Iyengar, Application specific Delta-encoding via Resemblance Detection”, Published in the 2003 USENIXAnnual Technical Conference.
“IPsec Anti-Replay Window: Expanding and Disabling,” Cisco IOS Security Configuration Guide. 2005-2006 Cisco Systems, Inc. Last updated: Sep. 12, 2006, 14 pages.
“Muthitacharoen, Athicha et al., ““A Low-bandwidth Network File System,”” 2001, in Proc. ofthe 18th ACM Symposium on Operating Systems Principles, Banff, Canada, pp. 174-187.”
“Notice of Entry of Judgement Accompanied by Opinion”, United States Court of Appeals for the Federal Circuit, Case: 15-2072, Oct. 24, 2017, 6 pages.
“Udi Manber. ““Finding Similar Files in a Large File System””, TR 93-33 Oct. 1994, Department of Computer Science,University of Arizona. http://webglimpse.net/pubs/TR93-33.pdf. Also appears in the 1994 winter USENIX Technical Conference.”.
Related Publications (1)
Number Date Country
20200358687 A1 Nov 2020 US
Continuations (2)
Number Date Country
Parent 16224482 Dec 2018 US
Child 16938873 US
Parent 14981814 Dec 2015 US
Child 16224482 US