CN101035139A - Service quality guarantee method for broadband radio access network media accessing control layer - Google Patents

Service quality guarantee method for broadband radio access network media accessing control layer Download PDF

Info

Publication number
CN101035139A
CN101035139A CNA2007100632980A CN200710063298A CN101035139A CN 101035139 A CN101035139 A CN 101035139A CN A2007100632980 A CNA2007100632980 A CN A2007100632980A CN 200710063298 A CN200710063298 A CN 200710063298A CN 101035139 A CN101035139 A CN 101035139A
Authority
CN
China
Prior art keywords
service
bandwidth
sigma
connects
class
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.)
Granted
Application number
CNA2007100632980A
Other languages
Chinese (zh)
Other versions
CN100583901C (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 CN200710063298A priority Critical patent/CN100583901C/en
Publication of CN101035139A publication Critical patent/CN101035139A/en
Application granted granted Critical
Publication of CN100583901C publication Critical patent/CN100583901C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

This invention belongs to a classification of service quality Broad Band wireless access network technology, its characteristics is that the service is divided into five categories and increase of variable-length packet, variable bit rate, real-time services fluctuations gentle flow; The sub-stations and base stations are made a detailed functional breakdown, the business services is established by admission control module to accept or reject IP layers; reading bandwidth allocation module with a wide range of services requested bandwidth connections with the quality of service parameters and distribution system available bandwidth, different sub-stations authorized obtained the total bandwidth; using uplink and downlink scheduling of the total bandwidth in accordance with its mandate and the necessary bandwidth, by service Priority service connecting the various dispatching through lower physical layer interface to send the media access control layer of data and control information. Not only satisfy a wide range of services connecting service quality requirements, but also take into account the unexpected increase in the data, increased fairness between sub-station and inter-connecting different priority-class service.

Description

Service quality guarantee method for broadband radio access network media accessing control layer
Technical field
The invention belongs to service quality graded broadband radio access network field.
Background technology
Nowadays broadband wireless access becomes the important way of high-speed Internet connection, integrated data, voice and video transmission.Wireless access wide band technology based on IEEE 802.16 standards has transmission rate height and the advantage of guaranteeing service quality (QoS), is the good selection of last mile access in the metropolitan area network scope.Meanwhile, broadband radio multi-media group adopts the CoMAC technology to broadcast and carries out warm with communication system at media access control layer (MAC) for realizing China's independent intellectual property right.Although defined the signaling mechanism of media access control layer in two standards, guarantee that for whole system service quality the RRM and the scheduling that play an important role are open studying a question.
Service quality guarantee method for broadband radio access network media accessing control layer proposed by the invention adopts advantages of simplicity and high efficiency to admit control, allocated bandwidth at all kinds of service classifications and goes up (descending) row dispatching method, be easy to software and hardware and realize, can be applicable to service quality graded broadband radio access network such as IEEE 802.16 systems etc.
Summary of the invention
The present invention proposes a kind of service quality guarantee method for broadband radio access network media accessing control layer, purpose is the blank of RRM and scheduling in the broadband radio access network standard of filling up service quality graded, solves the problem that this type systematic media access control layer service quality guarantees.
The present invention's consideration comprises base station system and substation system two large divisions based on putting multiple spot (PMP) topological structure and the Mesh topological structure that center control nodes is arranged, wherein:
Base station system comprises: high-level interface, COS decision device, descending service connect sets up module, admits control module, descending service connects the formation buffer, service link information database, descending service connects bandwidth request module, bandwidth allocation module, up-downgoing mapping generator, downlink scheduler, and following layer interface, wherein:
High-level interface receives data, Business Name and QoS parameter that the IP layer is sent, or sends the MAC layer data to the IP layer;
The COS decision device, which class service judges according to Business Name and QoS parameter is;
Descending service connects sets up module, for descending all kinds of services connect the request of foundation, consulting service quality parameter to admitting control module to send;
Admit control module, receive the connection foundation request that all kinds of services of up-downgoing send, accepting or refuse this service in conjunction with the situation of QoS parameter and system available bandwidth is connected foundation and asks, received connection is assigned with a connection identifier (CID, and the information that will connect is recorded in the service link information database;
Descending service connects the formation buffer, and descending service connects with the corresponding formation of connection identifier (CID, and data are carried out buffer memory;
Service link information database, the information that each service of storage update up-downgoing connects comprises sub-station number, connection identifier (CID, COS, QoS parameter, the bandwidth of former frame and the request of this frame;
Descending service connects the bandwidth request module, when each mac frame begins, measures each descending service and connects queue size (byte number), and be recorded in the service link information database;
Bandwidth allocation module reads the bandwidth of all kinds of service connection requests of up-downgoing from service link information database, carry out allocated bandwidth in conjunction with the situation of QoS parameter and system's available bandwidth, and draw the total bandwidth that authorize different substations;
Up-downgoing mapping generator, according to the required total bandwidth in different substations in the bandwidth allocation module, the time slot in conjunction with in the physical layer parameter distribution mac frame generates the up-downgoing mapping;
Downlink scheduler connects the coordination data sending order for each service of each substation the bandwidth reasonable distribution of authorizing in the descending mapping;
Following layer interface sends MAC layer data and control information to physical layer, or receives the data that physics is sent layer by layer;
Substation system comprises: high-level interface, and the COS decision device, up service connects sets up module, up service connects the formation buffer, up service link information database, and up service connects the bandwidth request module, uplink scheduling device, and following layer interface, wherein:
High-level interface receives data, Business Name and QoS parameter that the IP layer is sent, or sends the MAC layer data to the IP layer;
The COS decision device, which class service judges according to Business Name and QoS parameter is;
Up service connects sets up module, connects the request of foundation, consulting service quality parameter for up all kinds of services send;
Up service connects the formation buffer, and up service connects with the corresponding formation of connection identifier (CID, and data are carried out buffer memory;
Up service link information database, the information that up each service of storage update connects comprises connection identifier (CID, COS, QoS parameter, the bandwidth of former frame and the request of this frame;
Up service connects the bandwidth request module, when each mac frame begins, measures each up service and connects queue size (byte number), is recorded in the up service link information database, and sends bandwidth request in a different manner;
The uplink scheduling device connects the coordination data sending order with the bandwidth reasonable distribution of authorizing in the up mapping to each service;
Following layer interface sends MAC layer data and control information to physical layer, or receives the data that physics is sent layer by layer.
The present invention is divided into five kinds of COS with the Various types of data business, and sorting technique is as follows:
The 1st class service: the real-time service flow of fixed length grouping, fixed bit rate (CBR), as T1/E1, there are not the business such as VoIP of silence compression.QoS parameter is the maximum speed that continues, minimum reserved rate, maximum latency, tolerance shake.Minimum reserved rate and the maximum speed that continues equate.
The 2nd class service: variable-length packets, variable bit rate (VBR) be service flow in real time, and its transmission rate fluctuates up and down gently in Mean Speed, as the business such as video flowing after the smoothing processing.QoS parameter is maximum speed, minimum reserved rate, the maximum latency of continuing.
The 3rd class service: variable-length packets, variable bit rate real-time service flow, its transmission rate fluctuates up and down acutely in Mean Speed, as game on line, the business such as VoIP of silence compression are arranged.QoS parameter is maximum speed, minimum reserved rate, the maximum latency of continuing.
The 4th class service: the non real-time service flow of variable-length packets, variable bit rate, as business such as FTP.QoS parameter is maximum speed, minimum reserved rate, the transmission priority of continuing.
The 5th class service: have the non real-time service flow of self-similarity nature, as business such as Web online.QoS parameter is maximum speed, the transmission priority of continuing.
The present invention includes and admit control, allocated bandwidth and go up three methods of (descending) row scheduling.In order clearly to be described, we introduce following symbol:
N: substation number;
B: overall system bandwidth (byte number);
B a: system's available bandwidth (byte number);
Ni n: total linking number of existing n substation i class service in the system, n ∈ N, i ∈ 1,2,3,4,5};
Bi Nj Max: n substation i class served j maximum required bandwidth (byte number) that connects, and be corresponding with the lasting speed of maximum, n ∈ N, i ∈ 1,2,3,4,5}, j ∈ Ni n
Bi Nj Min: n substation i class served j minimum required bandwidth (byte number) that connects, and be corresponding with minimum reserved rate, n ∈ N, i ∈ 1,2,3,4}, j ∈ Ni n
α Nj: n substation COS 2 j the average required bandwidth factors that connect, α Nj∈ (0,1), n ∈ N, j ∈ N2 n
Annotate: base stations control α Nj, make the bandwidth of the request of carrying be not less than zero.
β i Nj: n substation i class served j transmission priority that connects, β i Nj∈ 0,1,2,3,4,5,6, and 7}, n ∈ N, i ∈ 4,5}, j ∈ Ni n, β i NjBe worth greatly more, transmission priority is high more;
ACF: admit control identifier, ACF ∈ 0,1};
BRi Nj: n substation i class served the bandwidth (byte number) of j connection request, n ∈ N, i ∈ 2,3,4,5}, j ∈ Ni n
BGi Nj: n substation i class served j and connected the bandwidth (byte number) that is authorized to, n ∈ N, i ∈ 1,2,3,4}, j ∈ Ni n
EXi Nj: n substation i class served j and connected the bandwidth (byte number) that exceeds QoS parameter, n ∈ N, i ∈ 2,3,4,5}, j ∈ Ni n
BG: the total bandwidth that system has been authorized (byte number);
EX: the total bandwidth (byte number) that exceeds QoS parameter;
BG n: n the total bandwidth (byte number) that has authorized the substation;
BR n: n the needed total bandwidth in substation (byte number);
BL n: n the last bandwidth in substation (byte number);
BAi Nj: n substation i class served j and connected the bandwidth (byte number) that is assigned with, n ∈ N, i ∈ 1,2,3,4,5}, j ∈ Ni n
The invention provides and a kind ofly guarantee the acceptance controlling method of all kinds of service Connection Service quality based on five classes services classification, this method comprises the steps:
(a1) receive the connection foundation request that all kinds of services of up-downgoing send;
(a2) situation about connecting according to existing all kinds of services in the system calculates system's available bandwidth
B a = B - Σ n ∈ N ( Σ i ∈ { 1 , 2,3 } Σ j ∈ Ni n Bi nj max + Σ i ∈ { 4 } Σ j ∈ Ni n Bi nj min ) ;
(a3) accept or refuse this service according to the situation of COS, QoS parameter and system available bandwidth and is connected the request of foundation, as if acceptance, execution in step (a4), otherwise execution in step (a5);
(a4) be that the service of accepting connects connection identifier (CID of distribution, its information be recorded in service link information database, and feed back this service connection and set up successfully;
(a5) feed back this service and connect the foundation failure.
Further, the present invention also has following characteristics, and described step (a3) can be further divided into following steps:
(a31) type of this service is judged, if the 1st, 2,3 class services, execution in step (a32); If the 4th class service, execution in step (a33), if the 5th class service, execution in step (a34);
(a32) maximum that connects by this service continues speedometer and calculates maximum required bandwidth, and compares with the system available bandwidth, if be not more than, then accepts execution in step (a4), otherwise execution in step (a5);
(a33) the minimum reserved rate that connects by this service calculates minimum required bandwidth, and compares with the system available bandwidth, if be not more than, then accepts execution in step (a4), otherwise execution in step (a5);
(a34) if system's available bandwidth greater than zero, is then accepted execution in step (a4), otherwise execution in step (a5).
The invention provides and a kind ofly guarantee the bandwidth allocation methods of all kinds of service Connection Service quality based on five classes services classification, this method comprises the steps:
(b1) from service link information database, read the information that all kinds of services of up-downgoing connect, comprise sub-station number, COS, the bandwidth of QoS parameter and the request of this frame, and carry out different operations according to COS;
(b2) calculate the total bandwidth that system has been authorized BG = Σ n ∈ N Σ i ∈ { 1,2,3,4 } Σ j ∈ Ni n BGi nj , The total bandwidth that exceeds QoS parameter EX = Σ n ∈ N Σ i ∈ { 1,2,3,4 } Σ j ∈ Ni n EXi nj , Both sums and overall system bandwidth are compared, if be not more than execution in step (b3), otherwise execution in step (b4);
(b3) the allocated bandwidth situation of all service connections of comprehensive n substation calculates the total bandwidth that has authorized this substation
BG n = Σ i ∈ { 1,2,3,4 } Σ j ∈ Ni n BGi nj + Σ i ∈ { 2,3,4,5 } Σ j ∈ Ni n EXi nj ;
(b4) ratio that exceeds the QoS parameter total bandwidth according to the total available bandwidth of system and system by following formula is revised the total bandwidth that exceeds QoS parameter in n the substation that step (b3) obtains, and obtains revised n the total bandwidth BG that has authorized the substation nFor:
BG n = Σ i ∈ { 12,3,4 } Σ j ∈ Ni n BGi nj + B - Σ n ∈ N Σ i ∈ { 1,2,3,4 } Σ j ∈ Ni n BGi nj Σ n ∈ N Σ i ∈ { 2,3,4,5 } Σ j ∈ Ni n EXi nj · Σ i { 2,3,4,5 } Σ j ∈ Ni n EXi nj .
Further, the present invention also has following characteristics, and described step (b1) can be further divided into following steps:
(b11) read the COS that a service connects, if the 1st class service, execution in step (b12); If the 2nd class service, execution in step (b13); If the 3rd class service, execution in step (b14); If the 4th class service, execution in step (b15), if the 5th class service, execution in step (b16);
(b12) the lasting speedometer of maximum that connects by this service is calculated maximum required bandwidth, and the base station licenses to the bandwidth that this service connects BG 1 nj = B 1 nj max , Need carry out allocated bandwidth if still have service to connect, execution in step (b1) then, otherwise execution in step (b2);
(b13) lasting speed of maximum and the minimum reserved rate that connects by this service calculates maximum required bandwidth and minimum required bandwidth, the bandwidth B R2 of request NjBe that n substation the 2nd class of this frame served j byte number and the average required bandwidth of part that connects formation
Figure A20071006329800146
Difference, if: 0 < BR 2 nj &le; B 2 nj max - &alpha; nj 2 ( B 2 nj max + B 2 nj min ) , The base station licenses to the bandwidth that this service connects BG 2 nj = BR 2 nj + &alpha; nj 2 ( B 2 nj max + B 2 nj min ) , Otherwise BG 2 nj = B 2 nj max , The bandwidth that exceeds QoS parameter EX 2 nj = BR 2 nj + &alpha; nj 2 ( B 2 nj max + B 2 nj min ) - B 2 nj max , Need carry out allocated bandwidth if still have service to connect, execution in step (b1) then, otherwise execution in step (b2);
(b14) the lasting speedometer of maximum that connects by this service is calculated maximum required bandwidth, the bandwidth B R3 of request NjBe that n substation the 3rd class of this frame served j byte number that connects formation, if: 0 < BR 3 nj &le; B 3 nj max , The base station licenses to the bandwidth B G3 that this service connects Nj=BR3 Nj, otherwise BG 3 nj = B 3 nj max , The bandwidth that exceeds QoS parameter EX 3 nj = BR 3 nj - B 3 nj max , Need carry out allocated bandwidth if still have service to connect, execution in step (b1) then, otherwise execution in step (b2);
(b15) the minimum reserved rate that connects by this service calculates minimum required bandwidth, the bandwidth B R4 of request NjBe that n substation the 4th class of this frame served j byte number that connects formation, if: 0 < BR 4 nj &le; B 4 nj min , The base station licenses to the bandwidth B G4 that this service connects Nj=BR4 Nj, otherwise BG 4 nj = B 4 nj min , The bandwidth that exceeds QoS parameter EX 4 nj = BR 4 nj - B 4 nj min , Need carry out allocated bandwidth if still have service to connect, execution in step (b1) then, otherwise execution in step (b2);
(b16) Qing Qiu bandwidth B R5 NjBe that n substation the 5th class of this frame served j byte number that connects formation, if: BR5 Nj>0, then think the bandwidth EX5 that exceeds QoS parameter Nj=BR5 Nj, need carry out allocated bandwidth if still have service to connect, execution in step (b1) then, otherwise execution in step (b2).
The invention provides and a kind ofly go up (descend) capable dispatching method based on what five classes services classification guaranteed all kinds of service Connection Service quality, this method comprises the steps:
(c1) from the mapping of last (descending) row, obtain the total bandwidth that has authorized n substation;
(c2) on up direction, from up service link information database, read the information that up all kinds of service connects, comprise COS, the bandwidth of QoS parameter and former frame request; On down direction, from service link information database, read the information that descending all kinds of service connects, comprise sub-station number, COS, the bandwidth of QoS parameter and former frame request; What specify is that the number that up all kinds of services connect the former frame bandwidth on demand in the service link information database is no more than the number of up all kinds of services connection former frame bandwidth on demand in the up service link information database;
(c3) calculate n the needed total bandwidth in substation
BR n = &Sigma; j &Element; N 1 n B 1 nj max + &Sigma; j &Element; N 2 n &alpha; nj 2 ( B 2 nj max + B 2 nj min ) + &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n BRi nj , The total bandwidth of having authorized with this substation compares, if be not more than execution in step (c4), otherwise execution in step (c5);
(c4) when the total bandwidth of having authorized is sufficient, dispatch according to the COS that each service connects;
(c5) when the total bandwidth of having authorized is not enough, dispatch according to the COS that each service connects;
(c6) will go up all kinds of services connections of (descending) row and go up the transmission of (descending) line data with the bandwidth of distributing according to the good order of scheduling.
Further, the present invention also has following characteristics, and described step (c4) can be further divided into following steps:
(c41) all kinds of services are connected according to the service priority ordering, service priority reduces along with the increase of COS numbering;
(c42) the 1st class is served each service and connect according to the ascending ordering of numbering, each service connects the bandwidth that is assigned with
BA 1 nj = B 1 nj max ;
Annotate: the numbering size is relevant with the order that the service connection arrives buffer, and it is little to arrive first label, and the back to numbering greatly.
(c43) the 2nd class is served each service and connect according to the ascending ordering of numbering, each service connects the bandwidth that is assigned with
BA 2 nj = BR 2 nj + &alpha; nj 2 ( B 2 nj max + B 2 nj min ) ,
(c44) the 3rd class is served each service and connect according to the ascending ordering of numbering, each service connects the bandwidth B A3 that is assigned with Nj=BR3 Nj
(c45) the 4th, 5 classes are served each service and connect according to the transmission priority ordering, each service connects the bandwidth B Ai that is assigned with Nj=BRi Nj, i ∈ 4,5}.
Further, the present invention also has following characteristics, and described step (c5) can be further divided into following steps:
(c51) all kinds of services connections are sorted according to service priority, service priority reduces along with the increase of COS numbering, calculates the bandwidth that all kinds of services connect the bandwidth of having authorized and exceed QoS parameter according to the method described in the step (b12) to (b16);
(c52) the 1st class is served each service and connect according to the ascending ordering of numbering, each service connects the bandwidth B A1 that is assigned with Nj=BG1 Nj
(c53) the 2nd class is served each service and connect according to the ascending ordering of numbering, if do not exceed the bandwidth of QoS parameter, then each service connects the bandwidth B A2 that is assigned with Nj=BG2 Nj, otherwise each service connects the bandwidth that is assigned with
BA 2 nj = B 2 nj max + BG n - &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj &Sigma; i &Element; { 2,3,4 , 5 } &Sigma; j &Element; Ni n EXi nj &CenterDot; EX 2 nj ;
(c54) the 3rd class is served each service and connect according to the ascending ordering of numbering, if do not exceed the bandwidth of QoS parameter, then each service connects the bandwidth B A3 that is assigned with Nj=BG3 NjOtherwise each service connects the bandwidth that is assigned with
BA 3 nj = B 3 nj max + BG n - &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj &Sigma; i &Element; { 2,3,4 , 5 } &Sigma; j &Element; Ni n EXi nj &CenterDot; EX 3 nj ;
(c55) the 4th class is served each service and connect, calculate n the last bandwidth in substation according to the transmission priority ordering BL n = BG n - &Sigma; i &Element; { 1,2,3 } &Sigma; j &Element; Ni n BAi nj , Be connected and authorize the bandwidth sum with each service
Figure A20071006329800172
Compare, if be not less than execution in step (c56), otherwise execution in step (c57);
(c56) if do not exceed the bandwidth of QoS parameter, then each service connects the bandwidth B A4 that is assigned with Nj=BG4 Nj, otherwise each service connects the bandwidth that is assigned with BA 4 nj = B 4 nj min + BL n &Sigma; i &Element; { 4,5 } &Sigma; j &Element; Ni n EXi nj &CenterDot; EX 4 nj , Next execution in step (c58);
(c57) each service with same transmission priority connects according to the ascending ordering of numbering, connect from the service of the little numbering of high-transmission priority to begin to distribute bandwidth, if do not exceed the bandwidth of QoS parameter, and the bandwidth B A4 that then should service connection be assigned with Nj=BG4 Nj, otherwise this service connects the bandwidth that is assigned with BA 4 nj = B 4 nj min , Calculate new last bandwidth B L n'=BL n-BA4 Nj, if less than zero, then this service connects the bandwidth B A4 that is assigned with Nj=BL n'+BA4 Nj, finish to distribute, otherwise, BL n=BL n', continue execution in step (c57);
(c58) the 5th class is served each service and connect, calculate n the last bandwidth in substation according to the transmission priority ordering
BL n = BL n - &Sigma; j &Element; Ni n BA 4 nj ;
(c59) each service with same transmission priority connects according to the ascending ordering of numbering, connect from the service of the little numbering of high-transmission priority to begin to distribute bandwidth, if the bandwidth that exceeds QoS parameter is arranged, and the bandwidth that then should service connection be assigned with BA 5 nj = ( &beta; 5 nj + 1 ) 8 &CenterDot; EX 5 nj , Calculate new last bandwidth B L n'=BL n-BA5 Nj, if less than zero, then this service connects the bandwidth B A5 that is assigned with Nj=BL n'+BA5 Nj, finish to distribute, otherwise, BL n=BL n', continue execution in step (c59).
Compare with prior art, the present invention has the following advantages:
The present invention has been divided into five kinds of COS with multiple business according to its characteristic, and wherein the 2nd class service is a kind of new service classification;
The present invention has carried out careful division with the functional module of base station system and substation system, and admittance control, allocated bandwidth is provided and has gone up elaborating of (descending) row dispatching method step, is easy to software and hardware and realizes.By emulation as can be seen, above method not only satisfies the quality of service requirement that all kinds of services connect, and has considered the total throughout of substation, has taken into account the problem that data burst increases, and has improved the fairness that reaches between the substation between different priorities service connection.
Below being the emulation explanation to method, is example with IEEE 802.16 systems, wherein corresponding the 3rd class service of rtPS, corresponding the 4th class service of nrtPS.
Fig. 7 a has compared proportional allocated bandwidth (PBA) algorithm that adopts existing fair Priority Queues in debt (DFPQ) algorithm and the present invention to propose in the base station when carrying out allocated bandwidth, and two all services of substation are connected the situation of data arrival and throughput.As can be seen from the figure, in the DFPQ algorithm, the bandwidth request of substation 1 has obtained whole responses, and the allocated bandwidth of substation 2 does not far reach the requirement of data variation.This is that the bandwidth request of the substation that the base station is polled to earlier can come the request message front of queue because be connected the bandwidth request mode that unicast polls is adopted in the substation with nrtPS for rtPS, is distributed bandwidth earlier by the base station.But owing to do not have priority between the substation, thereby caused inequitable situation.The PBA algorithm that proposes is on the basis of considering the substation total throughout, and the bandwidth request of each substation of being impartial to is promptly distributed according to need.
The difference that the fairness of algorithm is embodied between different entities is limited, promptly controls within limits, if difference is more little, then fairness is good more.Suppose
Figure A20071006329800181
Be respectively the total throughout that n the whole rtPS in substation, nrtPS connect, Be respectively the total data source flux that n the whole rtPS in substation, nrtPS connect,
Figure A20071006329800183
Be respectively the total throughout that the whole rtPS in the individual substation of n ', nrtPS connect,
Figure A20071006329800184
Be respectively the total data source flux that the whole rtPS in the individual substation of n ', nrtPS connect, then define the substation fairness and be:
&alpha; = | &Sigma; i &Element; I n T h rt PS ni + &Sigma; j &Element; J n Th nrt PS nj &Sigma; i &Element; I n S rt PS ni + &Sigma; j &Element; J n S nrt PS nj - &Sigma; i &Element; I n &prime; Th rt PS n &prime; i + &Sigma; j &Element; J n &prime; Th nrt P S n &prime; j &Sigma; i &Element; I n &prime; S rt PS n &prime; i + &Sigma; j &Element; J n &prime; S nrt P S n &prime; j |
α approaches 0 more, and then fairness between the two is good more; Otherwise it is poor more.
Fig. 7 b has compared the fairness of DFPQ and following two substations of PBA algorithm.Can see that in the PBA algorithm, the substation fairness is controlled at below 0.05, compare that it had not only kept each substation higher data throughput but also had taken into account fairness between the substation with the DPFQ algorithm.
Fig. 7 c has compared the situation that is connected data arrival and throughput when rtPS connection data volume increases suddenly at DFPQ with all kinds of services under the PBA algorithm.Suppose that the maximum required bandwidth that substation 2rtPS connects when setting up is 12Kbit, be increased to 24Kbit behind 50 frames, exceeded the qos requirement when consulting.As can be seen from the figure, though the DFPQ algorithm has satisfied the minimum reserved rate requirement that nrtPS connects, the rtPS that occurs connects the situation that takies nrtPS connection bandwidth and has still had a strong impact on the throughput that low priority service connects.The PBA algorithm that this paper proposes is guaranteeing that all kinds of services connect under the prerequisite of qos parameter, take into account the data volume that burst increases.
Suppose
Figure A20071006329800186
Be respectively the total throughout that the whole rtPS in all substations, nrtPS connect,
Figure A20071006329800187
Be respectively the total data source flux that the whole rtPS in all substations, nrtPS connect, then define service fairness and be: &beta; = | &Sigma; n &Element; N &Sigma; i &Element; I n Th rt PS ni &Sigma; n &Element; N &Sigma; i &Element; I n S rt PS ni - &Sigma; n &Element; N &Sigma; j &Element; J n Th nrt PS nj &Sigma; n &Element; N &Sigma; j &Element; J n S nrt PS nj |
β approaches 0 more, and then fairness between the two is good more; Otherwise it is poor more.
Fig. 7 d has compared the fairness of two classes service under DFPQ and the PBA algorithm.Can see that in the PBA algorithm, service fairness is controlled at below 0.1, compare that it has not only satisfied the bandwidth demand of all kinds of services connections but also obviously improved the fairness between different priorities service connection with the DFPQ algorithm.
Description of drawings
Fig. 1 applied environment;
Fig. 2 data format: comprise QoS parameter, connect and set up bandwidth request;
Fig. 3 media access control layer service quality entire block diagram: comprise base station, each module of substation up-downgoing
Fig. 4 admits control flow chart: Fig. 4 a is a main flow chart, and Fig. 4 b is the sub-process 1 at the service of the 1st, 2,3 classes, and Fig. 4 c is the sub-process 2 at the service of the 4th class, and Fig. 4 d is the sub-process 3 at the service of the 5th class;
Fig. 5 allocated bandwidth flow chart: Fig. 5 a is a main flow chart, Fig. 5 b is the sub-process 1 at the service of the 1st class, Fig. 5 c is the sub-process 2 at the service of the 2nd class, Fig. 5 d is the sub-process 3 at the service of the 3rd class, Fig. 5 e is the sub-process 4 at the service of the 4th class, and Fig. 5 f is the sub-process 5 at the service of the 5th class;
(descend) row scheduling flow figure on Fig. 6: Fig. 6 a is a main flow chart, Fig. 6 b is the sub-process 1 at the service of the 1st class, Fig. 6 c is the sub-process 2 at the service of the 2nd class, Fig. 6 d is the sub-process 3 at the service of the 3rd class, Fig. 6 e is the sub-process 4 at the service of the 4th class, Fig. 6 f is the sub-process 5 at the service of the 5th class, Fig. 6 g is the sub-process 6 at the service of the 1st class, Fig. 6 h is the sub-process 7 at the service of the 2nd class, Fig. 6 i is the sub-process 8 at the service of the 3rd class, Fig. 6 j is the sub-process 9 at the service of the 4th class, and Fig. 6 k is the sub-process 10 at the service of the 5th class;
Fig. 7 simulation curve figure: Fig. 7 a is two substation total throughouts, and Fig. 7 b is the substation fairness, and the service of two classes connected total throughout when Fig. 7 c was the increase of rtPS connection data, service fairness when Fig. 7 d is the increase of rtPS connection data, wherein
Figure A20071006329800191
The expression data source,
Figure A20071006329800192
Expression PDA algorithm,
Figure A20071006329800193
Expression DFPQ algorithm.
Embodiment
Fig. 1 is the applied environment that the broadband radio access network of service classification is arranged.Its local each substation independently is in charge of in the base station of playing the center control action, and the substation can be that the T1 level of cellular base stations, the Hot spot based on IEEE 802.11, dwelling house SOHO broadband access, large enterprises inserts, the DSL level access of small enterprise etc. and portable terminal such as mobile phone, palmtop PC, notebook computer etc.By wireless connections, the Internet of base station and backbone network such as all-IP net etc. is a wired connection between base station and substation.
Fig. 2 is the data format of five classes service, and wherein Fig. 2 a is the QoS parameter data format of the 1st, 2,3,4,5 classes service; Fig. 2 b connects to set up data format, comprises connection request, connects and set up success response and set up failure response with being connected; Fig. 2 c is the bandwidth request data format.
Fig. 3 is a media access control layer service quality entire block diagram, is example explanation embodiment with IEEE 802.16 systems below:
Can use FPGA, DSP, ASIC (ARM nuclear) to realize that media access control layer service quality guarantees system in base station and substation.During system initialization, the register zero clearing of all modules.Initiatively respectively corresponding the 1st, 3,4, the 5 class services of authorization service (UGS), real time polling service (rtPS), non real-time poll services (nrtPS) and the service of doing one's best (BE) of four classes service classification of having stipulated in IEEE 802.16 systems increase in addition and initiatively authorize corresponding the 2nd class service of request service (UGPRS) of carrying.
On up direction, the upper layer application of substation 1 sends to media access control layer by high-level interface with Business Name and QoS parameter, and for example Business Name is " VoIP ", and QoS parameter is as follows,
64Kb/s 64Kb/s 10ms 5ms
The COS decision device is judged this and is applied as the 1st class service, i.e. the active authorization service.Up service connects sets up module transmission connection request message, and form is as follows,
1 1 64Kb/s 64Kb/s 10ms 5ms
The base station admits control module to accept or refuse this service in conjunction with the situation of QoS parameter and system available bandwidth to be connected foundation and to ask, received connection is assigned with a connection identifier (CID, and the information that will connect is recorded in the service link information database, it is as follows that success response is set up in connection
1 1 1 1 64Kb/s 64Kb/s 10ms 5ms
It is that sign is carried out buffer memory with the connection identifier (CID with application data that the up service in substation connects the formation buffer, and the information that this service connects is recorded in the up service link information database.The service of the 1st class service connects and does not need to carry out bandwidth request, supposes that mac frame is long for 10ms, according to maximum latency 10ms, the every frame in base station need be authorized fixed-bandwidth, be maximum required bandwidth, it is corresponding with maximum lasting speed 64Kb/s, supposes that the physical layer modulation code coefficient is
Figure A20071006329800201
Then maximum required bandwidth is 64 Kb / s * 10 ms * 3 4 = 480 bits . The bandwidth allocation module of base station is connected the bandwidth addition of authorizing with above result with substation 1 other services and draws the total bandwidth that authorize substation 1, and generates up mapping in up-downgoing mapping generator.The uplink scheduling device of substation 1 connects the bandwidth reasonable distribution of authorizing in the up mapping to each service, the coordination data sending order, and by descending layer interface that data and control information are passed to physical layer.
On down direction, the upper layer application of base station sends to media access control layer by high-level interface with Business Name and QoS parameter, and for example Business Name is " MPEG4 ", and QoS parameter is as follows,
400Kb/s 200Kb/s 30ms 15ms
The COS decision device is judged this and is applied as the 2nd class service, promptly initiatively authorizes the request service of carrying.Descending service connects sets up module transmission connection request message, and form is as follows,
1 2 400Kb/s 200Kb/s 30ms 15ms
The base station admits control module to accept or refuse this service in conjunction with the situation of QoS parameter and system available bandwidth to be connected foundation and to ask, received connection is assigned with a connection identifier (CID, and the information that will connect is recorded in the service link information database, it is as follows that success response is set up in connection
1 1 2 2 400Kb/s 200Kb/s 30ms 15ms
It is that sign is carried out buffer memory with the connection identifier (CID with application data that the up service in substation connects the formation buffer, and the information that this service connects is recorded in the up service link information database.The service of the 2nd class service connects the fixed-bandwidth that the distribution that needs the base station cycle is lower than Mean Speed, carries the bandwidth request that exceeds part in the MAC head, supposes the long 10ms of being of mac frame, and the physical layer modulation code coefficient is Average required bandwidth factor is 0.5 according to maximum latency 30ms, and per 3 frames in base station need be authorized fixed-bandwidth, promptly 0.5 2 ( 400 Kb / s * 30 ms * 2 3 + 200 Kb / s * 30 ms * 2 3 ) = 3 Kb . The bandwidth allocation module of base station is connected the bandwidth addition of authorizing with above result with substation 1 other services and draws the total bandwidth that authorize substation 1, and generates descending mapping in up-downgoing mapping generator.The downlink scheduler of base station connects to each service of substation 1 the bandwidth reasonable distribution of authorizing in the descending mapping, the coordination data sending order, and by descending layer interface that data and control information are passed to physical layer.
Fig. 4 admits control flow chart, and the admittance control module of base station receives and connects that to set up request message as follows:
2 4 200Kb/s 100Kb/s 0
The computing system available bandwidth is 5Kbits, judge that COS is 4, enter sub-process 2, by calculating minimum required bandwidth and system's available bandwidth ratio, to admit control identifier to be changed to 1, and promptly accept this service and connect, distribute connection identifier (CID 3, write down this service link information, it is as follows that success response is set up in the service connection of transmission:
2 1 3 4 200Kb/s 100Kb/s 0
Fig. 5 is the allocated bandwidth flow chart, and it is as follows that substation 2 sends bandwidth request message:
2 3 140bits
The base station is read the information that this service connects according to connection identifier (CID 3 from service link information database, comprise sub-station number 2, COS 4, the bandwidth 140bits of QoS parameter and the request of this frame.Judge that COS is 4, enter sub-process 4, the bandwidth ratio of calculating minimum required bandwidth and request, if be not more than, it is bandwidth on demand that bandwidth is authorized in the base station, otherwise to authorize bandwidth be minimum required bandwidth in the base station, it is poor for both to exceed bandwidth.
After all service connections were authorized to bandwidth, total bandwidth that computing system has been authorized and the total bandwidth that exceeds QoS parameter compared both sums and overall system bandwidth, if greater than, the total bandwidth that has authorized the substation is
BG n = &Sigma; i &Element; { 12,3,4 } &Sigma; j &Element; Ni n BGi nj + B - &Sigma; n &Element; N &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj &Sigma; n &Element; N &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj &CenterDot; &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj , Otherwise the total bandwidth that has authorized the substation is
BG n = &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj + &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj .
Fig. 6 goes up (descending) row scheduling flow figure, on up direction, the total bandwidth that substation n has been authorized from up mapping, and from up service link information database, read up all kinds of service link information, calculate required total bandwidth, compare with the total bandwidth of having authorized, if be not more than, will serve to connect and sort according to service priority, carry out sub-process 1-5 successively, otherwise after the ordering, carry out sub-process 6-10 successively.Substation uplink scheduling device will be served to connect and be carried out transfer of data with allocated size in order.
On down direction, the base station obtains the total bandwidth that substation n has authorized from descending mapping, and from service link information database, read descending all kinds of service link information, calculate the required total bandwidth of substation n, compare, if be not more than with the total bandwidth of having authorized, to serve to connect and sort according to service priority, carry out sub-process 1-5 successively, otherwise after the ordering, carry out sub-process 6-10 successively.The base station down scheduler will be served to connect and be carried out transfer of data with allocated size in order.

Claims (2)

1. service quality guarantee method for broadband radio access network media accessing control layer, it is characterized in that described method be put the multidrop topology structure or base station system in the Mesh topological structure of center control nodes is arranged and the substation system two large divisions in realize according to the following steps successively:
In described base station system, carry out according to the following steps successively:
Step (1), the base station high-level interface receives data, Business Name and the QoS parameter that the IP layer is sent, to the output of base station services type decision device, or to IP layer transmission media access control layer data;
It is that step (2), Business Name that described base station services type decision device basis is received and QoS parameter are judged for which class service, and sets up module output to base station down service connection;
Step (3), described base station down service connection are set up module and are asked to admitting control module to send connection foundation according to the descending all kinds of services of receiving;
Step (4), this service connection foundation request is accepted or refused to described admittance control module decision according to the following steps successively, send corresponding connection response,, and the information of this connection be recorded in the base station services link information database for received connection distributes a connection identifier (CID:
Step (4.1) receives the connection foundation request that all kinds of services of up-downgoing send;
Step (4.2) is calculated as follows out system's available bandwidth according to the situation that existing all kinds of services in the system connect:
B a = B - &Sigma; n &Element; N ( &Sigma; i &Element; { 1,2,3 } &Sigma; j &Element; Ni n Bi nj max + &Sigma; i &Element; { 4 } &Sigma; j &Element; Ni n Bi nj min ) ;
Wherein:
B a: system's available bandwidth, represent with byte number;
B: overall system bandwidth, represent with byte number;
Ni n: total linking number of existing n substation i class service in the system, n ∈ N, N are the substation number, { 1,2,3,4,5}, i are the sequence number of COS to i ∈;
Bi Nj Max: n substation i class served j maximum required bandwidth that connects, and represents this Bi with byte number Nj MaxCorresponding with the lasting speed of maximum, j ∈ Ni n, represent the sequence number that n substation i class service connects;
Bi Nj Min: n substation i class served j minimum required bandwidth that connects, and represents this Bi with byte number Nj MinCorresponding with minimum reserved rate;
Described five kinds of COS are:
The 1st class service: the real-time service flow of fixed length grouping, fixed bit rate, QoS parameter are the maximum shakes that continues speed, minimum reserved rate, maximum latency and tolerance, and described minimum reserved rate equates with the maximum speed that continues;
The 2nd class service: variable-length packets, variable bit rate real-time service flow, its transmission rate fluctuates up and down gently in Mean Speed, and QoS parameter is maximum speed, minimum reserved rate and the maximum latency of continuing;
The 3rd class service: variable-length packets, variable bit rate real-time service flow, its transmission rate fluctuates up and down acutely in Mean Speed, and QoS parameter is maximum speed, minimum reserved rate and the maximum latency of continuing;
The 4th class service: the non real-time service flow of variable-length packets, variable bit rate, QoS parameter are maximum speed, minimum reserved rate and the transmission priorities of continuing;
The 5th class service: have the non real-time service flow of self-similarity nature, QoS parameter is maximum speed and the transmission priority of continuing;
Step (4.3), according to COS, QoS parameter and system's available bandwidth, decision is accepted or is refused this service and connects the request of foundation, if accept, execution in step (4.4), otherwise, execution in step (4.5);
Step (4.4), the service of be accepting connect distributes a connection identifier (CID, its information is recorded in service link information database, and feeds back a connection response, represents that this service connection sets up successfully;
Step (4.5) is fed back a connection response, represents that this service connects the foundation failure;
Step (5), described descending service connect sets up module after admit the control module service of receiving to connect to set up successful connection response, and descending service connection formation buffer is sent in the service connection that is assigned to a connection identifier (CID;
Step (6), described descending service connect corresponding formation of connection identifier (CID that the formation buffer connects with the descending service of receiving, metadata cache, and to the output of descending service connection bandwidth request module;
Step (7), described descending service connects the bandwidth request module when each media access control (MAC) frame begins, and measures each descending service and connects the byte number of formation, and be recorded in the service link information database;
Step (8), bandwidth allocation module reads the bandwidth of all kinds of service connection requests of up-downgoing from described service link information database, carry out allocated bandwidth in conjunction with QoS parameter and system's available bandwidth according to the following steps, and draw the total bandwidth that authorize different substations:
Step (8.1) reads the information that all kinds of services of up-downgoing connect from service link information database, comprising the bandwidth of sub-station number, COS, QoS parameter and the request of this frame, and carry out following different operation according to COS;
Step (8.1.1) reads the COS that a service connects;
Step (8.1.2), carry out different operating at different COS:
For the 1st class service, calculate maximum required bandwidth by the lasting speedometer of maximum that this service connects, the base station licenses to the bandwidth B G1 that this service connects NjBe that n substation the 1st class served j maximum required bandwidth B 1 that connects Nj Max, promptly
BG 1 nj = B 1 nj max ;
For the 2nd class service, the lasting speed of maximum and the minimum reserved rate that connect by this service calculate maximum required bandwidth and minimum required bandwidth, the bandwidth B R2 of request NjBe defined as n substation the 2nd class of this frame and serve j byte number and the average required bandwidth of part that connects formation &alpha; nj 2 ( B 2 nj max + B 2 nj min ) Difference, if 0 < BR 2 nj &le; B 2 nj max - &alpha; nj 2 ( B 2 nj max + B 2 nj min ) , Then the base station licenses to the bandwidth B G2 that this service connects NjFor: BG 2 nj = BR 2 nj + &alpha; nj 2 ( B 2 nj max + B 2 nj min ) , Otherwise, BG 2 nj = B 2 nj max , The bandwidth EX2 that exceeds QoS parameter NjFor:
EX 2 nj = BR 2 nj + &alpha; nj 2 ( B 2 nj max + B 2 nj min ) - B 2 nj max ;
For the 3rd class service, calculate maximum required bandwidth, the bandwidth B R3 of request by the lasting speedometer of maximum that this service connects NjBe defined as n substation the 3rd class of this frame and serve j byte number that connects formation, if 0 < BR 3 nj &le; B 3 nj max , Then to license to the bandwidth that this service connects be bandwidth on demand, i.e. BG3 in the base station Nj=BR3 Nj, otherwise, BG 3 nj = B 3 nj max , The bandwidth EX3 that exceeds QoS parameter NjFor: EX 3 nj = BR 3 nj - B 3 nj max ;
For the 4th class service, the minimum reserved rate that connects by this service calculates minimum required bandwidth, and the definitions of bandwidth of request is served j byte number that connects formation for n substation the 4th class of this frame, if 0 < BR 4 nj &le; B 4 nj min , Then to license to the bandwidth that this service connects be bandwidth on demand, i.e. BG4 in the base station Nj=BR4 Nj, otherwise, BG 4 nj = B 4 nj min , The bandwidth EX4 that exceeds QoS parameter NjFor: EX 4 nj = BR 4 nj - B 4 nj min ;
For the 5th class service, the bandwidth B R5 of request NjBe defined as n substation the 5th class of this frame and serve j byte number that connects formation, if BR5 Nj>0, then think the bandwidth EX5 that exceeds QoS parameter NjFor: EX5 Nj=BR5 Nj
Step (8.2), total bandwidth BG that the system of being calculated as follows out has been authorized and the total bandwidth EX that exceeds QoS parameter:
BG = &Sigma; n &Element; N &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n B Gi nj ;
BX = &Sigma; n &Element; N &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj ;
Wherein:
BGi Nj: n substation i class served j and connected the bandwidth that is authorized to, i=1,2,3,4;
EXi Nj: n substation i class served j and connected the bandwidth that exceeds QoS parameter, i=2,3,4,5;
Compare again described BG and EX addition summation, and with overall system bandwidth, if be not more than overall system bandwidth, execution in step (8.3) then, otherwise, execution in step (8.4);
Step (8.3) is calculated as follows the total bandwidth BG that has authorized n substation nFor:
BG n = &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj + &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj ;
Step (8.4), the ratio that exceeds the QoS parameter total bandwidth according to the total available bandwidth of system and system by following formula is revised the total bandwidth that exceeds QoS parameter in n the substation that step (8.3) obtains, and obtains revised n the total bandwidth BG that has authorized the substation nFor:
BG n = &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj + B - &Sigma; n &Element; N &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj &Sigma; n &Element; N &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj &CenterDot; &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj ;
Step (8.5), the total bandwidth that described bandwidth allocation module has been authorized n substation are sent to up-downgoing mapping generator, n=1, and 2 ..., N;
Step (9), the total bandwidth that described up-downgoing mapping generator is authorized according to different substations in the bandwidth allocation module, in conjunction with the time slot in the physical layer parameter allocation medium access control frame, generation up-downgoing mapping, and descending mapping delivered to downlink scheduler, layer interface sends the data and the control information of media access control layer to physical layer under passing through again, or receives the data that physical layer is sent;
In described substation system, carry out according to the following steps successively:
Step (1 '), the substation high-level interface receives data, Business Name and the QoS parameter that the IP layer is sent, or sends the media access control layer data to the IP layer;
Step (2 '), it is that the COS decision device is judged according to the Business Name of receiving from described substation high-level interface and QoS parameter for which class service, and connects to up service and to set up module output;
It is that the admittance control module of all kinds of up service in the base station of receiving sends connection foundation request that step (3 '), described up service connection are set up module, and receives corresponding connection response, if success response is set up in connection, then carries out next step;
Step (4 '), up service connect the formation buffer and connect from described up service and set up module and receive up service and connect, and with the corresponding formation of a connection identifier (CID, metadata cache, and connect the output of bandwidth request module to up service;
Step (5 '), up service connects the bandwidth request module when each media access control (MAC) frame begins, measure the size that each up service connects formation, be recorded in the up service link information database, and send the corresponding bandwidth request to the service link information database of base station system in a different manner;
Step (6 '), the uplink scheduling device receives up mapping from the up-downgoing mapping generator of base station system, the allocated bandwidth of authorizing in this up mapping is connected to each service, the coordination data sending order, and layer interface sends media access control layer data and control information to physical layer under passing through, or receives the data that physics is sent layer by layer;
Wherein, described uplink and downlink dispatching method contains following steps successively:
The first step: the uplink scheduling device receives the up mapping of base station broadcast, and downlink scheduler reads in descending mapping from up-downgoing mapping generator;
Second step: at up direction, the uplink scheduling device reads the information that up all kinds of service connects from up service link information database, comprising: the bandwidth of COS, QoS parameter and former frame request; At down direction, downlink scheduler reads the information that descending all kinds of service connects from service link information database, comprise: the bandwidth of sub-station number, COS, QoS parameter and former frame request, the number that up all kinds of services connect the former frame bandwidth on demand in the described service link information database are no more than the number of up all kinds of services connection former frame bandwidth on demand in the up service link information database;
The 3rd step: the uplink and downlink scheduler is calculated as follows out n the needed total bandwidth BR in substation n:
BR n = &Sigma; j &Element; N 1 n B 1 nj max + &Sigma; j &Element; N 2 n &alpha; nj 2 ( B 2 nj max + B 2 nj min ) + &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n BRi nj p ;
Wherein:
BR n: n the needed total bandwidth in substation, represent with byte number;
Ni n: total linking number of existing n substation i class service in the system, n ∈ N, i ∈ 1,2,3,4,5};
Bi Nj Max: n substation i class served j maximum required bandwidth that connects, and represents with byte number, and be corresponding with the lasting speed of maximum, n ∈ N, i ∈ 1,2,3,4,5}, j ∈ Ni n
Bi Nj Min: n substation i class served j minimum required bandwidth that connects, and represents with byte number, and be corresponding with minimum reserved rate, n ∈ N, i ∈ 1,2,3,4}, j ∈ Ni n
α Nj: the 2nd class is served j average required bandwidth factor that connects, α in n the substation Nj∈ (0,1), n ∈ N, j ∈ N2 n
BRi Nj: n substation i class served the bandwidth of j connection request, represent with byte number, and n ∈ N, i ∈ 2,3,4,5}, j ∈ Ni n
The 4th step: when the total bandwidth of system authorization is sufficient, dispatch according to COS that each service connects, specific as follows described:
At first, all kinds of services are connected according to the service priority ordering, service priority reduces along with the increase of COS numbering;
Secondly, again each COS is treated with a certain discrimination as follows:
Each service in the service of the 1st class is connected according to the ascending ordering of numbering, and each service connects the bandwidth that is assigned with BA 1 nj = B 1 nj max , Promptly equal its maximum required bandwidth, described numbering is little for earlier arriving buffer, after arrive for big;
Each service in the service of the 2nd class is connected according to the ascending ordering of numbering, and each service connects the bandwidth that is assigned with BA 2 nj = BR 2 nj + &alpha; nj 2 ( B 2 nj max + B 2 nj min ) , Promptly upwards float on j service connection request bandwidth, floating range is the average required bandwidth of part;
Each service in the service of the 3rd class is connected according to the ascending ordering of numbering, and each service connects the bandwidth B A3 that is assigned with Nj=BR3 Nj, promptly by the allocated bandwidth of serving connection request;
The 4th, 5 classes are served each service connect according to the transmission priority ordering, each service connects the bandwidth B Ai that is assigned with Nj=BRi Nj, { 4,5} is promptly by the allocated bandwidth of serving connection request for i ∈;
The 5th step: when the total bandwidth of having authorized is not enough, each service is connected according to the following distribution of priority:
At first, all kinds of services are connected according to the service priority ordering, service priority reduces along with the increase of COS numbering, and simultaneously, the method described in (8.1) calculates the bandwidth B Gi that all kinds of services connections have been authorized set by step NjWith the bandwidth EXi that exceeds QoS parameter Nj
Secondly, carry out corresponding scheduling at different COS again:
To the 1st class service, each service is connected according to the ascending ordering of numbering, each service connects the bandwidth B A1 that is assigned with Nj=BG1 Nj
To the 2nd class service, each service is connected according to the ascending ordering of numbering, if do not exceed the bandwidth of QoS parameter, then each service connects the bandwidth B A2 that is assigned with Nj=BG2 Nj, otherwise, press following formula and handle:
BA 2 nj = B 2 nj max + BG n - &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj &CenterDot; EX 2 nj ;
Wherein:
BG n: n the total bandwidth that has authorized the substation, represent with byte number;
BGi Nj: n substation i class served j and connected the bandwidth that is authorized to;
EXi Nj: n substation i class served j and connected the bandwidth that exceeds QoS parameter;
Promptly at B2 Nj MaxBe to exceed the part proportion at total system to increase an amplitude again according to the bandwidth that exceeds QoS parameter on the basis;
To the 3rd class service, each service is connected according to the ascending ordering of numbering, if do not exceed the bandwidth of QoS parameter, then each service connects the bandwidth B A3 that is assigned with Nj=BG3 Nj, otherwise each service connects the bandwidth B A3 that is assigned with NjFor:
BA 3 nj = B 3 nj max + BG n - &Sigma; i &Element; { 1,2,3,4 } &Sigma; j &Element; Ni n BGi nj &Sigma; i &Element; { 2,3,4,5 } &Sigma; j &Element; Ni n EXi nj &CenterDot; EX 3 nj ;
To the 4th class service, each service is connected according to the transmission priority ordering, calculate n the last bandwidth B L in substation n:
BL n = BG n - &Sigma; i &Element; { 1,2,3 } &Sigma; j &Element; Ni n BAi nj ;
BL nBe connected and authorize the bandwidth sum with each service
Figure A2007100632980008C3
Relatively:
If BL n &GreaterEqual; &Sigma; j &Element; N 4 n BG 4 nj , Then carry out following operation:
If do not exceed the bandwidth of QoS parameter, then each service connects the bandwidth B A4 that is assigned with Nj=BG4 Nj, otherwise each service connects the bandwidth B A4 that is assigned with NjFor: BA 4 nj = B 4 nj min + BL n &Sigma; i &Element; { 4,5 } &Sigma; j &Element; Ni n EX i nj &CenterDot; EX 4 nj , Calculate new last bandwidth
BL n &prime; = BL n - &Sigma; j &Element; N 4 n BA 4 nj ;
If BL n < &Sigma; j &Element; N 4 n BG 4 nj , Then carry out following operation:
Each service for same transmission priority connects, and according to the ascending ordering of numbering, connect from the service of the little numbering of high-transmission priority and to begin to distribute bandwidth, if do not exceed the bandwidth of QoS parameter, the bandwidth B A4 that then should service connection be assigned with Nj=BG4 Nj, otherwise, for connecting, this service distributes a bandwidth earlier BA 4 nj = B 4 nj min , Calculate new last bandwidth B L again n'=BL n-BA4 Nj, if less than zero, then this service connects the bandwidth B A4 that is assigned with Nj=BL n' BA4 Nj, finish to distribute, otherwise, BL n=BL n', continue to carry out this operation;
To the 5th class service, earlier each service is connected according to the transmission priority ordering, calculate n the last bandwidth B L in substation n=BL n', again each service of same transmission priority is connected according to the ascending ordering of numbering, connect from the service of the little numbering of high-transmission priority and begin to distribute bandwidth, if the bandwidth that exceeds QoS parameter is arranged, the bandwidth B A5 that then should service connection be assigned with NjFor: BA 5 nj = ( &beta; 5 nj + 1 ) 8 &CenterDot; EX 5 nj , Wherein, β 5 NjBe that n substation the 5th class served j transmission priority that connects, β 5 Nj∈ 0,1,2,3,4,5,6,7}, n ∈ N, j ∈ N5 n, β 5 NjBe worth greatly more, transmission priority is high more, calculates new last bandwidth B L n'=BL n-BA5 Nj, if less than zero, then this service connects the bandwidth B A5 that is assigned with Nj=BL n' BA5 Nj, finish to distribute, otherwise, BL n=BL n', continue to carry out this operation.
2. it is characterized in that described step (4.3) according to claims 1 described service quality guarantee method for broadband radio access network media accessing control layer, contain following substep successively:
Step (4.3.1), the current COS of receiving is judged:
If 1st, 2,3 class services, then execution in step (4.3.2);
If the 4th class service, then execution in step (4.3.3);
If the 5th class service, then execution in step (4.3.4);
Step (4.3.2), the maximum that connects by this service continues speedometer and calculates maximum required bandwidth, and compares with the system available bandwidth, if be not more than system's available bandwidth, then accepts execution in step (4.4), otherwise execution in step (4.5);
Step (4.3.3), the minimum reserved rate that connects by this service calculates minimum required bandwidth, and compares with the system available bandwidth, if be not more than system's available bandwidth, then accepts execution in step (4.4), otherwise execution in step (4.5);
Step (4.3.4) is if system's available bandwidth greater than zero, is then accepted execution in step (4.4), otherwise execution in step (4.5).
CN200710063298A 2007-01-08 2007-01-08 Service quality guarantee method for broadband radio access network media accessing control layer Expired - Fee Related CN100583901C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN200710063298A CN100583901C (en) 2007-01-08 2007-01-08 Service quality guarantee method for broadband radio access network media accessing control layer

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN200710063298A CN100583901C (en) 2007-01-08 2007-01-08 Service quality guarantee method for broadband radio access network media accessing control layer

Publications (2)

Publication Number Publication Date
CN101035139A true CN101035139A (en) 2007-09-12
CN100583901C CN100583901C (en) 2010-01-20

Family

ID=38731435

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200710063298A Expired - Fee Related CN100583901C (en) 2007-01-08 2007-01-08 Service quality guarantee method for broadband radio access network media accessing control layer

Country Status (1)

Country Link
CN (1) CN100583901C (en)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009117955A1 (en) * 2008-03-27 2009-10-01 华为技术有限公司 A method for allocating uplink resource and a user apparatus
CN102013959A (en) * 2010-12-01 2011-04-13 北京新岸线无线技术有限公司 Communication method and wireless communication system for realizing multi-user dispatching
CN102035880A (en) * 2010-11-02 2011-04-27 中兴通讯股份有限公司 Method and device for maintaining connection
WO2011079823A1 (en) * 2009-12-31 2011-07-07 华为技术有限公司 Method, device and system for bandwidth control
CN102308530A (en) * 2009-01-06 2012-01-04 阿尔卡特朗讯公司 Optimised bandwidth utilisation in networks
CN103152289A (en) * 2013-01-28 2013-06-12 中兴通讯股份有限公司 Hierarchical service quality scheduling method and device
CN101998182B (en) * 2009-08-25 2013-08-14 华为技术有限公司 Information processing method, optical communication device and optical communication system in optical networks
CN103327132A (en) * 2013-05-31 2013-09-25 山东泉清通信有限责任公司 IP transmission adaptation method based on TDMA system of wireless communication system
US8660062B2 (en) 2008-02-01 2014-02-25 Qualcomm Incorporated Methods and apparatus for quality of service-based uplink polling schemes
US8670419B2 (en) 2008-02-01 2014-03-11 Qualcomm Incorporated Methods and apparatus for intra-user quality of service uplink scheduling
CN103763483A (en) * 2014-01-23 2014-04-30 贝壳网际(北京)安全技术有限公司 Method and device for shaking resistance in photo taking process of mobile terminal and mobile terminal
CN105681219A (en) * 2016-03-09 2016-06-15 上海斐讯数据通信技术有限公司 WIFI network message processing method, system and WIFI network system
CN102013959B (en) * 2010-12-01 2016-12-14 北京新岸线移动多媒体技术有限公司 A kind of communication means realizing multi-subscriber dispatching and wireless communication system
CN107391252A (en) * 2016-05-16 2017-11-24 阿里巴巴集团控股有限公司 A kind of method for processing resource and device
CN112947271A (en) * 2021-01-27 2021-06-11 北京达源环保科技有限公司 PLC substation wireless control method and system based on Internet of things

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106776031B (en) * 2016-12-21 2019-11-15 浙江大华技术股份有限公司 A kind of data transmission method for uplink and device
EP3535956B1 (en) 2016-12-09 2021-02-17 Zhejiang Dahua Technology Co., Ltd Methods and systems for data transmission

Cited By (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8660062B2 (en) 2008-02-01 2014-02-25 Qualcomm Incorporated Methods and apparatus for quality of service-based uplink polling schemes
CN101933384B (en) * 2008-02-01 2015-03-25 高通股份有限公司 Methods and apparatus for intra-user quality of service uplink scheduling
US8670419B2 (en) 2008-02-01 2014-03-11 Qualcomm Incorporated Methods and apparatus for intra-user quality of service uplink scheduling
CN101547511B (en) * 2008-03-27 2013-04-24 华为技术有限公司 Uplink resource allocating method and user equipment
WO2009117955A1 (en) * 2008-03-27 2009-10-01 华为技术有限公司 A method for allocating uplink resource and a user apparatus
CN102308530B (en) * 2009-01-06 2017-03-08 阿尔卡特朗讯公司 The bandwidth optimizing in network uses
US9325527B2 (en) 2009-01-06 2016-04-26 Alcatel Lucent Optimised bandwidth utilisation in networks
CN102308530A (en) * 2009-01-06 2012-01-04 阿尔卡特朗讯公司 Optimised bandwidth utilisation in networks
CN101998182B (en) * 2009-08-25 2013-08-14 华为技术有限公司 Information processing method, optical communication device and optical communication system in optical networks
WO2011079823A1 (en) * 2009-12-31 2011-07-07 华为技术有限公司 Method, device and system for bandwidth control
US9119219B2 (en) 2009-12-31 2015-08-25 Huawei Technologies Co., Ltd. Bandwidth control method, apparatus and system
CN102035880A (en) * 2010-11-02 2011-04-27 中兴通讯股份有限公司 Method and device for maintaining connection
CN102035880B (en) * 2010-11-02 2014-04-30 中兴通讯股份有限公司 Method and device for maintaining connection
CN102013959A (en) * 2010-12-01 2011-04-13 北京新岸线无线技术有限公司 Communication method and wireless communication system for realizing multi-user dispatching
CN102013959B (en) * 2010-12-01 2016-12-14 北京新岸线移动多媒体技术有限公司 A kind of communication means realizing multi-subscriber dispatching and wireless communication system
WO2014114188A1 (en) * 2013-01-28 2014-07-31 中兴通讯股份有限公司 Hierarchical service quality scheduling method and apparatus
CN103152289B (en) * 2013-01-28 2016-08-17 山东智慧生活数据系统有限公司 A kind of multilevel service quality dispatching method and device
CN103152289A (en) * 2013-01-28 2013-06-12 中兴通讯股份有限公司 Hierarchical service quality scheduling method and device
US9807026B2 (en) 2013-01-28 2017-10-31 Xi'an Zhongxing New Software Co. Ltd Hierarchical quality of service scheduling method and device
CN103327132A (en) * 2013-05-31 2013-09-25 山东泉清通信有限责任公司 IP transmission adaptation method based on TDMA system of wireless communication system
CN103327132B (en) * 2013-05-31 2015-12-23 山东泉清通信有限责任公司 Based on the IP transmission adapting method of TDMA system wireless communication system
CN103763483A (en) * 2014-01-23 2014-04-30 贝壳网际(北京)安全技术有限公司 Method and device for shaking resistance in photo taking process of mobile terminal and mobile terminal
CN105681219A (en) * 2016-03-09 2016-06-15 上海斐讯数据通信技术有限公司 WIFI network message processing method, system and WIFI network system
CN107391252A (en) * 2016-05-16 2017-11-24 阿里巴巴集团控股有限公司 A kind of method for processing resource and device
CN112947271A (en) * 2021-01-27 2021-06-11 北京达源环保科技有限公司 PLC substation wireless control method and system based on Internet of things
CN112947271B (en) * 2021-01-27 2023-06-30 北京达源环保科技有限公司 PLC substation wireless control method and system based on Internet of things

Also Published As

Publication number Publication date
CN100583901C (en) 2010-01-20

Similar Documents

Publication Publication Date Title
CN101035139A (en) Service quality guarantee method for broadband radio access network media accessing control layer
CN1218591C (en) Dynamic allocation of packet data channels
Esmailpour et al. Dynamic QoS-based bandwidth allocation framework for broadband wireless networks
Kuo et al. Utility-based radio resource allocation for QoS traffic in wireless networks
CN101431811B (en) Cross-layer structure for guaranteeing QoS in WiMAX and QoS combination control method
CN1246771A (en) Pulse cascade resource allocation in honeycomb system
CN101043638A (en) Base station dispatcher, resource distribution module and dispatch control method for HSUPA
CN1921444A (en) Method for classified package dispatching and resource distributing based on service quality
CN1503474A (en) Wireless insertion network system, method, and control equipment
CN1645860A (en) Terminal up dispatching method for voice service in wide band wireless cut-in network
CN1866810A (en) Method and apparatus for realizing high-speed downlink packet dispatching
CN102404838B (en) Uplink resource allocation method and uplink resource allocation device
CN1897745A (en) Equilibrium method for transmitting MBMS service data
CN1917708A (en) Reception contro method based on measurement and QoS in broadband radio access system
CN1925457A (en) Device and method for multi-service grouping data dispatching
CN1933653A (en) Up bandwidth distributing method for wide band wireless access system
CN1885832A (en) Packet scheduling method and device for wireless communication system
CN1879360A (en) Distributed medium access control for broadband access systems
CN1889521A (en) Data dispatching method and system
CN1905549A (en) System and method for resource allocation of OFDM system
CN107231224A (en) LTE wlan networks dynamic aggregation decision-making technique under a kind of maximum transmitted time limit
CN101958828B (en) Service multiplex processing method and device
Wang et al. An optimized scheduling scheme in OFDMA WiMax networks
CN101060721A (en) A method and system and device for realizing the reverse dedicated line user mechanism
CN1889524A (en) Method for backward realizing private line user mechanism in communication system

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
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20100120

Termination date: 20110108