Methods for policy-based network traffic queue management and devices thereof
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/16
H04L-012/823
H04L-012/815
출원번호
US-0400186
(2012-02-20)
등록번호
US-9231879
(2016-01-05)
발명자
/ 주소
Wojcik, Frank
출원인 / 주소
F5 Networks, Inc.
대리인 / 주소
LeClairRyan, a Professional Corporation
인용정보
피인용 횟수 :
2인용 특허 :
179
초록▼
A method, computer readable medium, and network traffic management apparatus includes determining whether at least one existing request should be removed from a request queue. At least one existing request stored in the request queue is identified by applying one or more queue management rules. The
A method, computer readable medium, and network traffic management apparatus includes determining whether at least one existing request should be removed from a request queue. At least one existing request stored in the request queue is identified by applying one or more queue management rules. The identified existing request is removed from the request queue and the current request is added to the request queue when it is determined that at least one existing request should be removed from the request queue.
대표청구항▼
1. A method for policy-based network traffic queue management, comprising: determining, by a network traffic management apparatus, when an Hypertext Transfer Protocol (HTTP) request queue should be dequeued based on one or more queue management rules and in response to receiving a current HTTP reque
1. A method for policy-based network traffic queue management, comprising: determining, by a network traffic management apparatus, when an Hypertext Transfer Protocol (HTTP) request queue should be dequeued based on one or more queue management rules and in response to receiving a current HTTP request from a client computing device:identifying, by the network traffic management apparatus, one of a plurality of existing HTTP requests stored in the request queue based at least in part on a utilization level of the request queue and a score associated with each of the existing requests, wherein the utilization level is less than full utilization and the score is generated based on a type of content associated with each of the existing requests, and removing, the existing request from the request queue, when the determining indicates that the request queue should be dequeued;generating, by the network traffic management apparatus, another score for the current request based at least in part on another type of additional content associated with the current request; andinserting, by the network traffic management apparatus, the current request into the request queue as associated with the another score. 2. The method as set forth in claim 1 wherein the queue management rules defined based at least in part on historical information regarding one or more users or one or more network addresses, the requested content, or one or more request attributes selected from a network address, an associated user, a content type, whether servicing is likely to result in one or more related requests, a uniform resource identifier (URI) of associated content, one or more associated cookies, information regarding associated content stored in cache, or one or more associated Hypertext Transfer Protocol (HTTP) header values. 3. The method as set forth in claim 1 further comprising: updating, by the network traffic management apparatus, performance information selected from a number of requests received from a user associated with the current request, a number of requests received from a network address associated with the current request, or a number of requests received for the content; andgenerating, by the network traffic management apparatus, one or more of the queue management rules based at least in part on the performance information. 4. The method as set forth in claim 1 wherein one or more of the queue management rules are established by a manufacturer of the traffic management apparatus, configured by an administrator of the traffic management apparatus, or learned by the traffic management apparatus. 5. The method as set forth in claim 1 further comprising: determining, by the network traffic management apparatus, when the request queue is empty and at least one server is available; andservicing, by the network traffic management apparatus, the current request without removing the existing request when the determining indicates that the queue is empty and at least one server is available. 6. The method as set forth in claim 1 further comprising: determining, by the network traffic management apparatus, when the request queue has capacity when the determining indicates that the request queue should not be dequeued;inserting, by the network traffic management apparatus, the current request into the request queue when the determining indicates that the request queue has capacity;dropping, by the network traffic management apparatus, the current request when the determining indicates that the request queue does not have capacity; andasynchronously servicing, by the network traffic management apparatus, the existing requests according to the order in which the existing requests were added to the request queue. 7. The method as set forth in claim 6 wherein one or more of the removing the existing request from the request queue or the dropping the current request further comprises closing a connection associated with the existing request, communicating an error code to the client computing device, or communicating an alternate version of the content to the client computing device. 8. A non-transitory computer readable medium having stored thereon instructions for policy-based network traffic queue management comprising executable code which when executed by at least one processor, causes the processor to perform steps comprising: determining when an Hypertext Transfer Protocol (HTTP) request queue should be dequeued based on one or more queue management rules and in response to receiving a current HTTP request from a client computing device;identifying one of a plurality of existing HTTP requests stored in the request queue based at least in part on a utilization level of the request queue and a score associated with each of the existing requests, wherein the utilization level is less than full utilization and the score is generated based on a type of content associated with each of the existing requests, and removing the existing request from the request queue, when the determining indicates that the request queue should be dequeued;generating another score for the current request based at least in part on another type of additional content associated with the current request; andinserting the current request into the request queue as associated with the another score. 9. The medium as set forth in claim 8 wherein the queue management rules are defined based at least in part on historical information regarding one or more users or one or more network addresses, the requested content, or one or more request attributes selected from a network address, an associated user, a content type, whether servicing is likely to result in one or more related requests, a uniform resource identifier (URI) of associated content, one or more associated cookies, information regarding associated content stored in cache, or one or more associated Hypertext Transfer Protocol (HTTP) header values. 10. The medium as set forth in claim 8 wherein the executable code when executed by the at least one processor cause the processor to perform at least one additional step comprising: updating performance information selected from a number of requests received from a user associated with the current request, a number of requests received from a network address associated with the current request, or a number of requests received for the content; andgenerating one or more of the queue management rules based at least in part on the performance information. 11. The medium as set forth in claim 8 wherein one or more of the queue management rules are established by a manufacturer, configured by an administrator, or learned. 12. The medium as set forth in claim 8 wherein the executable code when executed by the at least one processor cause the processor to perform at least one additional step comprising: determining when the request queue is empty and at least one server is available; andservicing the current request without removing the existing request when the determining indicates that the queue is empty and at least one server is available. 13. The medium as set forth in claim 8 wherein the executable code when executed by the at least one processor cause the processor to perform at least one additional step comprising: determining when the request queue has capacity when the determining indicates that the request queue should not be dequeued;inserting the current request into the request queue when the determining indicates that the request queue has capacity;dropping the current request when the determining indicates that the request queue does not have capacity; andasynchronously servicing the existing requests according to the order in which the existing requests were added to the request queue. 14. The medium as set forth in claim 13 wherein one or more of the removing the existing request from the request queue or the dropping the current request further comprises closing a connection associated with the existing request, communicating an error code to the client computing device, or communicating an alternate version of the content to the client computing device. 15. A network traffic management apparatus comprising a processor and memory coupled to the processor which is configured to be capable of executing programmed instructions comprising and stored in the memory to: determine when an Hypertext Transfer Protocol (HTTP) request queue should be dequeued based on one or more queue management rules and in response to receiving a current HTTP request from a client computing device:identify one of a plurality of existing HTTP requests stored in the request queue based at least in part on a utilization level of the request queue and a score associated with each of the existing requests, wherein the utilization level is less than full utilization and the score is generated based on a type of content associated with each of the existing requests, and remove the existing request from the request queue, when the determining indicates that the request queue should be dequeued;generate another score for the current request based at least in part on another type of additional content associated with the current request; andinsert the current request into the request queue as associated with the another score. 16. The apparatus as set forth in claim 15 wherein the queue management rules are defined based at least in part on historical information regarding one or more users or one or more network addresses, the requested content, or one or more request attributes selected from a network address, an associated user, a content type, whether servicing is likely to result in one or more related requests, a uniform resource identifier (URI) of associated content, one or more associated cookies, information regarding associated content stored in cache, or one or more associated Hypertext Transfer Protocol (HTTP) header values. 17. The apparatus as set forth in claim 15 wherein the processor coupled to the memory is further configured to be capable of executing at least one additional programmed instruction comprising and stored in the memory to: update performance information selected from a number of requests received from a user associated with the current request, a number of requests received from a network address associated with the current request, or a number of requests received for the content; andgenerate one or more of the queue management rules based at least in part on the performance information. 18. The apparatus as set forth in claim 15 wherein one or more of the queue management rules are established by a manufacturer of the traffic management apparatus, configured by an administrator of the traffic management apparatus, or learned by the traffic management apparatus. 19. The apparatus as set forth in claim 15 wherein the processor coupled to the memory is further configured to be capable of executing at least one additional programmed instruction comprising and stored in the memory to: determine when the request queue is empty and at least one server is available; andservice the current request without removing the existing request when the determining indicates that the queue is empty and at least one server is available. 20. The apparatus as set forth in claim 15 wherein the processor coupled to the memory is further configured to be capable of executing at least one additional programmed instruction comprising and stored in the memory to: determine when the request queue has capacity when the determining indicates that the request queue should not be dequeued;insert the current request into the request queue when the determining indicates that the request queue has capacity;drop the current request when the determining indicates that the request queue does not have capacity; andasynchronously service the existing requests according to the order in which the existing requests were added to the request queue. 21. The apparatus as set forth in claim 20 wherein one or more of the removing the existing request from the request queue or the dropping the current request further comprises closing a connection associated with the existing request, communicating an error code to the client computing device, or communicating an alternate version of the content to the client computing device.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (179)
Morita, Yoichiro; Nakae, Masayuki, Access control system, access control method, and access control program.
Kim, Hye-Jeong, Apparatus and method for controlling slotted mode of several systems using one sleep controller in a hybrid terminal of a mobile communication system.
Susai, Michel K.; Sinha, Rajiv; Shetty, Anil, Apparatus, method and computer program product for efficiently pooling connections between clients and servers.
Sohn Sung Won,KRX ; Doh Yoon Mi,KRX ; Kim Jong Oh,KRX, Asynchronous transfer mode (ATM) layer function processing apparatus with an enlarged structure.
Sathaye Shirish S. (North Chelmsford MA) Hannigan Brendan (West Newton MA) Hawe William R. (Pepperell MA), Automatic assignment of addresses in a computer communications network.
Yang Henry S. (Andover MA) Sathaye Shirish S. (North Chelmsford MA) Ben-Nun Michael (Jerusalem ILX) De-Leon Moshe (Jerusalem ILX) Ben-Michael Simoni (Givaat Zeev ILX), Buffer descriptor prefetch in network and I/O design.
Fitzgerald Albion J. (Ridgewood NJ) Fitzgerald Joseph J. (New Paltz NY), Distributed computer network including hierarchical resource information structure and related method of distributing re.
Dobbins Kurt ; Grant Thomas A. ; Ruffen David J. ; Kane Laura ; Len Theodore ; Andlauer Philip ; Bahi David H. ; Yohe Kevin ; Fee Brendan ; Oliver Chris ; Cullerot David L. ; Skubisz Michael, Distributed connection-oriented services for switched communications networks.
Shi Shaw-Ben ; Ault Michael Bradford ; Plassmann Ernst Robert ; Rich Bruce Arland ; Rosiles Mickella Ann ; Shrader Theodore Jack London, Distributed file system web server user authentication with cookies.
Couland Ghislaine,FRX ; Hunt Guerney Douglass Holloway ; Levy-Abegnoli Eric Michel,FRX ; Jean-Marie Mauduit Daniel Georges,FRX, Distributed scalable device for selecting a server from a server cluster and a switched path to the selected server.
Albert, Mark; Howes, Richard A.; Jordan, James A.; Kersey, Edward A.; LeBlanc, William M.; Menditto, Louis F.; O'Rourke, Chris; Tiwari, Pranav Kumar; Tsang, Tzu-Ming, Handling packet fragments in a distributed network service environment.
Tokuyo, Masanaga; Nakagawa, Itaru; Chikuma, Satoru; Fujino, Nobutsugu; Taniguchi, Tetsuya; Hisanaga, Takanori; Chikada, Michiyasu; Kuwata, Daisuke, IP router device having a TCP termination function and a medium thereof.
Nisbet, James Donald; Wiese, James Christopher; Reizes, David Alexander; Hoyt, Stephen Crosby, Inferring document and content sensitivity from public account accessibility.
Sengupta, Uttam; Gandhi, Prashant; Varshney, Shobhit; Joshi, Mandar; Thakkar, Shreekant, Method and apparatus for a power-efficient framework to maintain data synchronization of a mobile personal computer to simulate a connected scenario.
Daniel Arthur A. (Rochester MN) Moore Robert E. (Durham NC) Anderson Catherine J. (Raleigh NC) Gelm Thomas J. (Raleigh NC) Kiter Raymond F. (Poughkeepsie NY) Meeham John P. (Raleigh NC) Stevenson Joh, Method and apparatus for communication network alert message construction.
Pani, Diana; Marinier, Paul; Cave, Christopher R., Method and apparatus for layer 2 processing and creation of protocol data units for wireless communications.
Attanasio Clement R. (Peekskill NY) Smith Stephen E. (Mahopac NY), Method and apparatus for making a cluster of computers appear as a single host on a network.
Chou Stephen T. ; Fenger Russell J. ; Kumar Mohan J. ; Lortz Victor B. ; Manny Benjamin L. ; Travnicek Mil ; Wang Chih-Kan, Method and apparatus for providing unattended on-demand availability of a computer system.
Mohaban, Shai; Parnafes, Itzhak; Ramberg, Yoram; Snir, Yoram; Strassner, John, Method and apparatus for storing policies for policy-based management of network quality of service.
Walter A. Hubis ; William G. Deitz, Method and system for controlling access share storage devices in a network environment by configuring host-to-volume mapping data structures in the controller memory for granting and denying access .
Colby Steven ; Krawczyk John J. ; Nair Raj Krishnan ; Royce Katherine ; Siegel Kenneth P. ; Stevens Richard C. ; Wasson Scott, Method and system for directing a flow between a client and a server.
Waldspurger, Carl; Craig, Michael; Dharan, Ramesh; Kambo, Rajit S.; Mann, Timothy P.; Muckle, Stephen A.; Weissman, Boris; Zedlewski, John, Method and system for improving the accuracy of timing and process accounting within virtual machines.
Pardee,Peter; Dillon,Douglas; Border,John; Bartlett,Nigel, Method and system for integrating performance enhancing functions in a virtual private network (VPN).
Linville John Walter ; Makrucki Brad Alan ; Suffern Edward Stanley ; Warren Jeffrey Robert, Method and system for monitoring and controlling data flow in a network congestion state by changing each calculated pause time by a random amount.
Leighton Frank T. (459 Chestnut Hill Ave. Newtonville MA) Micali Silvio (459 Chestnut Hill Ave. Brookline MA 02146), Method for enabling users of a cryptosystem to generate and use a private pair key for enciphering communications betwee.
Zhang,Hui; de la Iglesia,Erik; Gomez,Miguel; Liu,Liang; Lowe,Rick K.; Wallace,Mark Aaron; Wang,Wei, Method of and system for allocating resources to resource requests.
Choquier Philippe,FRX ; Peyroux Jean-Francios ; Griffin William J., Method of redirecting a client service session to a second application server without interrupting the session by forwa.
Albert, Mark; Howes, Richard A.; Jordan, James A.; Kersey, Edward A.; LeBlanc, William M.; McGuire, Jacob Mark; Menditto, Louis F.; O'Rourke, Chris; Tiwari, Pranav Kumar; Tsang, Tzu-Ming, Network address translation using a forwarding agent.
Allen, Jr., James Johnson; Bass, Brian Mitchell; Calvignac, Jean Louis; Gaur, Santosh Prasad; Heddes, Marco C.; Siegel, Michael Steven; Verplanken, Fabrice Jean, Network processor interface for building scalable switching systems.
Cummings Kevin D. (Phoenix AZ) Johnson William A. (Paradise Valley AZ) Laird Daniel L. (Madison WI), Pattern writing method during X-ray mask fabrication.
Smith R. Steven (Saratoga CA) Hanlon Mike S. (San Jose CA) Bailey Robert L. (San Jose CA), Power management for a laptop computer with slow and sleep modes.
Lim,Vincent Cheekiat; Raghuvanshi,Preetham, Power save management with customized range for user configuration and tuning value based upon recent usage.
Wright,Michael; Boucher,Peter; Nault,Gabe; Smith,Merrill; Jacobson,Sterling K; Wood,Jonathan; Mims,Robert, Protection of data accessible by a mobile device.
Allen, Jr., James Johnson; Bass, Brian Mitchell; Davis, Gordon Taylor; Jeffries, Clark Debs; Nair, Jitesh Ramachandran; Sabhikhi, Ravinder Kumar; Siegel, Michael Steven; Yedavalli, Rama Mohan, Retro flow control for arriving traffic in computer networks.
Arora Sanjeev (Berkeley CA) Knight ; Jr. Thomas F. (Belmont MA) Leighton Frank T. (Newton Center MA) Maggs Bruce M. (Princeton NJ) Upfal Eliezer (Palo Alto CA), Switching networks with expansive and/or dispersive logical clusters for message routing.
Liu, Fu-Hua; Cheng, Shih-An; Chang, Chen-Huei; Lee, Chih-Ping, System and method for determining a connectionless communication path for communicating audio data through an address and port translation device.
Gnagy,Matthew R.; Champagne,Jean Philippe; Aviani,James A.; Lueckenhoff,Bruce Arthur; O'Toole, Jr.,James W., System and method for generalized URL-rewriting.
Brezak, Jr.,John E.; Ward,Richard B.; Leach,Paul J.; Swift,Michael M., System and method for managing and authenticating services via service principal names.
Labio,Wilburt Juan; Nguyen,Giao Thanh; Liu,Winston Wencheng; Manku,Gurmeet Singh, System and method for optimizing access to information in peer-to-peer computer networks.
Bommareddy, Satish; Kale, Makarand; Chaganty, Srinivas, System and method for routing message traffic using a cluster of routers sharing a single logical IP address distinct from unique IP addresses of the routers.
Chang Albert (Austin TX) Neuman Grover H. (Austin TX) Shaheen-Gouda Amal A. (Austin TX) Smith Todd A. (Austin TX), System and method for using cached data at a local node after re-opening a file at a remote node in a distributed networ.
Pitts William M. (780 Mora Dr. Los Altos CA 94024), System for accessing distributed data cache channel at each network node to pass requests and data.
O'Toole, Jr.,James W., System using idle connection metric indicating a value based on connection characteristic for performing connection drop sequence.
Rao, Goutham P.; Rodriguez, Robert; Brueggemann, Eric, Systems and methods for communicating a lossy protocol via a lossless protocol using false acknowledgements.
Short, Joel E.; Delley, Frederic; Logan, Mark F.; Pagan, Florence C. I., Systems and methods for redirecting users having transparent computer access to a network using a gateway device having redirection capability.
Cappiello,Scott; Du,Yi; Le,Dyung V.; Li,Benjamin Z.; Li,Wenfeng; Polana,Ramprasad; Vinton,Patrick, Technique for handling server session requests in a system having a plurality of servers.
Brown Charles Allan ; Burns John Martin ; Nagaraj Holavanahally Seshachar ; O'Neill James Joseph ; Ullah Muhammad Inayet ; Volpe Leo ; Wendt Herman Russell, Vacuum baking process.
Brendel Juergen ; Kring Charles J. ; Liu Zaide ; Marino Christopher C., World-wide-web server with delayed resource-binding for resource-based load balancing on a distributed resource multi-n.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.