RU2364044C2 - Flow admission control for wireless communication systems - Google Patents

Abstract

FIELD: communication facilities.

SUBSTANCE: claimed device relates to wireless communication. Sector coverage is constantly changing, for example due to appearance of new base stations. Effect is achieved by wireless communication device design including device defining accessible resources in wireless communication system and device defining flow admission.

EFFECT: elimination of high dependency of a sector capacity on coverage conditions in the sector.

12 cl, 5 dwg

Description

This patent application claims priority under provisional application No. 60/503193 for the grant of a US patent entitled “FLOW ADMISSION CONTROL FOR WIRELESS SYSTEMS”, filed September 15, 2003, and provisional application No. 60/503192 for the grant of a US patent entitled "QUALITY OF SERVICE SCHEDULING METHODOLOGY", filed September 15, 2003, the rights to which belong to the applicant of this application and are hereby expressly incorporated into the materials of this application by reference .

Technical field

The present invention generally relates to wireless communications, and more specifically to wireless service management.

State of the art

Resource allocation is necessary for a wireless communication system, since the resources available to such a system may be limited for a changing number of subscribers. The purpose of admission control of communication channels, i.e. streams into the wireless communication system is to provide a level of quality for each of the subscribers already in the system, i.e. quality of service (QoS). One approach may be to limit the total amount of the exchange flow to an appropriate level for these resources. For a system that provides a variety of differentiated services, prioritizing each of the many communication flows can counterbalance the conflicting demands of a high utilization ratio of the sector capacity while meeting priority requirements. In addition, due to the time-varying nature of the wireless channel, some margin must be left in the resource utilization rate to ensure that priority requirements are met continuously, throughout the session, even during short periods of deep fading.

Based on the simulation, it was determined that channel fading is the dominant cause of packet drops. Most packet drops occur when the user is in a deep freeze state. In current systems, there is no information about user mobility patterns, namely, the characteristics of such long-term fading are unknown. A simple access control method could be based on the total demand and fixed capacity obtained by averaging over all possible scenarios, including the number of flows from each QoS class, user locations, mobility patterns, and so on. After the capacity is obtained, the implemented algorithm could be based solely on the aggregate requirement. Despite this simplicity, this scheme lacks the fact that the capacity value will be highly dependent on the coverage conditions in the sector, and it will change, while new base stations will be installed.

Essence

In a high-speed data transmission (HDR) system, admission control algorithms can limit the amount of traffic in a sector so that priority requirements can be met in the presence of wireless channel conditions that change over time. To enable access control algorithms and parameters to be more widely applicable and resilient to changes in the network, the present invention bases admission control on a real-time system utilization rate. This approach requires the collection and processing of statistics.

In one embodiment, admission control may be based on utilization of time slots by flow and on the satisfaction of conditions determined by their priorities in terms of delay and throughput. Time slot utilization and priority violations can be monitored in real time for existing threads. A new flow may be allowed only if the overall utilization rate of the time slots is below a certain threshold value. The status of existing flows can be adjusted if the requirements related to their priority cannot be met, or they take up excessive resources due to prolonged periods of deep fading. This adjustment may include stopping the delay-sensitive flow and lowering the velocity-sensitive flow to the best service level.

Brief Description of the Drawings

Figure 1 is one embodiment of a wireless communication system.

Figure 2 - one of the embodiments of a structural diagram illustrating the basic subsystems of a wireless communication system.

FIG. 3 is a flowchart of a method according to one embodiment of a method for controlling access.

4 is a flowchart of a method according to one embodiment of the method for terminating an existing EF stream.

5 is a flowchart of a method according to one embodiment for downgrading an existing AF stream to BE status.

Detailed description

Disclosed are user access control in a wireless communication system, where each user’s communication channel, i.e. a stream may have one of a variety of different priorities. An element of a wireless communication system, such as, for example, a base transceiver station (BTS or base station), may include access control functions. These functions, existing as access control methods and devices, can represent structured access to a communication system. Such access can be intended for a number of remote devices, where access can be determined according to a priority approach. There may be a number of service requirements, where each requirement may have a different priority, each priority is assigned to the speed or minimum speed that is available to the communication flow. As examples, service destinations may include high priority services, such as urgent forwarding (EF) for delay and scatter (packet to packet delay) sensitive streams, or medium priority services such as guaranteed forwarding with a guaranteed minimum speed. An additional priority service may be Best Service (BE), which may not have a guaranteed speed, but might offer speed based on any remaining capacity. In addition, such admission control may include tracking all existing flows as part of the BTS management and setting up individual flows, such as when a service is terminated or dropped, if certain conditions are met.

