EP1371253A2 - Adaptive threshold scheme for differentiated system access - Google Patents
Adaptive threshold scheme for differentiated system accessInfo
- Publication number
- EP1371253A2 EP1371253A2 EP02752874A EP02752874A EP1371253A2 EP 1371253 A2 EP1371253 A2 EP 1371253A2 EP 02752874 A EP02752874 A EP 02752874A EP 02752874 A EP02752874 A EP 02752874A EP 1371253 A2 EP1371253 A2 EP 1371253A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- service
- network
- services
- access
- resources
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
- 230000003044 adaptive effect Effects 0.000 title description 11
- 238000004891 communication Methods 0.000 claims abstract description 36
- 230000006854 communication Effects 0.000 claims abstract description 36
- 238000000034 method Methods 0.000 claims abstract description 34
- 238000010295 mobile communication Methods 0.000 claims abstract description 6
- 230000001413 cellular effect Effects 0.000 claims abstract 6
- 239000000872 buffer Substances 0.000 claims description 16
- 230000005540 biological transmission Effects 0.000 claims description 13
- 230000000903 blocking effect Effects 0.000 claims description 10
- 230000007246 mechanism Effects 0.000 claims description 7
- 230000010267 cellular communication Effects 0.000 claims description 3
- 238000001914 filtration Methods 0.000 claims description 3
- 238000009499 grossing Methods 0.000 claims description 3
- 230000006978 adaptation Effects 0.000 description 16
- 230000003247 decreasing effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000001276 controlling effect Effects 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 230000007774 longterm Effects 0.000 description 3
- 239000000203 mixture Substances 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 230000002123 temporal effect Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 2
- 238000009795 derivation Methods 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000011217 control strategy Methods 0.000 description 1
- 230000000875 corresponding effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000010355 oscillation Effects 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000035945 sensitivity Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
Definitions
- the invention concerns methods and devices for applying an adaptive threshold scheme for differentiated system access.
- threshold values are highly dependent on the traffic mix and the call/handoff/packet arrival process.
- traffic mix, the user mobility and the call/handoff/packet arrival process and burstiness depends on various factors such as time of the day and the piace/environment (temporal and spatial variations), which makes it very difficult and ineffi- cient to adjust the thresholds in a proper way for all different situations.
- Granting access (to network resources) in accordance with the claim wording can comprise granting access to at least one network for a user of a mobile station requesting network access for e.g. a speech call or for transmission of data or for any multimedia service.
- a threshold may be e.g. a value representing the percentage of capacity (for which access can be granted) or the number of channels or other resources to be granted for requested new services (e.g.
- a change-over may be a change-over from one element of a communication network to another element of this commu- nication network (e.g. a hand-over of a mobile station between base stations or adaptive antennas in GSM or CDMA etc) or a change-over from one element of a communication network to another element of an other communication network.
- New services according to the claim wording can be any services that are requested and have not started or for which services no or not yet all desired communication capacity has been granted- e.g. a new call.
- Granted resources or capacity or access to elements may e.g. comprise a time and/or frequency channel (e.g.
- Access can comprise providing network resources (e.g. network resources represented by frequency and/or time and/or codes) for a mobile station- e.g. a speech channel.
- network resources e.g. network resources represented by frequency and/or time and/or codes
- the measured quality of service can be any measured parameter indicating the level of the quality of service, e.g. the probability (measured rate) of blocking hand-over requests (and/ or dropping of calls during handover) and /or the probability (measured rate) of blocking requests for access for enabling a new service (e.g. not granting access to a speech channel) .
- the predetermined target quality of service is a level of service that is desired, e.g. the percentage of blocked/ dropped hand-over requests or the percentage of blocked requests for a new service.
- An adaptive adaptation scheme can comprise the adjustment of the threshold values, which is directly based on the quality of service measure that is con- trolled by the underlying threshold scheme, i.e., this scheme alters the threshold (s) in response to a call/packet loss/delay.
- the basic scheme can be generally applied to loss as well as queuing systems, controlling loss, delay or throughput of two or more service classes with simple or more sophisticated controlling schemes.
- the proposed adaptive threshold scheme according to the invention can provide the following benefits: • In the long-term it is able to provide exactly a predefined QoS level, which means that the mechanism is able to control directly the QoS parameters irrespectively of the arrival pattern, traffic fluctuations and burstiness. Therefore, the proposed scheme is very robust and is able to cope with various situations. In particular, it is able to dynamically adapt the system behaviour when the traffic composition and intensity varies due to temporal or spatial changes of the user activity.
- the dynamic approach provides superior performance (higher admissible system load), because the thresholds ⁇ will be dynamically optimised to a particular load situation taking into account the temporal and spatial variations of the traffic intensity and characteristics.
- a fix threshold scheme has to be dimemsioned according to the worst case thus providing a lower system load (otherwise, the QoS targets will be violated for the worst case scenarios) .
- the adaptation scheme is computationally simple, because the algorithm uses only additions/subtractions for the control of the threshold (no multiplications or divi- sions) . Therefore, the scheme is able to adapt the threshold value in real-time, even for a high-speed packet switched network.
- Figure 1 shows the basic algorithm of an example of the invention.
- Figure 2 shows an adaptive guard channel scheme
- Figure 3 shows the loss probability of handoff calls
- Figure 4 shows the loss probability of new call requests
- Figure 5 shows the mean value of the adaptive threshold
- Figure 6 shows application of the adaptive threshold scheme to a packet transmission buffer
- Figure 7 illustrates the dropping probability of the Random Early Detection scheme
- a basic idea behind the invention is the adaptation of the threshold values in response to the measured quality of service.
- the basic mechanism that is used for the adaptation of the threshold values can be described as follows.
- the threshold will be adapted for each event (arrival of a call/packet, departure of a call/packet) that should be controlled by the threshold according to the following basic rules: •
- the threshold will be raised slightly by a value ? if the event indicates a better QoS than the target QoS level. •
- the threshold will be reduced by a value K? if the event indicates a worse QoS than the target QoS level.
- K should be chosen in such a way that a certain QoS level in terms of call/packet loss probability, packet delay quantile, call load or packet throughput can be maintained. This leads to the following balance condition for the deriva- tion of K:
- K number of events with a QoS better than QoS target / number of events worse than QoS target.
- the first example application is the guard channel scheme used in cellular communications.
- the guard channel scheme reduces the call dropping probability encountered by handoff calls compared to the call blocking probability of new calls by comparing the number of occupied channels with a threshold value T when a new call arrives.
- the new call will be accepted when less or equal than T channels are occupied, whereas the admission will be denied when more than T channels are occupied.
- the threshold value T has to be dimensioned in such a way that the call dropping probability for handoff calls is lower than a certain value B d (see, e.g., [1]).
- the threshold has to be kept between a minimum of 0 and a maximum of N. If the system is not in over- or underload, these maxi- mum and minimum values will not be reached and therefore, the following balance equation is valid:
- the dropping probability B d for handoff calls is given by number of denied handoffs / (number of denied handoffs + number of admitted handoffs) which leads to the following relationship between B d and K
- B d target represents the target dropping probability. If the value K is chosen according to Equation (1) , it is guaranteed that a long-term blocking probability of B d will be achieved given that the system is not in overload (T equals 0) or in underload (T equals N) .
- T load
- T underload
- This system has been simulated with the assumptions that new and handoff calls are generated according to a Poisson process. Furthermore, the call holding time of new and handover calls is negative exponentially distributed. This model is identically to the model used in [1] . Further- more, a simple study has been carried out using the basic parameters used in [1] :
- Figures 3 and 4 show the results obtained from the scheme for different values of .
- a service may require a certain time slot, a certain bit rate or a certain code resource and in that case, the threshold is also given by a number of time slots, a bit rate or a cnumber of codes and the number of channels describes the number of time slots, the total bit rate of a radio cell or the number of code resources.
- Multi-Service loss networks such as UMTS, ISDN, ATM or IP networks offer a very unfair call admission to services with different resource (bit rate) requirements.
- bit rate resource
- a service with small resource (bit rate) requirements gets more often access to the system than a service with high resource (bit rate) requirements, i.e., the call loss probability is larger for high bit rate calls than for low bit rate calls.
- this so-called complete sharing policy has the disadvantage that it may lead to a poor resource utilisation and it provides a poor revenue for different service classes with class-dependent revenue [2] .
- the proposed scheme may be also applied to queueing instead of loss systems.
- queueing systems are used in packet data networks, where the packets from different communications arrive randomly at a switch/router. The packets are stored in a buffer until they can be transmitted on the cor- responding outgoing line. In case of a network congestion the buffers will overflow and some packets will be lost. Since the services and applications have different sensitivity with respect to packet loss, different buffer access and transmis- sion line scheduling policies have been developed to tailor the packet handling to the QoS requirements of the underlying services and applications.
- One scheme proposed in [3] divides the buffer into several parts, which can be accessed only by a part of the different traffic classes.
- the threshold will be raised by a value of ⁇ , for each incoming high priority packet, which is able to access the system.
- the threshold will be lowered by a value of K ⁇ , when a high priority packet is lost.
- a modification of the scheme would be again to control the threshold in such a way that the ratio of the packet loss probabilities of class 1 and class 2 packets is kept at a constant value. This is done in the same way as described earlier for the guard channel scheme.
- the adaptive threshold scheme has to take into account the packet size for the control of the threshold.
- a very powerful and popular means of congestion handling in TCP/IP networks is the Random Early Detection scheme used in IP routers [4] .
- This scheme randomly discards packets when the- average buffer' size exceeds a certain lower buffer threshold.
- the dropping probability increases linearly with the average buffer size until a maximum threshold is reached, where the dropping probability corresponds to max_p. If the average queue size exceeds the maximum threshold, then every packet will be dropped.
- This random dropping of packets controls the traffic generated at the source if the communication is controlled by the Transmission Control Protocol (TCP) .
- TCP Transmission Control Protocol
- the control of the minimum threshold value should be based on the system throughput, whereas the control of the maximum threshold should be based on the number of times when the maximum threshold is exceeded. Therefore, min_th will be increased for each packet that leaves an empty queue, whereas it will be decreased for each packet that leaves an occupied queue. On the other hand, the maximum threshold will be increased if the average queue size is larger than max_th whereas it will be decreased if the average queue size is smaller than max_th. Using appropriate control parameters it is possible to adapt the threshold values to achieve a large system throughput and to avoid global synchronisation.
- Threshold adaptation of the guard channel scheme used for the prioritisation of handoff calls in mobile communication systems may be based on a tar- get loss probability for handoff calls or on the ratio of lost handoff calls and lost new calls (ratio of dropping and blocking probability) .
- Threshold adaptation for the call/connection/bearer admission policies used for multi-service networks such as ISDN, ATM, IP or UMTS networks.
- the adaptation may be based on target loss probabilities of certain service classes, ratio of the loss probabilities of different service classes, revenue of service classes, throughput and so on.
- Threshold adaptation of the buffer access schemes used in ATM or IP networks which provide a service specific cell/packet loss probability.
- the adaptation may be per- formed based on cell/packet loss probabilities, delay quantiles, throughput and so on.
- Ratio of call/packet/information loss probabilities of certain traffic classes 3. Carried load/throughput of a certain traffic class
- Delay quantile (number of packets which have a delay larger than a certain value) of a traffic class
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
- Jib Cranes (AREA)
- Computer And Data Communications (AREA)
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP02752874A EP1371253A2 (en) | 2001-03-19 | 2002-02-19 | Adaptive threshold scheme for differentiated system access |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01106848A EP1244318B1 (en) | 2001-03-19 | 2001-03-19 | Adaptive threshold scheme for differentiated access to system resources |
EP01106848 | 2001-03-19 | ||
PCT/EP2002/001736 WO2002076129A2 (en) | 2001-03-19 | 2002-02-19 | Adaptive threshold scheme for differentiated access to system resources |
EP02752874A EP1371253A2 (en) | 2001-03-19 | 2002-02-19 | Adaptive threshold scheme for differentiated system access |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1371253A2 true EP1371253A2 (en) | 2003-12-17 |
Family
ID=8176836
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP01106848A Expired - Lifetime EP1244318B1 (en) | 2001-03-19 | 2001-03-19 | Adaptive threshold scheme for differentiated access to system resources |
EP02752874A Withdrawn EP1371253A2 (en) | 2001-03-19 | 2002-02-19 | Adaptive threshold scheme for differentiated system access |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP01106848A Expired - Lifetime EP1244318B1 (en) | 2001-03-19 | 2001-03-19 | Adaptive threshold scheme for differentiated access to system resources |
Country Status (6)
Country | Link |
---|---|
EP (2) | EP1244318B1 (en) |
AT (1) | ATE296017T1 (en) |
DE (1) | DE60110892T2 (en) |
ES (1) | ES2240265T3 (en) |
PT (1) | PT1244318E (en) |
WO (1) | WO2002076129A2 (en) |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FI20020454A0 (en) * | 2002-03-11 | 2002-03-11 | Nokia Corp | Access control for data connections |
US7672308B2 (en) | 2002-03-11 | 2010-03-02 | Nokia Corporation | Admission control for data connections |
CN100384293C (en) * | 2004-08-31 | 2008-04-23 | 华为技术有限公司 | Call admission control method |
EP1694088A1 (en) * | 2005-02-22 | 2006-08-23 | Alcatel | A method for admission control for mobile networks, an admission controller and a communication system therewith |
GB2432752B (en) | 2005-11-29 | 2008-04-09 | Motorola Inc | Resource partitioning in a cellular communication system |
US7688724B2 (en) * | 2005-12-23 | 2010-03-30 | Avaya Inc. | Call admission control for mobility-capable telecommunications terminals |
EP2188959B1 (en) | 2007-09-07 | 2017-08-16 | Telefonaktiebolaget LM Ericsson (publ) | Dynamic admission control for media gateways |
EP2083587A1 (en) | 2008-01-25 | 2009-07-29 | British Telecommunications public limited company | Handover control |
-
2001
- 2001-03-19 EP EP01106848A patent/EP1244318B1/en not_active Expired - Lifetime
- 2001-03-19 ES ES01106848T patent/ES2240265T3/en not_active Expired - Lifetime
- 2001-03-19 AT AT01106848T patent/ATE296017T1/en active
- 2001-03-19 DE DE60110892T patent/DE60110892T2/en not_active Expired - Lifetime
- 2001-03-19 PT PT01106848T patent/PT1244318E/en unknown
-
2002
- 2002-02-19 WO PCT/EP2002/001736 patent/WO2002076129A2/en active Application Filing
- 2002-02-19 EP EP02752874A patent/EP1371253A2/en not_active Withdrawn
Non-Patent Citations (1)
Title |
---|
See references of WO02076129A3 * |
Also Published As
Publication number | Publication date |
---|---|
ES2240265T3 (en) | 2005-10-16 |
WO2002076129A9 (en) | 2008-01-03 |
WO2002076129A3 (en) | 2003-01-03 |
WO2002076129A2 (en) | 2002-09-26 |
DE60110892D1 (en) | 2005-06-23 |
PT1244318E (en) | 2005-09-30 |
EP1244318A1 (en) | 2002-09-25 |
DE60110892T2 (en) | 2005-10-20 |
EP1244318B1 (en) | 2005-05-18 |
ATE296017T1 (en) | 2005-06-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Epstein et al. | Reservation strategies for multi-media traffic in a wireless environment | |
KR101193769B1 (en) | Coordinated data flow control and buffer sharing in umts | |
US8155072B2 (en) | Method and device for managing resources shared by different operators in a communication system | |
EP2080326B1 (en) | System and method of load dependent rate control | |
EP1787436B1 (en) | Method and system for managing radio resources in mobile communication networks, related network and computer program product therefor | |
US20030123392A1 (en) | Packet flow control method and device | |
EP1258117B1 (en) | Capacity allocation for packet data bearers | |
US20120002544A1 (en) | Dynamic Resource Partitioning for Long-Term Fairness to Non-Elastic Traffic on a Cellular Basestation | |
WO2007113517A1 (en) | Prioritising data transmission | |
JP2002152797A (en) | Method and device for adaptive admission control for guaranteeing quality of service of hand-off on radio network | |
EP1832015B1 (en) | A method for scheduling resources of packet level for integrated level for integrated traffic, and an apparatus therefor | |
EP2127125B1 (en) | Power overload control method useful with high speed downlink packet access | |
EP1244318B1 (en) | Adaptive threshold scheme for differentiated access to system resources | |
Do et al. | Channel assignment with QoS guarantees for a multiclass multicode CDMA system | |
EP1573980B1 (en) | Traffic channel scheduling | |
Epstein | Resource allocation algorithms for multi-class wireless networks | |
Wang et al. | Call admission control for self-similar data traffic in cellular communications | |
Ajib et al. | Effects of circuit switched transmissions over GPRS performance | |
Tomar et al. | New call admission control and handoff techniques for 3-g mobile networks | |
Yoshimura et al. | Wireless Packet Scheduling for Adaptive Service over IEEE802. 11 | |
PETIMANI et al. | Quality of Service for Call Admission in Wireless System | |
Wang et al. | Improved Channel Allocation and RLC block scheduling for Downlink traffic in GPRS | |
Cruz-Perez et al. | Flexible resource allocation strategy with prioritisation levels | |
Cruz-Perez et al. | Flexible Resource Allocation with Partial Resource Sharing and minimum overflow for integrated services | |
Ansari | Performance Analysis of Cell Switching Management Scheme in Wireless Packet Communications |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20030901 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK RO SI |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG |
|
RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS S.P.A. |
|
RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: NOKIA SIEMENS NETWORKS GMBH & CO. KG |
|
R17D | Deferred search report published (corrected) |
Effective date: 20080103 |
|
17Q | First examination report despatched |
Effective date: 20090212 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20090623 |