Use of virtual endpoints to improve data transmission rates

Description

BACKGROUND

Generally described, computing devices utilize a communication network, or a series of communication networks, to exchange data. Companies and organizations operate computer networks that interconnect a number of computing devices to support operations or provide services to third parties. The computing systems can be located in a single geographic location or located in multiple, distinct geographic locations (e.g., interconnected via private or public communication networks). Specifically, data centers or data processing centers, herein generally referred to as “data centers,” may include a number of interconnected computing systems to provide computing resources to users of the data center. The data centers may be private data centers operated on behalf of an organization or public data centers operated on behalf, or for the benefit of, the general public.

In some instances, the rate at which data can be transmitted over a communication network from a first device to a second device depends on the intermediary devices on the communication network over which the data is passed. The time required to transmit the data between intermediary devices can vary greatly based on the computing resources available to and the configuration of the intermediary devices. In public networks, such as the Internet, intermediary devices are often not under control of either the sending device or receiving device. Moreover, intermediary devices within public networks often operate under pre-established protocols that cannot be easily modified by sending and receiving devices.

In some instances, rapid transmission of information can be facilitated by distributed, interconnected networks of data centers. Illustratively, service providers or content creators (such as businesses, artists, media distribution services, etc.) can employ interconnected data centers, sometimes referred to as “content delivery networks” (CDNs), to deliver content (such as web sites, web content, or other digital data) or provide other services to users or clients. The content may be replicated or distributed among the data centers according to existing routing and addressing technologies, thereby enabling multiple data centers associated with the CDN to provide similar or identical content to client computing devices. In some instances, each data center of a CDN, or any location where it may have computing resources, may be referred to as a point-of-presence (“POP”). A CDN can maintain POPs over a wide area (or worldwide) in an attempt to ensure that a CDN is nearby to any requesting device. This minimizes the number of intermediary devices on public networks that must be utilized when transmitted content from the CDN to the client.

While useful in some instances, the use of CDNs is not necessarily applicable in all data transfers. For example, point-to-point transmission of information that is not intended to be replicated (e.g., transmission of data between a first specific device and a second specific device) generally does not benefit from existing CDN systems. Thus, these data transmissions often utilize conventional techniques (e.g., transmission via public intermediary devices), which results in highly variable, and often decreased, data transmission rates.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram depicting an illustrative logical network 100 including computing devices in communication over a public network, and a data transmission system configured to enable high-data-rate transmission of information between the computing devices;

FIG. 2 is a block diagram depicting interactions between a source computing device and the data transmission system of FIG. 1, in order to select a source-side endpoint within the data transmission system for use by the source computing device;

FIG. 3 is a block diagram depicting the transmission of data from the source computing device to a destination computing device, utilizing endpoints within the data transmission system;

FIGS. 4A and 4B are block diagrams depicting interactions for dynamically generating a virtual endpoint within the data transmission system for use by a computing device;

FIG. 5 is a block diagram depicting interactions for determining that locations of a source computing device, destination computing device, or endpoints within the data transmission system do not meet a set of threshold criteria for use of the data transmission system, and for instructing the source computing device to communicate with the destination computing device over an existing communication network;

FIG. 6 is a flow chart depicting an illustrative routine for selecting a source-side endpoint within a data transmission system for use by a source computing device; and

FIG. 7 is a block diagram depicting an illustrative configuration of one embodiment of an endpoint selector within the data transmission system of FIG. 1.

DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to enabling high-data-rate transmissions between two devices on a communication network. Specifically, the present disclosure enables two devices connected via a public network (e.g., a global area network (GAN), such as the Internet) to communicate with one another at least partly via a data transmission system expected to provide higher-data-rate transmissions than would be possible using solely the public network. The data transmission system may include a number of geographically distributed endpoints, each of which may communicate with devices on the public network, as well as with one another via a private network. Thus, a source computing device may transmit, via a public network, data to a first endpoint of the data transmission system for delivery to a destination computing device. The data transmission system may transmit the data from the first endpoint to a second endpoint via a private network, and from the second endpoint to the destination computing device via the public network. Because the use of public networks may be limited solely to client communication with endpoints, delays and errors that are common on those public networks may be reduced. Further, because endpoints may be selected such that they are geographically close to client devices, the frequency and effect of those errors and delays may be limited. Still further, the transmission of data between endpoints, rather than transmitting from a source computing device to a destination computing device without the use of endpoints, may increase the data transmission rate of stateful communication protocols such as the transmission control protocol (TCP). To ensure consistent states between sending and receiving devices, stateful communication protocols generally rely on data acknowledgement messages, the speed of which is limited by the round-trip transmission time between the two devices. Thus, by transmitting data via multiple separate stateful connections, the round trip time of each connection may be reduced, and the data-rate of transmissions between a source and destination computing device can be increased.

In some embodiments, the data transmission system may dynamically determine endpoints within the system to be used when transferring data between two computing devices. Illustratively, when a source computing device requests transmission of data to a destination computing device, the data transmission system may determine at least two endpoints to utilize in facilitating the transfer: a first endpoint nearby to the source computing device, and a second endpoint nearby to the destination computing device. By determining endpoints located nearby to both the source and destination computing devices, the use of public networks (e.g., between the source device and the first endpoint and between the second endpoint and the destination computing device) may be limited. As the use of public networks may be more likely to incur errors or delays, minimizing the use of these networks may generally increase the speed of data transmissions.

Proximity of computing devices (e.g., whether a device is “nearby to” or “far from” another device) may be described with respect to network distance, which reflects path used to communication between two devices on a shared communication network. Network distance may refer to any individual metric regarding that path, such as the latency incurred when communicating via the network path or the number of intermediate devices within the network path (e.g., network “hops”). Network distance may also refer to a metric derived from individual network communication metrics or combinations thereof. For example, network distance may refer to a network path's weight or score, which may be calculated based on a combination of latency or hops on that network path, as well as other factors, such as preference values or weights assigned to various paths. As discussed in detail below, embodiments of the present disclosure may utilize network distance to select preferred communication channels over a network (e.g., to select whether to utilize the data transmission system, to select endpoints within the data transmission system to utilize in communicating with source or destination client computing devices, etc.). In addition, embodiments of the present disclosure may utilize other communication metrics alternatively or in addition to network distance, such as the bandwidth of a communication path, the percentage of packet loss occurring over a communication path, the frequency of other errors or delays over the path, the availability of the path (e.g., the frequency that the path stops functioning), the variation in error, packet loss, or availability rates over time (e.g., the consistency of the network). These metrics, including network distance, percentage of packet loss, frequency of errors, or the availability of a path, may be referred to as metrics of “network quality.”

In some instances, minimization of network distance or maximization of network quality between a client computing device and the data transmission system may be facilitated by dynamic generation of endpoints. Illustratively, where a client computing device wishes to utilize the data transmission system, but is more than a threshold network distance away from any available endpoint within the data transmission system, the data transmission system may operate to dynamically generate a new endpoint for use by the client computing device. As a further example, a new dynamically generated endpoint may be created when no existing endpoint (or no endpoint within a threshold network distance) provides a communication path of sufficient network quality to the client computing device. These dynamically generated endpoints may be implemented, for example, as virtual computing devices executed by physical computing devices located in data centers operated by the data transmission system. Thus, a client computing device may be enabled to utilize the data transmission system even when no preexisting endpoint exists nearby to the client computing device.

Further, the data transmission system may be configured to attempt to ensure that transmission of data over the data transmission system will occur at a higher data-rate than would otherwise be expected without the use of the data transmission system. Accordingly, when a request is received at the data transmission system to facilitate data transmission between a first and second computing device, the data transmission system may attempt to estimate whether the data transmission would occur more quickly on the data transmission system than on a public network connecting the first and second computing devices. In the instance that the transmission would occur more quickly on the public network, the data transmission system may decline the request by instructing the two computing devices to utilize the public network. Thus, the data transmission system may generally attempt to ensure that the highest data transmission rate is achieved between two computing devices.

The foregoing aspects and many of the attendant advantages of the present disclosure will become more readily appreciated as the same become better understood by reference to the following, when taken in conjunction with the accompanying drawings.

FIG. 1 is a block diagram depicting an illustrative operating environment 100 in which a data transmission system 110 may facilitate transmission of data between various computing devices 102 in communication with the data transmission system 110 via a public network 104. Computing devices 102 may include any number of different computing devices capable of communicating with one another and with the data transmission system 110, including personal computing devices, server computing devices, and virtual computing devices operating on physical host computing devices. For example, individual accessing computing devices may correspond to a laptop or tablet computer, personal computer, wearable computer, server, personal digital assistant (PDA), hybrid PDA/mobile phone, mobile phone, electronic book reader, set-top box, camera, digital media player, and the like. In some instances, a computing device 102 may be operated as a personal device of a user. In other instances, a computing device 102 may implement a network-accessible service, such as a web site, database, or data storage service accessible to other computing devices 102. While shown as individual devices, one or more of the computing devices 102 may be associated with or operate as part of a collection of computing devices 102 configured to implement a desired functionality on the public network 104. Further, while shown as distinct from the data transmission system 110, in some instances computing devices 102 may be associated with or form part of the data transmission system 110, and may communicate with various other components of the data transmission system via a private network 112 (described in more detail below). Thus, computing devices 102 may generally represent any devices utilized to transmit data over the public network 104.

The public network 104 may be any wired network, wireless network, or combination thereof, operating as a collection of autonomous network systems under the control of various entities for use by the various computing devices 102. Illustratively, the public network 104 may include personal area networks, local area networks, wide area networks, cable networks, satellite networks, cellular telephone networks, and combinations thereof. In the example environment of FIG. 1, public network 104 is a global area network (GAN), such as the Internet. Protocols and components for communicating via the other aforementioned types of communication networks are well known to those skilled in the art of computer communications and thus, need not be described in more detail herein. As will be appreciated by one of skill in the art, operation of public networks 104 is generally subject to the operation of each autonomous system within the public network 104, as well as various agreements between autonomous systems regarding how such systems operate. As such, data transmission over a public network 104 may be highly variable and largely unpredictable, often resulting in slow rates of data transmission between computing devices 102, even where both computing devices 102 are otherwise capable of much higher rates of data transmission on the public network 104 generally.

In order to enable higher-speed transmission of data across the public network 104, a data transmission system 110 is described herein that can circumvent portions of the public network 104 that would otherwise delay or slow data transmissions, and that can further optimize communications between computing devices 102 without requiring reconfiguration of the transmission protocols used by those devices 102. As shown in FIG. 1, the illustrative data transmission system 110 includes a plurality of endpoints 114, a plurality of points of presence (POPs) 120, and one or more endpoint selectors 118, each in communication with one another via a private network 112.

The private network 112 may include any combination of various network types described above operated on behalf of the data transmission system 110, alone or in conjunction with other services. While shown as distinct from the public network 104, the private network 112 in some instances may be physically co-mingled with the private network 104. For example, the private network 112 may be formed by one or more leased lines on the public network 104 that provide dedicated communications to the data transmission system 110. Because the private network 112 is operated on behalf of the data transmission system 110 (e.g., independently or in conjunction with other services associated with the data transmission system 110), the number of delays and errors caused by transmission of data across the private network may generally be less than the number of delays and errors caused by transmission of data across the public network 104. Moreover, because the private network 112 is operated on behalf of the data transmission system 110, the functionality of the private network 112 (e.g., the protocols used therein or the configuration of network devices operating as part of the private network 112) may be modified by the data transmission system 110 without reducing the ability of the data transmission system 110 to interact with the public network 104.

Each endpoint 114 may correspond to a computing device, or collection of computing devices, configured to enable data transmission to and from other endpoints 114, as well as the various computing devices 102. In one embodiment, endpoints 114 may operate in pairs (generally referred to as source- and destination-side endpoints 114), and enable two computing devices 102 to communicate via the data transmission system 110. Specifically, a source-side endpoint 114 may be configured to receive a request from a first computing device 102 to transmit data to a second computing device 102. Thereafter, the source-side endpoint 114 may transmit the data a destination-side endpoint 114 nearby to the second computing device. The destination-side endpoint 114, in turn, can transmit the data to the second computing device 102, thus facilitating communication of the first and second computing devices 102 via the data transmission system 110. For example, where a user computing device (e.g., a first computing device 102) wishes to upload a document to a network-based storage service (e.g., operating on a second computing device 102), the user computing device may transmit the document to a first, source-side endpoint 114. The source-side endpoint 114 can then transmit the document to a second, destination-side endpoint 114, which in turn can transmit the document to the network-based storage service. Thus, the user computing device is enabled to upload data to the network-based storage service by use of the data transmission system 110, which may substantially increase the speed and reliability of such uploads. To enable endpoints 114 to maintain a state of connections to computing devices 102 and other endpoints 114, the endpoints 114 include a data queue 116 that can be utilized to store data received (e.g., from a source computing device 102) and awaiting transmission (e.g., to a destination-side endpoint 114). In one embodiment, the data queue 116 may be implemented in transitory memory of an endpoint 114, such as in a memory buffer (e.g., the TCP receive buffer) stored within random access memory (“RAM”). In another embodiment, the data queue 116 may be implemented in whole or in part on non-transitory memory, such as a hard disk drive of the endpoint 114.

The data transmission system 110 further includes one or more endpoint selectors 118 configured to enable a computing device 102 to locate and communicate with an endpoint 114 nearby to the computing device 102. As will be described in more detail below, each endpoint selector 118 may obtain requests from a computing device 102 to transmit information via the data transmission system 110, select an endpoint 114 nearby to the computing device 102, and return an identifier of that endpoint 114 to the request computing device, such that computing device 102 may transmit data over the data transmission system 110 by communicating that data to the endpoint 114. In one embodiment, the endpoint selector 118 may be implemented within a resolution service, such as a domain name service (“DNS”) resolver. For example, the endpoint selector 118 may be configured to receive requests from a computing device 102 to resolve an identifier of a destination computing device 102 into a network address (e.g., an internet protocol [“IP”] address), select an endpoint 114 nearby to the computing device 102, and return a network address of the endpoint 114 as a resolution of the request. Thus, the endpoint selectors 118 may enable each computing device 102 to automatically connect to a nearby endpoint 114 of the data transmission system 110 by use of a network identifier of a destination computing device 102, without requiring reconfiguration of the source computing device 102.

To assist in determining an endpoint 114 nearby to a requesting computing device 102, the endpoint selectors 118 can include a data store 119 including information regarding network paths between computing devices 102 and endpoints 114, as well as regarding paths between computing devices 102 themselves or endpoints 114 themselves. Illustratively, the information may include historical data regarding data transmissions across the data transmission system 110, such as a latency of communications, number of hops, bandwidth, or other network quality metrics regarding a path between a computing device 102 and an endpoint 114, between two endpoints 114, or between two computing devices 102. As will be described below, this information may be utilized by the endpoint selectors 118 to determine whether use of the data transmission system 110 is likely to result in higher-data-rate transmission than two computing devices 102 could achieve independently, as well as to determine an endpoint 114 to which a computing device 102 should connect when utilizing the data transmission system 110.

Still further, the illustrative data transmission system 110 of FIG. 1 can include a plurality of points of presence (“POPs”) 120. Each POP 120 may include a collection of on-demand computing devices 124 and data stores 122 available to be rapidly provisioned with computer executable instructions in order to implement various functionalities at the request of the data transmission system 110. While shown as part of the data transmission system 110, the POPs 120 may, in some instances, be operated separately from other components of the data transmission system 110 (e.g., as an part of a distinct service sharing a private network 112 with the data transmission system 110). In some instances, the POPs 120 may collectively be referred to as a “cloud computing” environment.

In accordance with embodiments of the present disclosure, the on-demand computing devices 124 within the POPs 120 may be utilized by the data transmission system 110 to dynamically generate virtual endpoints 114. Each virtual endpoint 114 implemented on a POP 120 may operate as an endpoint 114, described above, and therefore enable communication to and from the computing devices 102 and other endpoints 114. The use of virtual endpoints 114 may be beneficial, for example, where no preexisting endpoint 114 is located within a threshold network distance to a computing device 102 requesting use of the data transmission system 110, or when no preexisting endpoint 114 is closer to the computing device 102 than a POP 120. In such instances, the data transmission system 110 may select a POP 120 nearby to the computing device 102, and cause a virtual endpoint 114 to be created within the POP 120. The computing device 102 may thereafter communicate with the data transmission system 110 via the virtual endpoint 114. Thus, data transmission system 110 of FIG. 1 is not limited to the use of preexisting endpoints 114, but may dynamically create virtual endpoints 114 in order to minimize network distance or maximize network quality metrics between the data transmission system 110 and the various source or destination computing devices 102.

It will be appreciated by those skilled in the art that the data transmission system 110 may have fewer or greater components than are illustrated in FIG. 1. In addition, the data transmission system 110 could include various web services and/or peer-to-peer network configurations. Thus, the depiction of the data transmission system 110 in FIG. 1 should be taken as illustrative. For example, in some embodiments, components of the data transmission system 110, such as the endpoint selectors 118, may be executed by one more virtual machines implemented within the POPs 120.

Any one or more of the endpoints 114, endpoint selectors 118, and POPs 120, may be embodied in a plurality of components, each executing an instance of the respective endpoints 114, endpoint selectors 118, and POP 120. A server or other computing component implementing any one of the endpoints 114, endpoint selectors 118, and POPs 120 may include a network interface, memory, processing unit, and computer readable medium drive, all of which may communicate which each other by way of a communication bus. The network interface may provide connectivity over the private network 112, the public network 104, and/or other networks or computer systems. The processing unit may communicate to and from memory containing program instructions that the processing unit executes in order to operate the respective endpoints 114, endpoint selectors 118, and POPs 120. The memory may generally include RAM, ROM, other persistent and auxiliary memory, and/or any non-transitory computer-readable media. While endpoints 114 and endpoint selectors 118 are described above as distinct from the POP 120, some embodiments of the endpoints 114 and endpoint selectors 118 may be implemented by computing devices within the POP 120 (e.g., as virtual machines within the POP 120).

With reference to FIG. 2, an illustrative set of interactions for initiating a connection between a source computing device 102 and the data transmission system 110 will be described. Specifically, the interactions of FIG. 2 depict the use of an endpoint selector 118A within the data transmission system 110 to determine an endpoint 114 nearby to the source computing device 102, and to notify the source computing device 102 of that endpoint. For ease of illustration, components within the data transmission system 110 other than the endpoint selector 118A are omitted from FIG. 2.

The interactions of FIG. 2 begin at (1), where a source computing device 102A transmits a request to the endpoint selector 118A to transmit data to a destination computing device 102B. In one embodiment, the request may be automatically generated by the source computing device 102A in response to instructions to communicate with the destination computing device 102B. For example, where the source computing device 102A has been configured to utilize the data transmission service 110 as a proxy for communication requests, the source computing device 102A may reroute all (or a designated portion) of communication requests to the endpoint selector 118A. As a further example, where the endpoint selector 118A operates as a DNS server, the destination computing device 102A may designate the endpoint selector 118A as an authoritative resolver for an identifier (e.g., a uniform resource identifier, or “URI”) of the destination computing device 102B. Thus, when the source computing device 102A attempts to connect to the human-readable identifier of the destination computing device 102B, the source computing device 102A may automatically generate and transmit the request to the endpoint selector 118A.

