Nothing Special   »   [go: up one dir, main page]

CN100553359C - In the BWA based on measuring and the acceptance controlling method of QoS - Google Patents

In the BWA based on measuring and the acceptance controlling method of QoS Download PDF

Info

Publication number
CN100553359C
CN100553359C CNB2006101127753A CN200610112775A CN100553359C CN 100553359 C CN100553359 C CN 100553359C CN B2006101127753 A CNB2006101127753 A CN B2006101127753A CN 200610112775 A CN200610112775 A CN 200610112775A CN 100553359 C CN100553359 C CN 100553359C
Authority
CN
China
Prior art keywords
bandwidth
service
msub
mrow
time
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.)
Expired - Fee Related
Application number
CNB2006101127753A
Other languages
Chinese (zh)
Other versions
CN1917708A (en
Inventor
辛艳
粟欣
许希斌
肖立民
赵熠飞
丁国鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tsinghua University
Original Assignee
Tsinghua University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tsinghua University filed Critical Tsinghua University
Priority to CNB2006101127753A priority Critical patent/CN100553359C/en
Publication of CN1917708A publication Critical patent/CN1917708A/en
Application granted granted Critical
Publication of CN100553359C publication Critical patent/CN100553359C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention reside in acceptance controlling method field in the BWA, it is characterized in that judging type of service, the business of doing one's best is allowed to insert; Whether the non-real-time polling service of the non-application of the 1st priority being authorized business and the 3rd priority is judged less than the given bandwidth of system by professional actual bandwidth and system dedicated bandwidth sum; To the real-time polling service of the 2nd priority, screen as described above by professional actual bandwidth earlier, secondly, again by whether being that the GPC pattern is judged, if the GPC pattern is then judged by professional time-delay.The present invention adopts actual bandwidth and the admission control scheme that time-delay combines simultaneously, has improved quality of real-time service, has optimized systematic function.

Description

Admission control method based on measurement and QoS in broadband wireless access system
Technical Field
The invention relates to an algorithm of admission control in a Broadband Wireless Access (BWA) system based on IEEE 802.16, belonging to the technical field of wireless communication.
Background
The IEEE 802.16 standard is an air interface specification of a wireless metropolitan area network, and has very important meaning and wide application prospect in future broadband wireless access. The 802.16 standard not only allows non-line-of-sight connection and supports high-capacity users, but also can provide carrier-grade QoS guarantee and comprehensively support the application of rich multimedia services such as voice, video, data and the like.
An effective QoS guarantee system must reasonably allocate radio resources, and particularly, for a complex environment in a wireless communication environment, the QoS system of a wireless access system faces many challenges. The 802.16 standard implements a series of mechanisms at the MAC layer. Admission control is an important policy in the QoS guarantee architecture of broadband wireless access systems. Through admission control, the system can estimate system resources and service characteristics before formal communication, allow service access on the premise of meeting newly accessed service QoS and not influencing the accessed service QoS, and reject services which do not meet admission conditions.
The IEEE 802.16 system has four services of different service classes, which are respectively non-application granted service (UGS), real-time polling service (rtPS), non-real-time polling service (nrtPS), and best effort service (BE).
The existing admission strategy is a bandwidth-based admission method, and the specific implementation flow is as follows:
given the bandwidth B available to the system, let B be the bandwidth already used by the system when a new service arrivesusedLet the bandwidth required by UGS service be bUGSThe minimum bandwidth required for rtPS and nrtPS services is bminMaximum bandwidth is bmax
If the new service is a UGS service, then if Bused+bUGS< B, allowing UGS service to access system and assigning BUGSIf not, refusing;
if the new service is rtPS service, if Bused+bmax< B, service Access allowed and assignment BmaxIf not, refusing;
if the new service is nrtPS service, then if Bused+bmin< B, service Access allowed and assignment BminIf not, refusing;
access is allowed to BE made to BE traffic, but reserved bandwidth is not allocated.
Since the required bandwidth of rtPS and nrtPS services is (b)min,bmax) And so it is not reasonable to use the maximum or minimum bandwidth at a time to decide whether to admit or not. For example, for rtPS service, if the coming rtPS service does not need the maximum bandwidth, but the access is determined according to the maximum bandwidth, the blocking rate of the rtPS service is large, and the fairness is lost compared with other services.
Meanwhile, for the real-time rtPS service, the existing admission control method only adopts a bandwidth control method, and does not consider parameters such as delay, packet loss rate and the like of the real-time service, so that the service quality of the real-time service cannot be ensured. A good admission algorithm needs to comprehensively consider the service quality parameters such as bandwidth, delay, packet loss rate, etc. to provide QoS guarantee for the communication system.
Disclosure of Invention
The invention aims to provide an admission control algorithm based on measurement and QoS guarantee, which is applied to an IEEE 802.16 broadband wireless access system, can effectively reduce the packet loss rate of real-time services under the condition of not influencing the utilization rate of system bandwidth resources, improves the service quality and obtains better system performance.
The invention is characterized by comprising the following steps in sequence:
step (1), when a new service arrives, the base station of the broadband wireless access system based on IEEE 802.16 judges the type of the new service, the system allows access to best-effort services, and performs priority classification on other services, wherein a non-application granted service is a priority of 1 st, a real-time polling service is a priority of 2 nd, and a non-real-time polling service is a priority of 3 rd, and the processing is performed according to the following steps aiming at different service types;
step (2), for the best-effort service, the base station allows access, and step (6) is switched;
step (3), for non-application grant service, the base station judges whether the given system available bandwidth B is larger than the bandwidth B already used by the systemusedBandwidth required for new service BUGSIf the sum is larger than the available bandwidth given by the system, allowing access, and turning to the step (6), otherwise, rejecting access;
and (4) for the non-real-time polling service, the base station performs the following steps:
step (4.1) of measuring the actual bandwidth b of said trafficm
The method for measuring the time window comprises the following steps:
dividing a time window into 10 sampling periods, and calculating the average used bandwidth of each type of service in each period
Figure C20061011277500051
The sampling time is S, and the value of the estimated bandwidth is updated in the following 4 cases: taking the maximum value when the time window is finished
Figure C20061011277500052
As an estimated bandwidth; updating the estimated bandwidth and restarting the time window when a new flow is accessed; ③ when
Figure C20061011277500053
When the estimated bandwidth is exceeded, to
Figure C20061011277500054
As an estimated bandwidth; fourthly, when a flow leaves, updating the estimated bandwidth and restarting the time window; the update formula of the estimated bandwidth is as follows:
Figure C20061011277500055
wherein, bmIs the updated estimated bandwidth, i.e. the actual measured bandwidth of the traffic;
Figure C20061011277500056
average used bandwidth in S;
rpgenerating a rate for the traffic information;
beta is a bandwidth reduction factor, when a flow leaves the network after finishing leaving, the estimated value of the used bandwidth needs to be reduced, the reduced bandwidth is equal to the equivalent bandwidth of the flow, different values should be determined for beta according to the difference of the flows, and beta can be taken as 1 in order to simplify the algorithm;
step (4.2), judging whether the available bandwidth B of the given system is larger than the used bandwidth of the system and the actual bandwidth B of the servicemIf the system has available bandwidth B ofIf the access is large, the access is allowed, the step (6) is carried out, otherwise, the access is refused;
and (5) for the real-time polling service, the base station performs the following steps:
step (5.1) of measuring the actual bandwidth b of said trafficmThe measuring method is the same as the step (4.1);
step (5.2), judging whether the available bandwidth B of the system is larger than the used bandwidth B of the systemusedThe sum of the actual bandwidth; if the available bandwidth B of the system is large, entering the step (5.3);
otherwise, access is refused;
step (5.3), judge whether the said business is GPC mode, the mode means the base transceiver station distributes and sets up the bandwidth for each connection;
if the mode is GPC mode, judge:
pi<Pino, pi<PiWhen the access is allowed, otherwise the access is refused,
wherein p isiCalculating the packet loss rate of the service i according to the following formula:
<math> <mrow> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> </mfrac> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <msub> <mi>D</mi> <mi>i</mi> </msub> <mo>-</mo> <mi>Ts</mi> <mo>)</mo> </mrow> </mrow> </msup> </mrow> </math>
λithe value is the Poisson parameter of the arrival of the bag and is obtained through measurement;
μia complex exponential distribution parameter that is the service time of the packet, the value being obtained by measurement;
Disetting index parameters for a system for the maximum delay allowed to be tolerated by the service i;
ts is framing time compensation and parameters are set for the system;
Pisetting an index parameter for the system for the maximum packet loss rate set according to the service quality index;
if not, the method comprises the following steps;
step (5.4), executing in GPSS mode, where the base station allocates the set bandwidth for each terminal, and the terminal reallocates the bandwidth among several connections;
the base station determines W2If the number < D is not greater than the preset value,
<math> <mrow> <msub> <mi>W</mi> <mn>2</mn> </msub> <mo>=</mo> <mfrac> <msub> <mi>T</mi> <mn>1</mn> </msub> <mrow> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>1</mn> </msub> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>2</mn> </msub> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>
T1in order to wait for the time vacated by the service station, <math> <mrow> <msub> <mi>T</mi> <mn>1</mn> </msub> <mo>=</mo> <mi>&Sigma;</mi> <mfrac> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mn>2</mn> </mfrac> <mrow> <mo>(</mo> <msubsup> <mi>h</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mo>+</mo> <msubsup> <mi>&sigma;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> λifor the measured poisson parameter, h, of the arrival of the ith priority packetiIs the average value, σ, of packet service time of ith priorityi 2Is the service time variance;
ρ1=λ1h1,ρ2=λ2h2λ, h are as already mentioned above;
d is the maximum time delay allowed by the real-time polling service, and index parameters are set for the system;
W2is the delay of the real-time polling service;
judging if W is the result2If D, the access is allowed, otherwise, the access is refused;
and (6) the base station allocates reserved bandwidth.
The invention introduces a measuring mechanism, can obtain the relevant parameters of the system in real time, and simultaneously adopts an admission control strategy combining bandwidth and time delay, thereby improving the quality of real-time service and optimizing the performance of the broadband wireless access system.
Drawings
FIG. 1 is a QoS guarantee architecture for an IEEE 802.16 system;
FIG. 2 is a flow chart of a prior art admission control algorithm;
FIG. 3 is a flow chart of an admission control algorithm proposed by the present invention;
fig. 4. comparison of blocking rate before and after introduction of the measurement mechanism: fig. 4a is a congestion rate of each service in the existing algorithm, in which a straight line is a non-application granted service congestion rate curve, an asterisk line is a real-time service congestion rate curve, and a dot line is a non-real-time service congestion rate curve; fig. 4b is a service blocking rate of the algorithm after introducing the measurement mechanism, wherein a straight line is a non-application granted service blocking rate curve, an asterisk line is a real-time service blocking rate curve, and a dot line is a non-real-time service blocking rate curve;
fig. 5 shows packet loss ratio comparison of rtPS services before and after introducing delay admission control;
FIG. 6 is a comparison of system resource utilization before and after the present invention is employed.
Detailed Description
In order to solve the technical problem, the invention adopts a two-layer admission control system which introduces a measurement mechanism and is based on bandwidth and time delay, and the two-layer admission control system comprises the following steps:
and for all services, firstly carrying out admission judgment according to the bandwidth, if the sum of the bandwidth already used by the system and the bandwidth of the new service is less than the total bandwidth which can be provided by the system, allowing the service to be accessed, and if not, rejecting the service. In order to ensure real-time performance, the bandwidth of rtPS and nrtPS services is obtained by a measurement method, and bandwidth admission judgment is carried out by measuring the bandwidth.
And (3) for the real-time rtPS service, after the bandwidth judgment in the step (1) is carried out, the delay judgment is carried out. And modeling by using a relevant method of a queuing theory according to the measured parameters of the service flow to obtain the measurement of the delay or the packet loss rate of the rtPS service, and comparing the measurement with the corresponding service quality parameters to judge whether the admission is allowed or not. That is, if the delay or packet loss rate index of the real-time service meets the service quality requirement, the access is allowed, otherwise, the access is refused.
The following further describes embodiments of the present invention.
Fig. 3 is a flow chart of an admission control algorithm of the present invention, which is specifically described as follows:
when a new service arrives, the admission control judgment based on the bandwidth is firstly carried out. Given the bandwidth B available to the system, let B be the bandwidth already used by the system when a new service arrivesusedLet the bandwidth required by UGS service be bUGSThe actual bandwidth of rtPS and nrtPS services measured is bm. The admission control module first determines the traffic type.
If the new service is a UGS service, then if Bused+bUGS< B, allowing UGS service to access system and assigning BUGSIf not, refusing;
if the new service is rtPS service, if Bused+bmIf the result is less than B, starting to perform delay admission judgment, otherwise, rejecting;
if the new service is nrtPS service, then if Bused+bm< B, Access allowed and Allocation BmIf not, refusing;
access is allowed to BE made to BE traffic, but reserved bandwidth is not allocated.
And (3) for the rtPS service entering the delay admission judgment in the step (2), carrying out admission judgment according to a delay admission control algorithm.
The MAC of 802.16 has two modes, one is a gpc (grant Per connection) mode, in which the base station allocates a certain bandwidth to each connection, and the other is a gpss (grant Per Subscriber station) mode, in which the base station allocates a certain bandwidth to each terminal, and the terminal reallocates the bandwidth among several connections.
For the rtPS service entering the delay admission judgment in (2), it is first judged which MAC mode belongs to.
If the mode is GPC mode, a time delay control strategy based on GPC mode is adopted.
The admission judgment conditions are as follows: if p isi<PiThe rtPS service is allowed to be accessed, otherwise, the rtPS service is refused.
Wherein p isiIs the packet loss rate, P, of service iiThe maximum packet loss rate is used as a service quality index and is a fixed parameter.
Packet loss rate p of service iiThe calculation process of (2) is as follows:
and assuming that arrival of service packets obeys Poisson distribution and service time of the packets obeys negative exponential distribution, the cache of the SS end is approximately modeled into an M/M/1 queue.
The Poisson parameter of the arrival of the service packet is measured to be lambdaiNegative exponential distribution parameter is mui
According to the conclusion of the queuing theory, the packet latency W is distributed as:
<math> <mrow> <mi>G</mi> <mrow> <mo>(</mo> <mi>w</mi> <mo>)</mo> </mrow> <mo>=</mo> <mn>1</mn> <mo>-</mo> <mfrac> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> </mfrac> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mi>w</mi> </mrow> </msup> </mrow> </math>
then, the packet loss rate of the service i may be calculated as:
p i = p ( W > ( Di - Ts ) )
= 1 - G ( Di - Ts )
<math> <mrow> <mo>=</mo> <mfrac> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> </mfrac> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mi>Di</mi> <mo>-</mo> <mi>Ts</mi> <mo>)</mo> </mrow> </mrow> </msup> </mrow> </math>
wherein D isiFor the maximum delay that service i can tolerate, Ts is framing time offset.
Packet loss rate p of service iiCan be solved, then according to the judgment expression p of the time delay admissioni<PiAnd judging whether the service is accessed.
If the mode is GPSS mode, a time delay control strategy based on GPC mode is adopted.
The conditions for admission judgment are as follows: if W is2If < D, the access is allowed, otherwise, the access is refused.
Wherein, W2Is rtPS service delay, D is the maximum delay that the service can allow.
W2The calculation process of (2) is as follows:
in the GPSS mode, scheduling at the SS end meets a priority criterion, i.e., in the four classes of service queues at the SS end, a packet with a high priority is sent to a wireless channel first, and a packet with a low priority can be sent only when the high priority queue is empty.
Modeling becomes a priority queue. UGS is the 1 st priority, rtPS is the 2 nd priority, and nrtPS is the 3 rd priority.
Let the measured poisson parameter of the ith-level packet arrive be lambdaiThe average service time is hiVariance is σi 2The total traffic of the system is rho ═ Σ λihiRho < 1, WiIs the latency of the ith level of packets.
According to the priority queuing theory, the time for waiting for the vacation of the service desk is T1Then there is W1=T1/(1-ρ1) And recurrently obtaining the average waiting time of the kth-level packet as follows:
<math> <mrow> <msub> <mi>W</mi> <mi>k</mi> </msub> <mo>=</mo> <msub> <mi>W</mi> <mrow> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>k</mi> <mo>-</mo> <mn>2</mn> </mrow> </munderover> <msub> <mi>&rho;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mo>/</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>k</mi> </munderover> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> </math>
<math> <mrow> <mo>=</mo> <mfrac> <msub> <mi>T</mi> <mn>1</mn> </msub> <mrow> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>k</mi> </munderover> <msub> <mi>&rho;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <munderover> <mi>&Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>k</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <msub> <mi>&rho;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>
thus, the average latency of an rtPS packet is:
<math> <mrow> <msub> <mi>W</mi> <mn>2</mn> </msub> <mo>=</mo> <mfrac> <msub> <mi>T</mi> <mn>1</mn> </msub> <mrow> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>1</mn> </msub> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>2</mn> </msub> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>
wherein, <math> <mrow> <msub> <mi>T</mi> <mn>1</mn> </msub> <mo>=</mo> <mi>&Sigma;</mi> <mfrac> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mn>2</mn> </mfrac> <mrow> <mo>(</mo> <msubsup> <mi>h</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mo>+</mo> <msubsup> <mi>&sigma;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> ρi=λihi
the delay admission judgment expression in the GPSS mode is
W2<D
Then r in GPSS mode can be obtainedtime delay of tPS service, then according to time delay admission expression W2If the judgment result is less than D, the access is carried out if the condition is met, otherwise, the access is rejected.
In order to compare the effects before and after the implementation of the invention, Matlab is used for simulating the algorithm of the invention, and B is 2000kbps and B is adopted as simulation parametersUGS=32kbps,bmin=32kbps,bmaxThe poisson parameters of the three traffic flows are the same at 32kbps, the sum lambda of the poisson parameters ranges from 1 to 10, and the service time distribution parameters of the three traffic flows are all 3.05. Assuming that the actually measured rtPS and nrtPS traffic bandwidths are uniformly distributed over (32, 128) kbps, the actually measured traffic delay is positively correlated with the size of λ and follows an exponential distribution.
Fig. 4 shows the comparison of the blocking rates of the services before and after the measurement mechanism is introduced, and it can be seen that in the original admission strategy, since the rtPS service adopts the maximum bandwidth to determine whether to admit, the blocking rate of the rtPS service is greater than the blocking rates of other services, and after the measurement mechanism is introduced, the blocking rate of the rtPS service is balanced with other services. The audio and video service corresponding to rtPS occupies an important position in a future wireless access network, so that the fairness of the service can be effectively improved by introducing a measurement mechanism.
Fig. 5 shows the comparison of the packet loss rates of the rtPS services before and after the delay admission is adopted, and after the admission control strategy based on the delay is introduced for the rtPS service, it can be seen that the packet loss rate of the real-time service is obviously reduced, and the packet loss rate is kept stable with the increase of the system load. Meanwhile, due to the limitation of delay control, the blocking rate of rtPS service may increase.
Fig. 6 is a comparison of system bandwidth resource utilization before and after the present invention is employed. Because the admission strategy integrating bandwidth and delay control can effectively reduce the packet loss rate of the real-time service, ensure the QoS of the service, and increase the blocking rate of the real-time service to a certain extent, and the introduced measurement mechanism can reduce the blocking rate of the real-time service, the resource utilization rate of the system of the original admission algorithm in the 802.16 system and the new algorithm provided by the invention is compared. The use of which can be seen in fig. 6
The resource utilization rate of the system after the algorithm of the invention is not changed greatly, and is basically equal to the original system resource utilization rate, but the service quality of real-time rtPS service is obviously improved, thereby improving the performance of the system.

Claims (2)

1. An admission control method based on measurement and QoS in a broadband wireless access system is characterized by comprising the following steps in sequence:
step (1), when a new service arrives, the base station of the broadband wireless access system based on IEEE 802.16 judges the type of the new service, the system allows access to best-effort services, and performs priority classification on other services, wherein a non-application granted service is a priority of 1 st, a real-time polling service is a priority of 2 nd, and a non-real-time polling service is a priority of 3 rd, and the processing is performed according to the following steps aiming at different service types;
step (2), for the best-effort service, the base station allows access, and step (6) is switched;
step (3), for non-application grant service, the base station judges whether the given system available bandwidth B is larger than the bandwidth B already used by the systemusedBandwidth required for new service BUGSIf the sum is larger than the available bandwidth given by the system, allowing access, and turning to the step (6), otherwise, rejecting access;
and (4) for the non-real-time polling service, the base station performs the following steps:
step (4.1) of measuring the actual bandwidth b of said trafficm
The method for measuring the time window comprises the following steps:
dividing a time window into 10 sampling periods, and calculating the average used bandwidth of each type of service in each period
Figure C2006101127750002C1
The sampling time is S, and the value of the estimated bandwidth is updated in the following 4 cases: taking the maximum value when the time window is finished
Figure C2006101127750002C2
As an estimated bandwidth; updating the estimated bandwidth and restarting the time window when a new flow is accessed; ③ when
Figure C2006101127750002C3
When the estimated bandwidth is exceeded, to
Figure C2006101127750002C4
As an estimated bandwidth; fourthly, when a flow leaves, updating the estimated bandwidth and restarting the time window; the update formula of the estimated bandwidth is as follows:
Figure C2006101127750002C5
wherein, bmFor updated estimationMeasuring the bandwidth, namely the actual measurement bandwidth of the service;
Figure C2006101127750002C6
average used bandwidth in S;
rpgenerating a rate for the traffic information;
beta is a bandwidth reduction factor, when a flow leaves the network after finishing leaving, the estimation value of the used bandwidth needs to be reduced, the reduced bandwidth is equal to the equivalent bandwidth of the flow, and different values are determined for beta according to the difference of the flow;
step (4.2), judging whether the available bandwidth B of the given system is larger than the used bandwidth of the system and the actual bandwidth B of the servicemIf the available bandwidth B of the system is large, the access is allowed, and the step (6) is carried out, otherwise, the access is refused;
and (5) for the real-time polling service, the base station performs the following steps:
step (5.1) of measuring the actual bandwidth b of said trafficmThe measuring method is the same as the step (4.1);
step (5.2), judging whether the available bandwidth B of the system is larger than the used bandwidth B of the systemusedThe sum of the actual bandwidth; if the available bandwidth B of the system is large, entering the step (5.3);
otherwise, access is refused;
step (5.3), judge whether the said business is GPC mode, the mode means the base transceiver station distributes and sets up the bandwidth for each connection;
if the mode is GPC mode, judge:
pi<Pino, pi<PiWhen the access is allowed, otherwise the access is refused,
wherein p isiCalculating the packet loss rate of the service i according to the following formula:
<math> <mrow> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>=</mo> <mfrac> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> </mfrac> <msup> <mi>e</mi> <mrow> <mo>-</mo> <mrow> <mo>(</mo> <msub> <mi>&mu;</mi> <mi>i</mi> </msub> <mo>-</mo> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mo>)</mo> </mrow> <mrow> <mo>(</mo> <msub> <mi>D</mi> <mi>i</mi> </msub> <mo>-</mo> <mi>Ts</mi> <mo>)</mo> </mrow> </mrow> </msup> </mrow> </math>
λithe value is the Poisson parameter of the arrival of the bag and is obtained through measurement;
μia complex exponential distribution parameter that is the service time of the packet, the value being obtained by measurement;
Disetting index parameters for a system for the maximum delay allowed to be tolerated by the service i;
ts is framing time compensation and parameters are set for the system;
Pisetting an index parameter for the system for the maximum packet loss rate set according to the service quality index;
if not, the method comprises the following steps;
step (5.4), executing in GPSS mode, where the base station allocates the set bandwidth for each terminal, and the terminal reallocates the bandwidth among several connections;
the base station determines W2If the number < D is not greater than the preset value,
<math> <mrow> <msub> <mi>W</mi> <mn>2</mn> </msub> <mo>=</mo> <mfrac> <msub> <mi>T</mi> <mn>1</mn> </msub> <mrow> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>1</mn> </msub> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>2</mn> </msub> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msub> <mi>&rho;</mi> <mn>1</mn> </msub> <mo>)</mo> </mrow> </mrow> </mfrac> </mrow> </math>
T1in order to wait for the time vacated by the service station, <math> <mrow> <msub> <mi>T</mi> <mn>1</mn> </msub> <mo>=</mo> <mi>&Sigma;</mi> <mfrac> <msub> <mi>&lambda;</mi> <mi>i</mi> </msub> <mn>2</mn> </mfrac> <mrow> <mo>(</mo> <msubsup> <mi>h</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mo>+</mo> <msubsup> <mi>&sigma;</mi> <mi>i</mi> <mn>2</mn> </msubsup> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> λifor the measured poisson parameter, h, of the arrival of the ith priority packetiIs the average value, σ, of packet service time of ith priorityi 2Is the service time variance;
ρ1=λ1h1,ρ2=λ2h2λ, h are as already mentioned above;
d is the maximum time delay allowed by the real-time polling service, and index parameters are set for the system;
W2is the delay of the real-time polling service;
judging if W is the result2If D, the access is allowed, otherwise, the access is refused;
and (6) the base station allocates reserved bandwidth.
2. The admission control method based on measurement and QoS in a broadband wireless access system according to claim 1, wherein β -1.
CNB2006101127753A 2006-09-01 2006-09-01 In the BWA based on measuring and the acceptance controlling method of QoS Expired - Fee Related CN100553359C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2006101127753A CN100553359C (en) 2006-09-01 2006-09-01 In the BWA based on measuring and the acceptance controlling method of QoS

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2006101127753A CN100553359C (en) 2006-09-01 2006-09-01 In the BWA based on measuring and the acceptance controlling method of QoS

Publications (2)

Publication Number Publication Date
CN1917708A CN1917708A (en) 2007-02-21
CN100553359C true CN100553359C (en) 2009-10-21

Family

ID=37738566

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2006101127753A Expired - Fee Related CN100553359C (en) 2006-09-01 2006-09-01 In the BWA based on measuring and the acceptance controlling method of QoS

Country Status (1)

Country Link
CN (1) CN100553359C (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2452697A (en) 2007-08-14 2009-03-18 Nec Corp Dynamically allocating new resources to a node provided with persistently allocated resources
CN101420366B (en) * 2007-10-23 2011-04-20 中兴通讯股份有限公司 Device and method for guaranteeing quality of real-time service in wideband wireless access system
KR101021059B1 (en) * 2007-11-07 2011-03-15 삼성전자주식회사 Apparatus and method for connection admission control in broadband wireless access system
CN101286946B (en) * 2008-05-30 2010-08-11 北京北方烽火科技有限公司 Method of service flow access control and bandwidth allocation based on OFDM system
CN101369980B (en) * 2008-09-26 2010-08-11 北京航空航天大学 Band width estimation method based on self-adapting sampling
CN101369976B (en) * 2008-09-27 2011-05-04 上海华为技术有限公司 Multi-service quality graded access control method, apparatus and system
CN101965032B (en) * 2009-07-22 2013-03-20 中兴通讯股份有限公司 Access control method and device
CN101888672B (en) * 2010-06-30 2015-08-19 中兴通讯股份有限公司 A kind of QoS service cut-in method and device
CN102572872B (en) * 2011-11-17 2014-07-30 清华大学 Admission control method based on Kalman filter

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IEEE Standard 802.16:A Technical Overview of theWirelessMAN Air Interface for Broadband Wireless Access. Carl Eklund etc.IEEE 802.16 Broadband Wireless Access Working Group. 2002
IEEE Standard 802.16:A Technical Overview of theWirelessMAN Air Interface for Broadband Wireless Access. Carl Eklund etc.IEEE 802.16 Broadband Wireless Access Working Group. 2002 *

Also Published As

Publication number Publication date
CN1917708A (en) 2007-02-21

Similar Documents

Publication Publication Date Title
CN100553359C (en) In the BWA based on measuring and the acceptance controlling method of QoS
CN101621457B (en) Multi-service scheduling method and system
CN101111070B (en) Fairness resource scheduling method based on resource scheduling in broadband wireless access system
US9001763B2 (en) Wireless service access method and apparatus
WO2009074095A1 (en) A method, system and apparatus for adjusting users&#39; quality of service
JP4988743B2 (en) Improved dimensioning method for HSDPA traffic
Tang et al. An adaptive bandwidth allocation scheme with preemptive priority for integrated voice/data mobile networks
CN106604284A (en) Method and device for allocating heterogeneous network resources
CN107197530B (en) Downlink resource allocation algorithm for channel fluctuation perception in LTE system
JP4545662B2 (en) Wireless LAN base station control method and base station
CN107659940B (en) Multi-priority multi-channel media access control method based on channel perception
CN102711183A (en) Method and device for controlling packet sending rate of user
US9215621B2 (en) Air-time fair transmission regulation without explicit traffic specifications for wireless networks
CN101848494B (en) Dispatching method of real-time business and device thereof
Peng et al. Adaptive scheduling strategy for WiMAX real-time communication
Esmailpour et al. Packet scheduling scheme with quality of service support for mobile WiMAX networks
Esmailpour et al. A novel scheme for packet scheduling and bandwidth allocation in WiMAX networks
Sheu et al. A preemptive channel allocation scheme for multimedia traffic in mobile wireless networks
Yu et al. Distributed resource reservation mechanism for IEEE 802.11 e-based networks
Wang et al. A priority-based weighted fair queueing algorithm in wireless sensor network
Ma et al. A three-tier framework and scheduling to support QoS service in WiMAX
Liang et al. A Research on HCCA Mechanism of Wireless LAN Access
Kumar et al. DBAM: Novel User Based Bandwidth Allocation Mechanism in WiMAX
Kadoch et al. Courteous algorithm: performance optimization in WiMAX networks
Ruscelli et al. A Scheduling Algorithm for Providing QoS Guarantees in 802.11 e WLANs

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20091021

Termination date: 20150901

EXPY Termination of patent right or utility model