Distributing application traffic to servers based on dynamic service response time
Provided are methods and systems for distributing application traffic. A method for distributing application traffic may commence with receiving, from a host, a first service request for a first service session. The first service request may be associated with a service request time. The method may continue with relaying the first service request from a service gateway to a server. The method may further include receiving, from the server, a service response. The service response may be associated with a service response time. The method may continue with calculating a service processing time for the first service request based on the service request time and the service response time. The method may further include receiving, from the host, a second service request for a second service session. The method may continue with selectively relaying the second server request to the server based on the service processing time.
Latest A10 Networks, Inc. Patents:
The present application is a continuation of U.S. Nonprovisional patent application Ser. No. 15/460,029, filed Mar. 15, 2017, titled “Distributing Application Traffic to Servers Based On Dynamic Service Response Time” which is a continuation of, and claims the priority benefit of, U.S. Nonprovisional patent application Ser. No. 12/958,435, filed Dec. 2, 2010, titled “Distributing Application Traffic to Servers Based on Dynamic Service Response Time”, now U.S. Pat. No. 9,609,052, issued on Mar. 28, 2017. The disclosures of the above applications are hereby incorporated by reference in their entirety, including all references cited therein.
TECHNICAL FIELDThis disclosure relates generally to data communications, and more specifically, to a method and system for distributing application traffic to servers based on service process parameters.
BACKGROUND OF THE DISCLOSUREWeb services and cloud computing are deployed in an unprecedented pace. New servers are unloaded and installed at data centers every day. Demands of web services and corporate computing come from all directions. Consumer oriented services include smartphone apps, mobile applications such as location based services, turn-by-turn navigation services, e-book services such as Kindle™, video applications such as YouTube™ or Hulu™, music applications such as Pandora™ or iTunes™, Internet television services such as Netflix™, and many other fast growing consumer Web services. On the corporate front, cloud computing based services such as Google™ docs, Microsoft™ Office Live and Sharepoint™ software, Salesforce.com™'s on-line software services, tele-presence and web conferencing services, and many other corporate cloud computing services.
As a result more and more servers are deployed to accommodate the increasing computing needs. Traditionally these servers are managed by a service gateway such as Application Delivery Controller or Server Load Balancer (ADC/SLB) are typically network appliances in a fixed module or in a chassis or a software module running in a commoditized server ADC/SLB manage the application traffic to servers based on incoming service requests. Common methods to distribute traffic among servers is to distribute the service requests based on the applications (HTTP, FTP, HTTPS etc.), service addresses such as URL, priorities based on network interfaces or host IP addresses. ADC/SLB may distribute the service requests to a server assuming the server is fully available to handle the service requests. Typically, a fully loaded server does not handle service requests well. In fact, most if not all service requests suffer delay or no service available when a server is busy. It is often better not to further distribute service request to a busy server.
Current ADC/SLB allows a network administrator to set a maximum service session capacity so that ADC/SLB does not send more than the maximum capacity service requests to the server. However, statically configured limitation on a server cannot fully utilize the server's capacity and not all service requests require the same processing from the server. It is beneficial for an ADC/SLB to determine if a server is busy based on the service response time from a server such that the ADC/SLB can reduce sending further service requests to the server.
Therefore, there is a need for a system and method for an ADC/SLB to protect a server overloading based on dynamic service response time.
BRIEF SUMMARYThis summary is provided to introduce a selection of concepts in a simplified form that are further described in the Detailed Description below. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.
Provided are computer-implemented methods and systems for distributing application traffic. According to one example embodiment, a system for distributing application traffic may include a server configured to process service requests and a service gateway. The service gateway may be configured to receive, from a host, a first service request for a first service session. The first service request may be associated with a service request time. The service gateway may be further configured to relay the first service request from the service gateway to the server. The service gateway may be further configured to receive, from the server, a service response. The service response may be associated with a service response time. The service gateway may calculate a service processing time for the first service request based on the service request time and the service response time. The service gateway may receive, from the host, a second service request for a second service session and selectively relay the second server request to the server based on the service processing time.
According to one example embodiment, a method for distributing application traffic may commence with receiving, from a host, a first service request for a first service session. The first service request may be associated with a service request time. The method may continue with relaying the first service request from a service gateway to a server of a plurality of servers. The method may further include receiving, from the server, a service response. The service response may be associated with a service response time. The method may continue with calculating a service processing time for the first service request based on the service request time and the service response time. The method may further include receiving, from the host, a second service request for a second service session. The method may continue with selectively relaying the second server request to the server based on the service processing time.
Other features, examples, and embodiments are described below. System and computer program products corresponding to the above-summarized methods are also described and claimed herein.
The accompanying drawings, where like reference numerals refer to identical or functionally similar elements throughout the separate views, together with the detailed description below, are incorporated in and form part of the specification, and serve to further illustrate embodiments of concepts that include the claimed disclosure, and explain various principles and advantages of those embodiments.
The methods and systems disclosed herein have been represented where appropriate by conventional symbols in the drawings, showing only those specific details that are pertinent to understanding the embodiments of the present disclosure so as not to obscure the disclosure with details that will be readily apparent to those of ordinary skill in the art having the benefit of the description herein.
Embodiments of the present disclosure can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, etc.
Furthermore, the invention can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, propagate, or transport eh program for use by or in connection with the instruction execution system, apparatus, or device.
The medium can be an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system (or apparatus or device) or a propagation medium. Examples of a computer-readable medium include a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk. Current examples of optical disks include compact disk—read only memory (CD-ROM), compact disk—read/write (CD-R/W) and DVD.
A data processing system suitable for storing and/or executing program code will include at least one processor coupled directly or indirectly to memory elements through a system bus. The memory elements can include local memory employed during actual execution of the program code, bulk storage, and cache memories which provide temporary storage of at least some program code in order to reduce the number of times code must be retrieved from bulk storage during execution.
Input/output or I/O devices (including but not limited to keyboards, displays, point devices, etc.) can be coupled to the system either directly or through intervening I/O controllers.
Network adapters may also be coupled to the system to enable the data processing system to become coupled to other data processing systems or remote printers or storage devices through intervening private or public networks. Modems, cable modem and Ethernet cards are just a few of the currently available types of network adapters.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified local function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
Host 100 is a computing device with network access capabilities. The host 100 is operationally coupled to a processor 103 and a computer readable medium 104. The computer readable medium 104 stores computer readable program code for implementing the various embodiments of the present invention as described herein. In one embodiment, host 100 is a workstation, a desktop personal computer or a laptop personal computer. In one embodiment, host 100 is a Personal Data Assistant (PDA), a smartphone, or a cellular phone. In one embodiment, host 100 is a set-top box, an Internet media viewer, an Internet media player, a smart sensor, a smart medical device, a net-top box, a networked television set, a networked DVR, a networked Blu-ray player, or a media center.
In one embodiment, data network 153 is an Internet Protocol (IP) network. In one embodiment, data network 153 is a corporate data network or a regional corporate data network. In one embodiment, data network 153 is an Internet service provider network. In one embodiment, data network 153 is a residential data network. In one embodiment, data network 153 includes a wired network such as Ethernet. In one embodiment, data network 153 includes a wireless network such as a WiFi network, or cellular network.
The service gateway 110 is operationally coupled to a processor 113 and a computer readable medium 114. The computer readable medium 114 stores computer readable program code, which when executed by the processor 113, implements the various embodiments of the present invention as described herein. In some embodiments, service gateway 110 is implemented as a server load balancer, an application delivery controller, a service delivery platform, a traffic manager, a security gateway, a component of a firewall system, a component of a virtual private network (VPN), a load balancer for video servers, or a gateway to distribute load to a plurality of servers.
Server 200 is operationally coupled to a processor 213 and a computer readable medium 214. The computer readable medium 214 stores computer readable program code, which when executed by the processor 213, implements the various embodiments of the present invention as described herein. In some embodiments, the computer readable program code implements server 200 as a Web server, a file server, a video server, a database server, an application server, a voice system, a conferencing server, a media gateway, a SIP server, a remote access server, a VPN server, or a media center.
Service gateway 110 connects to server 200 via data network 155. In one embodiment, data network 155 is the same as data network 153. In one embodiment, data network 155 is different from data network 153. In one embodiment, host 100 does not have direct access to data network 155. In one embodiment, host 100 has direct access to data network 155.
After server 200 processes service request 301, server 200 responds with a service response 352. In one embodiment, service response 352 includes a web page, a document, a file, a picture, a streaming of audio or video signals, or a voice call. In one embodiment, service response 352 includes an error indication 354. Error indication 354 may include a HTTP error status code, a FTP error code, SIP error message, or any other error code.
Service gateway 110 receives service response 352 and relays the service response 352 to host 100 (703). Service gateway 110 determines service response time 362 upon receipt of service response 352 (704). In an embodiment, service response time 362 is a time stamp such as a time of the day, a system time, a time counter, and is compatible with service request time 361. In one embodiment, service response time 362 is a time when service gateway 110 receives service response 352. In one embodiment, service response time 362 is a time when service gateway 110 receives first piece of information of service response 352. In one embodiment, service response time 362 is a time when service gateway 110 receives the last piece of information of service response 352. In one embodiment, service response time 362 is a time when service gateway 110 disconnects service session 321 from server 200. In one embodiment, service response time 362 is included in service response 352.
After determining service request time 361 and service response time 362, service gateway 110 calculates service processing time 360 for service request 301 from the service request time and service response time (705). Service processing time 360 typically measures the duration between service request time 361 and service response time 362. In one example, service gateway 110 subtracts service request time 361 from service response time 362 to obtain service processing time 360. In another example, service gateway 110 calculates the duration between service request time 361 and service response time 362 to determine service process time. For example, service processing time 360 is 10 milliseconds, 5 milliseconds, 247 milliseconds, 3 seconds, 15 seconds, 1 minute, 75 microseconds, or 289 units of time.
In one embodiment, service gateway 110 verifies service response 352 prior to calculating service processing time 360. In an example, service gateway 110 verifies service response 352 if the response contains an error indication 354. In one embodiment, if there is an error indicated in error indication 354, service gateway 110 does not calculate service processing time 360 for the service request 301.
In one embodiment, service gateway 110 includes a completed service session counter 326, which counts the number of completed service sessions between service gateway 110 and server 200. In one embodiment, service gateway 110 increments the completed service session counter 326 by 1 after service gateway 110 receives service response 352 or after service gateway 110 disconnects service session 321 from server 200. In one embodiment, service gateway 110 increments the completed service session counter 326 by 1 after determining service processing time 360.
Service gateway 110 includes an expected service processing time 374. Referring to both
Service gateway 110 determines whether service processing time 360 is less than expected service processing time 374 (707), and in response, service gateway 110 updates server busy indicator 378 to ‘Not Busy’ (709). After updating server busy indicator 378, service gateway 110 receives a next service request from host 100.
Expected service processing time 374 may be based on service request 301. In various embodiments, service request 301 comprises a service request Universal Resource Locator (URL), and expected service processing time 374 is configured according to a service attribute 379. The service attribute 379 is an attribute affecting the expected service processing time 374. For example, different protocols would process service requests at different rates, and thus would have different expected service processing times. Service attribute 379 is based on service request URL, or part of service request URL such as the domain name, a web folder name in the web site, a document type, or a protocol indicated in service request URL. For example, if a hypothetical service request URL is “www.abc.com/shops/shoe.html”. Service attribute 379 is based on domain name “www.abc.com”, web folder “www.abc.com/shops”, document type .html (or other document type such as .php, .asp, etc.), protocol http (or other protocols such as ftp, https, sip, etc.). Service attribute 379 may also be related to program code implemented on server 200. For example, server 200 is a web server using Apache web server software, Microsoft web server software, Oracle web server software or other web server software. Service attribute 379 is related to the web server software.
In various embodiments, service attribute 379 is based on the domain name and the expected service processing time 374 is 10 milliseconds. Service attribute 379 may also be based on HTTP protocol with an expected service processing time 374 of 75 milliseconds. In other embodiments, service attribute 379 is based on FTP file download protocol and the expected service processing time 374 is 2 minutes. In still other embodiments, service attribute 379 is based on HTML document type and the expected service processing time 374 is 20 milliseconds.
In one embodiment, service attribute 379 relates to program code implemented on server 200. In an embodiment, server 200 uses Apache web server software and expected processing time is 50 milliseconds. In an embodiment, server 200 uses Microsoft web server software and expected processing time is 90 milliseconds.
In one embodiment, service attribute 379 relates to a plurality of attributes mentioned in above description. Expected processing time may be determined by a summation of a plurality of expected processing times for the plurality of attributes.
In one embodiment, service gateway 110 includes a datastore 380, which stores the expected service processing time 374 and associated service attribute 379. In an embodiment, service gateway 110 compares service request 301 or server 200 against service attribute 379 in datastore 380. If there is a match, service gateway 110 retrieves expected service processing time 374 associated with the matched service attribute 379, and compares the retrieved expected service processing time 374 with the service processing time 360. In one embodiment, expected service processing time 374 is not related to any service attribute. Service gateway 110 retrieves expected service processing time 374 and compares to service processing time 360.
In one embodiment, expected service processing time 374 is configured by a user.
In one embodiment, expected service processing time 374 is automatically determined based on service processing times of previous service sessions. Upon determining service processing time 360, service gateway 110 calculates an adjusted expected service processing time 376 by using the formula:
Service gateway 110 calculates adjusted expected service processing time 376 prior to changing competed service session counter 326. Service gateway 110 does not adjust expected service processing time 374 if service processing time 360 exceeds expected service processing time 374, or if service response 352 includes an error indication 354. In this embodiment, service gateway 110 does not change completed service session counter 326.
In one embodiment, expected service processing time 374 is associated with service attribute 379. Completed service session counter 326 is also associated with service attribute 379 in order to implement separate counters for each service attribute. Service gateway 110 checks if service request 301 or server 200 matches service attribute 379 prior to calculating adjusted expected service processing time 376.
In one embodiment, service gateway 110 replaces expected service processing time 374 with adjusted expected service processing time 376. The adjusted expected service processing time 376 becomes the expected service processing time 374 for the next service session between the service gateway 110 and the server 200.
After the service gateway 110 updates server busy indication, the service gateway 110 receives a next service request from the host (71) and the process repeats (710).
In one embodiment, server busy indicator 378 has an updated value of ‘Busy’. In one embodiment, service gateway 110 does not immediately process service request buffer 331. Service gateway 110 includes a timer 119. When timer 119 expires, service gateway 110 finds the service request 301 in the service request buffer 331 and relays service request 301 in service request buffer 331 to server 200 (701). Timer 119 may be configured for duration of, for example, 1 minute, 30 seconds, 1 second, 400 milliseconds, 5 milliseconds, 300 microseconds, or any other duration such that service to service request 301 is not severely affected. In one embodiment, time duration is based on attributes of the service request 301.
Service request buffer 331 is configured to store service requests with service priority 401. In the embodiment where server busy indicator 378 has an updated value of ‘Busy’, service gateway 110 compares service priority 403 to service priority 401. In response to finding a match, service gateway 110 places service request 303 into service request buffer 331.
In one embodiment, service gateway 110 includes a second service request buffer 332. Service request buffer 332 is configured to store service request with service priority 402, which is higher than service priority 401.
In the embodiment where server busy indicator 378 has an updated value of ‘Not Busy’, service gateway 110 processes service requests in service request buffer 332 prior to service request buffer 331. In one embodiment, service gateway 110 sends service request 302 in service request buffer 332 to server 200 prior to sending service request 301 in service request buffer 331 to server 200.
In one embodiment, service gateway 110 processes all service requests from service request buffer 332 before processing service request buffer 331. In one embodiment, service gateway 110 includes a serving ratio 117 wherein service gateway 110 processes service request buffer 332 and service request buffer 331 according to ratio 117, where serving ratio 117 favors high priority service request buffer 332 to the lower priority service request buffer 331 in order to avoid starving the lower priority service requests in service request buffer 331.
Although the present invention has been described in accordance with the embodiments shown, one of ordinary skill in the art will readily recognize that there could be variations to the embodiments and those variations would be within the spirit and scope of the present invention. Accordingly, many modifications may be made by one of ordinary skill in the art without departing from the spirit and scope of the appended claims.
Claims
1. A system for distributing application traffic, the system comprising:
- a server of a plurality of servers, the server being configured to process service requests; and
- a service gateway comprising a processor and a computer readable storage medium having computer readable program code embodied therewith, wherein the computer readable program code, when executed by the processor, causes the service gateway to:
- receive, from a host, a first service request for a first service session, the first service request being associated with a service request time;
- relay the first service request from the service gateway to the server;
- receive, from the server, a service response, the service response being associated with a service response time;
- calculate a service processing time for the first service request based on the service request time and the service response time, the expected service processing time being determined by the service gateway and stored in a datastore together with a service attribute of a service request or a service attribute of one of the plurality of servers, the service gateway determining the expected service processing time by comparing the service attribute of the first service request or the service attribute of the server with the service attribute in the datastore, and if the service attribute of the first service request or the service attribute of the server matches the service attribute in the datastore, retrieving the expected service processing time associated with the matching service attribute from the datastore, wherein the expected service processing time is variable based on the matching service attribute;
- compare the service processing time with an expected service processing time for the server to determine whether the service processing time exceeds the expected service processing time by at least a threshold amount;
- receive, from the host, a second service request for a second service session; and
- selectively relay the second server request to the server based on the service processing time.
2. The system of claim 1, wherein the service attribute is one or more of the following: a URL, a protocol, a domain name, a web folder name, and a document type.
3. The system of claim 1, wherein the service gateway is further configured to update a server busy indicator for the server in response to the comparing, wherein a server busy indicator for each of the plurality of servers is maintained at the service gateway.
4. The system of claim 3, wherein the updating the server busy indicator for the server comprises:
- in response to determining that the service processing time exceeds the expected service processing time by at least the threshold amount, updating, by the service gateway, the server busy indicator to indicate that the server is busy; and
- in response to determining that the service processing time does not exceed the expected service processing time by at least the threshold amount, updating, by the service gateway, the server busy indicator to indicate that the server is not busy.
5. The system of claim 3, wherein the selectively relaying the second server request to the server comprises:
- checking, by the service gateway, the server busy indicator for the server;
- in response to determining that the server busy indicator indicates that the server is busy, placing, by the service gateway, the second service request in a service request buffer of the service gateway and maintaining a connection to the host; and
- in response to that determination that the server busy indicator indicates that the server is not busy, relaying, by the service gateway, the second service request from the service gateway to the server.
6. The system of claim 5, wherein the selectively relaying the second service request from the service gateway to the server comprises:
- checking, by the service gateway, whether the service request buffer is empty;
- in response to determining that the service request buffer is empty, relaying, by the service gateway, the second service request from the service gateway to the server; and
- in response to determining that the service request buffer is not empty, placing, by the service gateway, the second service request in the service request buffer.
7. The system of claim 6, wherein the second service request is associated with a priority, the service request buffer being configured to store service requests associated with the priority, and wherein the placing the second service request in the service request buffer of the service gateway further comprises:
- relaying the second service request in the service request buffer from the service gateway to a further server of the plurality of servers according to the priority.
8. The system of claim 1, wherein the calculating the service processing time for the first service request comprises:
- calculating, by the service gateway, the service processing time for the first service request as a duration between the service request time and the service response time.
9. A method for distributing application traffic, the method comprising:
- receiving, from a host, by a service gateway, a first service request for a first service session, the first service request being associated with a service request time;
- relaying, by the service gateway, the first service request from the service gateway to a server of a plurality of servers;
- receiving, by the service gateway, from the server, a service response, the service response being associated with a service response time;
- calculating, by the service gateway, a service processing time for the first service request based on the service request time and the service response time, the expected service processing time being determined by the service gateway and stored in a datastore together with a service attribute of a service request or a service attribute of one of the plurality of servers, the service gateway determining the expected service processing time by comparing the service attribute of the first service request or the service attribute of the server with the service attribute in the datastore, and if the service attribute of the first service request or the service attribute of the server matches the service attribute in the datastore, retrieving the expected service processing time associated with the matching service attribute from the datastore, wherein the expected service processing time is variable based on the matching service attribute;
- compare the service processing time with an expected service processing time for the server to determine whether the service processing time exceeds the expected service processing time by at least a threshold amount;
- receiving, by the service gateway, from the host, a second service request for a second service session; and
- selectively relaying, by the service gateway, the second server request to the server based on the service processing time.
10. The method of claim 9, further comprising updating, by the service gateway, a server busy indicator for the server in response to the comparing, wherein a server busy indicator for each of the plurality of servers is maintained at the service gateway.
11. The method of claim 10, wherein the updating the server busy indicator for the server comprises:
- in response to determining that the service processing time exceeds the expected service processing time by at least the threshold amount, updating, by the service gateway, the server busy indicator to indicate that the server is busy; and
- in response to determining that the service processing time does not exceed the expected service processing time by at least the threshold amount, updating, by the service gateway, the server busy indicator to indicate that the server is not busy.
12. The method of claim 10, wherein the selectively relaying the second server request to the server comprises:
- checking, by the service gateway, the server busy indicator for the server;
- in response to determining that the server busy indicator indicates that the server is busy, placing, by the service gateway, the second service request in a service request buffer of the service gateway and maintaining a connection to the host; and
- in response to determining that the server busy indicator indicates that the server is not busy, relaying, by the service gateway, the second service request from the service gateway to the server.
13. The method of claim 12, wherein the selectively relaying the second service request from the service gateway to the server comprises:
- checking, by the service gateway, if the service request buffer is empty;
- in response to determining that the service request buffer is empty, relaying, by the service gateway, the second service request from the service gateway to the server; and
- in response to determining that the service request buffer is not empty, placing, by the service gateway, the second service request in the service request buffer.
14. The method of claim 13, wherein the second service request is associated with a priority, the service request buffer is configured to store service requests associated with the priority, and wherein the placing the second service request in the service request buffer of the service gateway further comprises:
- relaying the second service request in the service request buffer from the service gateway to a further server of the plurality of servers according to the associated priority.
15. The method of claim 9, wherein the calculating the service processing time for the first service request comprises:
- calculating, by the service gateway, the service processing time for the first service request as a duration between the service request time and the service response time.
5218602 | June 8, 1993 | Grant |
5774660 | June 30, 1998 | Brendel et al. |
5935207 | August 10, 1999 | Logue et al. |
5958053 | September 28, 1999 | Denker |
5995981 | November 30, 1999 | Wikstrom |
6003069 | December 14, 1999 | Cavill |
6047268 | April 4, 2000 | Bartoli et al. |
6131163 | October 10, 2000 | Wiegel |
6219706 | April 17, 2001 | Fan et al. |
6259705 | July 10, 2001 | Takahashi et al. |
6321338 | November 20, 2001 | Porras et al. |
6374300 | April 16, 2002 | Masters |
6459682 | October 1, 2002 | Ellesson et al. |
6587866 | July 1, 2003 | Modi et al. |
6748414 | June 8, 2004 | Boumas |
6772334 | August 3, 2004 | Glawitsch |
6779017 | August 17, 2004 | Lamberton et al. |
6779033 | August 17, 2004 | Watson et al. |
6952728 | October 4, 2005 | Alles et al. |
7010605 | March 7, 2006 | Dharmarajan |
7013482 | March 14, 2006 | Krumel |
7058718 | June 6, 2006 | Fontes et al. |
7069438 | June 27, 2006 | Balabine et al. |
7076555 | July 11, 2006 | Orman et al. |
7143087 | November 28, 2006 | Fairweather |
7181524 | February 20, 2007 | Lele |
7218722 | May 15, 2007 | Turner |
7228359 | June 5, 2007 | Monteiro |
7234161 | June 19, 2007 | Maufer et al. |
7236457 | June 26, 2007 | Joe |
7254133 | August 7, 2007 | Govindarajan et al. |
7269850 | September 11, 2007 | Govindarajan et al. |
7277963 | October 2, 2007 | Dolson et al. |
7301899 | November 27, 2007 | Goldstone |
7308499 | December 11, 2007 | Chavez |
7310686 | December 18, 2007 | Uysal |
7328267 | February 5, 2008 | Bashyam et al. |
7334232 | February 19, 2008 | Jacobs et al. |
7337241 | February 26, 2008 | Boucher et al. |
7343399 | March 11, 2008 | Hayball et al. |
7349970 | March 25, 2008 | Clement et al. |
7370353 | May 6, 2008 | Yang |
7391725 | June 24, 2008 | Huitema et al. |
7398317 | July 8, 2008 | Chen et al. |
7423977 | September 9, 2008 | Joshi |
7430755 | September 30, 2008 | Hughes et al. |
7463648 | December 9, 2008 | Eppstein et al. |
7467202 | December 16, 2008 | Savchuk |
7472190 | December 30, 2008 | Robinson |
7492766 | February 17, 2009 | Cabeca et al. |
7506360 | March 17, 2009 | Wilkinson et al. |
7509369 | March 24, 2009 | Tormasov |
7512980 | March 31, 2009 | Copeland et al. |
7533409 | May 12, 2009 | Keane et al. |
7552323 | June 23, 2009 | Shay |
7584262 | September 1, 2009 | Wang et al. |
7584301 | September 1, 2009 | Joshi |
7590736 | September 15, 2009 | Hydrie et al. |
7613193 | November 3, 2009 | Swami et al. |
7613822 | November 3, 2009 | Joy et al. |
7673072 | March 2, 2010 | Boucher et al. |
7675854 | March 9, 2010 | Chen et al. |
7703102 | April 20, 2010 | Eppstein et al. |
7707295 | April 27, 2010 | Szeto et al. |
7711790 | May 4, 2010 | Barrett et al. |
7739395 | June 15, 2010 | Parlamas et al. |
7747748 | June 29, 2010 | Allen |
7751409 | July 6, 2010 | Carolan |
7765328 | July 27, 2010 | Bryers et al. |
7792113 | September 7, 2010 | Foschiano et al. |
7808994 | October 5, 2010 | Vinokour et al. |
7826487 | November 2, 2010 | Mukerji et al. |
7881215 | February 1, 2011 | Daigle et al. |
7948952 | May 24, 2011 | Hurtta et al. |
7970934 | June 28, 2011 | Patel |
7983258 | July 19, 2011 | Ruben et al. |
7990847 | August 2, 2011 | Leroy et al. |
7991859 | August 2, 2011 | Miller et al. |
8019870 | September 13, 2011 | Eppstein et al. |
8032634 | October 4, 2011 | Eppstein et al. |
8090866 | January 3, 2012 | Bashyam et al. |
8122116 | February 21, 2012 | Matsunaga et al. |
8179809 | May 15, 2012 | Eppstein et al. |
8185651 | May 22, 2012 | Moran et al. |
8191106 | May 29, 2012 | Choyi et al. |
8224971 | July 17, 2012 | Miller et al. |
8266235 | September 11, 2012 | Jalan et al. |
8296434 | October 23, 2012 | Miller et al. |
8312507 | November 13, 2012 | Chen et al. |
8379515 | February 19, 2013 | Mukerji |
8499093 | July 30, 2013 | Grosser et al. |
8539075 | September 17, 2013 | Bali et al. |
8554929 | October 8, 2013 | Szeto et al. |
8560693 | October 15, 2013 | Wang et al. |
8584199 | November 12, 2013 | Chen et al. |
8595791 | November 26, 2013 | Chen et al. |
RE44701 | January 14, 2014 | Chen et al. |
8675488 | March 18, 2014 | Sidebottom et al. |
8681610 | March 25, 2014 | Mukerji |
8750164 | June 10, 2014 | Casado et al. |
8782221 | July 15, 2014 | Han |
8813180 | August 19, 2014 | Chen et al. |
8826372 | September 2, 2014 | Chen et al. |
8879427 | November 4, 2014 | Krumel |
8885463 | November 11, 2014 | Medved et al. |
8897154 | November 25, 2014 | Jalan et al. |
8965957 | February 24, 2015 | Barros |
8977749 | March 10, 2015 | Han |
8990262 | March 24, 2015 | Chen et al. |
9094364 | July 28, 2015 | Jalan et al. |
9106561 | August 11, 2015 | Jalan et al. |
9154577 | October 6, 2015 | Jalan et al. |
9154584 | October 6, 2015 | Han |
9215275 | December 15, 2015 | Kannan et al. |
9253152 | February 2, 2016 | Chen et al. |
9270705 | February 23, 2016 | Chen et al. |
9270774 | February 23, 2016 | Jalan et al. |
9338225 | May 10, 2016 | Jalan et al. |
9350744 | May 24, 2016 | Chen et al. |
9356910 | May 31, 2016 | Chen et al. |
9386088 | July 5, 2016 | Zheng et al. |
9531846 | December 27, 2016 | Han et al. |
9544364 | January 10, 2017 | Jalan et al. |
9602442 | March 21, 2017 | Han |
9609052 | March 28, 2017 | Jalan et al. |
9705800 | July 11, 2017 | Sankar et al. |
9843484 | December 12, 2017 | Sankar et al. |
9900252 | February 20, 2018 | Chiong |
9906422 | February 27, 2018 | Jalan et al. |
9906591 | February 27, 2018 | Jalan et al. |
9942152 | April 10, 2018 | Jalan et al. |
9942162 | April 10, 2018 | Golshan et al. |
9961136 | May 1, 2018 | Jalan et al. |
20010049741 | December 6, 2001 | Skene et al. |
20020032777 | March 14, 2002 | Kawata et al. |
20020078164 | June 20, 2002 | Reinschmidt |
20020091844 | July 11, 2002 | Craft et al. |
20020103916 | August 1, 2002 | Chen et al. |
20020133491 | September 19, 2002 | Sim et al. |
20020138618 | September 26, 2002 | Szabo |
20020143991 | October 3, 2002 | Chow et al. |
20020178259 | November 28, 2002 | Doyle et al. |
20020191575 | December 19, 2002 | Kalavade et al. |
20020194335 | December 19, 2002 | Maynard |
20020194350 | December 19, 2002 | Lu et al. |
20030009591 | January 9, 2003 | Hayball et al. |
20030014544 | January 16, 2003 | Pettey |
20030023711 | January 30, 2003 | Parmar et al. |
20030023873 | January 30, 2003 | Ben-Itzhak |
20030035409 | February 20, 2003 | Wang et al. |
20030035420 | February 20, 2003 | Niu |
20030065762 | April 3, 2003 | Stolorz et al. |
20030091028 | May 15, 2003 | Chang |
20030131245 | July 10, 2003 | Linderman |
20030135625 | July 17, 2003 | Fontes et al. |
20030195962 | October 16, 2003 | Kikuchi et al. |
20040062246 | April 1, 2004 | Boucher et al. |
20040073703 | April 15, 2004 | Boucher et al. |
20040078419 | April 22, 2004 | Ferrari et al. |
20040078480 | April 22, 2004 | Boucher et al. |
20040111516 | June 10, 2004 | Cain |
20040128312 | July 1, 2004 | Shalabi et al. |
20040139057 | July 15, 2004 | Hirata et al. |
20040139108 | July 15, 2004 | Tang et al. |
20040141005 | July 22, 2004 | Banatwala et al. |
20040143599 | July 22, 2004 | Shalabi et al. |
20040187032 | September 23, 2004 | Gels et al. |
20040199616 | October 7, 2004 | Karhu |
20040199646 | October 7, 2004 | Susai et al. |
20040202182 | October 14, 2004 | Lund et al. |
20040210623 | October 21, 2004 | Hydrie et al. |
20040210663 | October 21, 2004 | Phillips et al. |
20040213158 | October 28, 2004 | Collett et al. |
20040268358 | December 30, 2004 | Darling et al. |
20050005207 | January 6, 2005 | Herneque |
20050009520 | January 13, 2005 | Herrero et al. |
20050021848 | January 27, 2005 | Jorgenson |
20050027862 | February 3, 2005 | Nguyen et al. |
20050036501 | February 17, 2005 | Chung et al. |
20050036511 | February 17, 2005 | Baratakke et al. |
20050044270 | February 24, 2005 | Grove et al. |
20050074013 | April 7, 2005 | Hershey et al. |
20050080890 | April 14, 2005 | Yang et al. |
20050102400 | May 12, 2005 | Nakahara et al. |
20050125276 | June 9, 2005 | Rusu |
20050163073 | July 28, 2005 | Heller et al. |
20050198335 | September 8, 2005 | Brown et al. |
20050213586 | September 29, 2005 | Cyganski et al. |
20050240989 | October 27, 2005 | Kim et al. |
20050249225 | November 10, 2005 | Singhal |
20050259586 | November 24, 2005 | Hafid et al. |
20050289231 | December 29, 2005 | Harada |
20060023721 | February 2, 2006 | Miyake et al. |
20060036610 | February 16, 2006 | Wang |
20060036733 | February 16, 2006 | Fujimoto et al. |
20060064478 | March 23, 2006 | Sirkin |
20060069774 | March 30, 2006 | Chen et al. |
20060069804 | March 30, 2006 | Miyake et al. |
20060077926 | April 13, 2006 | Rune |
20060092950 | May 4, 2006 | Arregoces et al. |
20060098645 | May 11, 2006 | Walkin |
20060112170 | May 25, 2006 | Sirkin |
20060168319 | July 27, 2006 | Trossen |
20060187901 | August 24, 2006 | Cortes et al. |
20060190997 | August 24, 2006 | Mahajani et al. |
20060209789 | September 21, 2006 | Gupta et al. |
20060230129 | October 12, 2006 | Swami et al. |
20060233100 | October 19, 2006 | Luft et al. |
20060251057 | November 9, 2006 | Kwon et al. |
20060277303 | December 7, 2006 | Hegde et al. |
20060280121 | December 14, 2006 | Matoba |
20070019543 | January 25, 2007 | Wei et al. |
20070086382 | April 19, 2007 | Narayanan et al. |
20070094396 | April 26, 2007 | Takano et al. |
20070118881 | May 24, 2007 | Mitchell et al. |
20070156919 | July 5, 2007 | Potti et al. |
20070165622 | July 19, 2007 | O'Rourke et al. |
20070185998 | August 9, 2007 | Touitou et al. |
20070195792 | August 23, 2007 | Chen et al. |
20070230337 | October 4, 2007 | Igarashi et al. |
20070245090 | October 18, 2007 | King et al. |
20070259673 | November 8, 2007 | Willars et al. |
20070283429 | December 6, 2007 | Chen et al. |
20070286077 | December 13, 2007 | Wu |
20070288247 | December 13, 2007 | Mackay |
20070294209 | December 20, 2007 | Strub et al. |
20080031263 | February 7, 2008 | Ervin et al. |
20080101396 | May 1, 2008 | Miyata |
20080109452 | May 8, 2008 | Patterson |
20080109870 | May 8, 2008 | Sherlock et al. |
20080134332 | June 5, 2008 | Keohane et al. |
20080162679 | July 3, 2008 | Maher et al. |
20080228781 | September 18, 2008 | Chen et al. |
20080250099 | October 9, 2008 | Shen et al. |
20080263209 | October 23, 2008 | Pisharody et al. |
20080271130 | October 30, 2008 | Ramamoorthy |
20080282254 | November 13, 2008 | Blander et al. |
20080291911 | November 27, 2008 | Lee et al. |
20090049198 | February 19, 2009 | Blinn et al. |
20090070470 | March 12, 2009 | Bauman et al. |
20090077651 | March 19, 2009 | Poeluev |
20090092124 | April 9, 2009 | Singhal et al. |
20090106830 | April 23, 2009 | Maher |
20090138606 | May 28, 2009 | Moran et al. |
20090138945 | May 28, 2009 | Savchuk |
20090141634 | June 4, 2009 | Rothstein et al. |
20090164614 | June 25, 2009 | Christian et al. |
20090172093 | July 2, 2009 | Matsubara |
20090213858 | August 27, 2009 | Dolganow et al. |
20090222583 | September 3, 2009 | Josefsberg et al. |
20090227228 | September 10, 2009 | Hu et al. |
20090228547 | September 10, 2009 | Miyaoka et al. |
20090262741 | October 22, 2009 | Jungck et al. |
20090271472 | October 29, 2009 | Scheifler et al. |
20090313379 | December 17, 2009 | Rydnell et al. |
20100008229 | January 14, 2010 | Bi et al. |
20100023621 | January 28, 2010 | Ezolt et al. |
20100036952 | February 11, 2010 | Hazlewood et al. |
20100054139 | March 4, 2010 | Chun et al. |
20100061319 | March 11, 2010 | Aso et al. |
20100064008 | March 11, 2010 | Yan et al. |
20100082787 | April 1, 2010 | Kommula et al. |
20100083076 | April 1, 2010 | Ushiyama |
20100094985 | April 15, 2010 | Abu-Samaha et al. |
20100098417 | April 22, 2010 | Tse-Au |
20100106833 | April 29, 2010 | Banerjee et al. |
20100106854 | April 29, 2010 | Kim et al. |
20100128606 | May 27, 2010 | Patel et al. |
20100162378 | June 24, 2010 | Jayawardena et al. |
20100210265 | August 19, 2010 | Borzsei et al. |
20100217793 | August 26, 2010 | Preiss |
20100217819 | August 26, 2010 | Chen et al. |
20100223630 | September 2, 2010 | Degenkolb et al. |
20100228819 | September 9, 2010 | Wei |
20100228878 | September 9, 2010 | Xu et al. |
20100235507 | September 16, 2010 | Szeto et al. |
20100235522 | September 16, 2010 | Chen et al. |
20100238828 | September 23, 2010 | Russell |
20100265824 | October 21, 2010 | Chao et al. |
20100268814 | October 21, 2010 | Cross et al. |
20100293296 | November 18, 2010 | Hsu et al. |
20100312740 | December 9, 2010 | Clemm et al. |
20100318631 | December 16, 2010 | Shukla |
20100322252 | December 23, 2010 | Suganthi et al. |
20100330971 | December 30, 2010 | Selitser et al. |
20100333101 | December 30, 2010 | Pope et al. |
20110007652 | January 13, 2011 | Bai |
20110019550 | January 27, 2011 | Bryers et al. |
20110023071 | January 27, 2011 | Li et al. |
20110029599 | February 3, 2011 | Pulleyn et al. |
20110032941 | February 10, 2011 | Quach et al. |
20110040826 | February 17, 2011 | Chadzelek et al. |
20110047294 | February 24, 2011 | Singh et al. |
20110060831 | March 10, 2011 | Ishii et al. |
20110060840 | March 10, 2011 | Susai |
20110093522 | April 21, 2011 | Chen et al. |
20110099403 | April 28, 2011 | Miyata et al. |
20110110294 | May 12, 2011 | Valluri et al. |
20110145324 | June 16, 2011 | Reinart et al. |
20110153834 | June 23, 2011 | Bharrat |
20110178985 | July 21, 2011 | San Martin Arribas et al. |
20110185073 | July 28, 2011 | Jagadeeswaran et al. |
20110191773 | August 4, 2011 | Pavel et al. |
20110196971 | August 11, 2011 | Reguraman et al. |
20110276695 | November 10, 2011 | Maldaner |
20110276982 | November 10, 2011 | Nakayama et al. |
20110289496 | November 24, 2011 | Steer |
20110292939 | December 1, 2011 | Subramaian et al. |
20110302256 | December 8, 2011 | Sureshehandra et al. |
20110307541 | December 15, 2011 | Walsh et al. |
20120008495 | January 12, 2012 | Shen et al. |
20120023231 | January 26, 2012 | Ueno |
20120026897 | February 2, 2012 | Guichard et al. |
20120030341 | February 2, 2012 | Jensen et al. |
20120066371 | March 15, 2012 | Patel et al. |
20120084460 | April 5, 2012 | McGinnity et al. |
20120106355 | May 3, 2012 | Ludwig |
20120117571 | May 10, 2012 | Davis et al. |
20120144014 | June 7, 2012 | Nathan et al. |
20120151353 | June 14, 2012 | Joanny |
20120170548 | July 5, 2012 | Rajagopalan et al. |
20120173759 | July 5, 2012 | Agarwal et al. |
20120191839 | July 26, 2012 | Maynard |
20120239792 | September 20, 2012 | Banerjee et al. |
20120240185 | September 20, 2012 | Kapoor et al. |
20120290727 | November 15, 2012 | Tivig |
20120297046 | November 22, 2012 | Raja et al. |
20130046876 | February 21, 2013 | Narayana et al. |
20130058335 | March 7, 2013 | Koponen et al. |
20130074177 | March 21, 2013 | Varadhan et al. |
20130083725 | April 4, 2013 | Mallya et al. |
20130124713 | May 16, 2013 | Feinberg et al. |
20130148500 | June 13, 2013 | Sonoda et al. |
20130173795 | July 4, 2013 | McPherson |
20130176854 | July 11, 2013 | Chisu et al. |
20130191486 | July 25, 2013 | Someya et al. |
20130198385 | August 1, 2013 | Han et al. |
20130250765 | September 26, 2013 | Ehsan et al. |
20130250770 | September 26, 2013 | Zou et al. |
20130258846 | October 3, 2013 | Damola |
20130268646 | October 10, 2013 | Doron et al. |
20130282791 | October 24, 2013 | Kruglick |
20130336159 | December 19, 2013 | Previdi et al. |
20140169168 | June 19, 2014 | Jalan et al. |
20140226658 | August 14, 2014 | Kakadia et al. |
20140235249 | August 21, 2014 | Jeong et al. |
20140248914 | September 4, 2014 | Aoyagi et al. |
20140258465 | September 11, 2014 | Li |
20140269728 | September 18, 2014 | Jalan et al. |
20140286313 | September 25, 2014 | Fu et al. |
20140298091 | October 2, 2014 | Carlen et al. |
20140325649 | October 30, 2014 | Zhang |
20140330982 | November 6, 2014 | Jalan et al. |
20140334485 | November 13, 2014 | Jain et al. |
20140359052 | December 4, 2014 | Joachimpillai et al. |
20150098333 | April 9, 2015 | Lin et al. |
20150156223 | June 4, 2015 | Xu et al. |
20150215436 | July 30, 2015 | Kancherla |
20150237173 | August 20, 2015 | Virkki et al. |
20150296058 | October 15, 2015 | Jalan et al. |
20150312268 | October 29, 2015 | Ray |
20150350048 | December 3, 2015 | Sampat et al. |
20150350379 | December 3, 2015 | Jalan et al. |
20160042014 | February 11, 2016 | Jalan et al. |
20160044095 | February 11, 2016 | Sankar et al. |
20160088074 | March 24, 2016 | Kannan et al. |
20160094470 | March 31, 2016 | Skog |
20160119382 | April 28, 2016 | Chen et al. |
20160139910 | May 19, 2016 | Ramanathan et al. |
20160164792 | June 9, 2016 | Oran |
101094225 | December 2000 | CN |
1372662 | October 2002 | CN |
1449618 | October 2003 | CN |
1529460 | September 2004 | CN |
1575582 | February 2005 | CN |
1714545 | December 2005 | CN |
1725702 | January 2006 | CN |
101004740 | July 2007 | CN |
101163336 | April 2008 | CN |
101169785 | April 2008 | CN |
101189598 | May 2008 | CN |
101193089 | June 2008 | CN |
101247349 | August 2008 | CN |
101261644 | September 2008 | CN |
102143075 | August 2011 | CN |
102546590 | July 2012 | CN |
102571742 | July 2012 | CN |
102577252 | July 2012 | CN |
102918801 | February 2013 | CN |
103533018 | January 2014 | CN |
103944954 | July 2014 | CN |
104040990 | September 2014 | CN |
104067569 | September 2014 | CN |
104106241 | October 2014 | CN |
104137491 | November 2014 | CN |
104796396 | July 2015 | CN |
102577252 | March 2016 | CN |
102918801 | May 2016 | CN |
102571742 | July 2016 | CN |
1209876 | May 2002 | EP |
1770915 | April 2007 | EP |
1885096 | February 2008 | EP |
2296313 | March 2011 | EP |
2577910 | April 2013 | EP |
2622795 | August 2013 | EP |
2647174 | October 2013 | EP |
2760170 | July 2014 | EP |
2772026 | September 2014 | EP |
2901308 | August 2015 | EP |
2760170 | December 2015 | EP |
1182560 | November 2013 | HK |
1183569 | December 2013 | HK |
1183996 | January 2014 | HK |
1189438 | January 2014 | HK |
1198565 | May 2015 | HK |
1198848 | June 2015 | HK |
1199153 | June 2015 | HK |
1199779 | July 2015 | HK |
1200617 | August 2015 | HK |
3764CHB2014 | September 2015 | IN |
261CHE2014 | January 2016 | IN |
1668CHENP2015 | July 2016 | IN |
H0997233 | April 1997 | JP |
H1196128 | April 1999 | JP |
H11338836 | December 1999 | JP |
2000276432 | October 2000 | JP |
2000307634 | November 2000 | JP |
2001051859 | February 2001 | JP |
2001298449 | October 2001 | JP |
2002091936 | March 2002 | JP |
2003141068 | May 2003 | JP |
2003186776 | July 2003 | JP |
2005141441 | June 2005 | JP |
2006332825 | December 2006 | JP |
2008040718 | February 2008 | JP |
2009500731 | January 2009 | JP |
2013528330 | July 2013 | JP |
2014504484 | February 2014 | JP |
2014143686 | August 2014 | JP |
2015507380 | March 2015 | JP |
5855663 | February 2016 | JP |
5913609 | April 2016 | JP |
5946189 | July 2016 | JP |
5963766 | August 2016 | JP |
20080008340 | January 2008 | KR |
100830413 | May 2008 | KR |
20130096624 | August 2013 | KR |
101576585 | December 2015 | KR |
101632187 | June 2016 | KR |
101692751 | January 2017 | KR |
WO2001013228 | February 2001 | WO |
WO2001014990 | March 2001 | WO |
WO2001045349 | June 2001 | WO |
WO2003103237 | December 2003 | WO |
WO2004084085 | September 2004 | WO |
WO2006098033 | September 2006 | WO |
WO2008053954 | May 2008 | WO |
WO2008078593 | July 2008 | WO |
WO2011049770 | April 2011 | WO |
WO2011079381 | July 2011 | WO |
WO2011149796 | December 2011 | WO |
WO2012050747 | April 2012 | WO |
WO2012075237 | June 2012 | WO |
WO2012083264 | June 2012 | WO |
WO2012097015 | July 2012 | WO |
WO2013070391 | May 2013 | WO |
WO2013081952 | June 2013 | WO |
WO2013096019 | June 2013 | WO |
WO2013112492 | August 2013 | WO |
WO2013189024 | December 2013 | WO |
WO2014031046 | February 2014 | WO |
WO2014052099 | April 2014 | WO |
WO2014088741 | June 2014 | WO |
WO2014093829 | June 2014 | WO |
WO2014138483 | September 2014 | WO |
WO2014144837 | September 2014 | WO |
WO2014179753 | November 2014 | WO |
WO2015153020 | October 2015 | WO |
- Abe, et al., “Adaptive Split Connection Schemes in Advanced Relay Nodes,” IEICE Technical Report, 2010, vol. 109 (438), pp. 25-30.
- Cardellini, et al., “Dynamic Load Balancing on Web-Server Systems,” IEEE Internet Computing, 1999, vol. 3 (3), pp. 28-39.
- FreeBSD, “tcp—TCP Protocal,” Linux Programme□ s Manual [online], 2007, [retrieved on Apr. 13, 2016], Retreived from the Internet: <https://www.freebsd.org/cgi/man.cgi?query=tcp&apropos=0&sektion=7&manpath=SuSe+Linux%2Fi386+11.0&format=asci>.
- Gite, “Linux Tune Network Stack (Buffers Size) to Increase Networking Performance,” nixCraft [online], 2009, [retreived on Apr. 13, 2016], Retreived from the Internet: <URL:http://www.cyberciti.biz/faq/linux-tcp-tuning/>.
- Goldszmidt, et al., “NetDispatcher: A TCP Connection Router,” IBM Researc Report, RC 20853, 1997, pp. 1-31.
- Kjaer, et al., “Resource Allocation and Disturbance Rejection in Web Servers Using SLAs and Virtualized Servers,” IEEE Transactions on Network Service Management, 2009, vol. 6 (4), pp. 226-239.
- Koike, et al., “Transport Middleware for Network-Based Control,” IEICE Technical Report, 2000, vol. 100 (53), pp. 13-18.
- Noguchi, “Realizing the Highest Level “Layer 7” Switch”=0 Totally Managing Network Resources, Applications, and Users =, Computer & Network LAN, 2000, vol. 18 (1), pp. 109-112.
- Ohnuma, “AppSwitch: 7th Layer Switch Provided with Full Setup and Report Tools,” Interop Magazine, 2000, vol. 10 (6), pp. 148-150.
- Sharifian, et al., “An Approximation-Based Load-Balancing Algorithm with Admission Control for Cluster Web Servers with Dynamic Workloads,” The Journal of Supercomputing, 2010, vol. 53 (3), pp. 440-463.
- Spatscheck, et al., “Optimizing TCP Forwarder Performance,” IEEE/ACM Transactions on Networking, 2000, vol. 8 (2), pp. 146-157.
- Search Report and Written Opinion dated Sep. 21, 2012 for PCT Application No. PCT/US2011/062811.
- Takahashi, “The Fundamentals of the Windows Network: Understanding the Mystery of the Windows Network from the Basics,” Network Magazine, 2006, vol. 11 (7), pp. 32-35.
- Yamamoto, et al., “Performance Evaluation of Window Size in Proxy-Based TCP for Multi-Hop Wireless Networks,” IPSJ SIG Technical Reports, 2008, vol. 2008 (44), pp. 109-114.
Type: Grant
Filed: Jan 29, 2018
Date of Patent: Jan 8, 2019
Patent Publication Number: 20180152508
Assignee: A10 Networks, Inc. (San Jose, CA)
Inventors: Rajkumar Jalan (Saratoga, CA), Ronald Wai Lun Szeto (San Francisco, CA), Feilong Xu (San Jose, CA)
Primary Examiner: Jason D Recek
Application Number: 15/882,755
International Classification: H04L 29/08 (20060101); H04L 12/26 (20060101); G06F 9/50 (20060101); H04L 12/24 (20060101); H04L 12/859 (20130101);