Method and Arrangement in a Data Network for Bandwidth Management

• US 20090304020A1
• Filed: 07/01/2005
• Published: 12/10/2009
• Est. Priority Date: 05/03/2005
• Status: Abandoned Application

• Current Assignee: NetSocket, Inc.
• Original Assignee: Operax AB (NetSocket, Inc.)
• Inventors: Karlsson, Johan, Bodin, Ulf
• Application Number:
  US11/919,398
• Publication Number:
  US 20090304020A1
• Time in Patent Office: Days
• US Class Current: 370/458
• 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/215 using token-bucket
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/782 Hierarchical allocation of resources, e.g. involving a hierarchy of local and centralised entities
• CPC Class Codes: H04L 47/821 Prioritising resource allocation or reservation requests
• CPC Class Codes: H04L 47/827 Aggregation of resource allocation or reservation requests
• CPC Class Codes: H04L 47/83 based on usage prediction
• CPC Class Codes: H04Q 3/0025 Provisions for signalling

Abstract

An arrangement associated with a Bandwidth Manager, BM, adapted to reserve and return network resources requested from a first entity in a data network. The arrangement includes a first message rate limiter element (301) adapted to limit the rate of reservations request messages to the BM, a second message rate limiter element (302) adapted to limit the rate of resource return messages to the BM, and at least one message rate estimator unit (303) adapted to adjust the message rate limiters between the reservation request signalling peak rate and sustained rates defined for the communication between the BM and a second entity.

Claims

1. An arrangement associated with a resource managing capable entity adapted to reserve and return network resources requested from a first entity in a data network, characterised in that said arrangement comprises a first message rate limiter means (301) adapted to limit the rate of reservations request messages to the resource managing capable entity, a second message rate limiter means (302) adapted to limit the rate of resource return messages to the resource managing capable entity, and at least one message rate estimator means (303) adapted to adjust the message rate limiters between the reservation request signalling peak rate and sustained rates defined for the communication between the resource managing capable entity and a further resource managing capable entity.

2. The arrangement according claim 1, characterised in that it comprises buffering means (304) adapted to queue said reservation request messages and said resource return messages.

3. The arrangement according to claim 1, characterised in that it comprises aggregation means adapted to aggregate the reservation requests.

4. The arrangement according to claim 1, characterised in that the message rate estimator is a token bucket.

5. The arrangement according to claim 1, characterised in that the message rate estimator is a moving average.

6. The arrangement according to claim 1, characterised in that the message rate estimator is a table adapted to store history of transmission intervals.

15. The arrangement according to claim 2, characterised in that it comprises aggregation means adapted to aggregate the reservation requests.

7. A method in a data network comprising at least one resource managing capable entity, adapted to reserve and return network resources requested from a first entity, characterised in that the method comprises the steps of:

limiting the rate of reservations request messages to the resource managing capable entity,

limiting the rate of resource return messages to the resource managing capable entity, and

adjusting the message rate between the reservation request signalling peak rate and sustained rates defined for the communication between the resource managing capable entity and a further resource managing capable entity.

8. The method according to claim 7, characterised in that it comprises the step of:

queuing said reservation request messages and said resource return messages.

9. The method according to claim 7, characterised in that it comprises the step of:

aggregating the reservation requests.

10. The method according to claim 7, characterised in that the message rate is estimated by means of a token bucket.

11. The method according to claim 7, characterised in that the message rate is estimated by means of a moving average.

12. The method according to claim 7, characterised in that the message rate is estimated by means of a table adapted to store history of transmission intervals.

13. A computer program product directly loadable into a processing means in a data network, comprising the software code means for performing the steps of claim 7.

14. A computer program product stored on a computer usable medium, comprising readable program for causing a processing means in a data network, to control the execution of the steps of claim 7.

16. The method according to claim 8, characterised in that it comprises the step of:

aggregating the reservation requests.

17. The method according to claim 8, characterised in that the message rate is estimated by means of a token bucket.

18. The method according to claim 8, characterised in that the message rate is estimated by means of a moving average.

19. The method according to claim 8, characterised in that the message rate is estimated by means of a table adapted to store history of transmission intervals.