Maintenance of sliding window aggregated state using combination of soft state and explicit release principles

• US 6,687,655 B2
• Filed: 01/17/2002
• Issued: 02/03/2004
• Est. Priority Date: 02/22/2001
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Jacobsson, Martin Edvard, Oosthoek, Simon, Karagiannis, Georgios
• Primary Examiner(s): Barlow, John
• Assistant Examiner(s): Walling, Meagan S.
• Application Number:
  US10/051,570
• Publication Number:
  US 20020156599A1
• Time in Patent Office: 747 Days
• Field of Search: 702/186, 702/182, 702/183, 709/223, 709/224, 709/225, 709/226, 709/227, 370/230, 370/231, 370/232, 370/235, 370/236, 370/237, 370/401, 370/412, 370/468
• US Class Current: 702/186
• CPC Class Codes: H04L 47/2408 for supporting different services, e.g. a differentiated services [DiffServ] type of service
• CPC Class Codes: H04L 47/27 Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
• 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/826 Involving periods of time

Abstract

A method is provided for reserving, maintaining and releasing resources in the interior nodes located within an interior network positioned between edge nodes, wherein requests belonging to corresponding data microflows that continually arrive at any interior node do not establish any microflow reservation states, but these requests can establish, maintain and release either a part of, or an entire aggregated reservation state, using a combination of reservation soft state and explicit release principles. A window is applied to establish a first time period, which includes a selected cell in a sequence of time cells and also includes a number of additional cells preceding the selected cell. Arrival of reserve and refresh requests during the selected cell is detected to generate an rfcount associated with the selected cell. The rfcount is combined with a lastsum associated with the preceding cells to form a newsum, which is used to manage resources in the interior network during a reservation period corresponding to the selected cell. Following the selected cell, the window is shifted to establish a second time period which includes the next cell in the sequence, and excludes the oldest cell of the first time period.

Claims

1. In a network arrangement having an interior network which consists of interior nodes, and is positioned between edge nodes, wherein requests belonging to corresponding data microflows that continually arrive at any interior node do not establish any microflow reservation states, but these requests can establish, maintain and release either a part of, or an entire aggregated reservation state, using a combination of reservation soft state and explicit release principles, a method comprising the steps of:

detecting each of said requests arriving at said interior network during a selected time cell in a sequence of time cells;

computing a first resource count after said selected time cell, said first count representing the cumulative result of all reserve, maintenance and release requests arriving at said interior network during a first time period defined by a sliding window, said first time period comprising said selected cell and a specified number of additional time cells preceding said selected cell in said time cell sequence;

reserving a number of resource units corresponding to said first count for a first reservation period following said selected time cell;

sliding said window to define a second time period which includes the time cell next following said selected cell in said sequence, and which excludes the oldest cell of said first time period; and

computing a second resource count associated with said second time period for use in reserving resource units for a second reservation period following said first reservation period.

2. The method of claim 1 wherein:

reservation of resource units for a given one of said microflows is maintained by one or more refresh requests arriving at specified intervals following an initial reservation request for said given microflow; and

each of said specified intervals comprises a refresh period which is equal in time duration to said first and second time periods.

3. The method of claim 2 wherein:

reservation of resource units for said given microflow is released when a release request therefor arrives at said interior network.

4. The method of claim 3 further comprising the steps of:

detecting a release request for said given microflow arriving during a particular cell included in said first time period;

determining whether a refresh request for said given microflow has arrived during a cell prior to said particular cell and is likewise included in said first time period; and

subtracting the number of resource units reserved for said given microflow from a resource count associated with said prior cell if it is determined that a refresh request did arrive during a prior cell included in said first time period.

5. The method of claim 4 wherein determining step comprises:

calculating a first differential comprising the difference between the start of said first time period and the arrival time of said release request for said given microflow;

detecting a second differential comprising the difference between the respective arrival times of the release request and the most recent refresh request for said given micro flow; and

comparing said first and second differentials to determine whether to subtract said resource units reserved for said given microflow from said prior cell.

6. The method of claim 5 wherein:

said resource units reserved for said given microflow are subtracted from said prior cell if said first differential is selectively greater than said second differential.

7. The method of claim 4 wherein:

each of said reserve requests arriving at said interior network identifies the service class with which it is associated.

8. The method of claim 1 wherein:

each of said reservation periods has a time duration equal to the duration of respective cells of said sequence.

9. In a network arrangement having an interior network which consists of interior nodes, and is positioned between edge nodes, wherein requests belonging to corresponding data microflows that continually arriving at any interior node do not establish any microflow reservation states, but these requests can establish, maintain and release either a part of, or an entire aggregated reservation state, using a combination of reservation soft state and explicit release principles, a method comprising the steps of:

applying a sliding window to establish a first time period comprising a cell in a sequence of time cells, and further comprising a number of additional cells immediately preceding said selected cell in said sequence;

detecting arrival of reserve and refresh requests during said selected cell to generate a rfcount associated with said sliding window;

combining said rfcount and a lastsum associated with said additional immediately preceding cells of the sliding window to form a newsum of said sliding window for use in managing resources in said interior network during a reservation period corresponding to said selected cell; and

sliding said window, following said selected cell, to establish a second time period which includes the cell next following said selected cell in said sequence, and excludes the oldest cell of said first time period.

10. The method of claim 9, wherein:

reservation of resource units for a given one of said microflows is maintained by one or more refresh requests arriving at specified intervals following the initial reservation request for said given microflow; and

each of said specified intervals comprises a refresh period which is equal in time duration to said first and second time periods.

11. The method of claim 10 wherein:

reservation of resource units for said given microflow is released when a release request therefor arrives at said interior network.

12. The method of claim 11 further comprising the steps of:

detecting a release request for said given microflow during said first time period; and

determining whether a refresh request for said given microflow was received during a previous cell included in said first time period, and if so, subtracting the number of resource units reserved for said given microflow from a countarray associated with said previous cell.

13. An article of manufacture for reserving, maintaining and releasing resources in the interior nodes located within an interior network positioned between edge nodes, wherein requests belonging to corresponding data microflows that continually arrive at any interior node do not establish any microflow reservation states, but these requests can establish, maintain and release either a part of, or an entire aggregated reservation state, using a combination of reservation soft state and explicit release principles, said article of manufacture comprising:

a computer readable medium;

a plurality of instructions wherein at least a portion of said plurality of instructions are storable in said computer readable medium, and further wherein said plurality of instructions are configured to cause a processor to;

apply a sliding window to establish a first time period comprising a selected cell in a sequence of time cells, and further comprising a number of additional cells immediately preceding said selected cell in said sequence;

generate a rfcount associated with arrival of reserve and refresh requests during said selected cell of the current sliding window;

combine said rfcount with a lastsum associated with said additional immediately preceding cells of the sliding window to form a newsum of said sliding window for use in managing resources in said interior network during a reservation period corresponding to said selected cell; and

slide said window, following said selected cell, to establish a second time period which includes the cell next following said selected cell in said sequence, and excludes the oldest cell of said first time period.

14. The article of manufacture of claim 13 wherein:

reservation of resource units for a given one of said microflows is maintained by one or more refresh requests arriving at specified intervals following the initial reservation request for said given microflow; and

each of said specified intervals comprises a refresh period which is equal in time duration to said first and second time periods.

15. The article of manufacture of claim 14 wherein:

reservation of resource units for said given microflow is released when a release request therefor arrives at said interior network.

16. The article of manufacture of claim 15 wherein a release request for said given microflow is detected during said first time period, and wherein:

said processor determines whether a refresh request for said given microflow was received during a previous cell included in said first time period, and if so, subtracts the number of resource units reserved for said given microflow from a countarray associated with said previous cell.