Virtual wide area network overlays

Information

  • Patent Grant
  • 10313930
  • Patent Number
    10,313,930
  • Date Filed
    Friday, May 6, 2016
    8 years ago
  • Date Issued
    Tuesday, June 4, 2019
    5 years ago
Abstract
Disclosed herein are systems and methods for the creation, maintenance and management of virtual overlay networks across multiple communication networks managed by service providers. The simple creation and management of network overlays is accomplished via a network orchestrator manager, allowing for automation of configuration of connected network devices throughout an entire organization's network, regardless of the physical location of each device.
Description

The disclosures of the above-referenced patents and applications are hereby incorporated by reference in their entirety for all purposes.


TECHNICAL FIELD

This disclosure relates generally to the creation and managing of virtual network overlays.


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.


Local area networks (LANs) are capable of being segregated into multiple virtual LANs to carry different types of traffic. For example, one virtual LAN may be for guest Wi-Fi, one for a separate network for employees to access company information, one for a separate network for cash registers at a retail location, and one for a separate network for back offices of a retailer. Different types of data can be transmitted on each virtual LAN. However, currently no mechanism exists for creating separate networks for transmitting data over a Wide area network (WAN). Embodiments of the present disclosure describe mechanisms to create, deploy, and transmit data over virtual network overlays for a WAN.


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.


In exemplary embodiments, a method for transmitting data via a virtual overlay network is disclosed. The method comprises receiving at a first network appliance, data to be transmitted across a communication network to a destination, the data comprising a plurality of data packets; classifying the data based on a traffic access policy; assigning an overlay identification to the data based on the classification; determining, based on the destination, a second network appliance to receive the data; selecting a bonded tunnel for the assigned overlay identification and second network appliance, the bonded tunnel being a (virtual) tunnel for the overlay between the first network appliance and second network appliance; and transferring the data packets from the first network appliance via the selected tunnels to an endpoint of the communication network.


One or more of the network appliances may be located in a cloud. Each of the plurality of network appliances is connected to at least one other network appliance via at least one bonded tunnel, the bonded tunnel transporting data for a specific traffic classification specified by the traffic access policy.


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. 1 illustrates an exemplary system with two locations, within which the present disclosure can be implemented.



FIG. 2 illustrates an exemplary network for connecting multiple appliances.



FIG. 3 illustrates a block diagram of an appliance in an exemplary implementation of the invention.



FIG. 4 illustrates an exemplary implementation of data packet transfer over a network using quality of service using multiple flows.



FIG. 5 illustrates an exemplary infrastructure serving individual needs of separate overlays.



FIG. 6 depicts an exemplary graphical user interface that a network administrator may use to create and implement an overlay network.



FIGS. 7A-7B depict an exemplary graphical user interface that a network administrator may use to assign labels to different network interfaces.



FIG. 7C depicts an exemplary appliance with interface labels.



FIG. 8 depicts an exemplary setup of an orchestrator in communication network appliances.



FIGS. 9A-11 depict exemplary bonding policies.



FIGS. 12A-12C depict an exemplary embodiment of load balancing links.



FIGS. 13, 14A and 14B depict exemplary embodiments of a system using multiple access link providers in a cross-connected manner.



FIG. 15A depicts an exemplary system for data transfer using bonded tunnels and underlay tunnels.



FIG. 15B depicts an exemplary illustration of an original packet and amended packets.



FIG. 16 depicts an exemplary method for an appliance to process packet data.





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 the simple creation, deployment and management of virtual overlay networks.


I. System Setup



FIG. 1 illustrates an exemplary system 100, within which the present disclosure can be implemented. The exemplary system 100 includes a branch location 110, a central location 120 (also sometimes referred to as a data center), and two communication networks 130A and 130B. While two communication networks are depicted in exemplary system 100, there can be any number of communication networks, including just one, or three or more.


The branch location 110 includes computers 140, a first appliance 150, and a router 160. In the branch location 110, the computers 140 are linked to the first appliance 150. The first appliance 150 is linked to the router 160, which is coupled to the communication networks 130A and 130B. While only one appliance is depicted in branch location 110, there can be multiple appliances, physical and/or virtual, at branch location 110. Similarly, while only one router 160 is depicted in exemplary system 100, there can be multiple routers, switches, or other equipment (physical or virtual) at branch location 110. Additionally, in some embodiments, first appliance 150 may be in communication with the one or more communication networks directly, instead of through router 160.


The central location 120 in exemplary system 100 includes central servers 170 and a second appliance 180. While the term “server” is used herein, any type of computing device may be used in central location 120. In the central location 120, the central servers 170 are linked to the second appliance 180. The second appliance 180 is coupled directly to the communication networks 130A and 130B. While only one appliance is depicted in central location 120, there can be multiple appliances, physical and/or virtual, at central location 120. Additionally, in some embodiments, second appliance 180 may be in communication with the one or more communication networks through a router, switch, or other physical or virtual equipment, instead of directly.


The principles discussed herein are equally applicable to multiple branch locations (not shown) and to multiple central locations (not shown). For example, the system 100 may include multiple branch locations and/or multiple central locations coupled to one or more communication networks. Branch location/branch location communication, central location/central location communication, central location/cloud appliance communication, as well as multi-appliance and/or multi-node communication and bi-directional communication are further within the scope of the disclosure. However, for the sake of simplicity, the disclosure illustrates the system 100 having the single branch location 110 and the single central location 120, and the respective branch location 110/central location 120 communication.


The communication networks 130A and 130B comprise hardware and/or software elements that enable the exchange of information (e.g., voice, video and data) between the branch location 110 and the central location 120. Some examples of the communication network 130 are a private wide-area network (WAN), and the public Internet. Typically connections from the branch location 110 to the communication networks (e.g., from the router 160 and second appliance 180) are, T1 lines (1.544 Mbps), or broadband connections such as digital subscriber lines (DSL) and cable modems. Other examples are MPLS lines, T3 lines (43.232 Mbps), OC3 (155 Mbps), and OC48 (2.5 Gbps), fiber optic cables, or LTE wireless access connection. One or more of the communication networks 130A and 130B can also be a cloud network or virtual network.


The router 160 and second appliance 180 are connected to the communication networks 130A and 130B via access links 125, sometimes also referred to herein as network access links. The communication networks consist of routers, switches, and other internal components that make up provider links 135, that are managed by the network service providers such as an internet service provider. Access links 125 and provider links 135 can be combined to make various network paths along which data travels. The exemplary embodiment of FIG. 1 depicts two paths through each communication network, showing a total of four network paths for data to be exchanged between the first appliance 150 and second appliance 180. As understood by persons of ordinary skill in the art, there can be any number of network paths across one or more communication networks.


The first appliance 150 and second appliance 180 comprise hardware and/or software elements configured to receive data and optionally perform any type of processing, including but not limited to, WAN optimization techniques to the data, before transmitting to another appliance. The operations of the second appliance 180 may be similar to the operations of the first appliance 150.


As illustrated, the first appliance 150 is configured in-line (or serially) between the computers 140 and the router 160. The first appliance 150 and the second appliance 180 transparently intercept network traffic between the computers 140 and the central servers 170. For example, the second appliance 180 transparently intercepts data sent from the central servers 170 and addressed to the computers 140. The computers 140 and the central servers 170 advantageously require no additional configuration because the first appliance 150 and the second appliance 180 operate transparently.


Alternatively, the first appliance 150 and the second appliance 180 are configured as an additional router or gateway. As a router, for example, the first appliance 150 appears to the computers 140 as an extra hop before the router 160. In some embodiments, the first appliance 150 and the second appliance 180 provide redundant routing or peer routing with the router 160. Additionally, in the bridge and router configurations, the first appliance 150 and the second appliance 180 provide failure mechanisms, such as, fail-to-open (e.g., no data access) or fail-to-wire (e.g., a direct connection to the router 160). If an appliance has multiple interfaces, it can be transparent on some interfaces, and act like a router/bridge on others. Alternatively, the appliance can be transparent on all interfaces, or appear as a router/bridge on all interfaces.


The system 100 advantageously provides increased productivity, reduced IT costs, and enhanced data integrity and compliance. For example, the system 100 achieves the simple administration of centralized server systems whereby the central servers 170 can provide centralized management of business intent, objectives and policies for network traffic throughout all locations. By providing centralized management, the system 100 improves application performance and data access in the branch location 110 and central location 120.


In some embodiments, the system 100 includes one or more secure tunnels between the first appliance 150 and the second appliance 180. The secure tunnel may be utilized with encryption (e.g., IPsec), access control lists (ACLs), compression (such as header and payload compression), fragmentation/coalescing optimizations and/or error detection and correction provided by an appliance.


An exemplary network for connecting multiple appliances 250 is depicted in FIG. 2. Each appliance 250 can be in communication with other appliances 250, whether they are in a branch location 110, central location 120, private cloud network, customer datacenter, or any other location. In the exemplary embodiment of FIG. 2, a network is displayed where appliances are in communication with each other. As understood by persons of ordinary skill in the art, any type of network topology may be used.


Each appliance can be physical or virtual. In the exemplary embodiment of FIG. 2, a virtual appliance is depicted as being in its own virtual private cloud (VPC) 210, managed by a cloud service provider, such as Amazon Web Services, or others. Another appliance in customer datacenter 220 can be physical or virtual.


As discussed herein, the communication network 130 can comprise multiple provider links, made up of routers and switches, connecting networked devices in different locations. These provider links, which together form various paths, are part of one or more core networks, sometimes referred to as an underlay network. In addition to these paths, there can also be tunnels connecting two networked devices. A virtual network, sometimes called an overlay network, can be used to transmit data across the underlay network, regardless of which Service Provider manages the routes or provider links. Data from connected devices can travel over this overlay network, which can consist of any number of tunnels or paths between each location.


In an exemplary embodiment, data from computers 140 at branch location 110 may include voice, video, and data. This information is sent through switch 230, and then transmitted by an appliance 250 over the communication network 130 to other connected appliances 250. In some embodiments, voice, video, and data may be received and transmitted on separate LAN or vLAN interfaces, and the appliance 250 can distinguish the traffic based on the LAN/vLAN interface at which the data was received on.