After receiving a request from the source computing device 102A, the endpoint selector 118A, at (2), analyzes potential endpoints of the data transmission system 110 (e.g., both the preexisting endpoints 114 shown in FIG. 1, as well as potential virtual endpoints that may be dynamically created within the POPs 120 of FIG. 1) to determine an expected network distance between the endpoints 114 and the source computing device 102A. Illustratively, an expected network distance between each endpoint 114 and the source computing device 102A may be determined based at least in part on data within the data store 119A of the endpoint selector. As noted above, the data store 119A may include data regarding prior communications between various computing devices 102 and endpoints 114 of the data transmission system 110. Such data may include, but is not limited to, the latency of communications, the bandwidth available, the number of hops, or other network quality metrics regarding a communication path between the endpoints 114 and various computing devices 102. Thus, the endpoint selector 118A may inspect the data within the data store 119A to determine whether a network distance or network quality metric between the source computing device 102A and any potential endpoint 114 of the data transmission system 110 satisfies a threshold value. In one embodiment, this threshold may be an absolute value (e.g., a latency below 50 ms). In other embodiments, the threshold may be relative or variable. For example, the threshold network value may be set based at least in part on the network distance or network quality metrics between the source computing device 102A and a destination computing device 102B (e.g., to ensure that the network distance between the source computing device 102A and a selected endpoint 114 is not greater than the network distance between the source computing device 102A and the destination computing device 102B).

Additionally or alternatively to the use of data within the data store 119, the endpoint selector 118A may in some instances generate data regarding network distance or network quality metrics between the source computing device 102A and potential endpoints 114 within the data transmission system 110 (e.g., preexisting endpoints 114 and potential virtual endpoints 114 within the POPs 120). For example, the endpoint selector 118A may cause each of the endpoints 114 and POPS 120 of FIG. 1 to generate network probes, such as Internet Control Message Protocol (“ICMP”) packets, and to transmit those probes to computing devices 102 in order to assess the network distance or network quality metrics between computing devices 102 and the respective endpoints 114 or POPS 120. Thus, the endpoint selector 118A may utilize both passively and actively collected data to determine network distances or network quality metrics between the source computing device 102A and the various potential endpoints 114.

In some embodiments, the endpoint selector 118A may be configured to estimate the network distance or network quality metrics between the source computing device 102A and a potential endpoint, in order to supplement or replace the need for collected network data. In one instance, the endpoint selector 118A may estimate the network distance or network quality metrics between the source computing device 102A and a potential endpoint 114 based on data from similar source computing devices 102, similar endpoints 114, or both. For example, where previously collected data regarding the network distance or network quality metrics between the source computing 102A and a given endpoint 114 does not exist, the endpoint selector 118A may utilize previously collected data regarding the network distance or network quality metrics between the given endpoint 114 and other computing devices 102 originating from similar network addresses as the source computing device 102A (e.g., sharing a common internet service provider [“ISP”]). As a further example, the endpoint selector 118A may estimate network distance between the source computing device 102A and a given endpoint 114 based on the geographical distance between the source computing device 102A and the given endpoint 114 (e.g., as determined based on address geolocation techniques, which are known in the art). Thus, the endpoint selector 118A may function to estimate network distance between the source computing device 102A and potential endpoints 114, even where no data regarding communication between those devices previously exists.

While the examples provided above discuss network distance between a source computing device 102A and potential endpoints 114, the same or similar techniques may be utilized to determine or estimate network distance between any two devices, including between potential endpoints 114 on the data transmission system 110 and between potential endpoints 114 and a destination computing device 102B. As will be discussed below, these network distances may be utilized, for example, to select a destination-side endpoint 114 nearby to a destination computing device 102B, in order to minimize the network distance transmitted data must travel over the public network 104. In addition, while the embodiments of FIG. 2 are discussed with reference to network distance, network quality may additionally or alternatively be utilized to select among potential endpoints 114.

In the illustrative example of FIG. 2, it is assumed that a preexisting endpoint 114 within the data transmission system 110 is located within a threshold network distance of the source computing device 102A. Thus, the endpoint selector 118A, at (4), returns an identifier of that preexisting endpoint 114 to the source computing device 102A. Illustratively, the identifier may include, for example, a network address (e.g., IP address) or URI of the preexisting endpoint 114, which the source computing device 102A may thereafter utilize to connect with the data transmission system 110

With reference to FIG. 3, illustrative interactions for utilizing endpoints 114 within the data transmission system 110 to transmit information from a source computing device 102A to a destination computing device 102B will be described. Illustratively, the interactions of FIG. 3 may occur subsequently to those of FIG. 2, after the source computing device 102A has been provided with an identifier of a source-side endpoint 114 within the data transmission system 110, shown in FIG. 3 as source-side endpoint 114A.

The interactions of FIG. 3 begin at (1), where the source computing device 102A and the source-side endpoint 114A establish a stateful connection via the public network 104. Stateful connections may be, for example, communication channels in which at least one of a sender and receiver maintain information regarding a state of the connection, such as whether data transmitted via the communication channel was successfully received by a receiving device, and whether an acknowledgement of that receipt was received at a sending device. Illustratively, stateful connections may be established at the network level (e.g., by use of the TCP protocol or other stateful protocol), at the application level (e.g., by utilizing an application that maintains information regarding the state of an underlying protocol that is either stateful or stateless), or with a combination thereof. For ease of discussion, each of the stateful connections described with respect to FIG. 3 will be assumed to be TCP connections. However, the various stateful connections of FIG. 3 may, in some embodiments, utilize different types of stateful connections (e.g., utilizing different network-level protocols, application-level protocols, or combinations thereof).

After establishing the first stateful connection, at (2), the source computing device 102A transmits data to the source-side endpoint 114A via that first stateful connection. Beneficially, because the source-side endpoint 114A is located nearby to the source computing device 102A (e.g., within a threshold network distance, as described above with reference to FIG. 2), the potential for errors and delays caused by the public network 104 is low (e.g., as compared to transmitting data from the source computing device 102A to the destination computing device 102B without the use of endpoints 114). Moreover, because the round trip transmission time between the source-side endpoint 114A and the source computing device 102A is reduced, the time required to transmit data via the first stateful connection is reduced, as is the time required to recover from errors on the first stateful connection. For example, where the first stateful connection corresponds to a TCP connection, the TCP window (a variable which controls how much information may be sent by the TCP protocol without receiving an acknowledgement) may alter rapidly due to a low round-trip communication time, thereby handling the occurrence of errors on the public network 104 more efficiently.

After receiving data at the source-side endpoint 114A, that endpoint 114A enqueues the data into a data queue 116A. In one embodiment, the data queue 116A may be implemented in transitory memory of the source-side endpoint 114A, such as in a memory buffer (e.g., the TCP receive buffer) stored within random access memory (“RAM”). In another embodiment, the data queue 116A may be implemented in whole or in part on non-transitory memory, such as a hard disk drive of the source-side endpoint 114A.

At (4), the source-side endpoint 114A can select a device-side endpoint 114B to utilize in transmitting the data from the data queue 116A to the destination computing device 102B. Illustratively, the source-side endpoint 114A may select, as the destination-side endpoint 114B, any potential endpoint 114 within the data transmission system 110 that is nearby to the destination computing device 102B (e.g., within a threshold distance of the destination computing device 102B). In one embodiment, the source-side endpoint 114A may communicate with an endpoint selector 118 in order to determine a potential endpoint 114 within a threshold network distance to the destination computing device 102B (e.g., similarly to as described above in FIG. 2 with reference to determining a potential endpoint 114 within a threshold distance to the client computing device 102A). Still further, where no destination-side-endpoint exists nearby to the destination computing device 102B, or where a POP 120 exists closer than any pre-existing endpoint 114, the source may cause a new virtual endpoint 114 to be created on a POP 120 nearby to the destination computing device 102B. Interactions for dynamically generating a virtual endpoint 114 are described in more detail below with respect to FIGS. 4A and 4B. In the illustration of FIG. 3, it is assumed that the source-side endpoint 114A has selected a preexisting endpoint 114 of the data transmission system 110, shown in FIG. 3 as destination-side endpoint 114B.

Thereafter, at (5), the source-side endpoint 114A can establish a second stateful connection to the destination-side endpoint 114B (e.g., a TCP connection), via the private network 112. As noted above, because the private network 112 is operated on behalf of the data transmission system 110, the rate or errors or delays on the private network 112 is expected to be low in comparison to the public network 104. As such, in some instances, the source- and destination-side endpoints 114A and 114B may utilize an optimized communication protocol, such as a TCP protocol with a large starting transmission window, or a stateless protocol utilizing application-level state tracking and error correction, to ensure that the second stateful connection provides rapid communication between the source- and destination-side endpoints 114A and 114B.

Thereafter, at (6), the source-side endpoint 114A transmits the data from the data queue 116A (as received from the source computing device 102A and stored in the data queue 116A) to the destination-side endpoint 114B. In some instances, the source-side endpoint 114A may modify the data prior to transmission, such as by modifying header information of the data to note a network identifier of the original source computing device 102A, or otherwise encapsulating the data to ensure information is not lost or modified during transmission of the data through the data transmission system 110.

On receiving the data, the destination-side endpoint 114B, at (7), enqueues the data within its data queue 116B (e.g., as implemented in transitory or non-transitory memory of the destination-side endpoint). Thereafter, the destination-side endpoint 114B, at (8), establishes a third stateful connection (e.g., a third TCP connection) to the destination computing device 102 over the public network 104. At (9), the destination-side endpoint 114B utilizes the third stateful connection to transmit the data from the data queue 116B to the destination computing device 102B.

While not shown in FIG. 3, the source- and destination-side endpoints 114A and 114B may continue to facilitate transfer of information between the source and destination endpoints 102A and 102B over the data transmission service 110. Such transfer of data is generally expected to provide faster and more reliable service than would be achieved over the public network 104 alone. For example, because the data transmission system 110 utilizes a private network 112 between endpoints 114, the total potential for errors and delays between the two devices 102A and 102B is reduced. Moreover, stateful communication protocols are generally limited, at least in part, by the amount of unacknowledged or “in-flight” data allowed by a current state of the connection. For example, the Transmission Control Protocol (TCP) or other stateful communications protocols can use a “sliding window” communication protocol, in which only a set amount of data may be transmitted by a sender before receiving an acknowledgement by the receiver. While such limitations are intended to limit the effect of transmission errors, they can also reduce effective bandwidth of the connection, especially where the round trip transmission time is large. By segmenting transmissions between the source and destination computing devices 102A and 102B into multiple, independent stateful connections, the total amount of in-flight data allowed between the two devices 102A and 102B may be effectively multiplied (e.g., tripled, where two endpoints are used). More specifically, each pair of devices within the segmented network path may establish an independent transmission window, such that each additional, state-aware segment added to an initial point-to-point transmission path increases the total transmission amount of allowed in-flight data by an amount equal to the transmission window allowed on that additional, state-aware segment. Still further, because the network distance between each device 102A and 102B and their respective endpoints 114A and 114B is minimized, the round trip communication times between each device and endpoint 114 is reduced. This reduction in round trip communication times minimizes the effects of errors or delays on the public network 104 (e.g., causing reductions in the amount of “in-flight” data allowed), and increases the ability of each device 102 and endpoint 114 to recover from such delays (e.g., by reducing the time required to negotiate increases in the allowed level of “in-flight” data).

While the illustrative interactions of FIG. 3 are described in sequence, embodiments of the present application may modify the described sequence, omit interactions, or execute one or more interactions in parallel. For example, in one embodiment, interaction (5) (the establishment of a second stateful connection between source-side endpoint 114A and destination-side endpoint 114B) may occur immediately after interaction (1) (the establishment of a first stateful connection between the source computing device 102A and the source-side endpoint 114A). In another embodiment, interaction (5) may occur independently and prior to the other interactions described in FIG. 3. Illustratively, the source-side endpoint 114A may maintain pre-established stateful connections to various endpoints 114, including the destination-side endpoint 114B, such that the stateful connections need not be reestablished when a request to transmit data is received. These pre-established stateful connections may, in some instances, be selected from a pre-established pool of connections used to carry data originating from multiple computing devices 102, thus reducing the number of connections that must be maintained at each endpoint 114A.

Communication between endpoints 114 and computing devices 102 is described with reference to FIG. 3 as occurring via a public network 104. However, in some embodiments, this communication may additionally or alternatively occur on the private network 112. For example, where the destination computing device 102B is associated with the data transmission system 110 or otherwise has access to the private network 112, the third stateful connection may be established on that private network 112, further increasing the speed of data transfer to the destination computing device 102B. Alternatively, where the destination computing device 102B has access to the private network 112, the source-side endpoint 114A may transmit the data to the destination computing device via a stateful connection on that private network 112 without utilization of the destination-side endpoint 114B. In these instances, the destination-side endpoint 114B may be omitted. Various additional alternations of the interactions of FIG. 3 will be apparent to one of skilled in the art, based on the disclosure herein.

As noted above, potential endpoints 114 within the data transmission system 110 include both preexisting endpoints 114, as well as virtual endpoints 114 that may be dynamically created on POPs 120 associated with the data transmission system 110. One set of interactions for creating and utilizing such a virtual endpoint 114 is depicted in FIGS. 4A and 4B. While depicted separately for clarity, the interactions of FIGS. 4A and 4B will be described in conjunction, and numbering will be maintained between the two figures.

The interactions of FIGS. 4A and 4B begin at (1), where a source computing device 102A transmits a request to the endpoint selector 118A to interact with a destination computing device 102B. As discussed above with respect to FIG. 2, the request may be generated by a source computing device 102A in connection with a request to resolve an identifier of the destination computing device 102B (e.g., as a DNS request transmitted by the source computing device 102). The request may further be generated by the source computing device 102A based on a configuration of the source computing device (e.g., to utilize the data transmission service 110 as a proxy in communicating with the destination computing device 102B).

The interactions continue at (2), where the endpoint selector 118A analyzes the network distance between potential endpoints 114 within the data transmission system 110 and the source computing device 102A. As discussed above with respect to FIG. 2, this network distance may reflect the latency and/or number of hops on various network paths between endpoints 114 and the source computing device 102A, and may be calculated based on passively collected network data (e.g., data regarding previous transmissions between the data transmission system 110 and the source computing device 102A or other similar computing devices 102) or actively collected network data (e.g., data regarding network probes, such as ICMP packets, transmitted between the data transmission system 110 and the source computing device 102A). While the embodiments of FIG. 4A are discussed with reference to network distance, any network quality metric or combination of network quality metrics may be utilized by the endpoint selector 118A.

Unlike the interactions of FIG. 2, the results of analysis by the endpoint selector 118A may indicate that no preexisting endpoint 114 is within a threshold network distance to the source computing device 102A, and/or that a POP 120A is within a closer network distance to the source computing device 102A than any preexisting endpoint 114. As such, the endpoint selector 118A may determine that a virtual endpoint 114 should be created on the POP 120A, to enable the source computing device 102A to reach the data transmission system 110 over a minimum network distance. Accordingly, at (3), the endpoint selector 118A may select the POP 120A (e.g., representing the POP 120 with a minimum network distance to the source computing device 102A) for generation of a virtual endpoint 114.

Thereafter, at (4), the endpoint selector 118A can transmit instructions to the POP 120A to generate the virtual endpoint 114. Illustratively, the instructions may notify the POP 120A that a virtual computing device should be created, and that executable code implementing the functionality of an endpoint 114 (e.g., as contained within an executable disk image) should be provisioned onto the virtual computing device. In some instances, the instructions may further notify the POP 120A of various parameters usable by the virtual endpoint 114, such as an identity of the source computing device 102A or a destination computing device 102B with which the source computing device 102A wishes to communicate.

The interactions of FIGS. 4A and 4B then continue in FIG. 4B, where the POP 120A generates a virtual endpoint 114C in response to the received instructions. Illustratively, the virtual endpoint 114C may correspond to a virtual computing device, implemented on one or more host computing devices, provisioned with computer-executable instructions enabling the virtual computing device to carry out the functionalities described herein. As shown in FIG. 4B, the virtual endpoint 114C may include a virtual data queue 116C (e.g., representing a logical mapping to one or more portions of the data stores 122), enabling the virtual endpoint 114C to receive and forward information between the source computing device 102A and a destination computing device 102B.

At (6), the POP 120A can transmit a notification to the endpoint selector 118A that the virtual endpoint 114C has been established. The endpoint selector 118A, in turn, may transmit an identifier of the virtual endpoint 114C to the source computing device 102A. The source computing device 102A may thereafter establish a stateful communication channel to the virtual endpoint 114C on the public network 104, and utilize that communication channel to transmit data, via the data transmission system 110, to a destination computing device 102B. In this manner, the virtual endpoint 114C may function in the same way as a preexisting endpoint 114 (e.g., as described above with respect to FIG. 3).

In some embodiments, timing or ordering of the various interactions of FIG. 4B may be modified from those described above. For example, in order to facilitate rapid responses to client requests, the endpoint selector 118A may be configured to return an identified of the virtual endpoint 114C prior to receiving a notification, from the POP 120, that the virtual endpoint 114C has been created. Illustratively, the identifier of the virtual endpoint 114C may be pre-established, or may be selected by the endpoint selector and transmitted to the POP 120A, such that the endpoint selector 118A need not have received notification of the virtual endpoint 114C's creation prior to providing the identifier to the source computing device 102A. Thus, delays associated with creation of the virtual endpoint 114C may be reduced or eliminated. In one embodiment, the data transmission system 110 may be further configured to detect that a virtual endpoint 114C has not been utilized (e.g., by the source computing device 102A or other computing device 102) for a threshold period of time (e.g., 10 minutes), and to notify the POP 120A that the virtual endpoint 114C may be halted. In other embodiments, the POP 120A itself may be configured to automatically halt the virtual endpoint 114C.

In accordance with aspects of the present disclosure, the data transmission system 110 may be configured such that, when the data transmission system 110 is unlikely to increase the rate of data transmission between a source and destination computing device 102, the data transmission system 110 is not utilized by the source and destination computing devices 102. For example, where the source and destination computing devices 102 are located nearby to one another (e.g., in terms of network distance), use of the data transmission system 110 may not increase data transmission rates between the two devices 102. Accordingly, a set of interactions for determining whether use of the data transmission system 110 is likely to increase rates of transmission between two devices 102 is depicted in FIG. 5.

The interactions of FIG. 5 begin at (1), where a source computing device 102A transmits a request to the endpoint selector 118A to interact with a destination computing device 102B. As discussed above with respect to FIGS. 2 and 4A, the request may be generated by a source computing device 102A in connection with a request to resolve an identifier of the destination computing device 102B (e.g., as a DNS request transmitted by the source computing device 102). The request may further be generated by the source computing device 102A based on a configuration of the source computing device (e.g., to utilize the data transmission service 110 as a proxy in communicating with the destination computing device 102B).

The interactions continue at (2), where the endpoint selector 118A analyzes the locations of the source computing device 102A, the intended destination computing device 102B, and/or potential endpoints 114 within the data transmission system 110 to determine whether those locations meet a set of threshold criteria maintained by the data transmission system 110. In one embodiment, the threshold criteria is based at least in part on a network distance between the source computing device 102A and the destination computing device 102B, such that if the two devices 102A and 102B are less than a threshold network distance apart, the threshold criteria is not satisfied. For example, the threshold criteria may indicate that if a communication path between the two devices 102A and 102B over the public network 104 has a latency of less than 100 milliseconds (ms), the threshold criteria for use of the data transmission system 110 is not satisfied. Threshold criteria regarding the communication path between the two devices 102A and 102B may be established according to any network quality metric.

In another embodiment, the threshold criteria is based at least in part on a network distance between a source or destination computing device 102A or 102B and a closest potential endpoint 114 of the data transmission system 110, such that if no potential endpoint 114 (e.g., a preexisting endpoint 114 or a dynamically created virtual endpoint 114 created within a POP 120) is within a threshold network distance of the respective source or destination computing device 102A or 102B, the threshold criteria is not satisfied. For example, the threshold criteria may indicate that if no endpoint 114 is able to communicate with the source computing device 102A (e.g., over the public network 104) at less than 50 ms, then the threshold criteria for use of the data transmission system 110 is not satisfied. As in the example above, threshold criteria regarding the communication path between the source device 102A and an endpoint 114 may be established according to any network quality metric.

