Embodiments are directed towards improving the performance of network traffic management devices by optimizing the management of hot connection flows. A packet traffic management device (“PTMD”) may employ a data flow segment (“DFS”) and control segment (“CS”). The CS may perform high-level control
Embodiments are directed towards improving the performance of network traffic management devices by optimizing the management of hot connection flows. A packet traffic management device (“PTMD”) may employ a data flow segment (“DFS”) and control segment (“CS”). The CS may perform high-level control functions and per-flow policy enforcement for connection flows maintained at the DFS, while the DFS may perform statistics gathering, per-packet policy enforcement (e.g., packet address translations), or the like, on connection flows maintained at the DFS. The DFS may include high-speed flow caches and other high-speed components that may be comprised of high-performance computer memory. Making efficient use of the high speed flow cache capacity may be improved by maximizing the number of hot connection flows and minimizing the number of malicious and/or in-operative connections flows (e.g., non-genuine flows) that may have flow control data stored in the high-speed flow cache.
대표청구항▼
1. A method for managing communication over a network with a traffic management device (TMD) that includes a plurality of components and is operative to perform actions, comprising: employing at least one data flow segment (DFS) component to provide packet level flow handling for a portion of a plur
1. A method for managing communication over a network with a traffic management device (TMD) that includes a plurality of components and is operative to perform actions, comprising: employing at least one data flow segment (DFS) component to provide packet level flow handling for a portion of a plurality of connection flows;employing at least one control segment (CS) component to perform actions, including: managing the plurality of connection flows and handling a remainder portion of the plurality of connection flows;generating at least one connection flow metric based on at least one received network packet for at least one of the plurality of managed connection flows;employing the at least one connection flow metric to determine each hot connection flow in the plurality of managed connection flows;determining each hot connection flow to be handled by the DFS component wherein identifying each hot connection flow is based at least on a predicted connection flow capacity of the CS component, and wherein a percentile of connection flows are identified as hot connection flows; andemploying the DFS component to handle each determined hot connection flow. 2. The method of claim 1, wherein employing the at least one connection flow metric further comprises determining each hot connection flow handled by the DFS component if the plurality of managed connection flows exceeds a capacity of the DFS component. 3. The method of claim 1, wherein employing the at least one connection flow metric further comprises sorting the plurality of managed connection flows based on at least a total amount of data exchanged over a time interval. 4. The method of claim 1, wherein employing the at least one connection flow metric further comprises: determining a median bit-rate of data communicated for at least one connection flow being handled by the CS component; andemploying the median bit-rate of data communicated for at least one connection flow and at least a bit-rate capacity of the CS component to estimate the maximum number of connection flows the CS component can handle. 5. The method of claim 1, wherein determining each hot connection flow to be handled by the DFS component further comprises, identifying each hot connection flow to be handled by the DFS component based at least on a total amount of data communicated over a time interval, wherein N number of connection flows having a top total amount of data communicated over the time interval are identified as hot connection flows. 6. The method of claim 1, wherein generating the at least one connection flow metric further comprises, examining contents of the at least one received network packet to identify at least one of a data pattern, or a meta data which indicates that the at least one of the plurality of connection flows is a hot connection flow. 7. The method of claim 1, wherein the CS component performs further actions, comprising: dividing each connection flow into an upload portion and a download portion;generating separate connection flow metrics for each upload portion and each download portion of each of the plurality of managed connection flows;employing each connection flow metric to determine each hot download portion and each hot upload portion of the plurality of managed connection flows;determining each hot upload portion and each download portion of the plurality of managed connection flows to be handled by the DFS component; andemploying the DFS component to handle each determined hot upload portion and each download portion of the plurality of connection flows. 8. A traffic management device (TMD) that includes a plurality of components for managing communication over a network and is operative to perform actions, comprising: a transceiver that is operative to communicate data over the network;a memory that is operative to store instructions; and a processor that is operative to execute instructions that enable actions, including:employing at least one data flow segment (DFS) component to provide packet level flow handling for a portion of a plurality of connection flows; andemploying at least one control segment (CS) component to perform actions, comprising: managing the plurality of connection flows and handling a remainder portion of the plurality of connection flows;generating at least one connection flow metric based on at least one received network packet for at least one of the plurality of managed connection flows;employing the at least one connection flow metric to determine each hot connection flow in the plurality of managed connection flows;determining each hot connection flow to be handled by the DFS component, wherein identifying each hot connection flow is based at least on a predicted connection flow capacity of the CS component, and wherein a percentile of connection flows are identified as hot connection flows; andemploying the DFS component to handle each determined hot connection flow. 9. The TMD of claim 8, wherein employing the at least one connection flow metric further comprises determining each hot connection flow handled by the DFS component if the plurality of managed connection flows exceeds a capacity of the DFS component. 10. The TMD of claim 8, wherein employing the at least one connection flow metric further comprises sorting the plurality of managed connection flows based on at least a total amount of data exchanged over a time interval. 11. The TMD of claim 8, wherein employing the at least one connection flow metric further comprises: determining a median bit-rate of data communicated for at least one connection flow being handled by the CS component; andemploying the median bit-rate of data communicated for at least one connection flow and at least a bit-rate capacity of the CS component to estimate the maximum number of connection flows the CS component can handle. 12. The TMD of claim 8, wherein determining each hot connection flow to be handled by the DFS component further comprises, identifying each hot connection flow to be handled by the DFS component based at least on a total amount of data communicated over a time interval, wherein N number of connection flows having a top total amount of data communicated over the time interval are identified as hot connection flows. 13. The TMD of claim 8, wherein generating the at least one connection flow metric further comprises, examining contents of the at least one received network packet to identify at least one of a data pattern, or a meta data which indicates that the at least one of the plurality of connection flows is a hot connection flow. 14. The TMD of claim 8, wherein the CS component performs further actions, comprising: dividing each connection flow into an upload portion and a download portion;generating separate connection flow metrics for each upload portion and each download portion of each of the plurality of managed connection flows;employing each connection flow metric to determine each hot download portion and each hot upload portion of the plurality of managed connection flows;determining each hot upload portion and each download portion of the plurality of managed connection flows to be handled by the DFS component; andemploying the DFS component to handle each determined hot upload portion and each download portion of the plurality of connection flows. 15. A processor readable non-transitory storage media that is operative to store processor executable instructions for managing communication over a network with a traffic management device (TMD) having a plurality of components, wherein execution of the instructions by a processor enables the TMD to perform actions, comprising: employing at least one data flow segment (DFS) component to provide packet level flow handling for a portion of a plurality of connection flows;employing at least one control segment (CS) component to perform actions, including: managing the plurality of connection flows and handling a remainder portion of the plurality of connection flows;generating at least one connection flow metric based on at least one received network packet for at least one of the plurality of managed connection flows;employing the at least one connection flow metric to determine each hot connection flow in the plurality of managed connection flows;determining each hot connection flow to be handled by the DFS component wherein identifying each hot connection flow is based at least on a predicted connection flow capacity of the CS component, and wherein a percentile of connection flows are identified as hot connection flows; andemploying the DFS component to handle each determined hot connection flow. 16. The media of claim 15, wherein employing the at least one connection flow metric further comprises determining each hot connection flow handled by the DFS component if the plurality of managed connection flows exceeds a capacity of the DFS component. 17. The media of claim 15, wherein employing the at least one connection flow metric further comprises sorting the plurality of managed connection flows based on at least a total amount of data exchanged over a time interval. 18. The media of claim 15, wherein employing the at least one connection flow metric further comprises: determining a median bit-rate of data communicated for at least one connection flow being handled by the CS component; andemploying the median bit-rate of data communicated for at least one connection flow and at least a bit-rate capacity of the CS component to estimate the maximum number of connection flows the CS component can handle. 19. The media of claim 15, wherein determining each hot connection flow to be handled by the DFS component further comprises, identifying each hot connection flow to be handled by the DFS component based at least on a total amount of data communicated over a time interval, wherein N number of connection flows having a top total amount of data communicated over the time interval are identified as hot connection flows. 20. The media of claim 15, wherein generating the at least one connection flow metric further comprises, examining contents of the at least one received network packet to identify at least one of a data pattern, or a meta data which indicates that the at least one of the plurality of connection flows is a hot connection flow. 21. The media of claim 15, wherein the CS component performs further actions, comprising: dividing each connection flow into an upload portion and a download portion;generating separate connection flow metrics for each upload portion and each download portion of each of the plurality of managed connection flows;employing each connection flow metric to determine each hot download portion and each hot upload portion of the plurality of managed connection flows;determining each hot upload portion and each download portion of the plurality of managed connection flows to be handled by the DFS component; andemploying the DFS component to handle each determined hot upload portion and each download portion of the plurality of connection flows.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (76)
Hawkinson Christopher D., Apparatus and method for providing a binary range tree search.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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는 부적절한 답변을 할 수 있습니다.