FIG. 3 illustrates a block diagram of an appliance 250, in an exemplary implementation of the invention. The appliance 250 includes a processor 310, a memory 320, a WAN communication interface 330, a LAN communication interface 340, and a database 350. A system bus 380 links the processor 310, the memory 320, the WAN communication interface 330, the LAN communication interface 340, and the database 350. When deployed in a branch location, line 360 links the WAN communication interface 330 to the router 160 (in FIG. 1), and line 370 links the LAN communication interface 340 to the computers 140 in FIG. 1.


The database 350 comprises hardware and/or software elements configured to store data in an organized format to allow the processor 310 to create, modify, and retrieve the data. The hardware and/or software elements of the database 350 may include storage devices, such as RAM, hard drives, optical drives, flash memory, and magnetic tape.


In some embodiments, some appliances comprise identical hardware and/or software elements. Alternatively, in other embodiments, some appliances, such as a second appliance, may include hardware and/or software elements providing additional processing, communication, and storage capacity.


II. Overlay Networks



FIG. 4 illustrates an exemplary implementation of data packet transfer over a network using quality of service using multiple flows. An environment 400, as depicted in FIG. 4, may include certain similar elements as the system 100, such as the computers 140 and 430. The environment may also include a communication network 424, a communication network 404, as well as the various routers (e.g., the local routers 408, the edge routers 410, and the core routers 412). The communication networks 404 and 424 are composed of provider links, such as provider link 422, similar to provider links 135 of FIG. 1. Access link 420 may be used by a networked device to access the communication network 404. The environment 400 also includes a first appliance 150, positioned between the computer 140 and one of the local routers 408. The second appliance 180 is positioned between the computer 430 and another local router 408.


In some embodiments, the first appliance 150 may amend the packet 406 received from the computer 140 via the inter-computer flows to affect which inter-device flow the packet is directed to, this resulting in an amended packet 402. According to one embodiment, the packet 406 is amended such that an additional header portion is added to the packet 406, while according to another embodiment, the packet 406 is amended such that certain information in the header portion is altered or replaced (sometimes called encapsulation or tunneling to create tunnel packets). The amended packet 402 may be restored to the packet 406 upon receipt by the second appliance 180. After which, the packet 406 may be delivered to the computer 430 on the inter-computer flow from which it originated. Again, it is noted that the first appliance 150 may be equivalent to, and interchangeable with, the second appliance 180 in that any task or procedure carried out by the first appliance 150 may be carried out by the second appliance 180, and vice versa.


The data paths of environment 400 may be of varying quality, such as a good flow 414, a moderate flow 416, or a poor flow 418. Quality of a given path may be determined by certain metrics. As mentioned herein, the metrics may include latency, re-ordering, jitter, and/or loss of packets, and may be referred to as a latency metric, a re-ordering metric, and a loss metric, respectively.


The latency metric may simply be described as a time required for the packet to reach a destination. In some cases, the latency metric may be related to round-trip time (RTT). Many different communication network delays may comprise the latency metric. For example, a processing delay is time taken by various routers (e.g., the local router 408, the edge router 410, and the core router 412) to process the header of the packet. A queuing delay may be time that the packet spends in routing queues. Time required to push the packet into a physical link connecting the various routers may be referred to as a transmission delay. Lastly, a propagation delay is time required for a signal comprising the packet to propagate through a medium (e.g., a wire, a cable, or air) used to transmit the packet.


The re-ordering metric determines a level of re-ordering of the packets that is required upon arrival of the packets at the destination, in exemplary embodiments. To illustrate, when a plurality of related packets are transmitted across the communication network(s), different packets may be directed to different paths. This may be due to packets from a single flow being directed to more than one path, for example. The plurality of related packets may resultantly arrive at the destination in a different order than as sent. Thus, the plurality of related packets may require re-ordering. The re-ordering of packets may have a dramatic impact, for example, on VoIP and video data streams, and TCP/IP data streams.


The loss metric quantifies packet loss, which occurs when one or more packets being transmitted across the communication network fail to reach the destination. Packet loss may be caused by a number of factors, such as signal degradation, oversaturation of the communication network, corrupted packets being rejected in-transit, faulty communication networking hardware, and maligned system drivers or communication network applications. The loss metric may also take into account bit error and/or spurious packets. Although the latency metric, the re-ordering metric, and the loss metric are described herein, other metrics may comprise the flow metrics and still fall within the scope of the present invention.


The paths or tunnels in environment 400 may be categorized based on various flow metrics. These flow metrics may be related to, for example, latency, re-ordering, jitter, and/or loss of packets, among other metrics. The packets may be directed to tunnels having preferable metrics without any specific knowledge or concern of the communication network, protocols, or computers thereof.


Classifying the flows based on the flow metrics may aid the appliances 150 and 180 in determining which packets should be directed to which inter-device flows. For example, the inter-device flows may be grouped into three classifications. A first classification may be associated with inter-device flows having preferable flow metrics, which exhibit excellent performance in transferring the packets. The first classification may be reserved for packets having highest priorities. A second classification may be ascribed to inter-device flows having slightly less preferable flow metrics, relative to the first classification, but nevertheless acceptable. Packets that must be transferred, but that are less essential, may be directed to the inter-device flows having the second classification. Poorly performing inter-device flows, having less than desirable flow metrics, may be used only sparingly. However, in one example, at least some packets may be directed to each inter-device flow in order to determine the flow metrics.


As shown in FIG. 4, the amended packets 402 may advantageously be more heavily distributed to the inter-device flows having preferable flow metrics (e.g., the good flow 414). The moderate flow 416 may transfer less of the amended packets 402, while the poor flow 418 may transfer even fewer.


Embodiments of the present invention also allow for centrally assigned business intent policies to be implemented throughout an organization's entire network, to secure and control all WAN traffic for the organization. Software defined WAN (SD-WAN) overlay networks can be created independently from the physical network, and from each other. Topology, security, and forwarding rules can be specified independently for each overlay. This design allows for high-scale and secure application segmentation. Each overlay scales automatically as endpoints are added to the SD-WAN fabric, and configuration integrity is maintained as each site maps a local profile into a global overlay.


All of the overlay networks, labels, and corresponding ports, subnets and vLANs can be maintained in one or more databases in communication with an orchestrator device, as depicted in FIG. 8. The orchestrator 810 can be hardware and/or software, and be in communication with each of the networked devices, such as the appliances 250, as well as in communication with the database(s) 820.


In exemplary embodiments, the orchestrator may maintain information regarding the configuration of each appliance at each physical location. In this way, the orchestrator can create, manage and deploy the business objectives for network traffic throughout the network of connected devices. For example, if a higher priority is designated for voice traffic at each location, the orchestrator can automatically configure the corresponding network interfaces at each location accordingly.


By having knowledge of the configuration of each appliance in the network, the orchestrator 810 can also create and manage all of the bonded tunnels in the enterprise network, each bonded tunnel carrying a particular type of network traffic between each source-destination appliance pair. The orchestrator 810 can automatically configure the enterprise network by determining which overlay and underlay tunnels need to be set up, and automatically creating them based on the network nodes and overlays.



FIG. 5 illustrates an exemplary infrastructure (physical MPLS, Internet and cellular networks) serving individual needs of separate overlays. In this case, there are three separate overlays for Guest Wi-Fi, Enterprise Application, and Voice over IP (VoIP). The overlays apply globally to the enterprise network, and the local profiles for each appliance describe how to map incoming traffic onto each overlay. While in this embodiment, vLAN is used as the access policy, other methods can be used such as access control lists, network interface, etc.


In the exemplary infrastructure of FIG. 5, different topologies and behaviors define the requirements of these applications. For instance, a business may not want the same topology for CRM applications as for voice-over-IP (VoIP) applications. A dual hub and spoke configuration, with each of two data centers acting as hubs, would make sense for CRM, whereas VoIP typically would be configured in a full mesh to each destination.


Business intent overlays follow, and benefit from, the operational models of compute virtualization. They allow for maintenance of independence from the physical layer because the overlay decouples the delivery of business intent and applications from the vendor choice and hardware refresh cycle of the underlay (physical network of switches and routers). Furthermore, secure physical, virtual, and control networks are isolated because each overlay describes a logical network for the application that can have a different topology—including addressing and access control—from the physical network. In addition, high availability (HA) and ample bandwidth are facilitated via integration with route policies including dynamic path control (DPC) techniques that emphasize HA, maximum throughput or load balancing; applications are segmented according to required service-level guarantees such as minimum bandwidth or Quality of Service (QoS). Application visibility also provides full knowledge and control of all applications crossing the enterprise WAN with real-time graphs at the Layer 7 application level, including web services over HTTP(s).



FIG. 7A depicts an exemplary graphical user interface that a network administrator may use to assign labels to different network interfaces of an appliance, such as appliance 250. In the figure, the LAN ports and the WAN uplinks that are available in a small branch location profile are depicted. LAN ports have interface labels assigned to them that describe the traffic types and applications that will use them. For instance, voice traffic is assigned to lan0, and the different vLANs on lan1 carry data and replication traffic.


The interfaces are also labeled on the WAN side. Here, wan1 connects to the public Internet, and wan0 connects to an MPLS service. Both WAN interfaces are encrypted and the Internet uplink is configured for Network Address Translation (NAT). Combining these port configurations into a single profile simplifies the installation process for the appliance at the branch location and prevents configuration errors. This profile could be applied to all appliances with certain branch types, so each branch does not have to be configured independently. For example all front end office locations of an organization may have one profile associated with a branch type, while backend or central office locations of an organization may have a different profile. By creating these profiles, the orchestrator 810 is informed as to which interfaces of the appliance 250 are used for what purpose.


Unlike conventional systems, network interfaces of appliance 250 are assigned labels in addition to individual port names. This facilitates end-to-end consistency and the ability to define the behavior of these interfaces by labels. Additionally, some local overrides can be made to the profile when applying it to the branch location. For example, an administrator can change the WAN links (swapping wan0 and wan1) to match how the appliance is physically connected. In the exemplary embodiment depicted in FIG. 7B, wan0 is now connected to Internet and wan1 is connected to MPLS. Even though the appliance may be physically connected in a different way than an appliance at other branch locations, since each interface is labeled and traffic is transmitted according to label, the traffic can still be seamlessly transmitted to other appliances. Furthermore, the automation system can still be applied throughout the organization's network of connected devices since the interfaces are labeled. Thus, even though appliances at different locations may be connected differently, the orchestrator 810 can still automate configuration of appliances to implement network objectives and business intent.



