Model and method of an N-tier quality-of-service (QOS)
First Claim
1. A method comprising:
- a first component receiving first and second requests;
generating first and second priority values corresponding to the first and second requests, respectively, wherein the first and second priority values are not equal to each other;
the first component processing the first and second requests to generate third and fourth requests, respectively, wherein the first request is processed before the second request if the first priority value is numerically greater than the second priority value, or the first request is processed after the second request if the first priority value is numerically less than the second priority value;
the first component transmitting the third and fourth requests along with the first and second priorities, respectively, to a second component;
the second component receiving the third request along with the first priority value;
the second component receiving the fourth request along with the second priority value;
the second component processing the third and fourth transactions wherein the third request is processed before the fourth request if the first priority value is numerically greater than the second priority value, or the third request is processed after the fourth request if the first priority value is numerically less than the second priority value.
6 Assignments
0 Petitions
Accused Products
Abstract
A method for increasing the QoS in a data center. The method can be employed in first and second components of the data center. In one embodiment, the method includes a first component of the data center receiving first and second requests. The first component generates first and second priority values corresponding to the first and second requests, respectively. The first component processes the first and second requests to generate third and fourth requests, respectively, wherein the first request is processed before the second request if the first priority value is numerically greater than the second priority value, or the first request is processed after the second request if the first priority value is numerically less than the second priority value. A second component of the data center receives the third and fourth requests. The second component generates third and fourth priority values corresponding to the third and fourth requests, respectively. The second component processes the third and fourth requests wherein the third request is processed before the fourth request if the third priority value is numerically greater than the fourth priority value, or the third request is processed after the fourth request if the third priority value is numerically less than the fourth priority value. In one preferred embodiment, if the first priority value is numerically greater than the second priority value, then the third priority value generated by the second component should not be numerically less than the fourth priority value generated by the second component.
17 Citations
4 Claims
-
1. A method comprising:
-
a first component receiving first and second requests; generating first and second priority values corresponding to the first and second requests, respectively, wherein the first and second priority values are not equal to each other; the first component processing the first and second requests to generate third and fourth requests, respectively, wherein the first request is processed before the second request if the first priority value is numerically greater than the second priority value, or the first request is processed after the second request if the first priority value is numerically less than the second priority value; the first component transmitting the third and fourth requests along with the first and second priorities, respectively, to a second component; the second component receiving the third request along with the first priority value; the second component receiving the fourth request along with the second priority value; the second component processing the third and fourth transactions wherein the third request is processed before the fourth request if the first priority value is numerically greater than the second priority value, or the third request is processed after the fourth request if the first priority value is numerically less than the second priority value. - View Dependent Claims (2, 3)
-
-
4. A computer readable memory storing instructions that are executable by a computer system, wherein the computer system implements a method in response to executing the instructions, the method comprising:
-
generating first and second priority values corresponding to received first and second requests, respectively, wherein the first and second priority values are not equal to each other; processing the first and second requests to generate third and fourth requests, respectively, wherein the first request is processed before the second request if the first priority value is numerically greater than the second priority value, or the first request is processed after the second request if the first priority value is numerically less than the second priority value; transmitting the third request along with the first priority to a second component; transmitting the fourth request along with the second priority to the second component; the second component receiving the third request along with the first priority value; the second component receiving the fourth request along with the second priority value; the second component processing the third and fourth transactions wherein the third request is processed before the fourth request if the first priority value is numerically greater than the second priority value, or the third request is processed after the fourth request if the first priority value is numerically less than the second priority value.
-
Specification
-
- Resources
-
Current AssigneeVeritas Technologies, LLC (Whitehouse Group Ltd.)
-
Original AssigneeSymantec Operating Corporation (NortonLifeLock Inc.)
-
InventorsHu, Ron-Chung, Holroyd, Barry
-
Primary Examiner(s)Ruiz, Angelica
-
Application NumberUS12/480,547Time in Patent Office1,226 DaysField of Search709204-207, 709223-226US Class Current707/822CPC Class CodesH04L 67/1001 for accessing one among a p...H04L 67/1023 based on a hash applied to ...H04L 67/61 taking into account QoS or ...Y10S 707/99943 Generating database or data...Y10S 707/99944 Object-oriented database st...