In one embodiment, within one or more BTSs of a wireless communication system, an admission control task may reside on a processor. The packet scheduler can join all channel elements within the BTS and, in essence, be conveniently located to manage QoS requirements, i.e. priority. Once a stream is admitted through admission control, a packet scheduler within the BTS can handle various flow serving destinations, and where the packet scheduler can reside, for example, in a digital signal processor (DSP).

DSPs can be special microprocessors designed to execute iterative mathematically time-consuming algorithms. DSPs can have approximately the same level of integration, same clock speeds as general-purpose microprocessors. DSPs can outperform general-purpose processors by 2–3 orders of magnitude in speed due to architectural differences. Typical DSP applications include audio processing, video processing, and telecommunications devices, where such digital signal processing requires a large number of real-time calculations. The most common operation in digital signal processing is to calculate the sum of the pieces. Among such operations, convolution and the discrete Fourier transform are well known.

Figure 1 is one embodiment of a wireless communication system. Remote stations 102A-102J may be dispersed throughout the communication system 100 to be in communication with one or more base stations 104A-104G, with multiple base stations 104A-104G being in communication with a single base station controller (not shown). The communication system 100 may comprise multiple cells 106A-106G, where each cell 106A-106G may be served by a respective base station 104A-104G. Each of the remote stations 102A-102J may communicate with one or more base stations 104A-104G on a forward link in each frame of a traffic channel. For example, base station 104A may transmit to remote stations 102A and 102J, base station 104B may transmit to remote stations 102B and 102J, base station 104C may transmit to remote stations 102C and 102H. Each base station 104A-104G may transmit data to one or more remote stations 102A-102J at any given moment. In addition, the data rate may be variable and may be dependent on the ratio of carrier power to interference (C / T), which is measured by the receiving base station 102, and the required ratio of energy in bits to noise. Reverse link transmission signals from remote stations 102A-102J to base stations 104A-104G are not shown for simplicity.

Figure 2 - one of the embodiments of a structural diagram illustrating the basic subsystems of a wireless communication system. A base station controller (BSC) 202 can interface with a packet switched network interface 204, a public switched telephone network 206 (PSTN), and all base stations 208 (BTS) (only one shown) in a communication system 200. The base station controller 202 may coordinate communication between the remote stations 219 and the communication system 200 and other users connected to the packet-switched network interface 204 and the PSTN 206.

Within the BTS 208, the call processor 214 may reside in the BSC to coordinate with each selector 212 to control communications between one or more base stations 208 and at least one remote station 210. If the selector 212 has not been assigned to the remote station 210 , the call control processor 214 may be informed of the need to make a paging call to the remote station 210, where the call control processor 214 may then direct the base station 208 to the remote station 210.

The data source 216 may contain data that can be transmitted to the remote stations 210. The data source 216 can supply data to the packet-switched network interface 204, where the packet-switched network interface 204 can receive data and route data to the selector element 212. Selector element 212 may send data to each base station 208 in communication with the remote station 210. In one embodiment, each base station 208 may support a data queue 218, which may conclude It is a data to be transmitted to the remote station 210.

In one embodiment for admission control, the admission control function may reside in a processor 214 that is located in the BTS 208. Packet scheduler 211 may reside in the DSP 213 as well as within the BTS 208 to communicate with channel elements 220. Data may then be sent in data packets from the data queue 218 to the channel elements 220. On a forward link, the data packet may indicate a fixed amount of data that must be transmitted to the remote station 210 of the destination, to the limit x one frame. For each data packet, channel element 220 may insert the necessary control fields. In one embodiment, the CRC (cyclic redundancy code) of the channel element may encode a data packet and control fields and insert a set of code termination bits. A data packet, control fields, CRC parity bits, and a code bit combination constitute a formatted packet. Channel element 220 may encode a formatted packet, and then interleave (or reorder) the symbols within the encoded packet. The interleaved packet can be scrambled with a long (pseudo-noise) PN code, covered with a Walsh wrapper and spread-spectrum encoded by short codes of the PN sub-code I and PN-sub-code Q. The data encoded with spreading can be transmitted to a radio frequency (RF) node 222, which quadrature modulates, filters, and amplifies the signal. The forward link signal may then be transmitted over the air via antenna 224 on forward link 250.