FIG. 7C depicts an exemplary appliance 250 with interface labels. Each LAN and WAN interface is labeled with a particular type of traffic, and each label is associated with a separate overlay network to carry that type of traffic. For example, voice traffic may be transmitted over one overlay, data traffic over another, and guest Wi-Fi may be a third overlay network. At each location, such as a branch location, a network administrator may label the type of traffic handled at each network interface. In the exemplary setup for the appliance in FIG. 7C, LAN interface lan0 handles voice traffic, wan0 interfaces with the MPLS link and wan1 interfaces with the public Internet. The lan2 interface in FIG. 7C has multiple virtual LANs, each carrying a different type of traffic: intranet, BI Database, replication, and guest Wi-Fi.


However, at a different location, such as at a second branch location, the interfaces of appliance 250 may be configured differently such that wan0 is the Internet link and wan1 is the MPLS link. Every site of a company could be configured differently because a person has to physically setup and configure the equipment at each location. Thus, if a company has multiple locations, there may be no uniformity as to which port of an appliance 250 handles each type of traffic at each location.


Since each site has its appliance network interfaces labeled, an organization's business intent can be quickly applied to all appliances at all locations, such that traffic is handled according to the specified business intent uniformly throughout the organization. A network administrator may simply decide to take a certain action with voice traffic throughout all or a portion of the network of connected locations without any other specific configuration required. A central computer connecting to a database, referred to herein as orchestrator 810, keeps track of each branch location's configuration regarding which interface is assigned to which label, so that the computer knows which specific ports and interfaces are affected at each location, thus allowing for automation of appliance configuration based on business intent. In conventional systems, a network administrator would need to know which port handles voice traffic at each location in order to take any system-wide action with voice traffic specifically. Since every location has different addressing and configuration, this can become cumbersome for a large number of appliances. By labeling each network interface based on traffic type at initial setup of an appliance, automated management of all appliances uniformly can occur based on intent, instead of managing each device independently.


Furthermore, by connecting appliances in an overlay network by associating labels with network interfaces (physical ports, virtual ports, endpoint of vLANs, subnets, etc.), the network administrator can describe a business intent (for example to give voice traffic a higher priority), and the system automatically knows which ports, vLANs, and subnets are affected through the use of a consistent label throughout the entire network of connected devices. In this way, a network administrator can assign a different priority to a particular type of traffic (such as voice traffic), compared to other types of traffic.


By utilizing labels for each type of traffic, overlay networks for each can be easily created and configured by a network administrator. Rules for transmitting each type of traffic over a network can be written that are then automatically applied to every location in the network, without the network administrator having to know the specific network address or port for each type of traffic at each destination device.


For example, an organization may prefer that voice traffic be transmitted over MPLS. The orchestrator 810 knows how to identify voice traffic at each location and which interfaces at each appliance 250 in every location use MPLS, so the orchestrator 810 can automatically configure every appliance to direct voice traffic over the MPLS communication network, regardless of whether MPLS is connected to port lan1, wan0, etc.



FIG. 6 depicts an exemplary graphical user interface that a network administrator may use to create and implement an overlay network based on business intent. For each separate overlay network, the network administrator defines the network topology to be used, a traffic access policy, brownout thresholds for an access link type, primary access link, secondary access link, condition for use of backup ports, bonding policy, failover action, quality of service desired, and boost license. In exemplary embodiments, the user interface appears on a single-screen. In this way, a network administrator can define and implement business intent across all locations. Each of these parameters will be discussed in more detail below. The selection of each of these fields can be applied to each specific site in an organization's network of connected devices, as discussed herein.


As a person of ordinary skill in the art would understand, other exemplary embodiments may include fewer or additional fields for the creation and implementation of the overlay network in the graphical user interface.


III. Bonded Tunnels


There can be multiple provider links, made up of routers and switches, connecting devices in different locations, as explained herein and known to persons of ordinary skill in the art. Physical provider links, which make up paths, are part of one or more core networks, sometimes referred to as an underlay network. These provider links can be managed by different service providers, such as Internet Service Providers.


For example, within an MPLS network, there can be multiple provider links managed by a MPLS service provider. There can also be an access link connecting a device to the MPLS network. Other access links can connect a device to other networks, such as cable, DSL, or wireless networks such as LTE.


There may be tunnels, carrying packets such as IPsec packets, over each of these provider links from a source device to a destination device. Sometimes these tunnels are referred to as an overlay network in the art, but these tunnels are referred to herein as underlay tunnels.


In some embodiments of the present disclosure, further bonded tunnels are used as an additional layer of tunnels on top of the underlay tunnels to carry data from a source to a destination. In conventional systems, data entering the wide area network, such as data entering by switch 230, loses its segregation at the edge router 410, and becomes mixed with all other network traffic. However, in embodiments of the present invention, separate bonded tunnels can be used for each type of data traffic, such that each type of data traffic can remain separate across the network and arrive as a separate flow at the destination site. While three streams are discussed here (voice, video, and data), any number of streams can be used in this manner.


For example, an organization may have all of their financial data on one overlay, and data regarding building maintenance systems on another overlay. These two data streams are in no way related, and a person accessing one set of data does not need to access the other set of data. To keep them separate, a separate bonded tunnel can be used to transmit each type of data and keep the data segregated. In a further example, a retailer may have cash registers at a store location connected to a network to transmit and receive data. A back office computer may transmit different data to a head office or central location. These data streams can be kept separate by being transmitted over different bonded tunnels of an overlay network.


Each type of network traffic can remain separate through the use of labels for data from each interface of an appliance, as discussed herein. Thus, all video traffic from a particular device may be assigned a label of “video” and the data packets are amended by the appliance to include an overlay ID that corresponds to the label, in the header of each data packet from that network interface. In this manner, the data packets from each network interface are designated for transmission via separate bonded tunnels, in accordance with the business intent for the organization. While labels are described herein as being assigned according to network interface, separation can also occur based on other methods. For example, application access control lists can be used to distinguish voice data from video data, even though both data flows may arrive on the same network interface.


This second layer of tunnels is a virtual network, and allows for the creation of additional overlay networks over the provider links and underlay tunnels, regardless of which Service Provider manages the physical components. Data from connected devices can travel over these overlay networks, which can consist of any number of tunnels.



FIG. 15A depicts an exemplary system for data transfer in this manner. Incoming data packets are first received and then classified in accordance with a traffic access policy. In exemplary embodiments, the classification can be based on a traffic access policy, which in turn can rely on information in the packet and the network interface at which the traffic is received. Based on the classification, an overlay ID is assigned, and the packet headers can be amended accordingly to designate the overlay ID. The overlay ID denotes which overlay network the data is designated to utilize. In other embodiments, classification can be based on a label of the network interface of the incoming stream.


A destination appliance to receive the data is determined, and a bonded tunnel is selected for the overlay network and the source-destination pair. Each data packet is then directed to an appropriate bonded tunnel endpoint associated with that overlay network's bonded tunnel between the source and destination appliances. For example, if a source appliance is located in San Francisco and a destination appliance is in New York City, data packets from San Francisco destined for New York City that are labeled as video data are transmitted to an endpoint of bonded tunnel 1, voice traffic is sent to an endpoint of bonded tunnel 2, and regular data traffic is sent to an endpoint of bonded tunnel 3. Thus, even though the traffic is going from the same source to the same destination, a different bonded tunnel is used for each traffic type. While one bonded tunnel is depicted for each overlay in FIG. 15A, there can actually be many bonded tunnels to various destinations (i.e. one bonded tunnel for each overlay from San Francisco to New York City, one bonded tunnel for each overlay from San Francisco to Boston, etc.).


From a bonded tunnel, the network traffic is dynamically assigned to an endpoint of a second underlay tunnel, of the underlay network (for example, on a packet by packet basis). Tunnel 1 may utilize network 1, tunnel 2 utilizes network 2, and tunnel 3 utilizes network 3. While three tunnels and three networks are depicted here, there can be any number of tunnels and networks.


Each overlay network can use any one or more of the underlay tunnels. The bonding policy may dynamically determine which tunnel is selected as one or more primary tunnel and one or more secondary tunnels. This determination may also occur on a packet by packet basis. Further, a bonded tunnel can load balance its traffic over multiple underlay tunnels.


The underlay tunnels are qualified based on tunnel metrics, bonding policy, business intent, and/or quality of service desired. That is, a determination is made as to which underlay tunnel(s) are acceptable based on the metrics and quality of service desired. Thus, each overlay can use different underlay tunnels, based on network performance determined from measured metrics. In various embodiments, an overlay network can send data through multiple underlay tunnels at the same time, in a packet by packet manner, load balancing over each of the underlay tunnels. In other embodiments, multiple underlay tunnels may be used on a flow-by-flow basis (i.e., packets of a certain flow all travel over the same underlay tunnel). Further, sticky flows may be used such that every packet on a given flow gets transmitted across the same underlay tunnel until network conditions or loading trigger a reassignment.


In various embodiments, data packets can be transmitted across all, or any portion of, qualified underlay tunnels. From each underlay tunnel's endpoint, the traffic is sent to the appropriate network through a network service provider. In this way, the system allows for the selection of a network to be utilized for the data packets associated with a label and profile based on business intent and network performance, without controlling the routing through the physical network provider links of each individual network. Underlay tunnels may carry traffic for different overlay tunnels, i.e. traffic for voice overlay and traffic for data overlay.



FIG. 15B is an exemplary illustration of original packet and amended packets. Original packet 1502 may be a regular data packet received at an appliance for transmission. Packet 1502 may be received at either the LAN interface or the WAN interface of an appliance. Packet 1502 is composed of the data 1504 (sometimes referred to as payload), and a header 1506. As known to those of ordinary skill in the art, the data portion 1504 comprises information to be transferred from one location to another via one or more communication networks. The header portion 1506 comprises information such as network addresses of a sender and a recipient, and a protocol governing a format of the data portion 1504. Contents of the header portion 1506 may be specified by a protocol of the communication network(s) used for transmission. For example, transmission control protocol (TCP) may specify the header 1506 to include a source port, destination port, a sequence number, an acknowledgment number, and various flags.


In some embodiments, the received packet 1502 may optionally be transformed to generate transformed packet 1508, composed of transformed data 1510 and transformed header 1512. Transformation may include any manipulation of the packet, such as encryption/decryption, compression/decompression of payload and/or header, fragmentation/coalescing optimizations and/or error detection and correction provided by an appliance.