In yet another embodiment, the threshold criteria is based on a comparison of network distances. For example, the data transmission system 110 may define a first network distance as the network distance between the source and destination computing devices 102A and 102B over the public network 104, and define a second network distance as total network distance of a communications path that the source and destination computing devices 102A and 102B would use to communicate, if the data transmission system 110 were employed for that communication (e.g., sum of the network distances between the source computing device 102A and a first endpoint 114, the first endpoint 114 and a second endpoint 114, and the second endpoint 114 and the destination computing device 102B). The data transmission system 110 may further establish threshold criteria specifying that if the first network distance is greater than the second network distance, the threshold criteria are not satisfied. As in the examples above, threshold criteria regarding these communication paths may be established according to any network quality metric.

On determining that the threshold criteria is not satisfied (and thus, that use of the data transmission system 110 is not likely to increase the rate of data transmission between the source and destination computing devices 102A and 102B), the endpoint selector 118A may return to the source computing device 102A instructions to communicate with the destination computing device 102B at least partially outside of the private network 112, for example via traditional communication protocols and over an existing network between the source and destination computing devices. Illustratively, where the endpoint selector 118A serves as a DNS resolver for the source computing device 102A, the endpoint selector 118A may return an network or IP address of the destination computing device 102B or another computing device in the public network 104 (e.g., rather than a network address of an endpoint 114), thereby causing the source computing device 102A to connect with the destination computing device 102B over the public network 102 utilizing convention communication techniques.

With reference to FIG. 6, one illustrative routine 600 for selecting a source-side endpoint 114 within the data transmission system 110 will be described. The routine 600 may be carried out, for example, by an endpoint selector 118 of FIG. 1, independently or in conjunction with other components of the data transmission system 110.

The routine 600 begins at block 602, where a request is received from a source computing device to initiate communication with a destination computing device. Illustratively, the request may be sent based on a configuration of the source computing device to utilize the data transmission system as a proxy for network communications. Further, the request may be sent as a part of a request to resolve a human-readable identifier (e.g., a URI) for the destination computing device into a network address (e.g., an IP address).

At block 604, the endpoint selector 118 analyzes the location data corresponding to the request, which may include locations of the source and destination computing devices as well as locations of endpoints 114 within the data transmission system 110 to which those devices may connect, to determine whether a set of threshold connection criteria are satisfied. In one embodiment, the threshold criteria may require that the source and destination computing devices are greater than a threshold network distance apart. This threshold network distance may be an absolute value (e.g., such that source and destination computing devices must be more than 100 ms in latency apart), or a relative value (e.g., such that the source and destination computing devices must be further apart in network distance than are the source device and an endpoint 114 closest to that source device). Any variety of threshold criteria may be used in an attempt to ensure that communications via the data transmission system 110 occurs in instances when that system is likely to increase data transmission speed, and that the data transmission system 110 is not utilized in other instances.

At block 606, if the endpoint selector 118 determines that the threshold criteria are not met, the routine proceeds to block 608, where the source computing device is instructed to communicate with the destination computing device at least partially outside of the private network (e.g., via traditional communication protocols and over an existing network between the source and destination computing devices). The routine 600 may then end at block 616.

Returning to block 606, if the endpoint selector 118 determines that the threshold criteria are met, the routine 600 proceeds to block 609, where the endpoint selector 118 determines whether a POP 120 is a preferred as communication point for the source computing device over an existing endpoint 114. Illustratively, a POP 120 may be a preferred communication point when the POP 120 is within a shorter network distance to the source computing device than any existing endpoint 114, when a high network quality exists between the POP 120 and the source computing device, or a combination thereof. In the instance that a POP 120 is not a preferred communication point relative to an existing endpoint 114, the routine 600 continues to block 610, where an identifier (e.g., a network address) of the closest existing endpoint 114 to the source computing device is returned to the source computing device. Thereafter, the source computing device may communicate with the destination computing device via existing endpoint 114, as described above. The routine 600 may then end at block 616.

Returning to block 609, if the endpoint selector 118 determines that a POP 120 is a preferred communication point for the source computing device than the existing endpoint 114, the routine 600 proceeds to block 612, where the endpoint selector 118 causes a new virtual endpoint 114 to be created at the POP 120. Illustratively, the endpoint selector 118 may transmit instructions to the POP 120 to provision a virtual machine with a device image including computer-executable instructions that, when executed by the virtual machine, cause the virtual machine to carry out the functionalities of an endpoint 114, as described herein. Thereafter, at block 614, the identifier of the newly created virtual endpoint 114 can be returned to the source computing device. The source computing device can then communicate with the destination computing device via existing endpoint 114, as described above. The routine 600 may then end at block 616.

One skilled in the art will appreciate that the routine 600 may include fewer or more interactions than described above. For example, in some embodiments, a determination of whether threshold criteria for use of the data transmission system 110 are met (e.g., at block 606) may also include identifying whether a POP 120 exists closer to the source computing device than an existing endpoint 114 (e.g., as described with reference to block 609). Thus, in some instances, the operations represented by these blocks may be combined, executed simultaneously, or reversed. Accordingly, the interactions of routine 600 are intended to be illustrative in nature, rather than exhaustive.

FIG. 7 depicts one embodiment of an architecture of a server 700 that may implement the endpoint selector 118 described herein. The general architecture of server 700 depicted in FIG. 7 includes an arrangement of computer hardware and software components that may be used to implement aspects of the present disclosure. As illustrated, the server 700 includes a processing unit 704, a network interface 706, a computer readable medium drive 707, an input/output device interface 720, a display 702, and an input device 724, all of which may communicate with one another by way of a communication bus. The network interface 706 may provide connectivity to one or more networks or computing systems, such as the public network 104 and/or private network 112 of FIG. 1. The processing unit 704 may thus receive information and instructions from other computing systems or services via a network. The processing unit 704 may also communicate to and from memory 710 and further provide output information for an optional display 702 via the input/output device interface 720. The input/output device interface 720 may also accept input from the optional input device 724, such as a keyboard, mouse, digital pen, etc. In some embodiments, the server 700 may include more (or fewer) components than those shown in FIG. 7. For example, some embodiments of the server 700 may omit the display 702 and input device 724, while providing input/output capabilities through one or more alternative communication channel (e.g., via the network interface 706).

The memory 710 may include computer program instructions that the processing unit 704 executes in order to implement one or more embodiments. The memory 710 generally includes RAM, ROM, and/or other persistent or non-transitory memory. The memory 710 may store an operating system 714 that provides computer program instructions for use by the processing unit 704 in the general administration and operation of the server 700. The memory 710 may further include computer program instructions and other information for implementing aspects of the present disclosure. For example, in one embodiment, the memory 710 includes user interface software 712 that generates user interfaces (and/or instructions therefor) for display upon a computing device, e.g., via a navigation interface such as a web browser installed on the computing device. In addition, memory 710 may include or communicate with one or more auxiliary data stores, such as data store 120.

In addition to the user interface module 712, the memory 710 may include endpoint selection software 716 that may be executed by the processing unit 704. In one embodiment, the endpoint selection software 716 implements various aspects of the present disclosure, e.g., receiving requests for data transmission via the data transmission system 110, to determining whether threshold criteria for use of the data transmission system 110 is met, and returning an identifier of an endpoint 114 within the data transmission system 110 when that threshold criteria is met. While the endpoint selection software 716 is shown in FIG. 7 as part of the server 700, in other embodiments, all or a portion of the software may be implemented individual or collectively by one or more alternative computing devices within the content delivery system 110, such as computing devices within each POP 120.

While FIG. 7 is described above with reference to implementing an endpoint selector 118, the server 700 may additionally or alternatively implement functionality corresponding to the endpoints 114 themselves. Illustratively, the memory 710 may include additional software (not shown in FIG. 7) that contains computer-executable instructions that, when executed by the server 700, causes the server 700 to implement aspects of the present disclosure, e.g., receiving data via a first stateful connection and transmitted data to an additional endpoint 114 or to a destination computing device via a second stateful connection. In other embodiments, all or a portion of the mitigation software may be implemented individually or collectively by one or more alternative computing devices within the content delivery system 110, such computing devices within each POP 120.

All of the methods and processes described above may be embodied in, and fully automated via, software code modules executed by computers or processors. The code modules may be stored in any type of non-transitory computer-readable medium or other computer storage device. Some or all of the methods may alternatively be embodied in specialized computer hardware.

Conditional language such as, among others, “can,” “could,” “might” or “may,” unless specifically stated otherwise, are otherwise understood within the context as used in general to present that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.