At remote station 210, a forward link signal may be received by antenna 260 and routed to a receiver (not shown) within input stages 262. The receiver filters, amplifies, quadrature demodulates, and quantizes the signal. The digitized signal can then be provided to a demodulator 264 (DEMOD), where the signal can be decoded, down-spread, with short codes of the PN subcode I and PN subcode Q, deployed with a Walsh wrapper and descrambled with a long PN code . The demodulated data can then be provided to a decoder 266, which can reverse the order of the signal processing functions performed at the base station 208, more specifically, the functions of the deinterleaving, decoding, and CRC checking. The decoded data may then be provided to a data receiver 268.

The communication system 200 supports the transmission of data and messages on the reverse link 238. The data to be sent may reside in a data source 270. Within the remote station 210, the controller 276 can process the data or message transmissions by routing the data or messages to the encoder 272. In one embodiment, the encoder 272 can format a message that is compatible with the data format of the unlabeled radio signal transmission. Encoder 272 can then generate and attach a set of CRC bits, attach a set of code end bits, encode data and attached bits, and reorder characters within the encoded data. The interleaved data can then be provided to a modulator 274 (MOD).

Modulator 27 4 may be implemented in many embodiments. In the first embodiment, the interleaved data can be wrapped with a Walsh code that identifies the data channel assigned to the remote station 210, spread with a long PN code and, moreover, spread with short PN codes. Spread-coded data can then be provided to a transmitter (not shown) within the input stages 262. The transmitter can modulate, filter, amplify, and transmit the reverse link signal over the air through antenna 260, over reverse link 252.

At base station 208, a reverse link signal may be received by antenna 224 and provided to an RF node 222. An RF node 222 may filter, amplify, demodulate, and quantize the signal, and provide a digitized signal to channel element 220. Channel element 220 may expose the digitized spread decoding, reverse-coding signal with short PN codes and long PN code. Channel element 220 may also perform Walsh code mapping or disclosure, depending on the signal processing performed at remote station 210. Channel element 220 may then reorder the demodulated data, decode the deinterleaved data, and perform a CRC check function. Decoded data, such as data or a message, may be provided to a selector 212. The selector 212 can then route the data or message to an appropriate destination (eg, data receiver 246).

The hardware described above supports data communications, voice messaging, video, and other forward link communications, such as, for example, through a CDMA (Code Division Multiple Access) system. Another hardware architecture may be designed to support variable speed transmissions, and is within the scope of the present invention.

In one embodiment for admission control, service requirements from various individual information transmissions, i.e. communication flows can represent different levels of quality of service (QoS), which can be converted into resource requirements in a straight line. QoS Scheduler, i.e. packet scheduler 211 (FIG. 2) can provide streams that are assigned a first priority, such as, for example, EF streams, with absolute priority over a second priority, such as, for example, for AF streams. This can be accomplished by forcing the packet scheduler 211 to attempt to transmit EF packets as soon as they arrive in the queue. Therefore, as long as the EF stream delay restriction is not too short, you can focus on the speed requirement in controlling the tolerance of the EF flows without explicitly considering the delay requirements. In order to provide a rational time margin for the packet scheduler 211, it can be agreed that the delay limit (time between received at the base station and received at the remote station) of any EF stream is not less than, for example, 100 ms, since at present 100 ms used for normal streams of voice over IP (Internet Protocol). Therefore, in cases where admission control is considered, the QoS requirements from both, EF and AF, can be based on speed.

The resources considered in the forward link may be time slots. Therefore, the admission control solution can be based mainly on the proportion of time slots used by QoS flows and QoS violations. The sum of the specific time use of all EF flows and the sum of the specific time use of all QoS flows can be used to decide whether a new stream can be allowed. The packet scheduler may allocate intervals to the user depending on the data rate information provided by the reverse link data rate control channel (DRC). The data rate for the stream may be selected to reflect channel conditions after verification by a remote station. The fraction of the action time for each stream may depend on both the required speed and the average DRC of each respective user. Time utilization information for existing streams can be collected directly in real time, and the average DRC for all existing users can be calculated.

For a new stream where no track record has been accumulated, the demand of the new stream by the time utilization factor can be estimated based on the required QoS rate of the new stream and its average DRC, where the average DRC can be based, for example, on a sample. If a new stream is coming from an existing user, the average DRC may be known since the admission control algorithm monitors the channel quality of existing QoS streams. However, if a new stream comes from a new user without recording a DRC, the average DRC can be estimated as, for example, by the moving average of its requested DRC during connection setup or the smoothed average obtained by means of an IIR filter (with an infinite impulse response, IIR, IIR). The calculated parameter involved in this estimate is the window length in the case of a moving average and the time constant in the case of IIR filtering.