Within the appliance, the packet is then classified and delivered to an endpoint of a bonded tunnel, as discussed in FIG. 15A. A bonded tunnel packet 1514 is generated, comprising data 1516, header 1518 and bonded tunnel header 1520. Data 1516 may be the same or substantially similar to data 1504 or transformed data 1510. Header 1518 may be the same or substantially similar to header 1506 or transformed header 1512. Bonded tunnel header 1520 comprises bonded tunnel specific information, including but not limited to, an overlay ID for the associated overlay network, a time stamp and sequence number. Bonded tunnels are also sometimes referred to herein as overlay tunnels. While bonded tunnel header 1520 is shown in addition to header 1518 in FIG. 15B, bonded tunnel header 1520 may actually be an amendment or replacement of header 1518 in various embodiments.


Analysis of the information in the bonded tunnel header 1520 yields information regarding delay, order, and latency for the bonded tunnel, which is the tunnel created by the orchestrator 810 between two locations for the overlay network. Since data packets on a single bonded tunnel can travel over numerous paths to travel from one location to another (for example, from San Francisco to New York City), a bonded tunnel metric is essentially a single measurement reflecting the performance of all available paths between the two locations. Thus, the bonded tunnel metrics are application oriented, and represent the performance that an end application experiences, regardless of the specific provider links utilized by the underlay network.


Within the appliance, a data packet is then delivered to an endpoint of an underlay tunnel, as shown in FIG. 15A. An underlay tunnel packet 1522 is generated, comprising data 1524, header 1526, bonded tunnel header 1520, underlay tunnel header 1528, and optionally an IP header 1530. Data 1524 may be the same or substantially similar to data 1516 in the bonded tunnel packet 1514. Header 1526 may be the same or substantially similar to header 1518 in the bonded tunnel packet 1514. Bonded tunnel header 1520 is the same as in bonded tunnel packet 1514. Underlay tunnel header 1528 comprises underlay tunnel specific information, including but not limited to, a time stamp and sequence number. While underlay tunnel header 1528 is shown in addition to header 1526 and bonded tunnel header 1520 in FIG. 15B, underlay tunnel header 1528 may actually be an amendment or replacement of header 1526 and/or bonded tunnel header 1520 in various embodiments.


Analysis of the information in the underlay tunnel header 1528 yields information regarding loss, order, and latency for the underlay tunnel utilized by underlay tunnel packet 1522. Thus, the underlay tunnel metrics are network oriented, and represent the actual performance of a particular tunnel within a communication network.


By having both a bonded tunnel header 1520 with a timestamp and sequence number, and an underlay tunnel header 1528 with a time stamp and sequence number, two levels of performance metrics can be separately measured and evaluated—network specific metrics, and application performance metrics. That is, the performance experienced by an application can be measured, along with the performance of a particular communication network facilitating that application.


An IP header 1530 may also be a part of the underlay tunnel packet 1522. The IP header 1530 may contain standard information for the protocol, such as source IP and port and destination IP and port. Optionally a data packet may be encrypted, and an IPsec header can also be added to underlay tunnel packet 1522. While these headers are depicted as additional headers in FIG. 15B, they may actually be an amendment or replacement of header 1526 in various embodiments.



FIG. 16 depicts an exemplary method for an appliance, such as the appliance 250 of FIG. 2, to handle packet data. In step 1610 an incoming packet to be transmitted is received by an appliance, usually on the LAN side of the appliance. The incoming packet may be received directly from a computer, server, or from a router or switch, such as switch 230 of FIG. 2. In step 1620 the packet is classified in accordance with a traffic access policy. The traffic access policy could be based on the label of the network interface, or a more complex policy using a variety of packet inspection techniques. For example, the incoming traffic may already be mixed and the appliance would need to separate it out into traffic classifications (for example, voice, video, and data) using a combination of traffic statistics and packet content.


In step 1630, the overlay ID is determined from the classification. The peer destination appliance is also determined, usually based on information from the packet header, in step 1640. In an exemplary embodiment, the destination address is retrieved from the packet header and a routing table is used to determine the closest peer destination appliance. The peer destination appliance may be a short distance from the source appliance, or may be across the country or world. In step 1650 a bonded tunnel is selected for the specified overlay and destination appliance. For example, if a source appliance in San Francisco is transmitting voice traffic to New York City, then an appropriate bonded tunnel is selected for that source-destination pair for voice traffic.


In step 1660, a primary and/or one or more secondary underlay tunnels are selected for transmission of the data from the source to the destination. For example, an identification may first be made as to which underlay tunnels go from a source appliance in San Francisco to a destination appliance in New York City. Then, the primary and secondary tunnels may be selected from that list of tunnels based on the bonding policy set by the network administrator for the overlay network, and the underlay network metrics and classification as discussed in reference to FIG. 4.


In step 1670, the packet header may be amended to direct the received packet over the selected tunnels and to an endpoint of a communication network. Amending the packet header may include encapsulating the packet with a new header. The communication network can be a wired, wireless, or virtual network.


While the method has been described in these discrete steps, various steps may occur in a different order, or concurrently. Further, this method may be practiced for each incoming packet, or the classification can be cached so other packets on the same flow are processed in the same manner.


High Availability Bonding Policy



FIG. 9A depicts an exemplary embodiment of a system implementing a high availability bonding policy. In the exemplary embodiment, a branch location 110 has data to be transmitted across one or more communication networks to another entity, such as a data center, a second branch location, a central location 120, or another peer appliance. The data can utilize one or more communication networks as it travels from a source on one side of the network(s) to a destination on the other side of the network(s). While there can be multiple communication networks, they will be referred to herein as simply a singular ‘network’ for ease of reference.


There may be many types of network access links available to the appliance to transfer the data across the network, for example there may be an MPLS link, an Internet link, and a LTE link. The system may continually measure metrics across one or more of the links to determine the best access link to use for transferring data across the network, in view of the Quality of Service and business intent of an administrator. The metrics provide information regarding the transfer of data from each appliance to all other connected appliances in the network.


Furthermore, each access link may also have one or more tunnels for transferring data. The system may continually measure metrics across one or more of the tunnels to determine the tunnel(s) to use for transferring data across the network, in view of the Quality of Service and business intent of the data.


In an exemplary embodiment, the branch location may determine that the MPLS link has a latency of 50 milliseconds (ms) and a loss rate of 0.1%, while the Internet link has a latency of 100 ms and a loss rate of 0.3%. With these metrics, the system determines that the MPLS link represents the best access link to use since the path accessed via that access link has the better performance, and it is selected as the primary access link. The Internet link is selected as the secondary access link for data transfer. Data may travel over the primary link only, or over both the primary and secondary links.


In a high availability bonding policy scenario, an appliance may send data packets 920 across the primary access link, and an equal number of error correction packets 930 across the secondary access link. In the exemplary embodiment depicted in the figure, four data packets are shown as being transmitted across the primary access link and four error correction packets are depicted as being transmitted across the secondary access link. In this way, if any loss of data occurs in the network, as long as four total packets reach the recipient data center (either data packets or error correction packets or any combination thereof), the data can be reconstructed at the recipient and no total loss of data occurs. In this manner, the failover time is typically zero, since an equal number of error correction packets ensures that even if all data across the primary access link is lost, the information is still received by the recipient through reconstruction of the data from the error correction packets received over the secondary access link. Thus, no packets are dropped in the event of a failure, making the failover time effectively zero.


Further, in this high availability bonding policy, any number of a set of techniques, called path conditioning, can be applied to the data traveling over the tunnels. For example path conditioning may comprise error correction, order correction, fragmentation/coalescing, etc. Because the amount of error correcting information is approximately equal to the amount of data being sent, the bandwidth efficiency of a bonded tunnel while operating in this bonding policy is fifty percent. Different bonded tunnels can use different bonding policies at the same time. Error correction is described in further detail in U.S. Pat. No. 8,442,052 issued May 14, 2013 entitled “Forward Packet Recovery”, which is incorporated herein by reference.


While transmitting data, the system also continually monitors the network health metrics across the various access links, provider links and tunnels. In an exemplary embodiment, it may be determined that the latency of the MPLS access link has increased to 150 ms and the loss rate has increased to 0.5%. Meanwhile, the Internet access link metrics remain the same at 100 ms latency and 0.3% loss. Thus, the Internet link has now become the better access link for data transmission, and may automatically be re-designated as the primary access link while the MPLS link is re-designated as the secondary access link, as depicted in FIG. 9B. Therefore, data packets 920 are now transmitted from the branch location 110 over the Internet access link and error correction packets 930 are transmitted over the MPLS access link. In other embodiments, the error correction packets and data packets can be mixed together on both access links.


In this way, the system may continually monitor the network health metrics and transmit data over the best quality access link as a primary access link, regardless of whether that primary link is MPLS, Internet, or some other type of network, thus allowing for dynamic switching of access links for data transmission.


High Quality Bonding Policy



FIG. 10 depicts an exemplary embodiment of a system implementing a high quality bonding policy. In this exemplary embodiment, the system may operate substantially similar to the high availability scenario by continually monitoring the network health metrics and transmitting data over the best quality access link, allowing for dynamic switching of access links for data transmission. Data packets 1020 are transmitted over the primary access link and error correction packets 1030 are transmitted over the secondary access link.


Path conditioning may also be used, but with fewer error correction packets. For example, the system may implement a rule that a maximum 1:5 ratio be adhered to for error correction packets to data packets; that is, there is up to 1 error correction packet for every 5 data packets transmitted. The number of error correction packets 1030 generated and transmitted can be based on the amount of loss measured on that particular access link. In some embodiments, no error correction packets are transmitted across the secondary access link. For example, if no loss is observed for a set period of time, then no error correction packets may be sent until loss is observed again. If a maximum ratio of 1:5 error correction packets to data packets is used, then the bandwidth efficiency of the network is >80%. However, other ratios of error correction packets to data packets may also be used in other embodiments.


If the primary access link becomes inoperable for any reason and data switches over to the secondary access link, some packets will be lost. Since the amount of error correction information is less than the amount of data, there can be some loss of data while transmission switches from the primary access link to the secondary access link. Typically, the transmission can switch from the primary access link to the secondary access link in less than 1 second, minimizing the amount of data loss. In contrast, failover times for existing networks are typically measured in minutes.


