Method and apparatus for internet protocol transaction routing
First Claim
1. A method for providing optimal transaction routing of data packets through a network on a plurality of logical pipes, comprising:
- assigning each data packet to one of the plurality of logical pipes, each logical pipe having an assigned numerical service level;
associating a numerical priority-usage level to each of the assigned data packets;
establishing numerical threshold return-time-out (RTO) a for each logical pipe;
transmitting data packets from one of the logical pipes and evaluating a running estimate of round trip times (RTT) for the transmitted data packets from the logical pipe being serviced; and
transitioning to a subsequent logical pipe in a round robin manner once a combination of numerical priority-usage levels for the delivered data packets has at least equaled the numerical service level for the logical pipe being serviced, or once a current estimate of the RTT for the delivered packets has at least equaled the threshold RTO for the logical pipe being serviced.
18 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, a method for providing optimal transaction routing for data packets through a network on a plurality of logical pipes includes assigning each data packet to one of the plurality of logical pipes, with each logical pipe having an assigned numerical service level, and associating a numerical priority-usage level to each of the data packets. The method then includes establishing a threshold return-time-out (RTO) amount for each logical pipe, and transmitting data packets from one of the logical pipes and evaluating a running estimate of round trip times (RTT) for the transmitted data packets from the logical pipe being serviced. The method further includes transitioning to a subsequent logical pipe in a round robin manner once a combination of numerical bandwidth-usage levels for the delivered data packets has equaled or exceeded the numerical service level for the logical pipe being serviced or once that the current estimate of the round trip times for the delivered packets has equaled or exceeded the threshold RTO for the logical pipe being serviced.
-
Citations
24 Claims
-
1. A method for providing optimal transaction routing of data packets through a network on a plurality of logical pipes, comprising:
-
assigning each data packet to one of the plurality of logical pipes, each logical pipe having an assigned numerical service level;
associating a numerical priority-usage level to each of the assigned data packets;
establishing numerical threshold return-time-out (RTO) a for each logical pipe;
transmitting data packets from one of the logical pipes and evaluating a running estimate of round trip times (RTT) for the transmitted data packets from the logical pipe being serviced; and
transitioning to a subsequent logical pipe in a round robin manner once a combination of numerical priority-usage levels for the delivered data packets has at least equaled the numerical service level for the logical pipe being serviced, or once a current estimate of the RTT for the delivered packets has at least equaled the threshold RTO for the logical pipe being serviced. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system for providing optimal transaction routing of data packets through a network on a plurality of logical pipes, comprising:
-
means for assigning each data packet to one of the plurality of logical pipes, each logical pipe having an assigned numerical service level;
means for associating a numerical priority-usage level to each of the assigned data packets;
means for establishing a numerical threshold return-time-out (RTO) for each logical pipe;
means for transmitting data packets from one of the logical pipes and evaluating a running estimate of round trip times (RTT) for the transmitted data packets from the logical pipe being serviced; and
means for transitioning to a subsequent logical pipe in a round robin manner once a combination of numerical priority-usage levels for the delivered data packets has at least equaled the numerical service level for the logical pipe being serviced or once a current estimate of the RTT for the delivered packets has at least equaled the threshold RTO for the logical pipe being serviced. - View Dependent Claims (12, 13, 14)
-
-
15. A computer-readable medium having encoded therein computer-executable instructions for performing a method providing optimal transaction routing of data packets through a network on a plurality of logical pipes, the method comprising:
-
assigning each data packet to one of the plurality of logical pipes, each logical pipe having an assigned numerical service level;
associating a numerical priority-usage level to each of the assigned data packets;
establishing a numerical threshold return-time-out (RTO) for each logical pipe;
transmitting data packets from one of the logical pipes and evaluating a running estimate of round trip times (RTT) for the transmitted data packets from the logical pipe being serviced; and
transitioning to a subsequent logical pipe in a round robin manner once a combination of numerical priority-usage levels for the delivered data packets has equaled or exceeded the numerical service level for the logical pipe being serviced or once that the current estimate of the RTT for the delivered packets has equaled or exceeded the threshold RTO for the logical pipe being serviced. - View Dependent Claims (16, 17, 18, 19, 20)
-
-
21. A system for performing optimal transaction routing of data packets through a network on a plurality of logical pipes, the system comprising:
at least one processor programmed to assign each data packet to one of the plurality of logical pipes, each logical pipe having an assigned numerical service level;
associate a numerical priority-usage level to each of the assigned data packets;
establish a numerical threshold return-time-out (RTO) for each logical pipe;
transmit data packets from one of the logical pipes and evaluating a running estimate of round trip times (RTT) for the transmitted data packets from the logical pipe being serviced; and
transition to a subsequent logical pipe in a round robin manner once a combination of numerical priority-usage levels for the delivered data packets has equaled or exceeded the numerical service level for the logical pipe being serviced or once that the current estimate of the RTT for the delivered packets has equaled or exceeded the threshold RTO for the logical pipe being serviced.- View Dependent Claims (22, 23, 24)
Specification