The quality of a wireless channel may be time-varying, and as a result, it is difficult to predict long-term channel quality behavior. Therefore, it is possible that a particular QoS stream is allowed when the channel quality is good enough for its QoS requirement to be satisfied, and then the user can enter deep fading for a long period of time. When this happens, his QoS requirement will be violated, despite the priority service from the scheduler. The result can be high time utilization and severe QoS violations, such as increased packet loss for EF and low throughput for AF. Due to this high loss, EF flow requirements may not be satisfied. As a result, access control can terminate such EF flows and relieve pressure on other QoS flows in the sector. A similar argument applies to deep-fading AF streams, where these AF streams may be degraded to BE, rather than being terminated. Therefore, in one embodiment, the following regulatory policy or “symptom of compensation” can be implemented by admission control:

- An EF stream can be terminated if its packet loss rate is high over an extended period of time,

- The EF stream can be lowered to BE if for a long time its throughput is too low compared to its required speed,

- even if there is no EF or AF stream experiencing prolonged and severe QoS violation, but there are QoS violations among QoS flows, the algorithm can search for any QoS stream with a too high utilization factor and adjust its status. This feature is included in order to facilitate the case when QoS violations are distributed among multiple threads instead of being concentrated in one thread. This symptom of compensation may be detrimental to flows owned by low DRC users.

In one embodiment, for admission control, the following statistics may be collected:

- the fraction of the time when each thread is served by the BTS,

- packet drop percentage for EF streams,

- bandwidth for AF streams,

- The average requested by each DRC user.

Share time flow

In BTS, the algorithm may maintain a time slot counter for each stream. The counter value may increase by one after each interval in which the stream is served. Based on the value of the counter, the fraction of the time during which each thread is serviced can be periodically calculated, for example, with a period, such as, for example, a period of approximately 300 intervals.

EF stream drop rate

Two counters can be used for each EF stream:

- one counter can record the number of dropped packets due to delay violations,

- another counter can count the total number of received packets with the drop percentage calculated each period, such as, for example, approximately every 300 intervals.

AF stream throughput

For each AF stream, a counter can be maintained that can record the number of transmitted MAC packets (medium access control) and where the throughput can be calculated every period, such as, for example, approximately every 300 intervals. There may be an IIR bandwidth estimate that can be used by the scheduler. Here, linear estimation can be used mainly to reduce the impact of packaging in planning.

User average DRC requirement

This requirement can be calculated by maintaining two counters:

- one - for the size of the payload in the MAC packets,

- one - for the number of transmission time slots without early termination.

The values of both counters can increase in each interval, where the average DRC can be calculated periodically, for example, approximately every 300 intervals. There may be a shorter period for this calculation regarding the incoming user. This information can be used to decide on the admission for the new QoS stream of the new user, where the throughput can be calculated every period, such as, for example, approximately every 100 intervals.

The aforementioned estimate of the average DRC may have a negative bias, especially for slow-fading users, however, such a bias may not be detrimental because a slow-fading channel may be the worst channel in terms of QoS violations.

Statistical processing

All processing listed below can only be performed at the end of each period that is specified.

The statistics collected can be smoothed by filters with an infinite impulse response (IIR), as described below.

 - The fraction of the time in which each thread is served is saved:

let TF _k (n) be a fraction of the time of stream k over a period of time n. The average fraction of time at time n, avgTF _k (n), is updated by the IIR filter

avg TF _k (n) = (1-α _TF ) avg TF _k (n-1) + α _TF TF _k (n),

where, as an example, α _TF = 0.5 by default.

- Drop percentage for EF flows:

the drop percentage for each EF stream k, DROP _k (n), is calculated for each period. Its average, avg DROP _k (n), is also obtained by means of IIR filtering:

avg DROP _k (n) = (1-α _DR0P ) avg DROP _k (n-1) + α _DROP DROP _k (n),

where, as an example, α _DROP = 0.5 by default.

- Bandwidth for AF streams:

the throughput for each AF stream, Th _k (n), is calculated over each period. Its average, avg Th _k (n), is also obtained by means of IIR filtering:

avg Th _k (n) = (1-α _Th ) avgTh _k (n-1) + α _Th Th _k (n),

where, as an example, α _Th = 0.5 by default.

- Average DRC requirement for stream:

the average DRC for stream k, DRC _k (n), can be estimated by the ratio of the total requested payload to the total requested time slots. Its smoothed version, avg DRC _k (n), can also be obtained by means of IIR filtering:

avg DRC _k (n) = (1-α _DRC ) avgDRC _k (n-1) + α _DRC DRC _k (n),

where, as an example, α _DRC = 0.5 by default.

This average DRC can be accumulated for all existing users. If a new stream comes from a new user, information about the required DRC may be dialed during the connection setup time, or a shorter update period, such as, for example, 100 slots, may be used. The parameters in each statistical processing, including α _TF , α _Th , α _DROP , α _DRC , can be configured independently.

Decision making processes

Admission control algorithms can prioritize handoff flows and reset threads awakening from an idle state. Admission control algorithms can allow EF and / or AF flows, regardless of sector utilization. Accordingly, there may be some margin in time intervals for these two types of (EF / AF) flows.

FIG. 3 is a flowchart of a method according to one embodiment of a method for controlling access. A stream may arrive at the base station requesting admission (operation 302). Admission control can give the highest priority to the flow admission entering to establish a connection with the BTS, which is either a flow in a handoff or a flow awakening from an idle state. Such flow conditions may provide automatic tolerance or set a high priority for tolerance (operation 304). For a new thread that is not participating in a handoff and is not waking up from an idle state, admission control can then determine QoS, i.e. priority, new thread (operation 306). When a new EF stream arrives, its average requested DRC can be dialed and used to calculate the requirements of the new EF stream in terms of the fraction of time intervals (operation 308). Tolerance management can then add this requirement to the cumulative utilization factor EF (operation 310). A new EF stream may be allowed only if the cumulative required fraction of the time is less than the threshold value. In one embodiment, the recommended threshold may be approximately 30% (operation 312). If the threshold value is exceeded, the flow may not be allowed (operation 314), if lower, the EF stream may be allowed (operation 315). It may be appreciated that the cumulative EF exchange flow may be a mixture of different classes, such as, for example, voice over IP or video conferencing.

The threshold value for the cumulative utilization coefficient EF is generally applicable. The design criterion may be such that the average rejection percentage of all eligible EF flows is less than 1%. Slowly fading, such as, for example, the Pedestrian A model with one antenna (at a speed of 3 km / h), is the worst channel model in terms of packet rejection. In one embodiment, a threshold value can be determined by simulating a scenario where all EF streams have this type of channel at their disposal.

When a new AF stream arrives, its average DRC can be calculated in a similar way as for a new EF stream (operation 316). The total required time fraction for existing AF streams may be the sum of the serviced time fraction of each AF stream, scaled by the ratio of its required speed and actual throughput (operation 318). The required fraction of the time for the new AF stream can then be added to this amount (operation 320). A new AF stream can only be allowed if the aggregate utilization factor QoS (utilization factor EF + utilization factor AF) is not greater than the threshold value, where as an example the recommended threshold value can be approximately 50% (operation 322). If the new AF stream is below the threshold value, it may be allowed (operation 324), and if above the threshold value, the new AF stream may not be allowed (operation 326).

For existing QoS flows, their QoS status should be corrected if the violation of their QoS is severe, despite the priority service. 4 is a flowchart of a method according to one embodiment of the method for terminating existing EF streams.

A threshold value including the cumulative utilization factor EF may be applicable. The design principle may be that the average drop rate of all eligible EF flows is less than 1%. An approach may then be to discard one or more EF streams if certain criteria are not met. In one embodiment, the EF flows are estimated by the percentage of their drop (step 401), and when the EF stream has a smoothed drop frequency, i.e. a drop percentage greater than a threshold value, such as, for example, about 10% in about three consecutive seconds (operation 402), such an EF stream may be terminated (404). The smoothed drop rate can be updated as, for example, approximately every 300 intervals. These criteria may be the same, while six consecutive drop frequencies are higher than 10%. If there are no EF streams satisfying this condition, but there is one or more EF streams with a drop frequency higher than a threshold value, such as, for example, approximately 5% (operation 406), algorithms can search among all EFs -flows and terminate the one with the maximum time utilization, if the utilization is higher than another value, such as, for example, approximately 30% (operation 408), and if no EF-stream is higher than this value, then regarding EF flows cannot be attempted I have no action (operation 410).

