Call admission control system and method for interpreting signaling messages and controlling traffic load in internet protocol differentiated services networks

• US 7,660,242 B2
• Filed: 07/27/2004
• Issued: 02/09/2010
• Est. Priority Date: 08/28/2003
• Status: Expired due to Fees

• Current Assignee: Unwired Planet LLC (JP Morgan Chase & Co)
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Matefi, Gergely, Farkas, Janos, Antal, Csaba
• Primary Examiner(s): Pham; Chi H
• Assistant Examiner(s): Huang; Weibin
• Application Number:
  US10/595,092
• Publication Number:
  US 20060198304A1
• Time in Patent Office: 2,023 Days
• Field of Search: 370/229, 370/230, 370/231, 370/232, 370/233, 370/235, 370/236
• US Class Current: 370/230
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• 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/2408 for supporting different services, e.g. a differentiated services [DiffServ] type of service
• CPC Class Codes: H04L 47/2416 Real-time traffic
• CPC Class Codes: H04L 47/283 in response to processing delays, e.g. caused by jitter or round trip time [RTT]
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/801 Real time traffic
• CPC Class Codes: H04L 47/805 QOS or priority aware
• CPC Class Codes: H04L 47/822 Collecting or measuring resource availability data
• CPC Class Codes: H04L 47/824 Applicable to portable or mobile terminals
• CPC Class Codes: H04W 28/0247 based on conditions of the access network or the infrastructure network central resource management H04W28/16
• CPC Class Codes: H04W 28/0289 Congestion control load shedding arrangements in network planning H04W16/08; performing reselection for handling the traffic H04W36/22; wireless traffic scheduling H04W72/12
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]

Abstract

A call admission control system and method for Internet Protocol (IP) Differentiated Services (DiffServ) network having at least one node for interpreting signaling messages and controlling traffic load in the network. The method consists of an initialization (601) and a real-time phase (602). In initialization phase (601), coefficients of the approximating hyperplanes are computed (61) and stored (62). This phase is repeated when the descriptor of a traffic class changes (63), which usually happens when nodes are configured or reconfigured. A traffic mix is admissible (67), if for each real-time traffic class both the stability (65) and the delay (66) constraints are fulfilled. Stability is tested by evaluating the number of lost packets and comparing it to the tolerated packet loss ratio for each class in that queue. Delay constraint is tested by checking if the traffic mix is below at least one of the approximating hyperplanes in the space of number of sessions for each class.

Claims

1. A call admission control method in a node of an Internet Protocol (IP) Differentiated Services (DiffServ) network for controlling admission of a traffic mix relating to a number of different traffic classes of which at least one is a real-time traffic class, comprising the steps of:

determining whether a descriptor of a traffic class has changed;

invoking an initialization phase if said descriptor of a traffic class has changed, said initialization phase comprising computing coefficients of approximating hyperplanes of delay constraints of at least one traffic class;

storing the coefficients of said approximating hyperplanes; and

,

performing a real-time phase comprising the steps of;

determining whether a stability constraint is fulfilled;

determining whether a delay constraint is fulfilled;

admitting a traffic mix if, for each real-time traffic class, both the stability and the delay constraints are fulfilled; and

,

rejecting a traffic mix if, for each real-time traffic class, either the stability or the delay constraints are not fulfilled.

2. The call admission control method of claim 1, wherein said network is a Universal Mobile Telecommunication System Terrestrial Radio Access Networks (UTRAN) comprising at least one base station and a Radio Network Controller (RNC).

3. The call admission control method of claim 1, wherein the steps of said initialization phase are repeated if said descriptor of a traffic class changes.

4. The call admission control method of claim 1, wherein the steps of determining the stability constraint and the step of determining the delay constraint are performed simultaneously.

5. The call admission control method of claim 1, wherein the steps of computing the coefficients of approximating hyperplanes comprises the steps of calculating the arrays of:

the number of approximating hyperplanes for each real-time class i;

the effective bandwidth value for each class j session expressed in number of each class i sessions in scheduling model M;

the maximal number of each class i sessions in scheduling model M if no ongoing sessions from other classes are present; and

,

the capacity share of each real-time queue q if each other real-time queues are empty.

6. The call admission control method of claim 1, wherein the step of determining whether said stability constraint is fulfilled includes evaluating the number of lost packets and comparing it to the tolerated packet loss ratio for each class in that queue.

7. The call admission control method of claim 1, wherein the step of determining whether said delay constraint is fulfilled includes checking if the traffic mix is below at least one of the approximating hyperplanes in the space of number of sessions for each class.

8. The call admission control method of claim 1, wherein the step of determining whether said delay constraint is fulfilled comprises the steps of:

determining whether each traffic class is checked;

selecting the next traffic class if not each of traffic class is checked;

determining whether each hyperplane of that traffic class is checked;

selecting next hyperplane if not each of hyperplanes of that traffic class is checked; and

,

determining whether N is below of that hyperplane, where N is a vector defining the number of sessions is each traffic class.