In this way, the system may continually monitor the network health metrics and transmit data over the best quality access link as a primary link, with a minimal amount of data packet loss in the event the primary access link fails and traffic is switched to the secondary access link.


High Throughput Bonding Policy



FIG. 11 depicts an exemplary embodiment of an appliance implementing a high throughput bonding policy for transmitting data. In this exemplary embodiment, the appliance at branch location 110 receives data packets 1120 and transmits them over two communication networks in a load balanced manner, rather than selecting a primary access link and a secondary access link. For example, if both the MPLS and Internet access links are to be used for data transmission, the appliance may transmit the first packet of data packets 1120 over the MPLS access link, the second packet over the Internet access link, and continue alternating packets over the access links. While the exemplary embodiment depicted in the figure shows two access links being used, three or more access links may also be used to transmit data in other embodiments.


In addition to the traditional approaches for load balancing (such as round robin or other methods), the appliance can also transmit data over access links such that a similar amount of free space is maintained on each access link. For example, in the exemplary embodiment depicted in FIG. 12A, the MPLS access link has more free space available, as represented by reference number 1220, than the amount of free space available on the Internet link, as represented by reference number 1260. Since the MPLS link free space 1220 is greater than the Internet link free space 1260, a first data transmission may occur over the MPLS link, as represented by reference number 1210.


In the exemplary embodiment depicted in FIG. 12B, a second data transmission 1230 also occurs over the MPLS link because it still has more free space available than the Internet link. As data continues to be transmitted in this manner, eventually data will be transmitted over both the MPLS and Internet links, such that an equal amount of free space on each link can be maintained, as depicted in FIG. 12C by MPLS link free space 1220 and Internet link free space 1260.


As each packet is transmitted, a decision is made, on a packet by packet basis, as to which link to use, based on the amount of space available on each link. As understood by persons of ordinary skill in the art, there can be multiple ways of accomplishing this type of load balancing, where, a decision is made when each packet is transmitted, taking into account the space available. FIGS. 12A-12C merely depict one exemplary embodiment. Other embodiments, for example, may include tracking the amount of data recently scheduled on each of the links, or tracking the time when each link is ready to accept another packet.


As discussed herein, the high availability, high quality and high throughput bonding policies are only three examples of bonding policies. Other bonding policies can be used within the construct of the present disclosure. For example, error correction can be performed on the underlay tunnels instead of, or in addition to, on the overlay tunnels. Also, data packets and error correction packets can be sent over the same path.


Cross-Connect



FIG. 13 depicts an exemplary embodiment of a system using multiple access link providers in a cross-connected manner. Any bonding policy, including those discussed herein and not specifically mentioned here, can be implemented with access link providers cross-connected.


Typically, in transferring data over a network, the data is transmitted or delivered via the same type of link it arrives on, i.e., if data arrives on a MPLS link at an appliance, it is transmitted by the appliance to a further destination via the MPLS link. If the MPLS and Internet links are both inoperable, then the LTE link may be used. However, transferring data across an LTE network can be expensive, as this is a wireless network and the LTE network provider typically charges for each byte of data transmitted over the network. Furthermore, for large organizations having many locations and appliances, use of an IPsec tunnel across an LTE link means LTE data is used at both the source location and all of the destination locations that receive the data.


To address this issue, network providers can be cross-connected by tunnels that traverse access links, as depicted in the exemplary embodiment of FIG. 13. For example, a tunnel can be created for data transfer from a MPLS access link at a source site (such as branch location 110) to an Internet access link at a destination site (such as central location 120), or from a MPLS access link at a source site (such as branch location 110) to a LTE access link at a destination site (such as central location 120). In this way, data can be transmitted across tunnels in the most efficient and cost-effective manner, utilizing different access links at appliances at source and destination sites.


Network health metrics may be continuously measured over all of these tunnels such that the best tunnel for the overlay network can be selected for each type of traffic based on the business intent and network transmission objectives. Further, network metrics can be measured in each direction, instead of only by round trip time. Thus, data traveling from San Francisco to New York City may utilize one underlay tunnel, based on network performance metrics while data traveling from New York City to San Francisco may utilize a different underlay tunnel. The decision regarding which underlay tunnel(s) to use can be made independently at each appliance.



FIG. 14A depicts an exemplary network with two appliances 250a and 250b connected to each other via two communication networks: MPLS network 1410 and LTE network 1420. While two appliances are depicted in this exemplary embodiment, there may be any number of appliances connected to each other, in any configuration. Further, while a MPLS network and LTE network are depicted in this exemplary embodiment, there can be different or additional networks available to the networked appliances 250a and 250b.


In the exemplary embodiment of FIG. 14A, appliances 250a and 250b are connected to the MPLS network 1410 via MPLS access links 1430a and 1430b. Similarly, appliances 250a and 250b are connected to the LTE network 1420 via LTE access links 1440a and 1440b. In an active backup scenario, each data packet normally utilizes only one network, as represented by MPLS path 1450 for the MPLS network 1410 and LTE path 1460 for the LTE network 1420.


If a network access link goes down at one appliance, then a backup network access link may be used. For example, in an exemplary embodiment depicted in FIG. 14B, MPLS access link 1430a goes down at appliance 250a. Thus, at appliance 250a, the only operational network access link is LTE access link 1440a, and thus the LTE network 1420 is the only communication network through which appliance 250a can send or receive data. However, LTE network 1420 is a wireless LTE network, and is costly to use as the LTE service provider typically charges for every megabyte of data sent over the network. In conventional systems, since appliance 250a can only send data via the LTE access link, all other connected appliances will receive the data via the LTE network. That is, other appliances also must use the LTE network to receive the data from appliance 250a.


However, the other appliances at other sites, such as appliance 250b in FIG. 14B have operational MPLS links and thus incur charges unnecessarily by receiving data through the LTE access link. In this scenario, service providers may be cross-connected, as depicted in FIG. 14B. By using tunnels that cross-connect different service providers, data sent from the LTE access link from appliance 250a can utilize part of the LTE network 1420, and then switch over to the MPLS network 1410 while in transit, thus arriving at appliance 250b via the MPLS access link 1430b. This is represented by path 1480 in FIG. 14B.


Similarly, if MPLS access link 1430b goes down at appliance 250b but MPLS access link 1430a is operational at appliance 250a, then data transmitted by appliance 250a via MPLS access link 1430a can utilize part of the MPLS network 1410, then switch over to the LTE network 1420 in transit, arriving at appliance 250b via LTE access link 1440b, as shown by path 1470 in FIG. 14B. Thus, as long as at least one network access link is operational at an appliance, the appliance can send and receive data. Furthermore, if one appliance needs to use the wireless LTE network 1420 to send or receive data, all other appliances in the network do not automatically have to use wireless LTE to communicate with that appliance, thus preventing unnecessary charges from being incurred due to wireless LTE usage.


As a person of ordinary skill in the art would understand, even though the exemplary embodiment of FIG. 14B depicts MPLS and LTE networks, any two or more network service providers can be cross-connected in this manner such that data transmitted from an appliance via one network's access link can be received at another appliance via an access link to the same or different network. Data transmitted from appliance 250a can simply be sent from the LTE interface at appliance 250a but directed to the MPLS interface at appliance 250b. In this way, the data travels partly over one provider's network and then switches to another provider's network to reach the destination IP address.


IV. Visualization of Network Characteristics


Related U.S. patent application Ser. No. 14/981,814 filed Dec. 28, 2015 and entitled “Dynamic Monitoring and Visualization for Network Health Characteristics”, of which the present application is a continuation-in-part, describes a visualization mechanism for displaying and categorizing network health characteristics. Such visualization dashboards and mechanisms can also be used for displaying and categorizing the network health characteristics described herein, to aid a user in determining which path, tunnel, link or mechanism to use for transferring each particular type of data based on the business intent of the user.


Using the visualization system, tunnel metrics can be measured, monitored, and displayed for the underlay tunnels, which are essentially measuring network performance. Further, tunnels metrics can be measured, monitored, and displayed for the overlay tunnels (or bonded tunnels), which are application-oriented metrics that a user can observe.


A bad network may be used to transmit data, but the user may still see good performance because of bonding. For example, use of the visualization system may show that a particular underlay tunnel is losing a lot of data, and thus it is characterized as a bad tunnel and displayed as “red” in the visualization chart. However, if a user has selected a high availability bonding policy and the error correction packets from the secondary link are enabling all of the data to reach the destination, then from the user's perspective, the transmission is operating as it should. Thus, even though the user of the network service may not realize that there is any problem with the network, the network provider can still detect that a problem exists with a network link. In this way, the visualization platform can be used to discern problems that exist in a network, even though a user may not notice any disruption in the transmission and receipt of data across the network. Further, the metrics can present performance/troubleshooting data from both a user or application point of view, and a network point of view.