5 is a flowchart of a method according to one embodiment of a method for lowering an existing AF stream to BE status. Depending on a variety of factors, the range for any criterion used to lower the AF flux to the BE flux can be large. Admission control estimates AF flows by bandwidth (operation 501) and determines any AF stream that has smoothed bandwidth, which is based on linear estimation over a number of intervals (such as, for example, approximately 300 intervals), which is less than a first threshold value, such as, for example, approximately 50% of the required speed for a duration greater than a period of time. Such a period of time may be, for example, approximately three seconds (operation 502). This criterion can be considered the same as for a bandwidth of less than about 50% of the required speed for six consecutive samples. Admission control may lower such flows that satisfy this first threshold to BE (operation 504). If there is no AF stream satisfying this condition, admission control can determine if there is one or more AF streams whose throughput is lower than the second threshold value, such as, for example, approximately 50% of the required speed and the maximum utilization rate the time of these AF streams is higher than about 50% (operation 506). If one or more AF streams are found to satisfy this second threshold, these AF streams can be lowered to BE (operation 608), and if not, admission control may not take any action (operation 510).

Those of skill in the art would understand that information and signals can be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols and symbols of the pseudo-noise sequence that may be mentioned throughout the description above may be represented by voltages, currents, electromagnetic waves or particles, optical fields or particles, or any combination thereof .

Specialists, in addition, could take into account that various illustrative logical blocks, modules, circuits, and algorithmic steps described in connection with the embodiments disclosed herein may be implemented in the form of electronic hardware, computer software, or a combination of both of them. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above, typically in terms of their functionality. Whether such functionality is implemented in the form of hardware or software depends on the specific application and design constraints imposed on the entire system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

The various illustrative blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or implemented by a general-purpose processor, digital signal processor (DSP), application-specific integrated circuit (ASIC), programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform functions and described in the materials of this application. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a large number of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. The software-implemented module can be located in the memory of RAM (random access memory, RAM), flash memory, ROM memory (read-only memory), EEPROM memory (electrically erasable and programmable ROM), registers, hard disk, removable disk, CD-ROM (ROM on a CD) or any other form of storage medium known in the art. An exemplary storage medium is connected to the processor so that the processor can read information from it and write information to the storage medium. Alternatively, the storage medium may be integrated into the processor. The processor and the storage medium may reside in an ASIC. ASIC may reside in a user terminal. Alternatively, the processor and the storage medium may reside as discrete components in a user terminal.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications with respect to these embodiments will be apparent to those skilled in the art, and the generalized principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention does not intend to be limited by the embodiments shown in the materials of this application, but should be consistent with the widest scope, not contradicting the principles and new features disclosed in the materials of this application.

Claims (12)

1. The device (200) admission control flow for a wireless communication system containing
means (214) for determining available resources in a wireless communication system; means (214) for determining the tolerance of the flow, and
means (214) for planning customization of an existing stream;
moreover, said means for planning the tuning of an existing stream is characterized by the determination of too high use based on priority violations among the streams. 2. The device according to claim 1, additionally containing
means for determining the use of time slots by streams and real-time priority violations for existing streams; and
means for admitting a new flow based on the cumulative use of time intervals. 3. The device according to claim 1, further comprising means for determining a threshold value for allowing a new urgent transfer (EF) stream based on the fraction of time slots used by all EF streams. 4. The device according to claim 1, further comprising means for determining a threshold value for allowing a new guaranteed forwarding (AF) flow based on the use of quality of service. 5. The device according to claim 1, in which the means for planning settings further comprises means for determining the completion of the EF stream. 6. The device according to claim 1, in which the means for planning settings further comprises means for determining the reduction of the AF stream to the stream of best service (BE). 7. A method for controlling the admission of a stream for communication in a wireless communication system, comprising
determining available resources in a wireless communication system;
determination of flow tolerance, and
planning for tuning an existing stream (504; 505), wherein said planning for tuning an existing stream is characterized by determining too high utilization based on priority violations among the streams. 8. The method according to claim 7, further comprising
determination of the use of time intervals by threads and priority violations in real time for existing threads; and
the assumption of a new flow based on the cumulative use of time intervals. 9. The method according to claim 7, further comprising determining a threshold value for allowing a new urgent forwarding (EF) stream based on the fraction of time slots used by all EF streams (308). 10. The method according to claim 7, further comprising determining a threshold value for allowing a new flow of guaranteed forwarding (AF) (316; 318; 320) based on the use of quality of service. 11. The method according to claim 7, in which the configuration planning further comprises determining the completion of the EF stream (402; 406). 12. The method according to claim 7, wherein said tuning planning comprises determining to lower the AF stream to the Best Service Flow (BE) (504; 505).

Images