Managing reservations for resources

• US 20050188089A1
• Filed: 02/24/2004
• Published: 08/25/2005
• Est. Priority Date: 02/24/2004
• Status: Abandoned Application

• Current Assignee: Anders Skoe, David Agraz, John Ruttenberg, Luis Rojas, Walter D. Lichtenstein
• Original Assignee: Anders Skoe, David Agraz, John Ruttenberg, Luis Rojas, Walter D. Lichtenstein
• Inventors: Rojas, Luis, Ruttenberg, John, Skoe, Anders, Lichtenstein, Walter D., Agraz, David
• Application Number:
  US10/785,844
• Publication Number:
  US 20050188089A1
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/724 at intermediate nodes, e.g. resource reservation protocol [RSVP]
• CPC Class Codes: H04L 47/805 QOS or priority aware
• CPC Class Codes: H04L 47/821 Prioritising resource allocation or reservation requests
• CPC Class Codes: H04L 47/822 Collecting or measuring resource availability data
• CPC Class Codes: H04L 47/825 Involving tunnels, e.g. MPLS

Abstract

A methodology and algorithm for managing resources from classes within a pool of resources to determine whether and what resources may be allocated upon a request for resources.

Claims

1. A method for managing resources at a node in a communications network, the method comprising the steps of:

(a) defining a pool of one or more classes at the node;

(b) reserving resources for the one or more classes in the pool of classes;

(c) processing a request for the resources made in one or more classes in the pool;

(d) determining restrictions on the request for resources based on the reservation of resources in the step (b); and

(e) granting or denying the request for resources based on the determination of restrictions on the request made in the step (d).

2. The method of claim 1, the step (b) of reserving resources comprising the step of arbitrarily allocating resources among the one or more classes.

3. The method of claim 1, the step (b) of reserving resources comprising the step of reserving resources for a first class of the one or more classes, reserving resources for a second class of the one or more classes, and reserving resources for the union of the first and second classes.

4. The method of claim 3, the step of reserving resources for the union of the first and second classes comprises the step of reserving a greater amount of resources than the sum of the resources reserved for the first and second classes.

5. The method of claim 3, the step of reserving resources for the union of the first and second classes comprises the step of reserving a lesser amount of resources than the sum of the resources reserved for the first and second classes.

6. The method of claim 1, the step (b) of reserving resources comprising the step of reserving transmit bandwidth.

7. The method of claim 1, the step (b) of reserving resources comprising the step of reserving receive bandwidth.

8. The method of claim 1, the step (b) of reserving resources comprising the step of reserving storage space.

9. The method of claim 1, the step (a) of defining a pool of one or more classes comprises the step of defining by an arbitrary logical OR of an arbitrary logical AND of properties that may be evaluated.

10. The method of claim 1, wherein the step (b) of reserving resources comprises the step of calculating the resources from known restrictions on requests belonging to the classes in the pool.

11. A method for managing resources at a node in a communications network after a grant of resource to a class of a pool of classes, the method comprising the steps of:

(a) subtracting the resources from the reservation representing the class;

(b) recomputing restrictions on all possible requests given the subtraction in the step (a);

(c) applying rules governing restrictions to the restrictions recomputed in the step (b);

(d) adjusting a restriction to the extent the restriction violates the rules governing restrictions; and

(e) recomputing the reservations if a restriction was adjusted in said step (d).

12. A method for managing resources at a node in a communications network after a grant of an amount A of a resource to a plurality of classes of a pool of classes, the method comprising the steps of:

(a) applying an inclusion-exclusion process to initially calculate the resources in the plurality of classes after the grant,

(b) recomputing restrictions on all possible requests given the subtraction in the step (a);

(c) applying rules governing restrictions to the restrictions recomputed in the step (b);

(d) adjusting a restriction to the extent the restriction violates the rules governing restrictions; and

(e) recomputing the reservations if a restriction was adjusted in said step (d).

13. A method of determining a restriction on a request for resources in defined m number of classes, i₁ through i_m, from a pool of n number of classes, n greater than 0 and n greater than or equal to m, each class and combination of classes having reserved resources capable of being represented in an array res[k], k being an integer greater than 0 and less than 2ⁿ, and k having a binary expansion such that each bit in the binary expansion of k corresponds to a class in the pool, with the least significant bit corresponding to the first class, successively to the most significant bit corresponding to the n^th class, the restriction on the request for resources in the one or more defined classes allowing the determination of whether sufficient resources in the one or more defined classes are available to grant the request, the method comprising the steps of:

(a) determining the amount of resources in classes in which the request was not made, said step (a) including the step of;

(i) summing from 1 to (2ⁿ)−

₁ all reservations res[k] having a value of k whose binary expansion has all zero bits i₁ through i_m corresponding to classes i₁ through i_m in which the request was made;

(b) subtracting the summation found in said step (a) from the total amount of resources available; and

(c) denying the request for resources if the request for resources is greater than the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available; and

(d) granting the request for resources if the request for resources is less than or equal to the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available.

14. The method of claim 13, wherein the restrictions on a request in m-1 number of classes is greater than or equal to the restrictions on a request in m number of classes.