Thus, methods and systems for virtual overlay networks are disclosed. Although embodiments have been described with reference to specific examples, 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 system for creating an overlay network for a wide area network, comprising: a plurality of network appliances, each connected to at least two communication networks that are Wide Area Networks (WAN), wherein each of the plurality of network appliances has a plurality of network interfaces for transmitting and receiving data over the communication networks; andan orchestrator device in communication with each of the plurality of network appliances, wherein the orchestrator device: processes information regarding configuration of each network interface at each of the plurality of network appliances;assigns a first label to data traffic from a first network interface of a first network appliance;creates a first underlay tunnel from the first network interface of the first network appliance, for the data traffic with the first label;assigns a second label to data traffic from a second network interface of the first network appliance;creates a second underlay tunnel from the second network interface of the first network appliance, for the data traffic with the second label; andcreates a bonded tunnel for a subset of data transmitted between the first network appliance and a second network appliance, wherein the bonded tunnel is configured to utilize both the first underlay tunnel and the second underlay tunnel for the subset of data transmitted.
  • 2. The system of claim 1, wherein the bonded tunnel carries the subset of data transmitted between the first network appliance and the second network appliance, the subset of data having the same label.
  • 3. The system of claim 2, wherein the subset of data transmitted is selected based on the interface label or an access policy.
  • 4. The system of claim 1, wherein each of the plurality of network appliances includes at least one LAN interface and at least one WAN interface as part of the plurality of network interfaces.
  • 5. The system of claim 1, wherein the first label is associated with a traffic type.
  • 6. The system of claim 1, wherein the first label is associated with a network type or network provider.
  • 7. The system of claim 1, wherein the orchestrator device further receives information regarding a priority of data type for the data transmitted between the first network appliance and the second network appliance, and configures each network appliance in accordance with the priority.
  • 8. The system of claim 1, further comprising a database for maintaining information regarding a traffic access policy for the plurality of network appliances.
  • 9. The system of claim 1, wherein at least one of the plurality of network appliances is located in a cloud network.
  • 10. The system of claim 1, wherein each of the plurality of network appliances is connected to at least one other network appliance via at least one tunnel.
  • 11. The system of claim 1, wherein the first label distinguishes at least one of voice traffic, video traffic, and data traffic.
  • 12. The system of claim 1, wherein the at least two communication networks connected to the each of the plurality of network appliances comprise at least two of: Internet infrastructure, MPLS infrastructure, and LTE wireless connection infrastructure.
  • 13. The system of claim 1, wherein the orchestrator device further comprises information regarding network performance metrics of bonded tunnels between each pair of network appliances, the network performance metrics representing application-oriented performance.
  • 14. The system of claim 1, wherein the orchestrator device further comprises information regarding network performance metrics of underlay tunnels, the network performance metrics representing network-oriented performance.
  • 15. The system of claim 14, wherein the orchestrator device displays information regarding network performance metrics for each underlay tunnel to a network administrator via a grid graphical user interface.
  • 16. The system of claim 1, wherein the orchestrator device further selects one or more underlay tunnels to transfer network data, the one or more underlay tunnels selected based at least in part on network performance metrics.
  • 17. The system of claim 16, wherein the network performance metrics comprise at least one of re-ordering, loss, latency, and jitter.
  • 18. The system of claim 1, wherein at least one of the first underlay tunnel and the second underlay tunnel is an IPsec tunnel.
  • 19. The system of claim 1, wherein information regarding configuration of each network interface further comprises information regarding a type of data traffic received at each network interface.
  • 20. The system of claim 1, wherein information regarding configuration of each network interface further comprises information regarding a network access link connected to each network interface, the network access link providing access for the network appliance to a particular communication network.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of, and claims the priority benefit of, U.S. patent application Ser. No. 15/091,533 filed on Apr. 5, 2016 and entitled “Virtual Network Overlay”, now U.S. Pat. No. 9,717,021 issued on Jul. 25, 2017, which in turn is a continuation-in-part of, and claims the priority benefit of, U.S. patent application Ser. No. 14/981,814 filed on Dec. 28, 2015 and entitled “Dynamic Monitoring and Visualization for Network Health Characteristics” now U.S. Pat. No. 10,164,861 issued on Dec. 25, 2018. U.S. patent application Ser. No. 15/091,533 filed on Apr. 5, 2016 and entitled “Virtual Network Overlay” is also a continuation-in-part of, and claims the priority benefit of, U.S. patent application Ser. No. 14/677,841 filed on Apr. 2, 2015 entitled “Quality of Service Using Multiple Flows”, now U.S. Pat. No. 9,397,951 issued on Jul. 19, 2016, which in turn is a continuation of U.S. patent application Ser. No. 14/248,188 filed on Apr. 8, 2014, now U.S. Pat. No. 9,143,455 issued on Sep. 22, 2015, which in turn is a continuation of U.S. patent application Ser. No. 12/217,440 filed on Jul. 3, 2008, now U.S. Pat. No. 8,743,683 issued on Jun. 3, 2014.

US Referenced Citations (514)
Number Name Date Kind
4494108 Langdon, Jr. 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 Williams et al. Mar 1999 A
5903230 Masenas May 1999 A
5955976 Heath Sep 1999 A
6000053 Levine et al. Dec 1999 A
6003087 Housel, III 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 Viswanath 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
6842424 Key Jan 2005 B1
6856651 Singh Feb 2005 B2
6859842 Nakamichi et al. Feb 2005 B1
6862602 Guha Mar 2005 B2
6910106 Sechrest 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 Thiyagaranjan et al. Mar 2006 B2
7035214 Seddigh et al. Apr 2006 B1
7047281 Kausik May 2006 B1
7069268 Bums 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 Bokkelen et al. Jul 2007 B1
7243094 Tabellion 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
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 Duffle, III 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
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
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
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
8069225 McCanne et al. Nov 2011 B2
8072985 Golan et al. Dec 2011 B2
8090027 Schneider Jan 2012 B2
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
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 Vincent 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
10164861 Hughes et al. Dec 2018 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 Viswanath 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
20030067940 Edholm Apr 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
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 Ran 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, Jr. et al. Mar 2005 A1
20050055399 Savchuk 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 Sechrest 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
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
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 den Berg 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
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 La Cruz et al. Jun 2007 A1
20070174428 Lev Ran 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
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
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 Jardetzky et al. Oct 2008 A1
20080267217 Colville et al. Oct 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 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 Vijayaraghavan 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
20110002346 Wu Jan 2011 A1
20110022812 van der Linden et al. Jan 2011 A1
20110113472 Fung et al. May 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
20120005549 Ichiki et al. Jan 2012 A1
20120036325 Mashtizadeh et al. Feb 2012 A1
20120069131 Abelow Mar 2012 A1
20120147894 Mulligan Jun 2012 A1
20120173759 Agarwal et al. Jul 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 Fuentes et al. Apr 2013 A1
20130086236 Baucke et al. 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
20130282970 Hughes et al. Oct 2013 A1
20130325986 Brady et al. Dec 2013 A1
20130343191 Kim et al. Dec 2013 A1
20140052864 Van Der Linden 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 Scouamec et al. Apr 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
20160218947 Hughes et al. Jul 2016 A1
20160255000 Gattani et al. Sep 2016 A1
20160380886 Blair Dec 2016 A1
20170026467 Barsness et al. Jan 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 Hefei et al. Mar 2019 A1
Foreign Referenced Citations (3)
Number Date Country
1507353 Feb 2005 EP
H05061964 Feb 2005 JP
WO0135226 May 2001 WO
Non-Patent Literature Citations (235)
Entry
Request for Trial Granted, Jan. 2, 2014, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Notice of Allowance, dated Oct. 23, 2012, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Decision on Appeal, Sep. 17, 2012, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Examiner's Answer to Appeal Brief, Oct. 27, 2009, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Final Office Action, dated Jan. 12, 2009, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Non-Final Office Action, dated Jul. 17, 2008, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Final Office Action, dated Feb. 22, 2008, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Non-Final Office Action, dated Aug. 24, 2007, U.S. Appl. No. 11/202,697, filed Aug. 12, 2005.
Request for Trial Granted, dated Jan. 2, 2014, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Notice of Allowance, dated Aug. 30, 2012, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Decision on Appeal, dated Jun. 28, 2012, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Examiner's Answer to Appeal Brief, dated Oct. 27, 2009, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Final Office Action, dated Jan. 5, 2009, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Non-Final Office Action, dated Jul. 10, 2008, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Final Office Action, dated Jan. 22, 2008, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Non-Final Office Action, dated Aug. 24, 2007, U.S. Appl. No. 11/240,110, filed Sep. 29, 2005.
Notice of Allowance, dated Apr. 28, 2009, U.S. Appl. No. 11/357,657, filed Feb. 16, 2006.
Non-Final Office Action, dated Sep. 17, 2008, U.S. Appl. No. 11/357,657, filed Feb. 16, 2006.
Notice of Allowance, dated Sep. 8, 2009, U.S. Appl. No. 11/263,755, filed Oct. 31, 2005.
Final Office Action, dated May 11, 2009, U.S. Appl. No. 11/263,755, filed Oct. 31, 2005.
Non-Final Office Action, dated Nov. 17, 2008, U.S. Appl. No. 11/263,755, filed Oct. 31, 2005.
Non-Final Office Action, dated Jul. 18, 2011, U.S. Appl. No. 11/285,816, filed Nov. 22, 2005.
Final Office Action, dated Mar. 30, 2011, U.S. Appl. No. 11/285,816, filed Nov. 22, 2005.
Non-Final Office Action, dated Oct. 13, 2010, U.S. Appl. No. 11/285,816, filed Nov. 22, 2005.
Non-Final Office Action, dated Mar. 22, 2010, U.S. Appl. No. 11/285,816, filed Nov. 22, 2005.
Non-Final Office Action, dated Oct. 20, 2009, U.S. Appl. No. 11/285,816, filed Nov. 22, 2005.
Non-Final Office Action, dated Mar. 24, 2009, U.S. Appl. No. 11/285,816, filed Nov. 22, 2005.
Non-Final Office Action, dated Sep. 26, 2008, U.S. Appl. No. 11/285,816, filed Nov. 22, 2005.
Notice of Allowance, dated Feb. 14, 2014, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Non-Final Office Action, dated Jul. 10, 2013, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Final Office Action, dated Feb. 4, 2013, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Non-Final Office Action, dated Sep. 13, 2012, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Final Office Action, dated Mar. 16, 2012, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Non-Final Office Action, dated Dec. 20, 2011, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Final Office Action, dated Aug. 12, 2011, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Non-Final Office Action, dated Dec. 6, 2010, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Advisory Action, dated Oct. 2, 2009, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Final Office Action, dated Aug. 7, 2009, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Non-Final Office Action, dated Jan. 22, 2009, U.S. Appl. No. 11/498,473, filed Aug. 2, 2006.
Notice of Allowance, dated Jun. 10, 2014, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Final Office Action, dated Mar. 25, 2014, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Non-Final Office Action, dated Oct. 9, 2013, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Advisory Action, dated Jul. 16, 2013, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Final Office Action, dated Apr. 15, 2013, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Non-Final Office Action, dated Sep. 25, 2012, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Advisory Action, dated Nov. 25, 2011, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Final Office Action, dated Aug. 17, 2011, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Non-Final Office Action, dated Jan. 4, 2011, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Final Office Action, dated Jul. 13, 2010, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Non-Final Office Action, dated Feb. 2, 2010, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Final Office Action, dated Sep. 1, 2009, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Non-Final Office Action, dated Jan. 26, 2009, U.S. Appl. No. 11/498,491, filed Aug. 2, 2006.
Notice of Allowance, dated Aug. 31, 2009, U.S. Appl. No. 11/724,800, filed Mar. 15, 2007.
Request for Trial Granted, Jun. 11, 2014, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Notice of Allowance, dated Dec. 26, 2012, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Decision on Appeal, Nov. 14, 2012, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Examiner's Answer to Appeal Brief, Oct. 14, 2009, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Final Office Action, dated Dec. 31, 2008, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Non-Final Office Action, dated Jul. 8, 2008, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Final Office Action, dated Jan. 9, 2008, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Non-Final Office Action, dated Aug. 24, 2007, U.S. Appl. No. 11/497,026, filed Jul. 31, 2006.
Notice of Allowance, dated Dec. 3, 2009, U.S. Appl. No. 11/796,239, filed Apr. 27, 2007.
Non-Final Office Action, dated Jun. 22, 2009, U.S. Appl. No. 11/796,239, filed Apr. 27, 2007.
Notice of Allowance, dated Jan. 16, 2014, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Non-Final Office Action, dated Aug. 14, 2013, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Advisory Action, dated Jan. 29, 2013, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Final Office Action, dated Nov. 20, 2012, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Non-Final Office Action, dated Jul. 18, 2012, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Advisory Action, dated Jul. 2, 2012, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Final Office Action, dated Apr. 18, 2012, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Non-Final Office Action, dated Sep. 22, 2011, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Final Office Action, dated Feb. 3, 2011, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Non-Final Office Action, dated Oct. 7, 2010, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Final Office Action, dated May 14, 2010, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Non-Final Office Action, dated Jan. 6, 2010, U.S. Appl. No. 12/217,440, filed Jul. 3, 2008.
Notice of Allowance, dated Feb. 29, 2012, U.S. Appl. No. 11/825,440, filed Jul. 5, 2007.
Non-Final Office Action, dated Dec. 30, 2011, U.S. Appl. No. 11/825,440, filed Jul. 5, 2007.
Final Office Action, dated Sep. 30, 2011, U.S. Appl. No. 11/825,440, filed Jul. 5, 2007.
Non-Final Office Action, dated May 13, 2011, U.S. Appl. No. 11/825,440, filed Jul. 5, 2007.
Final Office Action, dated Oct. 12, 2010, U.S. Appl. No. 11/825,440, filed Jul. 5, 2007.
Non-Final Office Action, dated May 24, 2010, U.S. Appl. No. 11/825,440, filed Jul. 5, 2007.
Notice of Allowance, dated Nov. 12, 2011, U.S. Appl. No. 11/825,497, filed Jul. 5, 2007.
Notice of Allowance, dated Apr. 21, 2011, U.S. Appl. No. 11/825,497, filed Jul. 5, 2007.
Final Office Action, dated Nov. 4, 2010, U.S. Appl. No. 11/825,497, filed Jul. 5, 2007.
Non-Final Office Action, dated Jun. 18, 2010, U.S. Appl. No. 11/825,497, filed Jul. 5, 2007.
Non-Final Office Action, dated Dec. 9, 2009, U.S. Appl. No. 11/825,497, filed Jul. 5, 2007.
Notice of Allowance, dated Feb. 11, 2011, U.S. Appl. No. 11/903,416, filed Sep. 20, 2007.
Final Office Action, dated May 5, 2010, U.S. Appl. No. 11/903,416, filed Sep. 20, 2007.
Non-Final Office Action, dated Jan. 26, 2010, U.S. Appl. No. 11/903,416, filed Sep. 20, 2007.
Notice of Allowance, dated May 14, 2013, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Non-Final Office Action, dated Nov. 6, 2012, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Final Office Action, dated Apr. 23, 2012, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Non-Final Office Action, dated Dec. 1, 2011, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Final Office Action, dated Oct. 13, 2011, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Advisory Action, dated May 23, 2011, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Final Office Action, dated Nov. 9, 2010, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Final Office Action, dated Jul. 22, 2010, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Non-Final Office Action, dated Feb. 3, 2010, U.S. Appl. No. 11/998,726, filed Nov. 30, 2007.
Notice of Allowance, dated Mar. 21, 2013, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Final Office Action, dated Feb. 1, 2013, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Non-Final Office Action, dated Aug. 28, 2012, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Final Office Action, dated Feb. 10, 2012, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Non-Final Office Action, dated Jul. 7, 2011, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Final Office Action, dated Dec. 8, 2010, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Non-Final Office Action, dated Jul. 21, 2010, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Non-Final Office Action, dated Feb. 4, 2010, U.S. Appl. No. 12/070,796, filed Feb. 20, 2008.
Notice of Allowance, dated Mar. 16, 2012, U.S. Appl. No. 12/151,839, filed May 8, 2008.
Final Office Action, dated Oct. 12, 2011, U.S. Appl. No. 12/151,839, filed May 8, 2008.
Non-Final Office Action, dated Feb. 3, 2011, U.S. Appl. No. 12/151,839, filed May 8, 2008.
Final Office Action, dated Sep. 23, 2010, U.S. Appl. No. 12/151,839, filed May 8, 2008.
Non-Final Office Action, dated Jun. 14, 2010, U.S. Appl. No. 12/151,839, filed May 8, 2008.
Notice of Allowance, dated Apr. 14, 2014, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Final Office Action, dated Jan. 14, 2014, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Non-Final Office Action, dated Jul. 1, 2013, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Advisory Action, dated Aug. 20, 2012, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Final Office Action, dated May 25, 2012, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Non-Final Office Action, dated Oct. 4, 2011, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Non-Final Office Action, dated Mar. 8, 2011, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Non-Final Office Action, dated Aug. 12, 2010, U.S. Appl. No. 12/313,618, filed Nov. 20, 2008.
Notice of Allowance, dated Jan. 20, 2011, U.S. Appl. No. 12/622,324, filed Nov. 19, 2009.
Notice of Allowance, dated Dec. 9, 2010, U.S. Appl. No. 12/622,324, filed Nov. 19, 2009.
Non-Final Office Action, dated Jun. 17, 2010, U.S. Appl. No. 12/622,324, filed Nov. 19, 2009.
Notice of Allowance, dated Mar. 26, 2012, U.S. Appl. No. 13/112,936, filed May 20, 2011.
Final Office Action, dated Feb. 22, 2012, U.S. Appl. No. 13/112,936, filed May 20, 2011.
Non-Final Office Action, dated Sep. 27, 2011, U.S. Appl. No. 13/112,936, filed May 20, 2011.
Advisory Action, dated Dec. 3, 2013, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Final Office Action, dated Sep. 26, 2013, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Non-Final Office Action, dated May 20, 2013, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Non-Final Office Action, dated Jun. 13, 2014, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Final Office Action, dated Dec. 18, 2014, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Advisory Action, dated Mar. 5, 2015, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Non-Final Office Action, dated Jun. 2, 2015, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Final Office Action, dated Jan. 11, 2016, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Final Office Action, dated Apr. 1, 2014, U.S. Appl. No. 13/274,162, filed Oct. 14, 2011.
Non-Final Office Action, dated Oct. 22, 2013, U.S. Appl. No. 13/274,162, filed Oct. 14, 2011.
Advisory Action, dated Jun. 27, 2014, U.S. Appl. No. 13/274,162, filed Oct. 14, 2011.
Non-Final Office Action, dated Jul. 30, 2014, U.S. Appl. No. 13/274,162, filed Oct. 14, 2011.
Final Office Action, dated Jan. 12, 2015, U.S. Appl. No. 13/274,162, filed Oct. 14, 2011.
Advisory Action, dated Mar. 25, 2015, U.S. Appl. No. 13/274,162, filed Oct. 14, 2011.
Notice of Allowance, dated May 21, 2015, U.S. Appl. No. 13/274,162, filed Oct. 14, 2011.
Notice of Allowance, dated Jan. 2, 2014, U.S. Appl. No. 13/427,422, filed Mar. 22, 2012.
Advisory Action, dated Sep. 27, 2013, U.S. Appl. No. 13/274,162, filed Mar. 22, 2012.
Final Office Action, dated Jul. 17, 2013, U.S. Appl. No. 13/427,422, filed Mar. 22, 2012.
Non-Final Office Action, dated Apr. 2, 2013, U.S. Appl. No. 13/427,422, filed Mar. 22, 2012.
Advisory Action, dated Jan. 24, 2013, U.S. Appl. No. 13/427,422, filed Mar. 22, 2012.
Final Office Action, dated Nov. 2, 2012, U.S. Appl. No. 13/427,422, filed Mar. 22, 2012.
Non-Final Office Action, dated Jul. 5, 2012, U.S. Appl. No. 13/427,422, filed Mar. 22, 2012.
Notice of Allowance, dated Feb. 19, 2013, U.S. Appl. No. 13/482,321, filed May 29, 2012.
Non-Final Office Action, dated Jan. 3, 2013, U.S. Appl. No. 13/482,321, filed May 29, 2012.
Notice of Allowance, dated Sep. 26, 2013, U.S. Appl. No. 13/517,575, filed Jun. 13, 2012.
Advisory Action, dated Apr. 4, 2013, U.S. Appl. No. 13/517,575, filed Jun. 13, 2012.
Final Office Action, dated Jan. 11, 2013, U.S. Appl. No. 13/517,575, filed Jun. 13, 2012.
Non-Final Office Action, dated Sep. 20, 2012, U.S. Appl. No. 13/517,575, filed Jun. 13, 2012.
Notice of Allowance, dated Sep. 12, 2014, U.S. Appl. No. 13/657,733, filed Oct. 22, 2012.
Supplemental Notice of Allowability, dated Oct. 9, 2014, U.S. Appl. No. 13/657,733, filed Oct. 22, 2012.
Notice of Allowance, dated Jan. 3, 2014, U.S. Appl. No. 13/757,548, filed Feb. 1, 2013.
Non-Final Office Action, dated Sep. 10, 2013, U.S. Appl. No. 13/757,548, filed Feb. 1, 2013.
Notice of Allowance, dated Nov. 25, 2013, U.S. Appl. No. 13/917,517, filed Jun. 13, 2013.
Non-Final Office Action, dated Aug. 14, 2013, U.S. Appl. No. 13/917,517, filed Jun. 13, 2013.
Non-Final Office Action, dated Jun. 6, 2014, U.S. Appl. No. 14/190,940, filed Feb. 26, 2014.
Non-Final Office Action, dated Oct. 1, 2014, U.S. Appl. No. 14/190,940, filed Feb. 26, 2014.
Notice of Allowance, dated Mar. 16, 2015, U.S. Appl. No. 14/190,940, filed Feb. 26, 2014.
Notice of Allowance, dated Sep. 5, 2014, U.S. Appl. No. 14/248,229, filed Apr. 8, 2014.
Non-Final Office Action, dated Jun. 8, 2015, U.S. Appl. No. 14/248,167, filed Apr. 8, 2014.
Non-Final Office Action, dated Jul. 11, 2014, U.S. Appl. No. 14/248,188, filed Apr. 8, 2014.
Notice of Allowance, dated Jan. 23, 2015, U.S. Appl. No. 14/248,188, filed Apr. 8, 2014.
Corrected Notice of Allowability, dated Aug. 5, 2015, U.S. Appl. No. 14/248,188, filed Apr. 8, 2014.
Notice of Allowance, dated Oct. 6, 2014, U.S. Appl. No. 14/270,101, filed May 5, 2014.
Non-Final Office Action, dated Nov. 26, 2014, U.S. Appl. No. 14/333,486, filed Jul. 16, 2014.
Notice of Allowance, dated Dec. 22, 2014, U.S. Appl. No. 14/333,486, filed Jul. 16, 2014.
Non-Final Office Action, dated Dec. 31, 2014, U.S. Appl. No. 13/621,534, filed Sep. 17, 2012.
Non-Final Office Action, dated Jan. 23, 2015, U.S. Appl. No. 14/548,195, filed Nov. 19, 2014.
Notice of Allowance, dated Jun. 3, 2015, U.S. Appl. No. 14/548,195, filed Nov. 19, 2014.
Non-Final Office Action, dated Mar. 11, 2015, U.S. Appl. No. 14/549,425, filed Nov. 20, 2014.
Notice of Allowance, dated Jul. 27, 2015, U.S. Appl. No. 14/549,425, filed Nov. 20, 2014.
Non-Final Office Action, dated May 6, 2015, U.S. Appl. No. 14/477,804, filed Sep. 4, 2014.
Final Office Action, dated Sep. 18, 2015, U.S. Appl. No. 14/477,804, filed Sep. 4, 2014.
Non-Final Office Action, dated May 18, 2015, U.S. Appl. No. 14/679,965, filed Apr. 6, 2015.
Final Office Action, dated Dec. 21, 2015, U.S. Appl. No. 14/679,965, filed Apr. 6, 2015.
Final Office Action, dated Jul. 14, 2015, U.S. Appl. No. 13/482,321, filed May 29, 2012.
Non-Final Office Action, dated Jul. 15, 2015, U.S. Appl. No. 14/734,949, filed Jun. 9, 2015.
Non-Final Office Action, dated Aug. 11, 2015, U.S. Appl. No. 14/677,841, filed Apr. 2, 2015.
Non-Final Office Action, dated Aug. 18, 2015, U.S. Appl. No. 14/543,781, filed Nov. 17, 2014.
Notice of Allowance, dated Oct. 5, 2015, U.S. Appl. No. 14/734,949, filed Jun. 9, 2015.
Advisory Action, dated Nov. 25, 2015, U.S. Appl. No. 13/482,321, filed May 29, 2012.
Non-Final Office Action, dated Dec. 15, 2015, U.S. Appl. No. 14/479,131, filed Sep. 5, 2014.
Non-Final Office Action, dated Dec. 16, 2015, U.S. Appl. No. 14/859,179, filed Sep. 18, 2015.
Non-Final Office Action, dated Jan. 12, 2016, U.S. Appl. No. 14/477,804, filed Sep. 4, 2014.
Notice of Allowance, dated Feb. 8, 2016, U.S. Appl. No. 14/543,781, filed Nov. 17, 2014.
Corrected Notice of Allowability, dated Mar. 7, 2016, U.S. Appl. No. 14/543,781, filed Nov. 17, 2014.
Notice of Allowance, dated Feb. 16, 2016, U.S. Appl. No. 14/248,167, filed Apr. 8, 2014.
Notice of Allowance, dated Mar. 2, 2016, U.S. Appl. No. 14/677,841, filed Apr. 2, 2015.
Corrected Notice of Allowability, dated Mar. 14, 2016, U.S. Appl. No. 14/677,841, filed Apr. 2, 2015.
Advisory Action, dated Mar. 21, 2016, U.S. Appl. No. 14/679,965, filed Apr. 6, 2015.
Non-Final Office Action, dated May 3, 2016, U.S. Appl. No. 14/679,965, filed Apr. 6, 2015.
Non-Final Office Action, dated May 6, 2016, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Notice of Allowance, dated Jun. 3, 2016, U.S. Appl. No. 14/859,179, filed Sep. 18, 2015.
Non-Final Office Action, dated Jun. 15, 2016, U.S. Appl. No. 15/091,533, filed Apr. 5, 2016.
Non-Final Office Action, dated Jun. 22, 2016, U.S. Appl. No. 14/447,505, filed Jul. 30, 2014.
Final Office Action, dated Jul. 19, 2016, U.S. Appl. No. 14/479,131, filed Sep. 5, 2014.
Non-Final Office Action, dated Jul. 25, 2016, U.S. Appl. No. 14/067,619, filed Oct. 30, 2013.
Final Office Action, dated Jul. 26, 2016, U.S. Appl. No. 14/477,804, filed Sep. 4, 2014.
Notice of Allowance, dated Mar. 22, 2017, U.S. Appl. No. 13/621,534, filed Sep. 17, 2012.
Notice of Allowance, dated Mar. 23, 2017, U.S. Appl. No. 15/091,533, filed Apr. 5, 2016.
Non-Final Office Action, dated Apr. 27, 2017, U.S. Appl. No. 14/447,505, filed Jul. 30, 2014.
Final Office Action, dated May 3, 2017, U.S. Appl. No. 14/479,131, filed Sep. 5, 2014.
Non-Final Office Action, dated May 4, 2017, U.S. Appl. No. 14/811,482, filed Jul. 28, 2015.
Non-Final Office Action, dated Jul. 27, 2017, U.S. Appl. No. 14/981,814, filed Dec. 28, 2015.
Notice of Allowance, dated Sep. 5, 2017, U.S. Appl. No. 14/811,482, filed Jul. 28, 2015.
Notice of Allowance, dated Sep. 8, 2017, U.S. Appl. No. 14/479,131, filed Sep. 5, 2014.
“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.
“Decision Granting Motion to Terminate”, Inter Partes Review Case No. IPR2014-00245, Feb. 7, 2018, 4 pages.
“IPsec Anti-Replay Window: Expanding and Disabling,” Cisco IOS Security Configuration Guide. 2005-2006 Cisco Systems, Inc. Last updated: Sep. 12, 2006, 14 pages.
Singh et al. ; “Future of Internet Security—IPSEC”; 2005; pp. 1-8.
Muthitacharoen, Athicha et al., “A Low-bandwidth Network File System,” 2001, in Proc. of the 18th ACM Symposium on Operating Systems Principles, Banff, Canada, pp. 174-187.
“Shared LAN Cache Datasheet”, 1996, <http://www.lancache.com/slcdata.htm>, 8 pages.
Spring et al., “A protocol-independent technique for eliminating redundant network traffic”, ACM SIGCOMM Computer Communication Review, vol. 30, Issue 4 (Oct. 2000) pp. 87-95, Year of Publication: 2000.
Hong, B et al. “Duplicate data elimination in a SAN file system”, In Proceedings of the 21st Symposium on Mass Storage Systems (MSS '04), Goddard, MD, Apr. 2004. IEEE, pp. 101-114.
You, L. L. and Karamanolis, C. 2004. “Evaluation of efficient archival storage techniques”, In Proceedings of the 21st IEEE Symposium on Mass Storage Systems and Technologies (MSST), pp. 1-6.
Douglis, F. et al., “Application specific Delta-encoding via Resemblance Detection”, Published in the 2003 USENIX Annual Technical Conference, pp. 1-14.
You, L. L. et al., “Deep Store an Archival Storage System Architecture” Data Engineering, 2005. ICDE 2005. Proceedings of the 21st Intl. Conf. on Data Eng.,Tokyo, Japan, Apr. 5-8, 2005, pp. 12.
Manber, Udi, “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.
Knutsson, Bjorn et al., “Transparent Proxy Signalling”, Journal of Communications and Networks, vol. 3, No. 2, Jun. 2001, pp. 164-174.
Definition memory (n), Webster's Third New International Dictionary, Unabridged (1993), available at <http://lionreference.chadwyck.com> (Dictionaries/Webster's Dictionary). Copy not provided in IPR2013-00402 proceedings.
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 IPR2013-00402 proceedings.
Newton, “Newton's Telecom Dictionary”, 17th Ed., 2001, pp. 38, 201, and 714.
Silver Peak Systems, “The Benefits of Byte-level WAN Deduplication” (2008), pp. 1-5.
Business Wire, “Silver Peak Systems Delivers Family of Appliances for Enterprise-Wide Centralization of Branch Office Infrastructure; Innovative Local Instance Networking Approach Overcomes Traditional Application Acceleration Pitfalls” (available at http://www.businesswire.com/news/home/20050919005450/en/Silver-Peak-Systems-Delivers-Family-Appliances-Enterprise-Wide#.UVzkPk7u-1 (last visited Aug. 8, 2014)), pp. 1-4.
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)), 4 pages.
Tseng, Josh, “When accelerating secure traffic is not secure” (available at http://www.riverbed.com/blogs/whenaccelerati.html?&isSearch=true&pageSize=3&page=2 (last visited Aug. 8, 2014)), 3 pages.
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)), pp. 1-18.
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.
Final Written Decision, dated Dec. 30, 2014, Inter Partes Review Case No. IPR2013-00403, pp. 1-38.
Final Written Decision, dated Dec. 30, 2014, Inter Partes Review Case No. IPR2013-00402, pp. 1-37.
Final Written Decision, dated Jun. 9, 2015, Inter Partes Review Case No. IPR2014-00245, pp. 1-40.
Related Publications (1)
Number Date Country
20160255542 A1 Sep 2016 US
Continuations (3)
Number Date Country
Parent 15091533 Apr 2016 US
Child 15148933 US
Parent 14248188 Apr 2014 US
Child 14677841 US
Parent 12217440 Jul 2008 US
Child 14248188 US
Continuation in Parts (2)
Number Date Country
Parent 14981814 Dec 2015 US
Child 15091533 US
Parent 14677841 Apr 2015 US
Child 14981814 US