Disjunctive language such as the phrase “at least one of X, Y or Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to present that an item, term, etc., may be either X, Y or Z, or any combination thereof (e.g., X, Y and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y or at least one of Z to each be present.

Unless otherwise explicitly stated, articles such as ‘a’ or ‘an’ should generally be interpreted to include one or more described items. Accordingly, phrases such as “a device configured to” are intended to include one or more recited devices. Such one or more recited devices can also be collectively configured to carry out the stated recitations. For example, “a processor configured to carry out recitations A, B and C” can include a first processor configured to carry out recitation A working in conjunction with a second processor configured to carry out recitations B and C.

Any routine descriptions, elements or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or elements in the routine. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, or executed out of order from that shown or discussed, including substantially synchronously or in reverse order, depending on the functionality involved as would be understood by those skilled in the art.

It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims.

Claims

1. A system comprising: a plurality of network transmission endpoints, individual network transmission endpoints including a processor and memory and configured with computer-executable instructions to enable computing devices to transmit information to the individual network transmission endpoints for forwarding to at least one of another network transmission endpoint or a destination computing device;a point of presence (“POP”) comprising at least one computing device, the point of presence configured with computer-executable instructions to provision the at least one computing device with software enabling the at least one computing device to function as a virtual network transmission endpoint through which a first computing device communicates with a second computing device at least partly by transmitting first information to the virtual network transmission endpoint for forwarding to an additional endpoint from the plurality of network transmission endpoints and on to the second computing device; andone or more computing devices implementing an endpoint selector, the one or more computing devices configured with specific computer-executable instructions to: receive a request from the first computing device to transmit the first information through at least one of the plurality of network transmission endpoints for forwarding to the second computing device, wherein the request specifies the second computing device as a destination to which the first information should be transmitted;determine that a network distance between the first computing device and the plurality of network transmission endpoints does not satisfy a threshold distance;in response to determining that the network distance between the first computing device and the plurality of network transmission endpoints does not satisfy the threshold distance: select the POP, based at least partly on a network distance between the first computing device and the POP, as a location in which to generate the virtual network transmission endpoint through which the first computing device communicates with the second computing device at least partly by transmitting the first information to the virtual network transmission endpoint for forwarding to the additional endpoint and on to the second computing device; andtransmit instructions to the POP to provision the at least one computing device with the software enabling the at least one computing device to function as the virtual network transmission endpoint at least partly by receiving the first information from the first computing device to be forwarded to the additional endpoint and on to the second computing device, and forwarding the first information to the additional endpoint; andreturn an identifier of the POP to the first computing device;wherein the at least one computing device of the POP executes the software at least partly by receiving the first information from the first computing device to be forwarded to the additional endpoint and on to the second computing device, and forwarding the first information to the additional endpoint; andwherein the computer-executable instructions of the additional endpoint cause the additional endpoint to receive the first information from at least one computing device of the POP, and forward the communications to the second computing device.
2. The system of claim 1, wherein the at least one computing device of the POP and the first computing device are in communication via a stateful communication protocol.
3. The system of claim 2, wherein the stateful communication protocol is the transmission control protocol (TCP).
4. The system of claim 1, wherein provisioning the at least one computing device with the software enabling the at least one computing device to function as the virtual network transmission endpoint comprising implementing a virtual machine instance on the at least one computing device and provisioning the virtual machine instance with the software.
5. The system of claim 1, wherein receiving the first information from the first computing device to be forwarded to the additional endpoint and on to the second computing device occurs via a public communication network, and wherein forwarding the the first information to the additional endpoint occurs via a private network not directly accessible by the first computing device.
6. The system of claim 1, wherein receiving the first information from the first computing device to be forwarded to the additional endpoint and on to the second computing device occurs via a first stateful connection, wherein forwarding the first information to the additional endpoint occurs via a second stateful connection, and wherein forwarding the first information from the additional endpoint to the second computing device occurs via a third stateful connection.
7. A computer-implemented method comprising: as implemented by a computing device executing specific computer-executable instructions for implementing an endpoint selector within a data transmission system; receiving a request from a first computing device to transmit information through the data transmission system for forwarding to a second computing device specified within the request as a destination to which the information should be transmitted, the data transmission system comprising at least one network transmission endpoint configured with computer-executable instructions to enable computing devices to transmit information to the individual network transmission endpoints for forwarding to at least one of another network transmission endpoint or a destination computing device;determining that a value of a network quality metric between the first computing device and the at least one network transmission endpoint does not satisfy a threshold value;in response to determining that the value of the network quality metric between the first computing device and the at least one network transmission endpoint does not satisfy a threshold value: selecting a point of presence (“POP”), based at least partly on a value of the network quality metric between the first computing device and the POP, as a location in which to generate a second network transmission endpoint through which the first computing device communicates with the second computing device at least partly by transmitting the information to the second network transmission endpoint for forwarding to the second computing device; andtransmitting instructions to the POP to provision a computing device of the POP with software enabling the computing device of the POP to function as the second network transmission endpoint at least partly by receiving the information from the first computing device to be forwarded to the second computing device, and forwarding the information to the second computing device; andreturning an identifier of the POP to the first computing device, wherein the first computing device utilizes the identifier of the POP to communicate with the second computing device via the data transmission system.
8. The computer-implemented method of claim 7 further comprising determining the value of the network quality metric between the POP and the first computing device based at least in part on historical information regarding data transmitted on the data transmission system.
9. The computer-implemented method of claim 7 further comprising determining the value of the network quality metric between the POP and the first computing device based at least in part on transmission of network probe data.
10. The computer-implemented method of claim 7, wherein the software enabling the computing device of the POP to function as the second network transmission endpoint configures the computing device of the POP to forward the first information to the second computing device at least partly by transmitting the information received from the first computing device to the at least one network transmission endpoint for forwarding to the second computing device.
11. The computer-implemented method of claim 10, wherein the software enabling the computing device of the POP to function as the second network transmission endpoint configures the computing device of the POP to select the at least one network transmission endpoint based at least in part on a network distance between the at least one network transmission endpoint and the second computing device.
12. The computer-implemented method of claim 7, wherein the network quality metric reflects at least one of a network distance between the first computing device and the at least one network transmission endpoint, a level of packet loss occurring on a network path between the first computing device and the at least one network transmission endpoint, a frequency of errors occurring on the network path, or an availability of the network path.
13. Non-transitory computer-readable media comprising computer-executable instructions that, when executed by a computing system, cause the computing system to: receive a request from a first computing device to send data through a data transmission system for forwarding to a destination computing device specified within the request, the data transmission system comprising at least one network transmission endpoint configured with computer-executable instructions to enable computing devices to transmit information to at least one of the network transmission endpoints for forwarding to at least one of another network transmission endpoint or the destination computing device;determine that a value of a network quality metric of a communication path between the first computing device and the at least one network transmission endpoint, does not satisfy a threshold value;in response to determining that the value of the network quality metric of the communication path between the first computing device and the at least one network transmission endpoint does not satisfy a threshold value: select a point of presence (“POP”), based at least partly on a value of the network quality metric of a communication path between the first computing device and the POP, as a location in which to generate a second network transmission endpoint through which the first computing device communicates with the destination computing device at least partly by transmitting the data to the second network transmission endpoint for forwarding to the second computing device; andtransmit instructions to the POP to provision a computing device of the POP with software enabling the computing device of the POP to function as the second network transmission endpoint at least partly by receiving the data from the first computing device to be forwarded to the second computing device, and forwarding the data to the second computing device; andreturn an identifier of the POP to the first computing device.
14. The non-transitory computer-readable media of claim 13, wherein the destination computing device implements a network-accessible service.
15. The non-transitory computer-readable media of claim 13, wherein the threshold value is determined based at least in part on a network distance between the first computing device and the destination computing device.
16. The non-transitory computer-readable media of claim 15, wherein the threshold value is further determined based at least in part on a network distance between the destination computing device and the at least one network transmission endpoint.
17. The non-transitory computer-readable media of claim 13, wherein the request from a first computing device comprises a request to resolve an identifier of the destination computing device, and wherein the identifier of the POP is returned as a response to the request to resolve the identifier of the destination computing device.
18. The non-transitory computer-readable media of claim 13, wherein the identifier of the POP is at least one of a network address or a uniform resource indicator.
19. The non-transitory computer-readable media of claim 13, wherein the computer-executable instructions further cause the computing system to detect that the first computing device has not communicated with the second network transmission endpoint for at least a threshold period of time, and to transmit instructions to the POP to deactivate the second network transmission endpoint.

US Referenced Citations (1424)

Number	Name	Date	Kind
5063500	Shorter	Nov 1991	A
5341477	Pitkin et al.	Aug 1994	A
5459837	Caccavale	Oct 1995	A
5611049	Pitts	Mar 1997	A
5701467	Freeston	Dec 1997	A
5764910	Shachar	Jun 1998	A
5774660	Brendel et al.	Jun 1998	A
5852717	Bhide et al.	Dec 1998	A
5892914	Pitts	Apr 1999	A
5893116	Simmonds et al.	Apr 1999	A
5895462	Toki	Apr 1999	A
5905248	Russell et al.	May 1999	A
5933811	Angles et al.	Aug 1999	A
5937427	Shinagawa et al.	Aug 1999	A
5974454	Apfel et al.	Oct 1999	A
5991306	Burns et al.	Nov 1999	A
5999274	Lee et al.	Dec 1999	A
6016512	Huitema	Jan 2000	A
6018619	Allard et al.	Jan 2000	A
6026452	Pitts	Feb 2000	A
6038601	Lambert et al.	Mar 2000	A
6052718	Gifford	Apr 2000	A
6078960	Ballard	Jun 2000	A
6085234	Pitts et al.	Jul 2000	A
6092100	Berstis et al.	Jul 2000	A
6098096	Tsirigotis et al.	Aug 2000	A
6108703	Leighton et al.	Aug 2000	A
6128279	O'Neil et al.	Oct 2000	A
6151631	Ansell et al.	Nov 2000	A
6157942	Chu et al.	Dec 2000	A
6167438	Yates et al.	Dec 2000	A
6167446	Lister et al.	Dec 2000	A
6173316	De Boor et al.	Jan 2001	B1
6182111	Inohara et al.	Jan 2001	B1
6182125	Borella et al.	Jan 2001	B1
6185598	Farber et al.	Feb 2001	B1
6192051	Lipman et al.	Feb 2001	B1
6205475	Pitts	Mar 2001	B1
6223288	Byrne	Apr 2001	B1
6243761	Mogul et al.	Jun 2001	B1
6275496	Burns et al.	Aug 2001	B1
6286043	Cuomo et al.	Sep 2001	B1
6286084	Wexler et al.	Sep 2001	B1
6304913	Rune	Oct 2001	B1
6324580	Jindal et al.	Nov 2001	B1
6330602	Law et al.	Dec 2001	B1
6338082	Schneider	Jan 2002	B1
6345308	Abe	Feb 2002	B1
6351743	DeArdo et al.	Feb 2002	B1
6351775	Yu	Feb 2002	B1
6363411	Dugan et al.	Mar 2002	B1
6366952	Pitts	Apr 2002	B2
6374290	Scharber et al.	Apr 2002	B1
6377257	Borrel et al.	Apr 2002	B1
6386043	Millins	May 2002	B1
6389532	Gupta et al.	May 2002	B1
6405252	Gupta et al.	Jun 2002	B1
6408360	Chamberlain et al.	Jun 2002	B1
6411967	Van Renesse	Jun 2002	B1
6415280	Farber et al.	Jul 2002	B1
6430607	Kavner	Aug 2002	B1
6438592	Killian	Aug 2002	B1
6442165	Sitaraman et al.	Aug 2002	B1
6452925	Sistanizadeh et al.	Sep 2002	B1
6457047	Chandra et al.	Sep 2002	B1
6459909	Bilcliff et al.	Oct 2002	B1
6473804	Kaiser et al.	Oct 2002	B1
6484143	Swildens et al.	Nov 2002	B1
6484161	Chipalkatti et al.	Nov 2002	B1
6493765	Cunningham et al.	Dec 2002	B1
6505241	Pitts	Jan 2003	B2
6523036	Hickman et al.	Feb 2003	B1
6529910	Fleskes	Mar 2003	B1
6529953	Van Renesse	Mar 2003	B1
6553413	Leighton et al.	Apr 2003	B1
6560610	Eatherton et al.	May 2003	B1
6611873	Kanehara	Aug 2003	B1
6622168	Datta	Sep 2003	B1
6643357	Lumsden	Nov 2003	B2
6643707	Booth	Nov 2003	B1
6654807	Farber et al.	Nov 2003	B2
6658462	Dutta	Dec 2003	B1
6665706	Kenner et al.	Dec 2003	B2
6678717	Schneider	Jan 2004	B1
6678791	Jacobs et al.	Jan 2004	B1
6681282	Golden et al.	Jan 2004	B1
6687846	Adrangi et al.	Feb 2004	B1
6694358	Swildens et al.	Feb 2004	B1
6697805	Choquier et al.	Feb 2004	B1
6718324	Edlund et al.	Apr 2004	B2
6724770	Van Renesse	Apr 2004	B1
6732237	Jacobs et al.	May 2004	B1
6754699	Swildens et al.	Jun 2004	B2
6754706	Swildens et al.	Jun 2004	B1
6760721	Chasen et al.	Jul 2004	B1
6769031	Bero	Jul 2004	B1
6782398	Bahl	Aug 2004	B1
6785704	McCanne	Aug 2004	B1
6795434	Kumar et al.	Sep 2004	B1
6799214	Li	Sep 2004	B1
6804706	Pitts	Oct 2004	B2
6810291	Card et al.	Oct 2004	B2
6810411	Coughlin et al.	Oct 2004	B1
6829654	Jungck	Dec 2004	B1
6862607	Vermeulen	Mar 2005	B1
6868439	Basu et al.	Mar 2005	B2
6874017	Inoue et al.	Mar 2005	B1
6917951	Orbits et al.	Jul 2005	B2
6925499	Chen et al.	Aug 2005	B1
6928467	Peng et al.	Aug 2005	B2
6928485	Krishnamurthy et al.	Aug 2005	B1
6941562	Gao et al.	Sep 2005	B2
6950848	Yousefi'zadeh et al.	Sep 2005	B1
6963850	Bezos et al.	Nov 2005	B1
6976090	Ben-Shaul et al.	Dec 2005	B2
6981017	Kasriel et al.	Dec 2005	B1
6985945	Farhat et al.	Jan 2006	B2
6986018	O'Rourke et al.	Jan 2006	B2
6990526	Zhu	Jan 2006	B1
6996616	Leighton et al.	Feb 2006	B1
7003555	Jungck	Feb 2006	B1
7006099	Gut et al.	Feb 2006	B2
7007089	Freedman	Feb 2006	B2
7010578	Lewin et al.	Mar 2006	B1
7010598	Sitaraman et al.	Mar 2006	B2
7024466	Outten et al.	Apr 2006	B2
7027582	Khello et al.	Apr 2006	B2
7031445	Lumsden	Apr 2006	B2
7032010	Swildens et al.	Apr 2006	B1
7058633	Gnagy et al.	Jun 2006	B1
7058706	Iyer et al.	Jun 2006	B1
7058953	Willard et al.	Jun 2006	B2
7065587	Huitema et al.	Jun 2006	B2
7072982	Teodosiu et al.	Jul 2006	B2
7076633	Tormasov et al.	Jul 2006	B2
7082476	Cohen et al.	Jul 2006	B1
7086061	Joshi et al.	Aug 2006	B1
7092505	Allison et al.	Aug 2006	B2
7092997	Kasriel et al.	Aug 2006	B1
7096266	Lewin et al.	Aug 2006	B2
7099936	Chase et al.	Aug 2006	B2
7103645	Leighton et al.	Sep 2006	B2
7114160	Suryanarayana et al.	Sep 2006	B2
7117262	Bai et al.	Oct 2006	B2
7133905	Dilley et al.	Nov 2006	B2
7136922	Sundaram et al.	Nov 2006	B2
7139808	Anderson et al.	Nov 2006	B2
7139821	Shah et al.	Nov 2006	B1
7143169	Champagne et al.	Nov 2006	B1
7143170	Swildens et al.	Nov 2006	B2
7146560	Dang et al.	Dec 2006	B2
7149809	Barde et al.	Dec 2006	B2
7152118	Anderson, IV et al.	Dec 2006	B2
7162539	Garcie-Luna-Aceves	Jan 2007	B2
7174382	Ramanathan et al.	Feb 2007	B2
7185046	Ferstl et al.	Feb 2007	B2
7185063	Kasriel et al.	Feb 2007	B1
7185084	Sirivara et al.	Feb 2007	B2
7188214	Kasriel et al.	Mar 2007	B1
7194522	Swildens et al.	Mar 2007	B1
7194552	Schneider	Mar 2007	B1
7200667	Teodosiu et al.	Apr 2007	B2
7216170	Ludvig et al.	May 2007	B2
7225254	Swildens et al.	May 2007	B1
7228350	Hong et al.	Jun 2007	B2
7228359	Monteiro	Jun 2007	B1
7233978	Overton et al.	Jun 2007	B2
7240100	Wein et al.	Jul 2007	B1
7249196	Peiffer et al.	Jul 2007	B1
7251675	Kamakura et al.	Jul 2007	B1
7254626	Kommula et al.	Aug 2007	B1
7254636	O'Toole, Jr. et al.	Aug 2007	B1
7257581	Steele et al.	Aug 2007	B1
7260598	Liskov et al.	Aug 2007	B1
7260639	Afergan et al.	Aug 2007	B2
7269784	Kasriel et al.	Sep 2007	B1
7272227	Beran	Sep 2007	B1
7274658	Bornstein et al.	Sep 2007	B2
7284056	Ramig	Oct 2007	B2
7289519	Liskov	Oct 2007	B1
7293093	Leighton	Nov 2007	B2
7308499	Chavez	Dec 2007	B2
7310686	Uysal	Dec 2007	B2
7316648	Kelly et al.	Jan 2008	B2
7318074	Iyengar et al.	Jan 2008	B2
7320131	O'Toole, Jr.	Jan 2008	B1
7321918	Burd et al.	Jan 2008	B2
7337968	Wilz, Sr. et al.	Mar 2008	B2
7339937	Mitra et al.	Mar 2008	B2
7340505	Lisiecki et al.	Mar 2008	B2
7363291	Page	Apr 2008	B1
7363626	Koutharapu et al.	Apr 2008	B2
7370089	Boyd et al.	May 2008	B2
7372809	Chen	May 2008	B2
7373416	Kagan et al.	May 2008	B2
7376736	Sundaram et al.	May 2008	B2
7380078	Ikegaya et al.	May 2008	B2
7389354	Sitaraman et al.	Jun 2008	B1
7392236	Rusch et al.	Jun 2008	B2
7398301	Hennessey et al.	Jul 2008	B2
7406512	Swildens et al.	Jul 2008	B2
7406522	Riddle	Jul 2008	B2
7409712	Brooks et al.	Aug 2008	B1
7430610	Pace et al.	Sep 2008	B2
7441045	Skene et al.	Oct 2008	B2
7441261	Slater et al.	Oct 2008	B2
7454457	Lowery et al.	Nov 2008	B1
7454500	Hsu et al.	Nov 2008	B1
7461170	Taylor et al.	Dec 2008	B1
7464142	Flurry et al.	Dec 2008	B2
7478148	Neerdaels	Jan 2009	B2
7492720	Pruthi et al.	Feb 2009	B2
7496651	Joshi	Feb 2009	B1
7499998	Toebes et al.	Mar 2009	B2
7502836	Menditto et al.	Mar 2009	B1
7505464	Okmianski et al.	Mar 2009	B2
7506034	Coates et al.	Mar 2009	B2
7519720	Fishman et al.	Apr 2009	B2
7519726	Palliyil et al.	Apr 2009	B2
7523181	Swildens et al.	Apr 2009	B2
7543024	Holstege	Jun 2009	B2
7548947	Kasriel et al.	Jun 2009	B2
7552235	Chase et al.	Jun 2009	B2
7555542	Ayers et al.	Jun 2009	B1
7561571	Lovett et al.	Jul 2009	B1
7565407	Hayball	Jul 2009	B1
7568032	Feng et al.	Jul 2009	B2
7573916	Bechtolsheim et al.	Aug 2009	B1
7574499	Swildens et al.	Aug 2009	B1
7581009	Hsu et al.	Aug 2009	B1
7593935	Sullivan	Sep 2009	B2
7594189	Walker et al.	Sep 2009	B1
7596619	Leighton et al.	Sep 2009	B2
7617222	Coulthard et al.	Nov 2009	B2
7623460	Miyazaki	Nov 2009	B2
7624169	Lisiecki et al.	Nov 2009	B2
7631101	Sullivan et al.	Dec 2009	B2
7640296	Fuchs et al.	Dec 2009	B2
7650376	Blumenau	Jan 2010	B1
7653700	Bahl et al.	Jan 2010	B1
7653725	Yahiro et al.	Jan 2010	B2
7657613	Hanson et al.	Feb 2010	B1
7657622	Douglis et al.	Feb 2010	B1
7661027	Langen et al.	Feb 2010	B2
7664831	Cartmell et al.	Feb 2010	B2
7664879	Chan et al.	Feb 2010	B2
7676570	Levy et al.	Mar 2010	B2
7680897	Carter et al.	Mar 2010	B1
7684394	Cutbill et al.	Mar 2010	B1
7685109	Ransil et al.	Mar 2010	B1
7685251	Houlihan et al.	Mar 2010	B2
7693813	Cao et al.	Apr 2010	B1
7693959	Leighton et al.	Apr 2010	B2
7702724	Brydon et al.	Apr 2010	B1
7706740	Collins et al.	Apr 2010	B2
7707314	McCarthy et al.	Apr 2010	B2
7711647	Gunaseelan et al.	May 2010	B2
7711788	Lev Ran et al.	May 2010	B2
7716367	Leighton et al.	May 2010	B1
7725602	Liu et al.	May 2010	B2
7730187	Raciborski et al.	Jun 2010	B2
7739400	Lindbo et al.	Jun 2010	B2
7747720	Toebes et al.	Jun 2010	B2
7756913	Day	Jul 2010	B1
7756965	Joshi	Jul 2010	B2
7757202	Dahlsted et al.	Jul 2010	B2
7761572	Auerbach	Jul 2010	B1
7765304	Davis et al.	Jul 2010	B2
7769823	Jenny et al.	Aug 2010	B2
7773596	Marques	Aug 2010	B1
7774342	Virdy	Aug 2010	B1
7783727	Foley et al.	Aug 2010	B1
7787380	Aggarwal et al.	Aug 2010	B1
7792989	Toebes et al.	Sep 2010	B2
7805516	Kettler et al.	Sep 2010	B2
7809597	Das et al.	Oct 2010	B2
7813308	Reddy et al.	Oct 2010	B2
7814229	Cabrera et al.	Oct 2010	B1
7818454	Kim et al.	Oct 2010	B2
7827256	Phillips et al.	Nov 2010	B2
7836177	Kasriel et al.	Nov 2010	B2
7853719	Cao et al.	Dec 2010	B1
7865594	Baumback et al.	Jan 2011	B1
7865953	Hsieh et al.	Jan 2011	B1
7873065	Mukerji et al.	Jan 2011	B1
7890612	Todd et al.	Feb 2011	B2
7899899	Joshi	Mar 2011	B2
7904875	Hegyi	Mar 2011	B2
7912921	O'Rourke et al.	Mar 2011	B2
7925782	Sivasubramanian et al.	Apr 2011	B2
7930393	Baumback et al.	Apr 2011	B1
7930402	Swildens et al.	Apr 2011	B2
7930427	Josefsberg et al.	Apr 2011	B2
7933988	Nasuto et al.	Apr 2011	B2
7937477	Day et al.	May 2011	B1
7945693	Farber et al.	May 2011	B2
7949779	Farber et al.	May 2011	B2
7958222	Pruitt et al.	Jun 2011	B1
7958258	Yeung et al.	Jun 2011	B2
7962597	Richardson et al.	Jun 2011	B2
7966404	Hedin et al.	Jun 2011	B2
7970816	Chess et al.	Jun 2011	B2
7970940	van de Ven et al.	Jun 2011	B1
7979509	Malmskog et al.	Jul 2011	B1
7991910	Richardson et al.	Aug 2011	B2
7996533	Leighton et al.	Aug 2011	B2
7996535	Auerbach	Aug 2011	B2
8000724	Rayburn et al.	Aug 2011	B1
8001187	Stochosky	Aug 2011	B2
8010707	Elzur et al.	Aug 2011	B2
8019869	Kriegsman	Sep 2011	B2
8024441	Kommula et al.	Sep 2011	B2
8028090	Richardson et al.	Sep 2011	B2
8041773	Abu-Ghazaleh et al.	Oct 2011	B2
8041809	Sundaram et al.	Oct 2011	B2
8041818	Gupta et al.	Oct 2011	B2
8042054	White et al.	Oct 2011	B2
8065275	Eriksen et al.	Nov 2011	B2
8069231	Schran et al.	Nov 2011	B2
8073940	Richardson et al.	Dec 2011	B1
8082348	Averbuj et al.	Dec 2011	B1
8108623	Krishnaprasad et al.	Jan 2012	B2
8117306	Baumback et al.	Feb 2012	B1
8122098	Richardson et al.	Feb 2012	B1
8122124	Baumback et al.	Feb 2012	B1
8132242	Wu	Mar 2012	B1
8135820	Richardson et al.	Mar 2012	B2
8156199	Hoche-Mong et al.	Apr 2012	B1
8156243	Richardson et al.	Apr 2012	B2
8175863	Ostermeyer et al.	May 2012	B1
8190682	Paterson-Jones et al.	May 2012	B2
8195837	McCarthy et al.	Jun 2012	B2
8209695	Pruyne et al.	Jun 2012	B1
8224971	Miller et al.	Jul 2012	B1
8224986	Liskov et al.	Jul 2012	B1
8224994	Schneider	Jul 2012	B1
8234403	Richardson et al.	Jul 2012	B2
8239530	Sundaram et al.	Aug 2012	B2
8250135	Driesen et al.	Aug 2012	B2
8250211	Swildens et al.	Aug 2012	B2
8250219	Raciborski et al.	Aug 2012	B2
8266288	Banerjee et al.	Sep 2012	B2
8266327	Kumar et al.	Sep 2012	B2
8271471	Kamvar et al.	Sep 2012	B1
8280998	Joshi	Oct 2012	B2
8281035	Farber et al.	Oct 2012	B2
8291046	Farber et al.	Oct 2012	B2
8291117	Eggleston et al.	Oct 2012	B1
8296393	Alexander et al.	Oct 2012	B2
8301600	Helmick et al.	Oct 2012	B1
8301645	Crook	Oct 2012	B1
8321568	Sivasubramanian et al.	Nov 2012	B2
8356074	Ehrlich et al.	Jan 2013	B1
8380831	Barber	Feb 2013	B2
8380851	McCarthy et al.	Feb 2013	B2
8392928	Forys et al.	Mar 2013	B1
8402137	Sivasuramanian et al.	Mar 2013	B2
8423408	Barnes et al.	Apr 2013	B1
8423662	Weihl et al.	Apr 2013	B1
8433749	Wee et al.	Apr 2013	B2
8443167	Fallone et al.	May 2013	B1
8447831	Sivasubramanian et al.	May 2013	B1
8447876	Verma et al.	May 2013	B2
8452745	Ramakrishna	May 2013	B2
8452874	MacCarthaigh et al.	May 2013	B2
8463877	Richardson	Jun 2013	B1
8468222	Sakata et al.	Jun 2013	B2
8468245	Farber et al.	Jun 2013	B2
8473613	Farber et al.	Jun 2013	B2
8478903	Farber et al.	Jul 2013	B2
8504721	Hsu et al.	Aug 2013	B2
8510428	Joshi	Aug 2013	B2
8510807	Elazary et al.	Aug 2013	B1
8521851	Richardson et al.	Aug 2013	B1
8521876	Goodman et al.	Aug 2013	B2
8521880	Richardson et al.	Aug 2013	B1
8521885	Richardson et al.	Aug 2013	B1
8521908	Holmes et al.	Aug 2013	B2
8526405	Curtis et al.	Sep 2013	B2
8527639	Liskov et al.	Sep 2013	B1
8527645	Proffit et al.	Sep 2013	B1
8527658	Holmes et al.	Sep 2013	B2
8549646	Stavrou et al.	Oct 2013	B2
8572208	Farber et al.	Oct 2013	B2
8572210	Farber et al.	Oct 2013	B2
8577992	Richardson et al.	Nov 2013	B1
8589996	Ma et al.	Nov 2013	B2
8606996	Richardson et al.	Dec 2013	B2
8612565	Schneider	Dec 2013	B2
8615549	Knowles et al.	Dec 2013	B2
8619780	Brandwine	Dec 2013	B1
8626950	Richardson et al.	Jan 2014	B1
8635340	Schneider	Jan 2014	B1
8639817	Sivasubramanian et al.	Jan 2014	B2
8645539	McCarthy et al.	Feb 2014	B2
8676918	Richardson et al.	Mar 2014	B2
8683023	Brandwine et al.	Mar 2014	B1
8683076	Farber et al.	Mar 2014	B2
8688837	Richardson et al.	Apr 2014	B1
8712950	Smith et al.	Apr 2014	B2
8732309	Richardson et al.	May 2014	B1
8745177	Kazerani et al.	Jun 2014	B1
8756322	Lynch	Jun 2014	B1
8756325	Sivasubramanian et al.	Jun 2014	B2
8756341	Richardson et al.	Jun 2014	B1
8782236	Marshall et al.	Jul 2014	B1
8782279	Eggleston et al.	Jul 2014	B2
8812727	Sorenson, III et al.	Aug 2014	B1
8819283	Richardson et al.	Aug 2014	B2
8826032	Yahalom et al.	Sep 2014	B1
8904009	Marshall et al.	Dec 2014	B1
8914514	Jenkins et al.	Dec 2014	B1
8924528	Richardson et al.	Dec 2014	B1
8930513	Richardson et al.	Jan 2015	B1
8930544	Richardson et al.	Jan 2015	B2
8935744	Osterweil	Jan 2015	B2
8938526	Richardson et al.	Jan 2015	B1
8949161	Borst et al.	Feb 2015	B2
8949459	Scholl	Feb 2015	B1
8966318	Shah	Feb 2015	B1
8972580	Fleischman	Mar 2015	B2
9003035	Richardson	Apr 2015	B1
9003040	MacCarthaigh et al.	Apr 2015	B2
9009286	Sivasubramanian et al.	Apr 2015	B2
9009334	Jenkins et al.	Apr 2015	B1
9021127	Richardson et al.	Apr 2015	B2
9021128	Sivasubramanian	Apr 2015	B2
9021129	Richardson et al.	Apr 2015	B2
9026616	Sivasubramanian et al.	May 2015	B2
9037975	Taylor et al.	May 2015	B1
9075777	Pope et al.	Jul 2015	B1
9075893	Jenkins	Jul 2015	B1
9083675	Richardson et al.	Jul 2015	B2
9083743	Patel et al.	Jul 2015	B1
9106701	Richardson et al.	Aug 2015	B2
9116803	Agrawal et al.	Aug 2015	B1
9130756	Richardson et al.	Sep 2015	B2
9130977	Zisapel et al.	Sep 2015	B2
9137302	Makhijani et al.	Sep 2015	B1
9154551	Watson	Oct 2015	B1
9160703	Richardson et al.	Oct 2015	B2
9172674	Patel et al.	Oct 2015	B1
9176894	Marshall et al.	Nov 2015	B2
9185012	Richardson et al.	Nov 2015	B2
9191338	Richardson et al.	Nov 2015	B2
9191458	Richardson et al.	Nov 2015	B2
9195996	Walsh et al.	Nov 2015	B1
9208097	Richardson et al.	Dec 2015	B2
9210235	Sivasubramanian et al.	Dec 2015	B2
9237087	Risbood et al.	Jan 2016	B1
9237114	Richardson et al.	Jan 2016	B2
9240954	Ellsworth et al.	Jan 2016	B1
9246776	Ellsworth et al.	Jan 2016	B2
9251112	Richardson et al.	Feb 2016	B2
9253065	Richardson et al.	Feb 2016	B2
9276812	Nagargadde et al.	Mar 2016	B1
9294391	Mostert	Mar 2016	B1
9323577	Marr et al.	Apr 2016	B2
9332078	Sivasubramanian et al.	May 2016	B2
9386038	Martini	Jul 2016	B2
9391949	Richardson et al.	Jul 2016	B1
9407676	Archer et al.	Aug 2016	B2
9407681	Richardson et al.	Aug 2016	B1
9407699	Sivasubramanian et al.	Aug 2016	B2
9444718	Khakpour et al.	Sep 2016	B2
9444759	Richardson et al.	Sep 2016	B2
9479476	Richardson et al.	Oct 2016	B2
9495338	Hollis et al.	Nov 2016	B1
9497259	Richardson et al.	Nov 2016	B1
9515949	Richardson et al.	Dec 2016	B2
9525659	Sonkin et al.	Dec 2016	B1
9544394	Richardson et al.	Jan 2017	B2
9571389	Richardson et al.	Feb 2017	B2
9584328	Graham-cumming	Feb 2017	B1
9590946	Richardson et al.	Mar 2017	B2
9608957	Sivasubramanian et al.	Mar 2017	B2
9621660	Sivasubramanian et al.	Apr 2017	B2
9628509	Holloway et al.	Apr 2017	B2
9628554	Marshall et al.	Apr 2017	B2
9645808	Turpie	May 2017	B1
9703713	Nadgowda	Jul 2017	B2
9705922	Foxhoven et al.	Jul 2017	B2
9712325	Richardson et al.	Jul 2017	B2
9712484	Richardson et al.	Jul 2017	B1
9734472	Richardson et al.	Aug 2017	B2
9742795	Radlein et al.	Aug 2017	B1
9760420	Letz et al.	Sep 2017	B1
9774619	Radlein et al.	Sep 2017	B1
9787599	Richardson et al.	Oct 2017	B2
9787775	Richardson et al.	Oct 2017	B1
9794216	Richardson et al.	Oct 2017	B2
9794281	Radlein et al.	Oct 2017	B1
9800539	Richardson et al.	Oct 2017	B2
9811451	Arguelles et al.	Nov 2017	B1
9819567	Uppal et al.	Nov 2017	B1
9832141	Raftery	Nov 2017	B1
9871794	Joffe et al.	Jan 2018	B2
9887914	Bergman	Feb 2018	B2
9887915	Richardson et al.	Feb 2018	B2
9887931	Uppal et al.	Feb 2018	B1
9887932	Uppal et al.	Feb 2018	B1
9888089	Sivasubramanian et al.	Feb 2018	B2
9893957	Ellsworth et al.	Feb 2018	B2
9894168	Sivasubramanian et al.	Feb 2018	B2
9900402	Li et al.	Feb 2018	B1
9912740	Richardson et al.	Mar 2018	B2
9929959	Mostert	Mar 2018	B2
9930131	MacCarthaigh et al.	Mar 2018	B2
9954934	Sivasubramanian et al.	Apr 2018	B2
9985927	Richardson et al.	May 2018	B2
9992086	Mizik et al.	Jun 2018	B1
9992303	Richardson et al.	Jun 2018	B2
10015237	Richardson et al.	Jul 2018	B2
10015241	Marr et al.	Jul 2018	B2
10021179	Velummylum et al.	Jul 2018	B1
10027582	Richardson et al.	Jul 2018	B2
10033627	Howard et al.	Jul 2018	B1
10033691	Mizik et al.	Jul 2018	B1
10049051	Baldwin	Aug 2018	B1
10075551	Baldwin et al.	Sep 2018	B1
10079742	Richardson et al.	Sep 2018	B1
10091096	Howard et al.	Oct 2018	B1
10097398	Richardson et al.	Oct 2018	B1
10097448	Howard et al.	Oct 2018	B1
10097566	Radlein et al.	Oct 2018	B1
10110694	Watson et al.	Oct 2018	B1
10116584	Richardson et al.	Oct 2018	B2
10135620	Richardson et al.	Nov 2018	B2
10157135	Richardson et al.	Dec 2018	B2
10158729	Sivasubramanian et al.	Dec 2018	B2
10162753	Marshall et al.	Dec 2018	B2
10180993	Raftery	Jan 2019	B2
20010000811	May et al.	May 2001	A1
20010025305	Yoshiasa et al.	Sep 2001	A1
20010027479	Delaney et al.	Oct 2001	A1
20010032133	Moran	Oct 2001	A1
20010034704	Farhat et al.	Oct 2001	A1
20010049741	Skene et al.	Dec 2001	A1
20010052016	Skene et al.	Dec 2001	A1
20010056416	Garcia-Luna-Aceves	Dec 2001	A1
20010056500	Farber et al.	Dec 2001	A1
20020002613	Freeman et al.	Jan 2002	A1
20020004846	Garcia-Luna-Aceves et al.	Jan 2002	A1
20020007413	Garcia-Luna-Aceves et al.	Jan 2002	A1
20020010783	Primak et al.	Jan 2002	A1
20020010798	Ben-Shaul et al.	Jan 2002	A1
20020035624	Jun-Hyeong	Mar 2002	A1
20020048269	Hong et al.	Apr 2002	A1
20020049608	Hartsell et al.	Apr 2002	A1
20020049842	Huetsch et al.	Apr 2002	A1
20020049857	Farber et al.	Apr 2002	A1
20020052942	Swildens et al.	May 2002	A1
20020062372	Hong et al.	May 2002	A1
20020065910	Dutta	May 2002	A1
20020068554	Dusse	Jun 2002	A1
20020069420	Russell et al.	Jun 2002	A1
20020078233	Biliris et al.	Jun 2002	A1
20020082858	Heddaya et al.	Jun 2002	A1
20020083118	Sim	Jun 2002	A1
20020083148	Shaw et al.	Jun 2002	A1
20020083178	Brothers	Jun 2002	A1
20020083198	Kim et al.	Jun 2002	A1
20020087374	Boubez et al.	Jul 2002	A1
20020091786	Yamaguchi et al.	Jul 2002	A1
20020091801	Lewin et al.	Jul 2002	A1
20020092026	Janniello et al.	Jul 2002	A1
20020099616	Sweldens	Jul 2002	A1
20020099850	Farber et al.	Jul 2002	A1
20020101836	Dorenbosch	Aug 2002	A1
20020103820	Cartmell et al.	Aug 2002	A1
20020103972	Satran et al.	Aug 2002	A1
20020107944	Bai et al.	Aug 2002	A1
20020112049	Elnozahy et al.	Aug 2002	A1
20020112123	Becker et al.	Aug 2002	A1
20020116481	Lee	Aug 2002	A1
20020116491	Boyd et al.	Aug 2002	A1
20020116582	Copeland et al.	Aug 2002	A1
20020120666	Landsman et al.	Aug 2002	A1
20020120782	Dillon et al.	Aug 2002	A1
20020124047	Gartner et al.	Sep 2002	A1
20020124098	Shaw	Sep 2002	A1
20020129123	Johnson et al.	Sep 2002	A1
20020131428	Pecus et al.	Sep 2002	A1
20020133741	Maeda et al.	Sep 2002	A1
20020135611	Deosaran et al.	Sep 2002	A1
20020138286	Engstrom	Sep 2002	A1
20020138437	Lewin et al.	Sep 2002	A1
20020138443	Schran et al.	Sep 2002	A1
20020138649	Cartmell et al.	Sep 2002	A1
20020143675	Orshan	Oct 2002	A1
20020143798	Lisiecki et al.	Oct 2002	A1
20020143989	Huitema et al.	Oct 2002	A1
20020145993	Chowdhury et al.	Oct 2002	A1
20020147770	Tang	Oct 2002	A1
20020147774	Lisiecki et al.	Oct 2002	A1
20020150094	Cheng et al.	Oct 2002	A1
20020150276	Chang	Oct 2002	A1
20020152326	Orshan	Oct 2002	A1
20020154157	Sherr et al.	Oct 2002	A1
20020156884	Bertram et al.	Oct 2002	A1
20020156911	Croman et al.	Oct 2002	A1
20020161745	Call	Oct 2002	A1
20020161767	Shapiro et al.	Oct 2002	A1
20020163882	Bornstein et al.	Nov 2002	A1
20020165912	Wenocur et al.	Nov 2002	A1
20020169890	Beaumont et al.	Nov 2002	A1
20020184368	Wang	Dec 2002	A1
20020188722	Banerjee et al.	Dec 2002	A1
20020194324	Guha	Dec 2002	A1
20020194382	Kausik et al.	Dec 2002	A1
20020198953	O'Rourke et al.	Dec 2002	A1
20030002484	Freedman	Jan 2003	A1
20030004998	Datta	Jan 2003	A1
20030005036	Mitzenmacher	Jan 2003	A1
20030005111	Allan	Jan 2003	A1
20030007482	Khello et al.	Jan 2003	A1
20030009488	Hart, III	Jan 2003	A1
20030009591	Hayball et al.	Jan 2003	A1
20030026410	Lumsden	Feb 2003	A1
20030028642	Agarwal et al.	Feb 2003	A1
20030033283	Evans et al.	Feb 2003	A1
20030037108	Peiffer et al.	Feb 2003	A1
20030037139	Shteyn	Feb 2003	A1
20030037284	Srinivasan et al.	Feb 2003	A1
20030041094	Lara et al.	Feb 2003	A1
20030046343	Krishnamurthy et al.	Mar 2003	A1
20030065739	Shnier	Apr 2003	A1
20030070096	Pazi	Apr 2003	A1
20030074401	Connell et al.	Apr 2003	A1
20030074471	Anderson et al.	Apr 2003	A1
20030074472	Lucco et al.	Apr 2003	A1
20030079027	Slocombe et al.	Apr 2003	A1
20030093523	Cranor et al.	May 2003	A1
20030099202	Lear et al.	May 2003	A1
20030099237	Mitra et al.	May 2003	A1
20030101278	Garcia-Luna-Aceves et al.	May 2003	A1
20030105829	Hayward	Jun 2003	A1
20030105857	Kamen et al.	Jun 2003	A1
20030112792	Cranor et al.	Jun 2003	A1
20030120741	Wu et al.	Jun 2003	A1
20030126387	Watanabe	Jul 2003	A1
20030133554	Nykanen et al.	Jul 2003	A1
20030135467	Okamoto	Jul 2003	A1
20030135509	Davis et al.	Jul 2003	A1
20030140087	Lincoln et al.	Jul 2003	A1
20030145038	Tariq et al.	Jul 2003	A1
20030145066	Okada et al.	Jul 2003	A1
20030149581	Chaudhri et al.	Aug 2003	A1
20030154239	Davis et al.	Aug 2003	A1
20030154284	Bernardin et al.	Aug 2003	A1
20030163722	Anderson, IV	Aug 2003	A1
20030172145	Nguyen	Sep 2003	A1
20030172183	Anderson, IV et al.	Sep 2003	A1
20030172291	Judge et al.	Sep 2003	A1
20030174648	Wang et al.	Sep 2003	A1
20030177321	Watanabe	Sep 2003	A1
20030182305	Balva et al.	Sep 2003	A1
20030182413	Allen et al.	Sep 2003	A1
20030182447	Schilling	Sep 2003	A1
20030187935	Agarwalla et al.	Oct 2003	A1
20030187970	Chase et al.	Oct 2003	A1
20030191822	Leighton et al.	Oct 2003	A1
20030200394	Ashmore et al.	Oct 2003	A1
20030204602	Hudson et al.	Oct 2003	A1
20030206520	Wu et al.	Nov 2003	A1
20030229682	Day	Dec 2003	A1
20030233423	Dilley et al.	Dec 2003	A1
20030233445	Levy et al.	Dec 2003	A1
20030233455	Leber et al.	Dec 2003	A1
20030236700	Arning et al.	Dec 2003	A1
20030236779	Choi et al.	Dec 2003	A1
20040003032	Ma et al.	Jan 2004	A1
20040010562	Itonaga	Jan 2004	A1
20040010563	Forte et al.	Jan 2004	A1
20040010588	Slater et al.	Jan 2004	A1
20040010601	Afergan	Jan 2004	A1
20040010621	Afergan et al.	Jan 2004	A1
20040015584	Cartmell et al.	Jan 2004	A1
20040019518	Abraham et al.	Jan 2004	A1
20040024841	Becker et al.	Feb 2004	A1
20040030620	Benjamin et al.	Feb 2004	A1
20040032278	Orii et al.	Feb 2004	A1
20040034744	Karlsson et al.	Feb 2004	A1
20040039798	Hotz et al.	Feb 2004	A1
20040044731	Chen et al.	Mar 2004	A1
20040044791	Pouzzner	Mar 2004	A1
20040054757	Ueda et al.	Mar 2004	A1
20040059805	Dinker et al.	Mar 2004	A1
20040064335	Yang	Apr 2004	A1
20040064501	Jan et al.	Apr 2004	A1
20040068542	Lalonde et al.	Apr 2004	A1
20040073596	Kloninger et al.	Apr 2004	A1
20040073707	Dillon	Apr 2004	A1
20040073867	Kausik et al.	Apr 2004	A1
20040078468	Hedin et al.	Apr 2004	A1
20040078487	Cernohous et al.	Apr 2004	A1
20040083283	Sundaram et al.	Apr 2004	A1
20040083307	Uysal	Apr 2004	A1
20040105544	Haneda et al.	Jun 2004	A1
20040117309	Inoue et al.	Jun 2004	A1
20040117455	Kaminksy et al.	Jun 2004	A1
20040128344	Trossen	Jul 2004	A1
20040128346	Melamed et al.	Jul 2004	A1
20040148520	Talpade et al.	Jul 2004	A1
20040167981	Douglas et al.	Aug 2004	A1
20040167982	Cohen et al.	Aug 2004	A1
20040170379	Yao et al.	Sep 2004	A1
20040172466	Douglas et al.	Sep 2004	A1
20040184456	Binding	Sep 2004	A1
20040194085	Beaubien et al.	Sep 2004	A1
20040194102	Neerdaels	Sep 2004	A1
20040203630	Wang	Oct 2004	A1
20040205149	Dillon et al.	Oct 2004	A1
20040205162	Parikh	Oct 2004	A1
20040215823	Kleinfelter et al.	Oct 2004	A1
20040221019	Swildens et al.	Nov 2004	A1
20040221034	Kausik et al.	Nov 2004	A1
20040246948	Lee et al.	Dec 2004	A1
20040249939	Amini et al.	Dec 2004	A1
20040249971	Klinker	Dec 2004	A1
20040249975	Tuck et al.	Dec 2004	A1
20040250119	Shelest et al.	Dec 2004	A1
20040254921	Cohen et al.	Dec 2004	A1
20040267906	Truty	Dec 2004	A1
20040267907	Gustafsson	Dec 2004	A1
20050010653	McCanne	Jan 2005	A1
20050015471	Zhang et al.	Jan 2005	A1
20050021706	Maggi et al.	Jan 2005	A1
20050021862	Schroeder et al.	Jan 2005	A1
20050027882	Sullivan et al.	Feb 2005	A1
20050038967	Umbehocker et al.	Feb 2005	A1
20050039019	Delany	Feb 2005	A1
20050044270	Grove et al.	Feb 2005	A1
20050102683	Branson et al.	May 2005	A1
20050108169	Balasubramanian et al.	May 2005	A1
20050108262	Fawcett	May 2005	A1
20050108529	Juneau	May 2005	A1
20050114296	Farber et al.	May 2005	A1
20050117717	Lumsden	Jun 2005	A1
20050132083	Raciborski et al.	Jun 2005	A1
20050147088	Bao et al.	Jul 2005	A1
20050149529	Gutmans	Jul 2005	A1
20050157712	Rangarajan et al.	Jul 2005	A1
20050160133	Greenlee et al.	Jul 2005	A1
20050163168	Sheth et al.	Jul 2005	A1
20050168782	Kobashi et al.	Aug 2005	A1
20050171959	Deforche et al.	Aug 2005	A1
20050172080	Miyauchi	Aug 2005	A1
20050181769	Kogawa	Aug 2005	A1
20050188073	Nakamichi et al.	Aug 2005	A1
20050192008	Desai et al.	Sep 2005	A1
20050198170	LeMay et al.	Sep 2005	A1
20050198200	Subramanian et al.	Sep 2005	A1
20050198303	Knauerhase et al.	Sep 2005	A1
20050198334	Farber et al.	Sep 2005	A1
20050198453	Osaki	Sep 2005	A1
20050198571	Kramer et al.	Sep 2005	A1
20050216483	Armstrong et al.	Sep 2005	A1
20050216569	Coppola et al.	Sep 2005	A1
20050216674	Robbin et al.	Sep 2005	A1
20050223095	Volz et al.	Oct 2005	A1
20050228856	Swildens et al.	Oct 2005	A1
20050229119	Torvinen	Oct 2005	A1
20050232165	Brawn et al.	Oct 2005	A1
20050234864	Shapiro	Oct 2005	A1
20050240574	Challenger et al.	Oct 2005	A1
20050256880	Nam Koong et al.	Nov 2005	A1
20050259645	Chen et al.	Nov 2005	A1
20050259672	Eduri	Nov 2005	A1
20050262248	Jennings, III et al.	Nov 2005	A1
20050266835	Agrawal et al.	Dec 2005	A1
20050267937	Daniels et al.	Dec 2005	A1
20050267991	Huitema et al.	Dec 2005	A1
20050267992	Huitema et al.	Dec 2005	A1
20050267993	Huitema et al.	Dec 2005	A1
20050278259	Gunaseelan et al.	Dec 2005	A1
20050283759	Peteanu et al.	Dec 2005	A1
20050283784	Suzuki	Dec 2005	A1
20060005014	Aura et al.	Jan 2006	A1
20060013158	Ahuja et al.	Jan 2006	A1
20060020596	Liu et al.	Jan 2006	A1
20060020684	Mukherjee et al.	Jan 2006	A1
20060020714	Girouard et al.	Jan 2006	A1
20060020715	Jungck	Jan 2006	A1
20060021001	Giles et al.	Jan 2006	A1
20060026067	Nicholas et al.	Feb 2006	A1
20060026154	Altinel et al.	Feb 2006	A1
20060031239	Koenig	Feb 2006	A1
20060031319	Nelson et al.	Feb 2006	A1
20060031503	Gilbert	Feb 2006	A1
20060034494	Holloran	Feb 2006	A1
20060036720	Faulk, Jr.	Feb 2006	A1
20060036966	Yevdayev	Feb 2006	A1
20060037037	Miranz	Feb 2006	A1
20060039352	Karstens	Feb 2006	A1
20060041614	Oe	Feb 2006	A1
20060045005	Blackmore et al.	Mar 2006	A1
20060047787	Aggarwal et al.	Mar 2006	A1
20060047813	Aggarwal et al.	Mar 2006	A1
20060059246	Grove	Mar 2006	A1
20060063534	Kokkonen et al.	Mar 2006	A1
20060064476	Decasper et al.	Mar 2006	A1
20060064500	Roth et al.	Mar 2006	A1
20060070060	Tantawi et al.	Mar 2006	A1
20060074750	Clark et al.	Apr 2006	A1
20060075084	Lyon	Apr 2006	A1
20060075139	Jungck	Apr 2006	A1
20060083165	McLane et al.	Apr 2006	A1
20060085536	Meyer et al.	Apr 2006	A1
20060088026	Mazur et al.	Apr 2006	A1
20060106938	Dini et al.	May 2006	A1
20060107036	Randle et al.	May 2006	A1
20060112066	Hamzy	May 2006	A1
20060112176	Liu et al.	May 2006	A1
20060120385	Atchison et al.	Jun 2006	A1
20060129665	Toebes et al.	Jun 2006	A1
20060129766	Cassia et al.	Jun 2006	A1
20060136453	Kwan	Jun 2006	A1
20060143293	Freedman	Jun 2006	A1
20060143442	Smith	Jun 2006	A1
20060146820	Friedman et al.	Jul 2006	A1
20060149529	Nguyen et al.	Jul 2006	A1
20060155823	Tran et al.	Jul 2006	A1
20060155862	Kathi et al.	Jul 2006	A1
20060161541	Cencini	Jul 2006	A1
20060165051	Banerjee et al.	Jul 2006	A1
20060168088	Leighton et al.	Jul 2006	A1
20060173957	Robinson	Aug 2006	A1
20060179080	Meek et al.	Aug 2006	A1
20060184936	Abels et al.	Aug 2006	A1
20060188097	Taniguchi et al.	Aug 2006	A1
20060190605	Franz et al.	Aug 2006	A1
20060193247	Naseh et al.	Aug 2006	A1
20060195866	Thukral	Aug 2006	A1
20060206568	Verma et al.	Sep 2006	A1
20060206586	Ling et al.	Sep 2006	A1
20060218265	Farber et al.	Sep 2006	A1
20060218304	Mukherjee et al.	Sep 2006	A1
20060224752	Parekh et al.	Oct 2006	A1
20060227740	McLaughlin et al.	Oct 2006	A1
20060227758	Rana et al.	Oct 2006	A1
20060230137	Gare et al.	Oct 2006	A1
20060230265	Krishna	Oct 2006	A1
20060233155	Srivastava	Oct 2006	A1
20060253546	Chang et al.	Nov 2006	A1
20060253609	Andreev et al.	Nov 2006	A1
20060259581	Piersol	Nov 2006	A1
20060259690	Vittal et al.	Nov 2006	A1
20060259984	Juneau	Nov 2006	A1
20060265497	Ohata et al.	Nov 2006	A1
20060265508	Angel et al.	Nov 2006	A1
20060265516	Schilling	Nov 2006	A1
20060265720	Cai et al.	Nov 2006	A1
20060271641	Stavrakos et al.	Nov 2006	A1
20060282522	Lewin et al.	Dec 2006	A1
20060288119	Kim et al.	Dec 2006	A1
20060288424	Saito	Dec 2006	A1
20070005689	Leighton et al.	Jan 2007	A1
20070005801	Kumar et al.	Jan 2007	A1
20070005892	Mullender et al.	Jan 2007	A1
20070011267	Overton et al.	Jan 2007	A1
20070014241	Banerjee et al.	Jan 2007	A1
20070021998	Laithwaite et al.	Jan 2007	A1
20070028001	Phillips et al.	Feb 2007	A1
20070038729	Sullivan et al.	Feb 2007	A1
20070038994	Davis et al.	Feb 2007	A1
20070041393	Westhead et al.	Feb 2007	A1
20070043667	Qawami et al.	Feb 2007	A1
20070043859	Ruul	Feb 2007	A1
20070050522	Grove et al.	Mar 2007	A1
20070050703	Lebel	Mar 2007	A1
20070055764	Dilley et al.	Mar 2007	A1
20070061440	Sundaram et al.	Mar 2007	A1
20070064610	Khandani	Mar 2007	A1
20070076872	Juneau	Apr 2007	A1
20070086429	Lawrence et al.	Apr 2007	A1
20070094361	Hoynowski et al.	Apr 2007	A1
20070101061	Baskaran et al.	May 2007	A1
20070101377	Six et al.	May 2007	A1
20070118667	McCarthy et al.	May 2007	A1
20070118668	McCarthy et al.	May 2007	A1
20070134641	Lieu	Jun 2007	A1
20070156726	Levy	Jul 2007	A1
20070156919	Potti et al.	Jul 2007	A1
20070162331	Sullivan	Jul 2007	A1
20070168336	Ransil et al.	Jul 2007	A1
20070168517	Weller	Jul 2007	A1
20070174426	Swildens et al.	Jul 2007	A1
20070174442	Sherman et al.	Jul 2007	A1
20070174490	Choi et al.	Jul 2007	A1
20070183342	Wong et al.	Aug 2007	A1
20070198982	Bolan et al.	Aug 2007	A1
20070204107	Greenfield et al.	Aug 2007	A1
20070208737	Li et al.	Sep 2007	A1
20070219795	Park et al.	Sep 2007	A1
20070220010	Ertugrul	Sep 2007	A1
20070233705	Farber et al.	Oct 2007	A1
20070233706	Farber et al.	Oct 2007	A1
20070233846	Farber et al.	Oct 2007	A1
20070233884	Farber et al.	Oct 2007	A1
20070243860	Aiello et al.	Oct 2007	A1
20070244964	Challenger et al.	Oct 2007	A1
20070245022	Olliphant et al.	Oct 2007	A1
20070250467	Mesnik et al.	Oct 2007	A1
20070250468	Pieper	Oct 2007	A1
20070250560	Wein et al.	Oct 2007	A1
20070250601	Amlekar et al.	Oct 2007	A1
20070250611	Bhogal et al.	Oct 2007	A1
20070253377	Janneteau et al.	Nov 2007	A1
20070255843	Zubev	Nov 2007	A1
20070263604	Tal	Nov 2007	A1
20070266113	Koopmans et al.	Nov 2007	A1
20070266311	Westphal	Nov 2007	A1
20070266333	Cossey et al.	Nov 2007	A1
20070270165	Poosala	Nov 2007	A1
20070271375	Hwang	Nov 2007	A1
20070271385	Davis et al.	Nov 2007	A1
20070271560	Wahlert et al.	Nov 2007	A1
20070271608	Shimizu et al.	Nov 2007	A1
20070280229	Kenney	Dec 2007	A1
20070288588	Wein et al.	Dec 2007	A1
20070291739	Sullivan et al.	Dec 2007	A1
20070294419	Ulevitch	Dec 2007	A1
20080005057	Ozzie et al.	Jan 2008	A1
20080008089	Bornstein et al.	Jan 2008	A1
20080016233	Schneider	Jan 2008	A1
20080025304	Venkataswami et al.	Jan 2008	A1
20080037536	Padmanabhan et al.	Feb 2008	A1
20080046550	Mazur et al.	Feb 2008	A1
20080046596	Afergan et al.	Feb 2008	A1
20080049615	Bugenhagen	Feb 2008	A1
20080056207	Eriksson et al.	Mar 2008	A1
20080065724	Seed et al.	Mar 2008	A1
20080065745	Leighton et al.	Mar 2008	A1
20080066072	Yurekli et al.	Mar 2008	A1
20080071859	Seed et al.	Mar 2008	A1
20080071987	Karn et al.	Mar 2008	A1
20080072264	Crayford	Mar 2008	A1
20080082551	Farber et al.	Apr 2008	A1
20080082662	Dandliker et al.	Apr 2008	A1
20080086434	Chesla	Apr 2008	A1
20080086559	Davis et al.	Apr 2008	A1
20080086574	Raciborski et al.	Apr 2008	A1
20080092242	Rowley	Apr 2008	A1
20080101358	Van Ewijk et al.	May 2008	A1
20080103805	Shear et al.	May 2008	A1
20080104268	Farber et al.	May 2008	A1
20080109679	Wright et al.	May 2008	A1
20080114829	Button et al.	May 2008	A1
20080125077	Velazquez et al.	May 2008	A1
20080126706	Newport et al.	May 2008	A1
20080134043	Georgis et al.	Jun 2008	A1
20080140800	Farber et al.	Jun 2008	A1
20080147866	Stolorz et al.	Jun 2008	A1
20080147873	Matsumoto	Jun 2008	A1
20080155059	Hardin et al.	Jun 2008	A1
20080155061	Afergan et al.	Jun 2008	A1
20080155613	Benya et al.	Jun 2008	A1
20080155614	Cooper et al.	Jun 2008	A1
20080162667	Verma et al.	Jul 2008	A1
20080162821	Duran et al.	Jul 2008	A1
20080162843	Davis et al.	Jul 2008	A1
20080172488	Jawahar et al.	Jul 2008	A1
20080189437	Halley	Aug 2008	A1
20080201332	Souders et al.	Aug 2008	A1
20080215718	Stolorz et al.	Sep 2008	A1
20080215730	Sundaram et al.	Sep 2008	A1
20080215735	Farber et al.	Sep 2008	A1
20080215747	Menon et al.	Sep 2008	A1
20080215750	Farber et al.	Sep 2008	A1
20080215755	Farber et al.	Sep 2008	A1
20080222281	Dilley et al.	Sep 2008	A1
20080222291	Weller et al.	Sep 2008	A1
20080222295	Robinson et al.	Sep 2008	A1
20080222647	Taylor et al.	Sep 2008	A1
20080228574	Stewart et al.	Sep 2008	A1
20080228920	Souders et al.	Sep 2008	A1
20080235383	Schneider	Sep 2008	A1
20080235400	Slocombe et al.	Sep 2008	A1
20080256087	Piironen et al.	Oct 2008	A1
20080256175	Lee et al.	Oct 2008	A1
20080263135	Olliphant	Oct 2008	A1
20080270882	Rollins et al.	Oct 2008	A1
20080275772	Suryanarayana et al.	Nov 2008	A1
20080281946	Swildens et al.	Nov 2008	A1
20080281950	Wald et al.	Nov 2008	A1
20080288722	Lecoq et al.	Nov 2008	A1
20080301670	Gouge et al.	Dec 2008	A1
20080312766	Couckuyt	Dec 2008	A1
20080319862	Golan et al.	Dec 2008	A1
20080320123	Houlihan et al.	Dec 2008	A1
20080320269	Houlihan et al.	Dec 2008	A1
20090013063	Soman	Jan 2009	A1
20090016236	Alcala et al.	Jan 2009	A1
20090029644	Sue et al.	Jan 2009	A1
20090031367	Sue	Jan 2009	A1
20090031368	Ling	Jan 2009	A1
20090031376	Riley et al.	Jan 2009	A1
20090043900	Barber	Feb 2009	A1
20090049098	Pickelsimer et al.	Feb 2009	A1
20090063038	Shrivathsan et al.	Mar 2009	A1
20090063704	Taylor et al.	Mar 2009	A1
20090070533	Elazary et al.	Mar 2009	A1
20090083228	Shatz et al.	Mar 2009	A1
20090083279	Hasek	Mar 2009	A1
20090086728	Gulati et al.	Apr 2009	A1
20090086741	Zhang	Apr 2009	A1
20090089869	Varghese	Apr 2009	A1
20090094252	Wong et al.	Apr 2009	A1
20090103707	McGary et al.	Apr 2009	A1
20090106202	Mizrahi	Apr 2009	A1
20090106381	Kasriel et al.	Apr 2009	A1
20090112703	Brown	Apr 2009	A1
20090125393	Hwang et al.	May 2009	A1
20090125934	Jones et al.	May 2009	A1
20090132368	Cotter et al.	May 2009	A1
20090132640	Verma et al.	May 2009	A1
20090132648	Swildens et al.	May 2009	A1
20090138533	Iwasaki et al.	May 2009	A1
20090138582	Turk	May 2009	A1
20090144411	Winkler et al.	Jun 2009	A1
20090144412	Ferguson et al.	Jun 2009	A1
20090150926	Schlack	Jun 2009	A1
20090157504	Braemer et al.	Jun 2009	A1
20090157850	Gagliardi et al.	Jun 2009	A1
20090158163	Stephens et al.	Jun 2009	A1
20090164331	Bishop et al.	Jun 2009	A1
20090164614	Christian et al.	Jun 2009	A1
20090177667	Ramos et al.	Jul 2009	A1
20090182815	Czechowski et al.	Jul 2009	A1
20090182837	Rogers	Jul 2009	A1
20090182945	Aviles et al.	Jul 2009	A1
20090187575	DaCosta	Jul 2009	A1
20090198817	Sundaram et al.	Aug 2009	A1
20090204682	Jeyaseelan et al.	Aug 2009	A1
20090210549	Hudson et al.	Aug 2009	A1
20090228708	Trostle	Sep 2009	A1
20090233623	Johnson	Sep 2009	A1
20090241167	Moore	Sep 2009	A1
20090248697	Richardson et al.	Oct 2009	A1
20090248786	Richardson et al.	Oct 2009	A1
20090248787	Sivasubramanian et al.	Oct 2009	A1
20090248852	Fuhrmann et al.	Oct 2009	A1
20090248858	Sivasubramanian et al.	Oct 2009	A1
20090248893	Richardson et al.	Oct 2009	A1
20090249222	Schmidt et al.	Oct 2009	A1
20090253435	Olofsson	Oct 2009	A1
20090254661	Fullagar et al.	Oct 2009	A1
20090259588	Lindsay	Oct 2009	A1
20090259971	Rankine et al.	Oct 2009	A1
20090262741	Jungck et al.	Oct 2009	A1
20090271498	Cable	Oct 2009	A1
20090271577	Campana et al.	Oct 2009	A1
20090271730	Rose et al.	Oct 2009	A1
20090276771	Nickolov et al.	Nov 2009	A1
20090279444	Ravindran et al.	Nov 2009	A1
20090282038	Subotin et al.	Nov 2009	A1
20090287750	Banavar et al.	Nov 2009	A1
20090307307	Igarashi	Dec 2009	A1
20090327489	Swildens et al.	Dec 2009	A1
20090327517	Sivasubramanian et al.	Dec 2009	A1
20090327914	Adar et al.	Dec 2009	A1
20100005175	Swildens et al.	Jan 2010	A1
20100011061	Hudson et al.	Jan 2010	A1
20100011126	Hsu et al.	Jan 2010	A1
20100020699	On	Jan 2010	A1
20100023601	Lewin et al.	Jan 2010	A1
20100023621	Ezolt et al.	Jan 2010	A1
20100030662	Klein	Feb 2010	A1
20100030914	Sparks et al.	Feb 2010	A1
20100034470	Valencia-Campo et al.	Feb 2010	A1
20100036944	Douglis et al.	Feb 2010	A1
20100042725	Jeon et al.	Feb 2010	A1
20100049862	Dixon	Feb 2010	A1
20100057894	Glasser	Mar 2010	A1
20100070603	Moss et al.	Mar 2010	A1
20100070700	Borst et al.	Mar 2010	A1
20100082320	Wood et al.	Apr 2010	A1
20100082787	Kommula et al.	Apr 2010	A1
20100088367	Brown et al.	Apr 2010	A1
20100088405	Huang et al.	Apr 2010	A1
20100095008	Joshi	Apr 2010	A1
20100100629	Raciborski et al.	Apr 2010	A1
20100103837	Jungck et al.	Apr 2010	A1
20100106934	Calder et al.	Apr 2010	A1
20100111059	Bappu et al.	May 2010	A1
20100115133	Joshi	May 2010	A1
20100115342	Shigeta et al.	May 2010	A1
20100121953	Friedman et al.	May 2010	A1
20100121981	Drako	May 2010	A1
20100122069	Gonion	May 2010	A1
20100125626	Lucas et al.	May 2010	A1
20100125673	Richardson et al.	May 2010	A1
20100125675	Richardson et al.	May 2010	A1
20100131646	Drako	May 2010	A1
20100138559	Sullivan et al.	Jun 2010	A1
20100150155	Napierala	Jun 2010	A1
20100161564	Lee et al.	Jun 2010	A1
20100161565	Lee et al.	Jun 2010	A1
20100161799	Maloo	Jun 2010	A1
20100169392	Lev Ran et al.	Jul 2010	A1
20100169452	Atluri et al.	Jul 2010	A1
20100174811	Musiri et al.	Jul 2010	A1
20100191854	Isci et al.	Jul 2010	A1
20100192225	Ma et al.	Jul 2010	A1
20100217801	Leighton et al.	Aug 2010	A1
20100217856	Falkena	Aug 2010	A1
20100223364	Wei	Sep 2010	A1
20100226372	Watanabe	Sep 2010	A1
20100228819	Wei	Sep 2010	A1
20100257024	Holmes et al.	Oct 2010	A1
20100257266	Holmes et al.	Oct 2010	A1
20100257566	Matila	Oct 2010	A1
20100268789	Yoo et al.	Oct 2010	A1
20100268814	Cross et al.	Oct 2010	A1
20100274765	Murphy et al.	Oct 2010	A1
20100281482	Pike et al.	Nov 2010	A1
20100293296	Hsu et al.	Nov 2010	A1
20100293479	Rousso et al.	Nov 2010	A1
20100299427	Joshi	Nov 2010	A1
20100299438	Zimmerman et al.	Nov 2010	A1
20100299439	McCarthy et al.	Nov 2010	A1
20100312861	Kolhi et al.	Dec 2010	A1
20100318508	Brawer et al.	Dec 2010	A1
20100322255	Hao et al.	Dec 2010	A1
20100325365	Colglazier et al.	Dec 2010	A1
20100332595	Fullagar et al.	Dec 2010	A1
20110010244	Hatridge	Jan 2011	A1
20110016214	Jackson	Jan 2011	A1
20110029598	Arnold et al.	Feb 2011	A1
20110040893	Karaoguz et al.	Feb 2011	A1
20110051738	Xu	Mar 2011	A1
20110055386	Middleton et al.	Mar 2011	A1
20110055714	Vemulapalli et al.	Mar 2011	A1
20110055921	Narayanaswamy et al.	Mar 2011	A1
20110057790	Martin et al.	Mar 2011	A1
20110058675	Brueck et al.	Mar 2011	A1
20110072138	Canturk et al.	Mar 2011	A1
20110072366	Spencer	Mar 2011	A1
20110078000	Ma et al.	Mar 2011	A1
20110078230	Sepulveda	Mar 2011	A1
20110085654	Jana et al.	Apr 2011	A1
20110087769	Holmes et al.	Apr 2011	A1
20110096987	Morales et al.	Apr 2011	A1
20110106949	Patel et al.	May 2011	A1
20110113467	Agarwal et al.	May 2011	A1
20110153938	Verzunov et al.	Jun 2011	A1
20110153941	Spatscheck et al.	Jun 2011	A1
20110154318	Oshins et al.	Jun 2011	A1
20110154350	Doyle et al.	Jun 2011	A1
20110161461	Niven-Jenkins	Jun 2011	A1
20110166935	Armentrout et al.	Jul 2011	A1
20110182290	Perkins	Jul 2011	A1
20110191445	Dazzi	Aug 2011	A1
20110191447	Dazzi et al.	Aug 2011	A1
20110191449	Swildens et al.	Aug 2011	A1
20110191459	Joshi	Aug 2011	A1
20110196892	Xia	Aug 2011	A1
20110208876	Richardson et al.	Aug 2011	A1
20110208958	Stuedi et al.	Aug 2011	A1
20110209064	Jorgensen et al.	Aug 2011	A1
20110219120	Farber et al.	Sep 2011	A1
20110219372	Agarwal et al.	Sep 2011	A1
20110238501	Almeida	Sep 2011	A1
20110238793	Bedare et al.	Sep 2011	A1
20110239215	Sugai	Sep 2011	A1
20110252142	Richardson et al.	Oct 2011	A1
20110252143	Baumback et al.	Oct 2011	A1
20110258049	Ramer et al.	Oct 2011	A1
20110258614	Tamm	Oct 2011	A1
20110270964	Huang et al.	Nov 2011	A1
20110276623	Girbal	Nov 2011	A1
20110296053	Medved et al.	Dec 2011	A1
20110296370	Ferris et al.	Dec 2011	A1
20110302304	Baumback et al.	Dec 2011	A1
20110307533	Saeki	Dec 2011	A1
20110320522	Endres et al.	Dec 2011	A1
20110320559	Foti	Dec 2011	A1
20120011190	Driesen et al.	Jan 2012	A1
20120023090	Holloway et al.	Jan 2012	A1
20120023226	Petersen et al.	Jan 2012	A1
20120036238	Sundaram et al.	Feb 2012	A1
20120041970	Ghosh et al.	Feb 2012	A1
20120066360	Ghosh	Mar 2012	A1
20120072600	Richardson et al.	Mar 2012	A1
20120072608	Peters et al.	Mar 2012	A1
20120078998	Son et al.	Mar 2012	A1
20120079096	Cowan et al.	Mar 2012	A1
20120079115	Richardson et al.	Mar 2012	A1
20120089700	Safruti et al.	Apr 2012	A1
20120089972	Scheidel et al.	Apr 2012	A1
20120096065	Suit et al.	Apr 2012	A1
20120096166	Devarapalli et al.	Apr 2012	A1
20120110515	Abramoff et al.	May 2012	A1
20120124184	Sakata et al.	May 2012	A1
20120131177	Brandt et al.	May 2012	A1
20120136697	Peles et al.	May 2012	A1
20120142310	Pugh et al.	Jun 2012	A1
20120143688	Alexander	Jun 2012	A1
20120159476	Ramteke et al.	Jun 2012	A1
20120166516	Simmons et al.	Jun 2012	A1
20120169646	Berkes et al.	Jul 2012	A1
20120173677	Richardson et al.	Jul 2012	A1
20120173760	Jog et al.	Jul 2012	A1
20120179796	Nagaraj et al.	Jul 2012	A1
20120179817	Bade et al.	Jul 2012	A1
20120179839	Raciborski et al.	Jul 2012	A1
20120198043	Hesketh et al.	Aug 2012	A1
20120198071	Black et al.	Aug 2012	A1
20120209942	Zehavi et al.	Aug 2012	A1
20120224516	Stojanovski et al.	Sep 2012	A1
20120226649	Kovacs et al.	Sep 2012	A1
20120233329	Dickinson et al.	Sep 2012	A1
20120233522	Barton et al.	Sep 2012	A1
20120233668	Leafe et al.	Sep 2012	A1
20120239725	Hartrick et al.	Sep 2012	A1
20120246129	Rothschild et al.	Sep 2012	A1
20120246257	Brown	Sep 2012	A1
20120254961	Kim et al.	Oct 2012	A1
20120257628	Bu et al.	Oct 2012	A1
20120259954	McCarthy et al.	Oct 2012	A1
20120278229	Vishwanathan et al.	Nov 2012	A1
20120278831	van Coppenolle et al.	Nov 2012	A1
20120303785	Sivasubramanian et al.	Nov 2012	A1
20120303804	Sundaram et al.	Nov 2012	A1
20120311648	Swildens et al.	Dec 2012	A1
20120324089	Joshi	Dec 2012	A1
20130003547	Motwani et al.	Jan 2013	A1
20130003735	Chao et al.	Jan 2013	A1
20130007100	Trahan et al.	Jan 2013	A1
20130007101	Trahan et al.	Jan 2013	A1
20130007102	Trahan et al.	Jan 2013	A1
20130007241	Trahan et al.	Jan 2013	A1
20130007273	Baumback et al.	Jan 2013	A1
20130018945	Vendrow et al.	Jan 2013	A1
20130019311	Swildens et al.	Jan 2013	A1
20130034099	Hikichi et al.	Feb 2013	A1
20130041872	Aizman et al.	Feb 2013	A1
20130046869	Jenkins et al.	Feb 2013	A1
20130046883	Lientz et al.	Feb 2013	A1
20130054675	Jenkins et al.	Feb 2013	A1
20130055374	Kustarz et al.	Feb 2013	A1
20130067530	Spektor et al.	Mar 2013	A1
20130073808	Puthalath et al.	Mar 2013	A1
20130080420	Taylor et al.	Mar 2013	A1
20130080421	Taylor et al.	Mar 2013	A1
20130080576	Taylor et al.	Mar 2013	A1
20130080577	Taylor et al.	Mar 2013	A1
20130080623	Thireault	Mar 2013	A1
20130080627	Kukreja et al.	Mar 2013	A1
20130080636	Friedman et al.	Mar 2013	A1
20130086001	Bhogal et al.	Apr 2013	A1
20130111035	Alapati et al.	May 2013	A1
20130117282	Mugali, Jr. et al.	May 2013	A1
20130117849	Golshan et al.	May 2013	A1
20130130221	Kortemeyer et al.	May 2013	A1
20130133057	Yoon et al.	May 2013	A1
20130151646	Chidambaram et al.	Jun 2013	A1
20130191499	Ludin et al.	Jul 2013	A1
20130198341	Kim	Aug 2013	A1
20130212300	Eggleston et al.	Aug 2013	A1
20130219020	McCarthy et al.	Aug 2013	A1
20130227165	Liu	Aug 2013	A1
20130246567	Green et al.	Sep 2013	A1
20130254269	Sivasubramanian et al.	Sep 2013	A1
20130254879	Chesla et al.	Sep 2013	A1
20130263256	Dickinson et al.	Oct 2013	A1
20130268616	Sakata et al.	Oct 2013	A1
20130275549	Field et al.	Oct 2013	A1
20130279335	Ahmadi	Oct 2013	A1
20130305046	Mankovski et al.	Nov 2013	A1
20130311583	Humphreys et al.	Nov 2013	A1
20130311605	Richardson et al.	Nov 2013	A1
20130311989	Ota et al.	Nov 2013	A1
20130318153	Sivasubramanian et al.	Nov 2013	A1
20130339429	Richardson et al.	Dec 2013	A1
20130346465	Maltz et al.	Dec 2013	A1
20130346470	Obstfeld et al.	Dec 2013	A1
20130346567	Richardson et al.	Dec 2013	A1
20130346614	Baughman et al.	Dec 2013	A1
20140006577	Joe et al.	Jan 2014	A1
20140007239	Sharpe et al.	Jan 2014	A1
20140013403	Shuster	Jan 2014	A1
20140019605	Boberg	Jan 2014	A1
20140022951	Lemieux	Jan 2014	A1
20140036675	Wang et al.	Feb 2014	A1
20140040478	Hsu et al.	Feb 2014	A1
20140047104	Rodriguez	Feb 2014	A1
20140053022	Forgette et al.	Feb 2014	A1
20140059120	Richardson et al.	Feb 2014	A1
20140059198	Richardson et al.	Feb 2014	A1
20140059379	Ren et al.	Feb 2014	A1
20140082165	Marr et al.	Mar 2014	A1
20140082614	Klein et al.	Mar 2014	A1
20140089917	Attalla et al.	Mar 2014	A1
20140108672	Ou et al.	Apr 2014	A1
20140122698	Batrouni et al.	May 2014	A1
20140122725	Batrouni et al.	May 2014	A1
20140137111	Dees et al.	May 2014	A1
20140143320	Sivasubramanian et al.	May 2014	A1
20140149601	Carney	May 2014	A1
20140164817	Bartholomy et al.	Jun 2014	A1
20140165061	Greene et al.	Jun 2014	A1
20140195686	Yeager et al.	Jul 2014	A1
20140215019	Ahrens	Jul 2014	A1
20140244937	Bloomstein et al.	Aug 2014	A1
20140257891	Richardson et al.	Sep 2014	A1
20140269371	Badea et al.	Sep 2014	A1
20140280606	Long	Sep 2014	A1
20140280679	Dey et al.	Sep 2014	A1
20140297866	Ennaji et al.	Oct 2014	A1
20140297870	Eggleston et al.	Oct 2014	A1
20140310402	Giaretta et al.	Oct 2014	A1
20140310811	Hentunen	Oct 2014	A1
20140325155	Marshall et al.	Oct 2014	A1
20140331328	Wang et al.	Nov 2014	A1
20140337472	Newton et al.	Nov 2014	A1
20140351871	Bomfim et al.	Nov 2014	A1
20140365666	Richardson et al.	Dec 2014	A1
20150006615	Wainner et al.	Jan 2015	A1
20150019686	Backholm	Jan 2015	A1
20150026407	Mclellan et al.	Jan 2015	A1
20150067171	Yum	Mar 2015	A1
20150074228	Drake	Mar 2015	A1
20150081842	Richardson et al.	Mar 2015	A1
20150081877	Sethi et al.	Mar 2015	A1
20150088964	Shiell et al.	Mar 2015	A1
20150088972	Brand et al.	Mar 2015	A1
20150089621	Khalid	Mar 2015	A1
20150106864	Li et al.	Apr 2015	A1
20150154051	Kruglick	Jun 2015	A1
20150156279	Vaswani et al.	Jun 2015	A1
20150172379	Richardson et al.	Jun 2015	A1
20150172407	MacCarthaigh et al.	Jun 2015	A1
20150172414	Richardson et al.	Jun 2015	A1
20150172415	Richardson et al.	Jun 2015	A1
20150180988	Sivasubramanian et al.	Jun 2015	A1
20150188734	Petrov	Jul 2015	A1
20150188994	Marshall et al.	Jul 2015	A1
20150189042	Sun et al.	Jul 2015	A1
20150195244	Richardson et al.	Jul 2015	A1
20150200991	Kwon	Jul 2015	A1
20150207733	Richardson et al.	Jul 2015	A1
20150215270	Sivasubramanian et al.	Jul 2015	A1
20150215656	Pulung et al.	Jul 2015	A1
20150229710	Sivasubramanian et al.	Aug 2015	A1
20150244580	Saavedra	Aug 2015	A1
20150256647	Richardson et al.	Sep 2015	A1
20150288647	Chhabra et al.	Oct 2015	A1
20150319194	Richardson et al.	Nov 2015	A1
20150319260	Watson	Nov 2015	A1
20150334082	Richardson et al.	Nov 2015	A1
20150341431	Hartrick et al.	Nov 2015	A1
20150358276	Liu et al.	Dec 2015	A1
20150358436	Kim et al.	Dec 2015	A1
20150363113	Rahman et al.	Dec 2015	A1
20160006672	Saavedra	Jan 2016	A1
20160021197	Pogrebinsky et al.	Jan 2016	A1
20160026568	Marshall et al.	Jan 2016	A1
20160028598	Khakpour et al.	Jan 2016	A1
20160028644	Richardson et al.	Jan 2016	A1
20160028755	Vasseur et al.	Jan 2016	A1
20160036857	Foxhoven et al.	Feb 2016	A1
20160041910	Richardson et al.	Feb 2016	A1
20160065665	Richardson et al.	Mar 2016	A1
20160072669	Saavedra	Mar 2016	A1
20160072720	Richardson et al.	Mar 2016	A1
20160132600	Woodhead et al.	May 2016	A1
20160134492	Ellsworth et al.	May 2016	A1
20160142251	Contreras et al.	May 2016	A1
20160142367	Richardson et al.	May 2016	A1
20160182454	Phonsa et al.	Jun 2016	A1
20160182542	Staniford	Jun 2016	A1
20160205062	Mosert	Jul 2016	A1
20160241637	Marr et al.	Aug 2016	A1
20160241639	Brookins et al.	Aug 2016	A1
20160241651	Sivasubramanian et al.	Aug 2016	A1
20160253262	Nadgowda	Sep 2016	A1
20160255042	Newton	Sep 2016	A1
20160274929	King	Sep 2016	A1
20160294678	Khakpour	Oct 2016	A1
20160308959	Richardson et al.	Oct 2016	A1
20160337426	Shribman et al.	Nov 2016	A1
20160366202	Phillips et al.	Dec 2016	A1
20170041428	Katsev	Feb 2017	A1
20170085495	Richardson et al.	Mar 2017	A1
20170099345	Leach	Apr 2017	A1
20170109316	Hack et al.	Apr 2017	A1
20170126557	Richardson et al.	May 2017	A1
20170126796	Hollis et al.	May 2017	A1
20170142062	Richardson et al.	May 2017	A1
20170153980	Araújo et al.	Jun 2017	A1
20170155678	Araújo et al.	Jun 2017	A1
20170155732	Araújo et al.	Jun 2017	A1
20170171146	Sharma et al.	Jun 2017	A1
20170180217	Puchala et al.	Jun 2017	A1
20170214755	Sivasubramanian et al.	Jul 2017	A1
20170214761	Hsu et al.	Jul 2017	A1
20170250821	Richardson et al.	Aug 2017	A1
20170257340	Richardson et al.	Sep 2017	A1
20170353395	Richardson et al.	Dec 2017	A1
20180063027	Rafferty	Mar 2018	A1
20180077109	Hoeme et al.	Mar 2018	A1
20180077110	Huston, III et al.	Mar 2018	A1
20180097631	Uppal et al.	Apr 2018	A1
20180097634	Uppal et al.	Apr 2018	A1
20180097831	Uppal et al.	Apr 2018	A1
20180109553	Radlein et al.	Apr 2018	A1
20180159757	Uppal et al.	Jun 2018	A1
20180159769	Richardson et al.	Jun 2018	A1
20180167444	Sivasubramanian et al.	Jun 2018	A1
20180167469	Sivasubramanian et al.	Jun 2018	A1
20180183689	Ellsworth et al.	Jun 2018	A1
20180191817	Richardson et al.	Jul 2018	A1
20180212880	Mostert	Jul 2018	A1
20180213052	Maccarthaigh et al.	Jul 2018	A1
20180278717	Richardson et al.	Sep 2018	A1
20180287916	Mizik et al.	Oct 2018	A1
20180302322	Richardson et al.	Oct 2018	A1
20180332107	Marr et al.	Nov 2018	A1
20180351904	Mizik et al.	Dec 2018	A1
20180367498	Bliss et al.	Dec 2018	A1
20190007515	Baldwin et al.	Jan 2019	A1
20190044787	Richardson et al.	Feb 2019	A1

Foreign Referenced Citations (41)

Number	Date	Country
2741 895	May 2010	CA
1422468	Jun 2003	CN
1511399	Jul 2004	CN
1605182	Apr 2005	CN
101189598	May 2008	CN
101460907	Jun 2009	CN
103731481	Apr 2014	CN
1603307	Dec 2005	EP
1351141	Oct 2007	EP
2008167	Dec 2008	EP
3156911	Apr 2017	EP
07-141305	Jun 1995	JP
2001-0506093	May 2001	JP
2001-249907	Sep 2001	JP
2002-024192	Jan 2002	JP
2002-044137	Feb 2002	JP
2002-323986	Nov 2002	JP
2003-167810	Jun 2003	JP
2003-167813	Jun 2003	JP
2003-522358	Jul 2003	JP
2003188901	Jul 2003	JP
2004-070935	Mar 2004	JP
2004-532471	Oct 2004	JP
2004-533738	Nov 2004	JP
2005-537687	Dec 2005	JP
2007-133896	May 2007	JP
2007-207225	Aug 2007	JP
2008-515106	May 2008	JP
2009-071538	Apr 2009	JP
2012-509623	Apr 2012	JP
2012-209623	Oct 2012	JP
WO 2002069608	Sep 2002	WO
WO 2005071560	Aug 2005	WO
WO 2007007960	Jan 2007	WO
WO 2007126837	Nov 2007	WO
WO 2009124006	Oct 2009	WO
WO 2010002603	Jan 2010	WO
WO 2012044587	Apr 2012	WO
WO 2012065641	May 2012	WO
WO 2014047073	Mar 2014	WO
WO 2017106455	Jun 2017	WO

Non-Patent Literature Citations (170)

Entry
“Non-Final Office Action dated Jan. 3, 2012,” U.S. Appl. No. 12/652,541, filed Jan. 3, 2012; 35 pages.
“Final Office Action dated Sep. 5, 2012,” U.S. Appl. No. 12/652,541, filed Sep. 5, 2012; 40 pages.
“Notice of Allowance dated Jan. 4, 2013,” U.S. Appl. No. 12/652,541, filed Jan. 4, 2013; 11 pages.
“Non-Final Office Action dated Apr. 30, 2014,” U.S. Appl. No. 13/842,970; 20 pages.
“Final Office Action dated Aug. 19, 2014,” U.S. Appl. No. 13/842,970; 13 pages.
“Notice of Allowance dated Dec. 5, 2014,” U.S. Appl. No. 13/842,970; 6 pages.
Canonical Name (CNAME) DNS Records, domainavenue.com, Feb. 1, 2001, XP055153783, Retrieved from the Internet: URL:http://www.domainavenue.com/cname.htm [retrieved on Nov. 18, 2014].
“Content delivery network”, Wikipedia, the free encyclopedia, Retrieved from the Internet: URL:http://en.wikipedia.org/w/index.php?title=Contentdelivery network&oldid=601009970, XP055153445, Mar. 24, 2008.
“Global Server Load Balancing with ServerIron,” Foundry Networks, retrieved Aug. 30, 2007, from http://www.foundrynet.com/pdf/an-global-server-load-bal.pdf, 7 pages.
“Grid Computing Solutions,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/grid, 3 pages.
“Grid Offerings,” Java.net, retrieved May 3, 2006, from http://wiki.java.net/bin/view/Sungrid/OtherGridOfferings, 8 pages.
“Recent Advances Boost System Virtualization,” eWeek.com, retrieved from May 3, 2006, http://www.eWeek.com/article2/0,1895,1772626,00.asp, 5 pages.
“Scaleable Trust of Next Generation Management (STRONGMAN),” retrieved May 17, 2006, from http://www.cis.upenn.edu/˜dsl/STRONGMAN/, 4 pages.
“Sun EDA Compute Ranch,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://sun.com/processors/ranch/brochure.pdf, 2 pages.
“Sun Microsystems Accelerates UltraSP ARC Processor Design Program With New Burlington, Mass. Compute Ranch,” Nov. 6, 2002, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2002-11/sunflash.20021106.3 .xml, 2 pages.
“Sun N1 Grid Engine 6,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/gridware/index.xml, 3 pages.
“Sun Opens New Processor Design Compute Ranch,” Nov. 30, 2001, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2001-11/sunflash.20011130.1.xml, 3 pages.
“The Softricity Desktop,” Softricity, Inc., retrieved May 3, 2006, from http://www.softricity.com/products/, 3 pages.
“Xen—The Xen virtual Machine Monitor,” University of Cambridge Computer Laboratory, retrieved Nov. 8, 2005, from http://www.cl.cam.ac.uk/Research/SRG/netos/xen/, 2 pages.
“XenFaq,” retrieved Nov. 8, 2005, from http://wiki.xensource.com/xenwiki/XenFaq?action=print, 9 pages.
Abi, Issam, et al., “A Business Driven Management Framework for Utility Computing Environments,” Oct. 12, 2004, HP Laboratories Bristol, HPL-2004-171, retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2004/HPL-2004-171.pdf, 14 pages.
American Bar Association; Digital Signature Guidelines Tutorial [online]; Feb. 10, 2002 [retrieved on Mar. 2, 2010]; American Bar Association Section of Science and Technology Information Security Committee; Retrieved from the internet: (URL: http://web.archive.org/web/20020210124615/www.abanet.org/scitech/ec/isc/dsg-tutorial.html; pp. 1-8.
Armour et al.: “A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities”; Management Science, vol. 9, No. 2 (Jan. 1963); pp. 294-309.
Baglioni et al., “Preprocessing and Mining Web Log Data for Web Personalization”, LNAI 2829, 2003, pp. 237-249.
Barbir, A., et al., “Known Content Network (CN) Request-Routing Mechanisms”, Request for Comments 3568, [online], IETF, Jul. 2003, [retrieved on Feb. 26, 2013], Retrieved from the Internet: (URL: http://tools.ietf.org/rfc/rfc3568.txt).
Bellovin, S., “Distributed Firewalls,” ;login;:37-39, Nov. 1999, http://www.cs.columbia.edu/-smb/papers/distfw. html, 10 pages, retrieved Nov. 11, 2005.
Blaze, M., “Using the KeyNote Trust Management System,” Mar. 1, 2001, from http://www.crypto.com/trustmgt/kn.html, 4 pages, retrieved May 17, 2006.
Brenton, C., “What is Egress Filtering and How Can I Implement It?—Egress Filtering v 0.2,” Feb. 29, 2000, SANS Institute, http://www.sans.org/infosecFAQ/firewall/egress.htm, 6 pages.
Byun et al., “A Dynamic Grid Services Deployment Mechanism for On-Demand Resource Provisioning”, IEEE International Symposium on Cluster Computing and the Grid:863-870, 2005.
Chipara et al, “Realtime Power-Aware Routing in Sensor Network”, IEEE, 2006, 10 pages.
Clark, C., “Live Migration of Virtual Machines,” May 2005, NSDI '05: 2nd Symposium on Networked Systems Design and Implementation, Boston, MA, May 2-4, 2005, retrieved from http://www.usenix.org/events/nsdi05/tech/full_papers/clark/clark.pdf, 14 pages.
Coulson, D., “Network Security Iptables,” Apr. 2003, Linuxpro, Part 2, retrieved from http://davidcoulson.net/writing/lxf/38/iptables.pdf, 4 pages.
Coulson, D., “Network Security Iptables,” Mar. 2003, Linuxpro, Part 1, retrieved from http://davidcoulson.net/writing/lxf/39/iptables.pdf, 4 pages.
Deleuze, C., et al., A DNS Based Mapping Peering System for Peering CDNs, draft-deleuze-cdnp-dnsmap-peer-00.txt, Nov. 20, 2000, 20 pages.
Demers, A., “Epidemic Algorithms for Replicated Database Maintenance,” 1987, Proceedings of the sixth annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, Aug. 10-12, 1987, 12 pages.
Gruener, J., “A Vision of Togetherness,” May 24, 2004, NetworkWorld, retrieved May 3, 2006, from, http://www.networkworld.com/supp/2004/ndc3/0524virt.html, 9 pages.
Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”,May 2005, In Proc. of Networking 2005, all pages.
Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”, Dec. 18, 2004, Technical University Berlin, all pages.
Hartung et al.; Digital rights management and watermarking of multimedia content for m-commerce applications; Published in: Communications Magazine, IEEE (vol. 38, Issue: 11 ); Date of Publication: Nov. 2000; pp. 78-84; IEEE Xplore.
Horvath et al., “Enhancing Energy Efficiency in Multi-tier Web Server Clusters via Prioritization,” in Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International , vol., No., pp. 1-6, Mar. 26-30, 2007.
Ioannidis, S., et al., “Implementing a Distributed Firewall,” Nov. 2000, (ACM) Proceedings of the ACM Computer and Communications Security (CCS) 2000, Athens, Greece, pp. 190-199, retrieved from http://www.cis.upenn.edu/˜dls/STRONGMAN/Papers/df.pdf, 10 pages.
Joseph, Joshy, et al., “Introduction to Grid Computing,” Apr. 16, 2004, retrieved Aug. 30, 2007, from http://www.informit.com/articles/printerfriendly.aspx?p=169508, 19 pages.
Kalafut et al., Understanding Implications of DNS Zone Provisioning., Proceeding IMC '08 Proceedings of the 8th AMC SIGCOMM conference on Internet measurement., pp. 211-216., ACM New York, NY, USA., 2008.
Kato, Yoshinobu , Server load balancer—Difference in distribution technique and supported protocol—Focus on function to meet the needs, Nikkei Communications, Japan, Nikkei Business Publications, Inc., Mar. 20, 2000, vol. 314, pp. 114 to 123.
Kenshi, P., “Help File Library: Iptables Basics,” Justlinux, retrieved Dec. 1, 2005, from http://www.justlinux.com/nhf/Security/Iptables _ Basics.html, 4 pages.
Liu et al., “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering 61 (2007) pp. 304-330.
Maesono, et al., “A Local Scheduling Method considering Data Transfer in Data Grid,” Technical Report of IEICE, vol. 104, No. 692, pp. 435-440, The Institute of Electronics, Information and Communication Engineers, Japan, Feb. 2005.
Meng et al., “Improving the Scalability of Data Center Networks with Traffic-Aware Virtual Machine Placement”; Proceedings of the 29th Conference on Information Communications, INFOCOM'10, pp. 1154-1162. Piscataway, NJ. IEEE Press, 2010.
Mulligan et al.; How DRM-based content delivery systems disrupt expectations of “personal use”; Published in: Proceeding DRM '03 Proceedings of the 3rd ACM workshop on Digital rights management; 2003; pp. 77-89; ACM Digital Library.
Shankland, S., “Sun to buy start-up to bolster N1 ,” Jul. 30, 2003, CNet News.com, retrieved May 3, 2006, http://news.zdnet.com/2100-3513_22-5057752.html, 8 pages.
Sharif et al, “Secure In-VM Monitoring Using Hardware Virtualization”, Microsoft, Oct. 2009 http://research.microsoft.com/pubs/153179/sim-ccs09.pdf; 11 pages.
Strand, L., “Adaptive distributed firewall using intrusion detection,” Nov. 1, 2004, University of Oslo Department of Informatics, retrieved Mar. 8, 2006, from http://gnist.org/˜lars/studies/master/StrandLars-master.pdf, 158 pages.
Takizawa, et al., “Scalable MultiReplication Framework on the Grid,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2004, No. 81, pp. 247-252, Japan, Aug. 1, 2004.
Tan et al., “Classification: Basic Concepts, Decision Tree, and Model Evaluation”, Introduction in Data Mining; http://www-users.cs.umn.edu/˜kumar/dmbook/ch4.pdf, 2005, pp. 245-205.
Van Renesse, R., “Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining,” May 2003, ACM Transactions on Computer Systems (TOCS), 21 (2): 164-206, 43 pages.
Vijayan, J., “Terraspring Gives Sun's N1 a Boost,” Nov. 25, 2002, Computerworld, retrieved May 3, 2006, from http://www.computerworld.com/printthis/2002/0,4814, 76159,00.html, 3 pages.
Virtual Iron Software Home, Virtual Iron, retrieved May 3, 2006, from http://www.virtualiron.com/, 1 page.
Waldspurger, CA., “Spawn: A Distributed Computational Economy,” Feb. 1992, IEEE Transactions on Software Engineering, 18(2): 103-117, 15 pages.
Watanabe, et al., “Remote Program Shipping System for GridRPC Systems,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2003, No. 102, pp. 73-78, Japan, Oct. 16, 2003.
Xu et al., “Decision tree regression for soft classification of remote sensing data”, Remote Sensing of Environment 97 (2005) pp. 322-336.
Yamagata, et al., “A virtual-machine based fast deployment tool for Grid execution environment,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2006, No. 20, pp. 127-132, Japan, Feb. 28, 2006.
Zhu, Xiaoyun, et al., “Utility-Driven Workload Management Using Nested Control Design,” Mar. 29, 2006, HP Laboratories Palo Alto, HPL-2005-193(R. 1), retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2005/HPL-2005-193R1.pdf, 9 pages.
Supplementary European Search Report in Application No. 09729072.0 2266064 dated Dec. 10, 2014.
First Singapore Written Opinion in Application No. 201006836-9, dated Oct. 12, 2011 in 12 pages.
Singapore Written Opinion in Application No. 201006836-9, dated Apr. 30, 2012 in 10 pages.
First Office Action in Chinese Application No. 200980111422.3 dated Apr. 13, 2012.
First Office Action in Japanese Application No. 2011-502138 dated Feb. 1, 2013.
Singapore Written Opinion in Application No. 201006837-7, dated Oct. 12, 2011 in 11 pages.
Supplementary European Search Report in Application No. 09727694.3 dated Jan. 30, 2012 in 6 pages.
Singapore Examination Report in Application No. 201006837-7 dated Mar. 16, 2012.
First Office Action in Chinese Application No. 200980111426.1 dated Feb. 16, 2013.
Second Office Action in Chinese Application No. 200980111426.1 dated Dec. 25, 2013.
Third Office Action in Chinese Application No. 200980111426.1 dated Jul. 7, 2014.
Fourth Office Action in Chinese Application No. 200980111426.1 dated Jan. 15, 2015.
Fifth Office Action in Chinese Application No. 200980111426.1 dated Aug. 14, 2015.
First Office Action in Japanese Application No. 2011-502139 dated Nov. 5, 2013.
Decision of Rejection in Application No. 2011-502139 dated Jun. 30, 2014.
Singapore Written Opinion in Application No. 201006874-0, dated Oct. 12, 2011 in 10 pages.
First Office Action in Japanese Application No. 2011-502140 dated Dec. 7, 2012.
First Office Action in Chinese Application No. 200980119995.0 dated Jul. 6, 2012.
Second Office Action in Chinese Application No. 200980119995.0 dated Apr. 15, 2013.
Examination Report in Singapore Application No. 201006874-0 dated May 16, 2012.
Search Report for European Application No. 09839809.2 dated May 11, 2015.
Supplementary European Search Report in Application No. 09728756.9 dated Jan. 8, 2013.
First Office Action in Chinese Application No. 200980119993.1 dated Jul. 4, 2012.
Second Office Action in Chinese Application No. 200980119993.1 dated Mar. 12, 2013.
Third Office Action in Chinese Application No. 200980119993.1 dated Oct. 21, 2013.
First Office Action in Japanese Application No. 2011-503091 dated Nov. 18, 2013.
Office Action in Japanese Application No. 2014-225580 dated Oct. 26, 2015.
Search Report and Written Opinion issued in Singapore Application No. 201006873-2 dated Oct. 12, 2011.
First Office Action is Chinese Application No. 200980125551.8 dated Jul. 4, 2012.
First Office Action in Japanese Application No. 2011-516466 dated Mar. 6, 2013.
Second Office Action in Japanese Application No. 2011-516466 dated Mar. 17, 2014.
Decision of Refusal in Japanese Application No. 2011-516466 dated Jan. 16, 2015.
Office Action in Canadian Application No. 2726915 dated May 13, 2013.
First Office Action in Korean Application No. 10-2011-7002461 dated May 29, 2013.
First Office Action in Chinese Application No. 200980145872.4 dated Nov. 29, 2012.
First Office Action in Canadian Application No. 2741895 dated Feb. 25, 2013.
Second Office Action in Canadian Application No. 2741895 dated Oct. 21, 2013.
Search Report and Written Opinion in Singapore Application No. 201103333-9 dated Nov. 19, 2012.
Examination Report in Singapore Application No. 201103333-9 dated Aug. 13, 2013.
International Search Report and Written Opinion in PCT/US2011/053302 dated Nov. 28, 2011 in 11 pages.
International Preliminary Report on Patentability in PCT/US2011/053302 dated Apr. 2, 2013.
First Office Action in Japanese Application No. 2013-529454 dated Feb. 3, 2014 in 6 pages.
Office Action in Japanese Application No. 2013-529454 dated Mar. 9, 2015 in 8 pages.
First Office Action issued in Australian Application No. 2011307319 dated Mar. 6, 2014 in 5 pages.
Search Report and Written Opinion in Singapore Application No. 201301573-0 dated Jul. 1, 2014.
First Office Action in Chinese Application No. 201180046104.0 dated Nov. 3, 2014.
Second Office Action in Chinese Application No. 201180046104.0 dated Sep. 29, 2015.
Examination Report in Singapore Application No. 201301573-0 dated Dec. 22, 2014.
International Preliminary Report on Patentability in PCT/US2011/061486 dated May 22, 2013.
International Search Report and Written Opinion in PCT/US2011/061486 dated Mar. 30, 2012 in 11 pages.
Office Action in Canadian Application No. 2816612 dated Nov. 3, 2015.
First Office Action in Chinese Application No. 201180053405.6 dated May 3, 2015.
Second Office Action in Chinese Application No. 201180053405.6 dated Dec. 4, 2015.
Office Action in Japanese Application No. 2013-540982 dated Jun. 2, 2014.
Written Opinion in Singapore Application No. 201303521-7 dated May 20, 2014.
International Search Report and Written Opinion in PCT/US07/07601 dated Jul. 18, 2008 in 11 pages.
International Preliminary Report on Patentability in PCT/US2007/007601 dated Sep. 30, 2008 in 8 pages.
Supplementary European Search Report in Application No. 07754164.7 dated Dec. 20, 2010 in 7 pages.
Office Action in Chinese Application No. 200780020255.2 dated Mar. 4, 2013.
Office Action in Indian Application No. 3742/KOLNP/2008 dated Nov. 22, 2013.
Office Action in Japanese Application No. 2012-052264 dated Dec. 11, 2012 in 26 pages.
Office Action in Japanese Application No. 2013-123086 dated Apr. 15, 2014 in 3 pages.
Office Action in Japanese Application No. 2013-123086 dated Dec. 2, 2014 in 2 pages.
Office Action in European Application No. 07754164.7 dated Dec. 14, 2015.
Office Action in Japanese Application No. 2011-502139 dated Aug. 17, 2015.
Third Office Action in Chinese Application No. 201180046104.0 dated Apr. 14, 2016.
Office Action in Japanese Application No. 2015-533132 dated Apr. 25, 2016.
Office Action in Canadian Application No. 2884796 dated Apr. 28, 2016.
Office Action in Japanese Application No. 2015-075644 dated Apr. 5, 2016 in 15 pages.
Office Action in Japanese Application No. 2011-516466 dated May 30, 2016.
Office Action in Russian Application No. 2015114568 dated May 16, 2016.
Office Action in Chinese Application No. 201310537815.9 dated Jul. 5, 2016.
Office Action in Chinese Application No. 201310717573.1 dated Jul. 29, 2016.
Office Action in Japanese Application No. 2014-225580 dated Oct. 3, 2016.
Partial Supplementary Search Report in European Application No. 09826977.2 dated Oct. 4, 2016.
Decision of Rejection in Chinese Application No. 201180046104.0 dated Oct. 17, 2016.
Office Action in Canadian Application No. 2816612 dated Oct. 7, 2016.
Office Action in European Application No. 09839809.2 dated Dec. 8, 2016.
International Search Report and Written Opinion in PCT/US/2016/ 066848 dated May 1, 2017.
Supplementary Examination Report in Singapore Application No. 11201501987U dated May 17, 2017
Office Action in Chinese Application No. 201310537815.9 dated Jun. 2, 2017.
Office Action in Canadian Application No. 2816612 dated Aug. 8, 2017.
Guo, F., Understanding Memory Resource Management in Vmware vSphere 5.0, Vmware, 2011, pp. 1-29.
Hameed, CC, “Disk Fragmentation and System Performance”, Mar. 14, 2008, 3 pages.
Liu, “The Ultimate Guide to Preventing DNS-based DDoS Attacks”, Retrieved from http://www.infoworld.com/article/2612835/security/the-ultimate-guide-to-preventing-dns-based-ddos-attacks.html, Published Oct. 30, 2013.
Ragan, “Three Types of DNS Attacks and How to Deal with Them”, Retrieved from http://www.csoonline.com/article/2133916/malware-cybercrime/three-types-of-dns-attacks-and-how-to-deal-with-them.html, Published Aug. 28, 2013.
Office Action in European Application No. 11767118.0 dated Feb. 3, 2017.
International Search Report and Written Opinion in PCT/US2017/055156 dated Dec. 13, 2017.
Krsul et al., “VMPlants: Providing and Managing Virtual Machine Execution Environments for Grid Computing”, Nov. 6, 2004 (Nov. 6, 2004), Supercomputing, 2004. Proceedings of the ACM/IEEE SC2004 Conference Pittsburgh, PA, USA Nov. 6-12, 2004, Piscataway, NJ, USA, IEEE, 1730 Massachusetts Ave., NW Washington, DC 20036-1992 USA, 12 pages.
Zhao et al., “Distributed file system support for virtual machines in grid computing”, Jun. 4, 2004 (Jun. 4, 2004), High Performance Distributed Computing, 2004. Proceedings. 13th IEEE International Symposium on Honolulu, HI, USA Jun. 4-6, 2004, Piscataway, NJ, USA, IEEE, p. 202-211.
Office Action in Indian Application No. 5937/CHENP/2010 dated Jan. 19, 2018.
Office Action in Indian Application No. 6210/CHENP/2010 dated Mar. 27, 2018.
Office Action in Chinese Application No. 201310537815.9 dated Feb. 1, 2018.
Office Action in European Application No. 07754164.7 dated Jan. 25, 2018.
Arends et al., DNS Security Introduction and Requirements, RFC 4033, Mar. 2005, 21 pages.
Ariyapperuma et al., “Security Vulnerabilities in DNS and DNSSEC.” The Second International Conference on Availability, Reliability and Security, IEEE, 2007, 8 pages.
Chandramouli et al., “Challenges in Securing the Domain Name System.” IEEE Security & Privacy4.1 (2006),pp. 84-87.
Cohen et al., “Proactive Caching of DNS Records: Addressing a Performance Bottleneck”, Proceedings of Saint 2001 Symposium on Applications and the Internet; 8-12, Jan. 8, 2001, IEEE Computer Society, pp. 85-94.
Eastlake, Donald, Domain Name System Security Extensions, RFC 2535, Mar. 1999, 47 pages.
JH Software, Moving a DNS Server to a New IP Address, last updated Jan. 26, 2006, 1 page.
Office Action in Application No. 09729072.0 dated May 14, 2018.
Examination Report in Indian Application No. 6213/CHENP/2010 dated May 23, 2018.
Office Action in European Application No. 11767118.0 dated Jul. 25, 2018.
Extended Search Report in European Application No. 18156163 dated Sep. 3, 2018.
Office Action in Chinese Application No. 2013800492635 dated Aug. 30, 2017.
International Preliminary Report on Patentability in PCT/US/2016/ 066848 dated Jun. 19, 2018.
Office Action in Application No. 09729072.0 dated Dec. 7, 2018.
Examination Report in Indian Application No. 4487/DELNP/2013 dated Dec. 28, 2018.

Related Publications (1)

	Number	Date	Country
	20170180267 A1	Jun 2017	US

Use of virtual endpoints to improve data transmission rates

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications