Method and arrangement for admission control in a shared channel environment

Patent metadata

Field	Value
Publication number	US-9693374-B2
Application number	US-201214396815-A
Country	US
Kind code	B2
Filing date	May 16, 2012
Priority date	May 16, 2012
Publication date	Jun 27, 2017
Grant date	Jun 27, 2017

Abstract

Network node and method therein for admission control in a communication system applying shared channels for communication. The method comprises receiving a request for a bearer setup, and deciding whether to accept or reject the request for a bearer setup based on information on current bearers carrying data having a QoS value, and for which bearers a transmission of the data fulfills a criterion, the criterion representing a probability of violating the QoS value. Information on bearers carrying data which do not have a QoS value and information on bearers for which a transmission of data having a QoS value does not fulfill the criterion is disregarded.

First claim

The invention claimed is:

1. A method for admission control in a network node, the method comprising:
scheduling transmissions for a plurality of bearers, the plurality of bearers comprising:
a first set of current bearers that are not at risk of resource starvation, the first set of current bearers carrying first data that either has no QoS value or for which the transmissions do not fulfill a criterion representing a probability of violating a QoS value associated with the first data; and
a second set of current bearers that are at risk of resource starvation, the second set of current bearers carrying second data for which the transmissions fulfill a criterion representing a probability of violating a QoS value associated with the second data;

receiving a request for a bearer setup;
deciding whether to accept or reject the request for the bearer setup depending on whether the network node is experiencing high resource usage that is caused by congestion, wherein:
the decision to accept the request for the bearer setup is based on disregarding information associated with the first set of current bearers and determining that information associated with the second set of current bearers indicates that accepting the request for the bearer setup would not cause a congestion threshold to be exceeded; and
the decision to reject the request for the bearer setup is based on disregarding the information associated with the first set of current bearers and determining that the information associated with the second set of current bearers indicates that accepting the request for the bearer setup would cause the congestion threshold to be exceeded;

wherein the disregarding of the information associated with the first set of current bearers, which are not at risk of resource starvation, prevents an unnecessary rejection of the request for the bearer setup.

2. The method according to claim 1 , wherein the information is related to resource usage of the bearers.

3. The method according to claim 1 , wherein the criterion relates to at least one of:
a packet delay;
a bit rate;
a function of a packet delay and/or a bit rate;
a scheduling priority or weight.

4. The method according to claim 1 , wherein the criterion relates to a scheduling priority or weight, set by a scheduler.

5. Method according to claim 4 , wherein the scheduling priority or weight is set as a function of a probability of violating the QoS value.

6. The method according to claim 1 , further comprising:
indicating the outcome of the deciding to the requesting node.

7. A network node operable to perform admission control, the network node comprising:
a scheduler adapted to schedule transmissions for a plurality of bearers, the plurality of bearers comprising:
a first set of current bearers that are not at risk of resource starvation, the first set of current bearers carrying first data that either has no QoS value or for which the transmissions do not fulfill a criterion representing a probability of violating a QoS value associated with the first data; and
a second set of current bearers that are at risk of resource starvation, the second set of current bearers carrying second data for which the transmissions fulfill a criterion representing a probability of violating a QoS value associated with the second data;

a receiver adapted to receive a request for bearer setup; and
an admission controller adapted to decide whether to accept or reject the request for the bearer setup depending on whether the network node is experiencing high resource usage that is caused by congestion, wherein:
the decision to accept the request for the bearer setup is based on disregarding information associated with the first set of current bearers and determining that information associated with the second set of current bearers indicates that accepting the request for the bearer setup would not cause a congestion threshold to be exceeded; and
the decision to reject the request for the bearer setup is based on disregarding the information associated with the first set of current bearers and determining that the information associated with the second set of current bearers indicates that accepting the request for the bearer setup would cause the congestion threshold to be exceeded;

wherein the disregarding of the information associated with the first set of current bearers, which are not at risk of resource starvation, prevents an unnecessary rejection of the request for the bearer setup.

8. The network node of claim 7 , wherein the information is related to resource usage of the bearers.

9. The network node of claim 7 , wherein the criterion relates to at least one of:
a packet delay;
a bit rate;
a function of a packet delay and/or a bit rate;
a scheduling priority or weight.

10. The network node of claim 7 , wherein the criterion relates to a scheduling priority or weight, set by the scheduler.

11. Network node according to claim 10 , wherein the scheduling priority or weight is set as a function of a probability of violating the QoS value.

12. The network node of claim 7 , wherein the admission controller is further adapted to indicate the outcome of the deciding to the requesting node.

Assignees

• Arvidsson Pontus
• Hurd Magnus
• Skärby Christian
• ERICSSON TELEFON AB L M (publ)

Inventors

• Arvidsson Pontus
• Hurd Magnus
• Skärby Christian

Classifications

• H04L5/0064

  Rate requirement of the data, e.g. scalable bandwidth, data priority · CPC title

• H04W76/027

  Electricity · mapped topic

• H04W76/02 Primary

  Electricity · mapped topic

• H04W28/24

  Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service] · CPC title

• H04W72/1263 Primary

  Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows · CPC title