15. One or more processor readable storage devices having processor readable code embodied on said processor readable storage devices, said processor readable code for programming one or more processors to perform a method of determining a restriction on a request for resources in defined classes i₁ through i_m from a pool of n classes, n greater than 0 and n greater than or equal to m, each class and combination of classes having reserved resources capable of being represented in an array res[k], k being an integer greater than 0 and less than 2ⁿ, and k having a binary expansion such that each bit in the binary expansion of k corresponds to a class in the pool, with the least significant bit corresponding to the first class, successively to the most significant bit corresponding to the nth class, the restriction on the request for resources in the one or more defined classes allowing the determination of whether sufficient resources in the one or more defined classes are available to grant the request, the method comprising the steps of:

(a) determining the amount of resources in classes in which the request was not made, said step (a) including the step of;

(i) summing from 1 to (2ⁿ)−

₁ all reservations res[k] having a value of k whose binary expansion has all zero bits i₁ through i_m corresponding to classes i₁ through i_m in which the request was made;

(b) subtracting the summation found in said step (a) from the total amount of resources available; and

(c) denying the request for resources if the request for resources is greater than the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available; and

(d) granting the request for resources if the request for resources is less than or equal to the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available.

16. A method of managing resources at a node in a computer network, comprising the steps of:

(a) determining a restriction on a request for resources in defined m number of classes, i₁ through i_m, from a pool of n number of classes, n greater than 0 and n greater than or equal to m, each class and combination of classes having reserved resources capable of being represented in an array res[k], k being an integer greater than 0 and less than 2ⁿ, and k having a binary expansion such that each bit in the binary expansion of k corresponds to a class in the pool, with the least significant bit corresponding to the first class, successively to the most significant bit corresponding to the nth class, the restriction on the request for resources in the one or more defined classes allowing the determination of whether sufficient resources in the one or more defined classes are available to grant the request, the step (a) including the step of;

(i) determining the amount of resources in classes in which the request was not made, including the step of summing from 1 to (2ⁿ)−

₁ all reservations res[k] having a value of k whose binary expansion has all zero bits i₁ through i_m corresponding to classes i₁ through i_m in which the request was made;

(b) subtracting the summation found in said step (a) from the total amount of resources available; and

(c) denying the request for resources if the request for resources is greater than the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available; and

(d) granting the request for resources if the request for resources is less than or equal to the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available.

17. The method of claim 16, wherein the restrictions on a request in m-1 number of classes is greater than or equal to the restrictions on a request in m number of classes.

18. The method of claim 16, after the step (d) of granting the request for resources, further comprising the steps:

(e) subtracting the resources from the reservation representing the class or classes in which the request was granted;

(f) recomputing restrictions on all possible requests given the subtraction in the step (e);

(g) applying rules governing restrictions to the restrictions recomputed in the step (f);

(h) adjusting a restriction to the extent the restriction violates the rules governing restrictions; and

(i) recomputing the reservations if a restriction was adjusted in said step (h).

19. The method of claim 18, the step (g) of applying rules governing restrictions including the step of applying the rule that a restriction on a request in m-1 number of classes must be greater than or equal to the restrictions on a request in m number of classes.

20. One or more processor readable storage devices having processor readable code embodied on said processor readable storage devices, said processor readable code for programming one or more processors to perform a method of managing resources at a node in a computer network, the method comprising the steps of:

(a) determining a restriction on a request for resources in defined m number of classes, i₁ through i_m, from a pool of n number of classes, n greater than 0 and n greater than or equal to m, each class and combination of classes having reserved resources capable of being represented in an array res[k], k being an integer greater than 0 and less than 2ⁿ, and k having a binary expansion such that each bit in the binary expansion of k corresponds to a class in the pool, with the least significant bit corresponding to the first class, successively to the most significant bit corresponding to the n^th class, the restriction on the request for resources in the one or more defined classes allowing the determination of whether sufficient resources in the one or more defined classes are available to grant the request, the step (a) including the step of;

(i) determining the amount of resources in classes in which the request was not made, including the step of summing from 1 to (2ⁿ)−

1 all reservations res[k] having a value of k whose binary expansion has all zero bits i₁ through i_m corresponding to classes i₁ through i_m in which the request was made;

(b) subtracting the summation found in said step (a) from the total amount of resources available; and

(c) denying the request for resources if the request for resources is greater than the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available; and

(d) granting the request for resources if the request for resources is less than or equal to the result found in said step (b) of subtracting the amount of resources in the classes in which the request was not made from the total amount of resources available.

21. The one or more processor readable storage devices having processor readable code embodied on said processor readable storage devices, said processor readable code for programming one or more processors to perform the method of claim 20, wherein the restrictions on a request in m-1 number of classes is greater than or equal to the restrictions on a request in m number of classes.

22. The one or more processor readable storage devices having processor readable code embodied on said processor readable storage devices, said processor readable code for programming one or more processors to perform the method of claim 20, after the step (d) of granting the request for resources, further comprising the steps:

(e) subtracting the resources from the reservation representing the class or classes in which the request was granted;

(f) recomputing restrictions on all possible requests given the subtraction in the step (e);

(g) applying rules governing restrictions to the restrictions recomputed in the step (f);

(h) adjusting a restriction to the extent the restriction violates the rules governing restrictions; and

(i) recomputing the reservations if a restriction was adjusted in said step (h).

23. The one or more processor readable storage devices having processor readable code embodied on said processor readable storage devices, said processor readable code for programming one or more processors to perform the method of claim 22, the step (g) of applying rules governing restrictions including the step of applying the rule that a restriction on a request in m-1 number of classes must be greater than or equal to the restrictions on a request in m number of classes.