Conductor gateway buffer prioritization

• US 20020056006A1
• Filed: 04/16/2001
• Published: 05/09/2002
• Est. Priority Date: 04/17/2000
• Status: Active Grant

• Current Assignee: Sons of Innovation LLC
• Original Assignee: Circadence Corporation
• Inventors: Plumb, Mark, Wilson, Glenn Sydney, Kouts, Michael, Vange, Mark
• Granted Patent: US 7,155,539 B2
• Time in Patent Office: Days
• US Class Current: 709/235
• CPC Class Codes: G06F 2209/5021 Priority
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06F 9/5055 considering software capabilities, i.e. software resources associated or available to the machine
• CPC Class Codes: G06F 9/5088 involving task migration
• CPC Class Codes: H04L 45/14 Routing performance; Theoretical aspects
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/193 at the transport layer, e.g. TCP related
• CPC Class Codes: H04L 47/24 Traffic characterised by specific attributes, e.g. priority or QoS
• CPC Class Codes: H04L 61/4511 using domain name system [DNS]
• CPC Class Codes: H04L 63/0272 Virtual private networks
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/1408 by monitoring network traffic monitoring network traffic per se H04L43/00
• CPC Class Codes: H04L 63/1416 Event detection, e.g. attack signature detection
• CPC Class Codes: H04L 63/1458 Denial of Service
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/10015 Access to distributed or replicated servers, e.g. using brokers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/101 : based on network conditions
• CPC Class Codes: H04L 67/1021 : based on client or server locations
• CPC Class Codes: H04L 67/1029 : using data related to the state of servers by a load balancer
• CPC Class Codes: H04L 67/1031 : Controlling of the operation of servers by a load balancer, e.g. adding or removing servers that serve requests
• CPC Class Codes: H04L 67/1034 : Reaction to server failures by a load balancer
• CPC Class Codes: H04L 67/142 : Managing session states for stateless protocols; Signalling session states; State transitions; Keeping-state mechanisms
• CPC Class Codes: H04L 67/303 : Terminal profiles
• CPC Class Codes: H04L 67/561 : Adding application-functional data or data for application control, e.g. adding metadata
• CPC Class Codes: H04L 67/563 : Data redirection of data network streams
• CPC Class Codes: H04L 67/564 : Enhancement of application control based on intercepted application data
• CPC Class Codes: H04L 67/565 : Conversion or adaptation of application format or content adding application control or application functional data H04L67/561
• CPC Class Codes: H04L 67/568 : Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/5681 : Pre-fetching or pre-delivering data based on network characteristics
• CPC Class Codes: H04L 67/5682 : Policies or rules for updating, deleting or replacing the stored data
• CPC Class Codes: H04L 67/61 : taking into account QoS or priority requirements
• CPC Class Codes: H04L 69/16 : Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
• CPC Class Codes: H04L 69/329 : in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 : Network security protocols
• CPC Class Codes: H04W 8/04 : Registration at HLR or HSS [Home Subscriber Server]
• CPC Class Codes: Y10S 707/99944 : Object-oriented database structure
• CPC Class Codes: Y10S 707/99945 : Object-oriented database structure processing

Abstract

A method for transmitting packets from a network computer onto a network. At least two data sets are received. A priority value is determined for each of the at least two data sets. A composite data set is composed comprising portions of the at least two data sets such that an amount of data from each of the data sets within the composite data set is based upon relative priorities between each of the at least two data sets. The composite data set is transmitted onto the network.

Claims

1. A method for transmitting packets from a computer onto a network, said method comprising the acts:

receiving at least two data sets;

determining a priority value for each of the at least two data sets;

composing a composite data set comprising portions of the at least two data sets such that an amount of data from each of the data sets within the composite data set is based upon relative priorities between each of the at least two data sets; and

transmitting the composite data set onto the network.

2. The method of claim 1 wherein the act of receiving comprises:

creating a group comprising a plurality of connection buffers for each data set; and

assigning a priority to each created group.

3. The method of claim 2 wherein the step of creating comprises:

monitoring the speed of the connection supplying data to each connection buffer; and

adjusting the size of the corresponding connection buffer to maintain a buffer sized to hold packets received over a preselected time interval.

4. The method of claim 3 wherein the preselected time interval is at least as long as the time required to complete the composing step.

5. The method of claim 1 further comprising:

determining a weight value for each data set; and

selecting portions of the first and second data sets in an order at least partially based upon the weight value.

6. The method of claim 1 wherein the step of composing comprises:

creating a connection buffer for each data set;

organizing the connection buffers into logical rings of like priority value;

selecting portions of data from each logical ring at a frequency at least partially reflecting the relative priority of the logical rings.

7. The method of claim 6 further comprising:

determining for each logical ring a number of bytes held by all the connection buffers within that ring (nBytes);

determining for each ring the number of connection buffers it holds that have data waiting to be sent (nReady);

determining a number of bytes to be sent from each logical ring.

8. The method of claim 7 wherein the step of determining the number of bytes comprises normalizing to the logical ring having the largest nBytes value.

9. The method of claim 7 wherein number of logical rings is “

n”

defining n discrete priority levels labeled 0 to n-1, and the step of selecting further comprises;

selecting sub-packets from each of the rings in having a selection pattern substantially matching;

selection roundlogical ring1n2n, n-13n, n-1, n-2nn, n-1, n-2, . . ., n-1.

10. The method of claim 1, wherein the networked computer transmits the prioritized packets to a second networked computer over the Internet.

11. The method of claim 1, wherein the networked computer receives the prioritized packets from at least one client.

12. The method of claim 1, wherein the prioritized packets are received by an originating server.

13. The method of claim 1, wherein the networked computer transmits the prioritized packets to a second networked computer and receives prioritized packets from the second networked computer.

14. The method of claim 1 wherein the act of determining the priority value comprises:

parsing the data sets; and

determining the priority value at least partially based on the parsed data sets.

15. The method of claim 1 wherein the act of determining the priority value comprises:

receiving prioritization rules from an external content server associated with at least one of the data sets; and

determining the priority value at least partially based on the prioritization rules.

17. The system of claim 16 wherein:

the buffer is part of an intermediary web server that receives packets from the at least one client; and

the network is the Internet.

18. The system of claim 16 wherein the priority value is based on at least two priority parameter values for the at least one packet, wherein the at least two priority parameter values are converted into a priority value based on a weighting algorithm.

19. The system of claim 16, wherein the priority value is at least partially determined by the number of transmission cycles each of the at least two packets has remained in the buffer.

20. The system of claim 16, wherein the networked computer transmits the prioritized packets to a second networked computer over the Internet.

21. The system of claim 16, wherein the prioritized packets are received by an originating server.

22. The system of claim 16, wherein the networked computer transmits the prioritized packets to a second networked computer and receives prioritized packets from the second networked computer.

16. A system for transmitting packets from a buffer of a network computer onto a network, said system comprising:

a buffer to store a plurality of packets received from at least one client;

at least two packets stored in the buffer, wherein each of the packets has a priority value that at least partially determines a queue order for transmitting; and

a transmitter to transmit prioritized packets from the buffer.