CN104010376A - Wireless connection scheduling method and node device - Google Patents

Wireless connection scheduling method and node device Download PDF

Info

Publication number
CN104010376A
CN104010376A CN201310060418.7A CN201310060418A CN104010376A CN 104010376 A CN104010376 A CN 104010376A CN 201310060418 A CN201310060418 A CN 201310060418A CN 104010376 A CN104010376 A CN 104010376A
Authority
CN
China
Prior art keywords
error rate
frame error
queue
weights
compensation
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
CN201310060418.7A
Other languages
Chinese (zh)
Other versions
CN104010376B (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.)
Lenovo Beijing Ltd
Original Assignee
Lenovo Beijing Ltd
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 Lenovo Beijing Ltd filed Critical Lenovo Beijing Ltd
Priority to CN201310060418.7A priority Critical patent/CN104010376B/en
Publication of CN104010376A publication Critical patent/CN104010376A/en
Application granted granted Critical
Publication of CN104010376B publication Critical patent/CN104010376B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a wireless connection scheduling method and an electronic device which are applied to a node device of a wireless network. The node device is provided with at least one connection queue comprising a first connection queue. The method comprises: at first time, when the guarantee scheduling weight of the first connection queue is a first scheduling weight, obtaining a first frame error rate of the first connection queue; determining whether the first frame error rate is greater than or equal to a preset frame error rate; and when the first frame error rate is greater than or equal to the preset frame error rate, reducing an actual scheduling weight from the first scheduling weight to a second scheduling weight.

Description

A kind of wireless connections dispatching method and node device
Technical field
The application belongs to network resource management field, is specifically related to a kind of wireless connections dispatching method and node device.
Background technology
Grouping scheduling method is one of core mechanism of network resource management, is to solve a plurality of connections or the effective means of service class to the competition of sharing link bandwidth, and meanwhile, grouping scheduling method also has important impact to the performance of network service quality.
Grouping scheduling method can be understood as scheduler and from a plurality of queues, selects a queue that meets certain condition, and this queue is divided into groups to send.The grouping scheduling method relevant to generalized processor sharing (GPS) growing up on the basis based on priority approach, can guarantee primary bandwidth and the requirement to delay of each connection.At present, no matter in cable network, or in wireless network, for the research of dispatching method, mainly concentrate on this class grouping scheduling method.
Link performance in cable network is stable, and the fluctuation of signal to noise ratio is no more than 1 ~ 2dB conventionally, and the grouping scheduling method conventionally adopting is Weighted Fair Queuing method (WFQ), and, in wireless network, due to relevant to position, there is burst and higher channel error code in the channel status of each connection.
Present inventor, in realizing the process of the embodiment of the present application technical scheme, at least finds to exist in prior art following technical problem:
In prior art, because wireless network is different from cable network, its limited bandwidth, channel status and position have dependence, and there is channel error code burst and higher, so there is the technical problem that cannot adopt the grouping scheduling method in cable network to dispatch the connection queue in wireless network;
Due to when the packet scheduling, for the poor connection queue of some channel statuss, distribute and obtain too much bandwidth, and this connection queue can not effectively utilize bandwidth, can have the technical problem of waste bandwidth again;
Separately, because the connection queue in wireless network has in advance, hysteresis, synchronous minute, when the connection queue that channel status is worsened compensates, there is the poor technical problem of fairness of compensation, for example, if connect queue A due to channel status severe exacerbation, the accumulation of compensation share is excessive, after its channel status improves, will give the too much scheduling weights of this queue, and then makes it distribute the proportion of bandwidth excessive, the bandwidth that other queue assignment arrive is too small, thereby fairness is impacted.
Summary of the invention
The embodiment of the present invention provides a kind of wireless connections dispatching method and node device, for solving prior art due to the connection queue assignment too much bandwidth poor to channel status, there is the technical problem of waste bandwidth, realized based on frame error rate adjustment and dispatched weights to carry out packet scheduling, bandwidth has been carried out to the technique effect effectively utilizing.
A wireless connections dispatching method, is applied in the node device of wireless network, and described energy-saving device has at least one the connection queue that comprises the first connection queue, and described method comprises:
In first moment, when the described first assurance scheduling weights that connect queue are the first scheduling weights, obtain the first frame error rate of described the first connection queue;
Judge whether described the first frame error rate is more than or equal to a default frame error rate;
When described the first frame error rate is more than or equal to described default frame error rate, actual schedule weights are reduced to the second scheduling weights from described the first scheduling weights.
Further, described when described the first frame error rate is more than or equal to described default frame error rate, actual schedule weights are reduced to described the second scheduling weights from described the first scheduling weights, specifically comprise:
When described the first frame error rate is more than or equal to described default frame error rate, based on described the first frame error rate, obtain the first compensation share;
Based on described the first compensation share, actual schedule weights are reduced to described the second scheduling weights from described the first scheduling weights.
Further, described judge whether described the first frame error rate is more than or equal to a default frame error rate after, described method also comprises:
When described the first frame error rate is less than described default frame error rate, judge whether described the first connection queue is to lag behind to connect queue;
Described first, connecting queue is described hysteresis while connecting queue, obtains the second frame error rate constantly of first before the first compensation constantly, and wherein, described the first compensation is constantly that frame error rate is for the first time lower than moment of described default frame error rate.
Further, after second frame error rate in first moment at quarter before described acquisition the first compensation constantly, described method also comprises:
Based on described the second frame error rate, obtain the second compensation share;
Based on described the second compensation share, actual schedule weights are brought up to the 3rd scheduling weights from described the first scheduling weights.
Further, described, judge whether described the first connection queue is that after hysteresis connects queue, described method also comprises:
When described the first connection queue is not described hysteresis connection queue, keeping actual schedule weights is described the first scheduling weights.
A node device, is applied in wireless network, and described node device has at least one the connection queue that comprises the first connection queue, and described node device comprises:
First obtains unit, in first moment, when the described first assurance scheduling weights that connect queue are the first scheduling weights, obtains the first frame error rate of described the first connection queue;
The first judging unit, for judging whether described the first frame error rate is more than or equal to a default frame error rate;
The first control unit, for when described the first frame error rate is more than or equal to described default frame error rate, is reduced to the second scheduling weights by actual schedule weights from described the first scheduling weights.
Further, described the first control unit specifically comprises:
First obtains subelement, for when described the first frame error rate is more than or equal to described default frame error rate, based on described the first frame error rate, obtains the first compensation share;
First controls subelement, for based on described the first compensation share, actual schedule weights is reduced to described the second scheduling weights from described the first scheduling weights.
Further, described node device also comprises:
The second judging unit, for when described the first frame error rate is less than described default frame error rate, judges whether described the first connection queue is to lag behind to connect queue;
Second obtains unit, for when described the first connection queue is described hysteresis connection queue, obtain the second frame error rate constantly of first before the first compensation constantly, wherein, described the first compensation is constantly that frame error rate is for the first time lower than moment of described default frame error rate.
Further, described node device also comprises:
The 3rd obtains unit, for based on described the second frame error rate, obtains the second compensation share;
The second control unit, for based on described the second compensation share, brings up to the 3rd scheduling weights by actual schedule weights from described the first scheduling weights.
Further, described node device also comprises:
The 3rd control unit, for when described the first connection queue is not described hysteresis connection queue, keeping actual schedule weights is described the first scheduling weights.
The one or more technical schemes that provide in the embodiment of the present application, at least have following technique effect or advantage:
In the embodiment of the present invention, by acquisition first, connect the first frame error rate of queue, when described the first frame error rate is more than or equal to a default frame error rate, actual schedule weights are reduced to the second scheduling weights from described the first scheduling weights, solved due to the connection queue assignment too much bandwidth poor to channel status, there is the technical problem of waste bandwidth, realized the technique effect effectively bandwidth being utilized;
Again, by when described the first connection queue is described hysteresis connection queue, obtain second frame error rate in first first moment before in the compensation moment, based on described the second frame error rate, obtain the second compensation share, based on described the second compensation share, actual schedule weights are brought up to the 3rd scheduling weights from described the first scheduling weights, solved because the connection queue in wireless network has in advance, lag behind, synchronous divides, when the connection that channel status is worsened compensates, there is the poor technical problem of fairness of compensation, realized and guaranteed to connect bandwidth and the level and smooth technique effect declining of volume of services.
Accompanying drawing explanation
Fig. 1 is the flow chart of wireless connections dispatching method in one embodiment of the invention;
Fig. 2 is the structure chart of electronic equipment in one embodiment of the invention.
Embodiment
The embodiment of the present invention provides a kind of wireless connections dispatching method and node device, for solving prior art due to the connection queue assignment too much bandwidth poor to channel status, there is the technical problem of waste bandwidth, realized based on frame error rate adjustment and dispatched weights to carry out packet scheduling, bandwidth has been carried out to the technique effect effectively utilizing.
Technical scheme in the embodiment of the present invention is for addressing the above problem, and general thought is as follows:
By in first moment, when the described first assurance scheduling weights that connect queue are the first scheduling weights, obtain the first frame error rate of described the first connection queue; Judge whether described the first frame error rate is more than or equal to a default frame error rate; When described the first frame error rate is more than or equal to described default frame error rate, actual schedule weights are reduced to the second scheduling weights from described the first scheduling weights, realized based on frame error rate adjustment and dispatched weights to carry out packet scheduling, avoided the technique effect of waste bandwidth.
In order better to understand technique scheme, below in conjunction with Figure of description and concrete execution mode, technique scheme is described in detail.
The application one embodiment provides a kind of wireless connections dispatching method, be applied in the node device of wireless network, wherein, node refers to that a computer or other equipment have absolute address and have the network that transmits or accept data function and be connected with one, node device can be work station, personal computer, can also be the equipment that server, printer and other networks are connected.Each work station, server, terminal equipment, the network equipment, the equipment that has own unique network address is all apparatus for network node.In described node device, except including the first connection queue, can also comprise that the second connection queue, the 3rd connects the connection queues such as queue.
Take that only to include the first connection queue in node device be example below, said method is elaborated.
Referring to Fig. 1, described wireless connections dispatching method comprises:
Step 101: in first moment, when the described first assurance scheduling weights that connect queue are the first scheduling weights, obtain the first frame error rate of described the first connection queue.
In specific implementation process, in wireless network, each channel status that connects queue is along with the time changes, and in data transmission procedure, to pass wrong probability higher for frame, be that frame error rate is higher, show that channel status is poorer, otherwise, frame error rate is lower, shows that channel status is better.In addition, in order to reach, distinguish the object that each connects the connection status of queue, the present invention's scheduling weights that give one's hand actual schedule weights φ iand compensation share m (t) i(t) three property values, wherein, corresponding different connection queues, i gets different numerical value.Constantly, be 0 o'clock, system initialization, the actual schedule weights of all connection queues are and guarantee scheduling weights, wherein, scheduling weights can choose at random when initial assignment, and it is directly proportional with the bandwidth that is connected queue, for characterizing bandwidth many and few that give connection queue.In addition, if first moment was t 1, t constantly 1for the arbitrary moment after initial time 0.At moment t 1, obtaining the first the first frame error rate that connects queue is e 1(t 1), and carve at this moment, the first assurance scheduling weights that connect queue are
After completing steps 101, the embodiment of the present application execution step 102: judge whether described the first frame error rate is more than or equal to a default frame error rate.
In specific implementation process, default frame error rate th fERfor the frame error rate thresholding that causes the adjustment of connection queue weights that user sets, the default frame error rate th of general setting fERbe 1%, also can be set as 2%.
After completing steps 102, the embodiment of the present application execution step 103: when described the first frame error rate is more than or equal to described default frame error rate, described actual schedule weights are reduced to the second scheduling weights from described the first scheduling weights.
Further, step 103 specifically comprises:
When described the first frame error rate is more than or equal to described default frame error rate, based on described the first frame error rate, obtain the first compensation share;
Based on described the first compensation share, actual schedule weights are reduced to described the second scheduling weights from described the first scheduling weights.
In specific implementation process, as the first frame error rate e 1(t 1)>=th fERtime, according to formula 1: obtain the first compensation share m 1(t 1), wherein, Δ is frame error rate division unit interval, its size arranges as required, is generally made as 0.5%.Obtaining the first compensation share m 1(t)=m 1(t 1) afterwards, according to formula 2: by actual schedule weights φ 1(t 1) from be reduced to
After completing steps 103, described method also comprises:
When described the first frame error rate is less than described default frame error rate, judge whether described the first connection queue is to lag behind to connect queue.
In specific implementation process, wireless network is at fixed time, and active service amount is greater than its leading connection that is connected to that guarantees volume of services, and active service amount is less than it and guarantees that being connected to of volume of services lags behind and connect, if connected, neither do not lag behind in advance yet, be referred to as synchronous connection.In the embodiment of the present application, with M (t), representing to lag behind connects collection of queues, uses represent anhysteretic articulation set, comprise leading connection and be synchronously connected.
Described, judge described first connects after whether queue be hysteresis queue, and described method also comprises:
Described first, connecting queue is described hysteresis while connecting queue, obtains the second frame error rate constantly of first before the first compensation constantly, and wherein, described the first compensation is constantly that frame error rate is for the first time lower than moment of described default frame error rate.
In specific implementation process, if the first connection queue i=1 belongs to M (t), obtain the first compensation t constantly rthe first moment t before r-1the second frame error rate e 1(t r-1), wherein, as a certain moment t rthe frame error rate of previous moment be more than or equal to default frame error rate, and t constantly rframe error rate be less than default frame error rate, i.e. e i(t r-1)>=th fERand e i(t r) <th fERtime, claim t rfor the compensation moment.
After second frame error rate in first moment before described acquisition the first compensation constantly, described method also comprises:
Based on described the second frame error rate, obtain the second compensation share;
Based on described the second compensation share, actual schedule weights are brought up to the 3rd scheduling weights from described the first scheduling weights.
In specific implementation process, obtaining the second frame error rate e 1(t r-1) afterwards, according to formula 3: obtain the second compensation share again according to above-mentioned formula 2: by actual schedule weights from bring up to
In the embodiment of the present application, described, judge whether described the first connection queue is that after hysteresis connects queue, described method also comprises:
When described the first connection queue is not described hysteresis connection queue, keeping actual schedule weights is described the first scheduling weights.
In specific implementation process, if the first connection queue i=1 belongs to m 1(t)=0, and then actual schedule weights remain and guarantee scheduling weights
By foregoing description, can be based on formula 1,2,3, obtain as follows for determine the formula 4 that connects the actual compensation of queue share with for definite formula 5 that is connected queue actual schedule weights:
m i(0)=0
Formula 4: m i ( t ) = e i ( t ) &Delta; if e i ( t ) &GreaterEqual; th FER 0 if e i ( t ) < th FER andi &Element; M &OverBar; ( t ) - e i ( t r - 1 ) &Delta; if e i ( t ) < th FER andi &Element; M ( t )
&phi; i ( 0 ) = &phi; i G
Formula 5: &phi; i ( t ) = &phi; i G - e i ( t ) &Delta; ife i ( t ) &GreaterEqual; th FER &phi; i G ife i ( t ) < th FER andi &Element; M &OverBar; ( t ) &phi; i G + e i ( t r - 1 ) &Delta; ife i ( t ) < th FER andi &Element; M ( t )
Take that to exist A, B, tri-of C to connect queues in node device be example below, and be elaborated in conjunction with a pair of the application's of table of actual packet scheduling situation wireless connections dispatching method.
Table one
Suppose to exist A, B, tri-of C to connect queue in first node, default frame error rate is th fER, Δ is 0.5%, and system is in constantly initialization in 0 o'clock, take and guarantees to dispatch weights as 10 being example, and all connections scheduling weights are all set to and guarantee scheduling weights 10.In the moment 1, there is error code in the channel that connects queue A, frame error rate rises to 1% from 0, therefore, and based on formula 4 and formula 5, obtaining connecting the compensation share of queue A 1 o'clock moment is 2, actual schedule weights are 8, then, and the moment 2 and 3 o'clock constantly, the compensation share that in like manner can obtain queue A is respectively 2,4, and actual schedule weights are respectively 8,6.4 o'clock moment, the frame error rate of queue A was less than default frame error rate, and due to the process moment 1,2,3, queue A belongs to the connection M (t) that lags behind, and the compensation of queue A moment t rfor the moment 4,3 frame error rate is 1% constantly, based on formula 4 and formula 5, obtaining the compensation share of 4 o'clock queue A is constantly-4, actual schedule weights are 14, at 5 o'clock constantly, equally based on the compensation frame error rate in the previous moment moment 3 constantly, and formula 4 and formula 5, the compensation share that obtains queue A is-4, and actual schedule weights are 14, final, by two compensation, at 6 o'clock constantly, connect A and obtain full remuneration in volume of services and the bandwidth of the internal loss of the time period of moment 1-3.
From the above, within the time period of moment 1-3, although the actual schedule weights of queue B and queue C do not change, but its proportion in total scheduling weights rises, therefore, be equivalent to reduce the bandwidth that queue A is distributed, increased the bandwidth to queue B and queue C distribution, solve the technical problem of the bandwidth waste existing in prior art, realized the technique effect effectively bandwidth being utilized.In addition, within the time period of moment 4-5, although the actual schedule weights of queue B and queue C do not change, but its proportion in total scheduling weights declines, therefore, be equivalent to reduce the bandwidth to queue B and queue C distribution, to measure by way of compensation compensation queue A, and, the frame error rate that is the eve based on the compensation moment in the process of compensation compensates, guaranteed the level and smooth decline of Connection Service amount and bandwidth, solved the poor technical problem of fairness of the compensation of existing existence, guaranteed that the bandwidth of queue and volume of services smoothly decline.
The application another embodiment provide a kind of node device, is applied in wireless network, and described node device has at least one the connection queue that comprises the first connection queue.
Referring to Fig. 2, described node device comprises:
First obtains unit 201, in first moment, when the described first assurance scheduling weights that connect queue are the first scheduling weights, obtains the first frame error rate of described the first connection queue.
In specific implementation process, in wireless network, each channel status that connects queue is along with the time changes, and in data transmission procedure, to pass wrong probability higher for frame, be that frame error rate is higher, show that channel status is poorer, otherwise, frame error rate is lower, shows that channel status is better.In addition, in order to reach, distinguish the object that each connects the connection status of queue, the present invention's scheduling weights that give one's hand actual schedule weights φ iand compensation share m (t) i(t) three property values, wherein, corresponding different connection queues, i gets different numerical value.Constantly, be 0 o'clock, system initialization, the actual schedule weights of all connection queues are and guarantee scheduling weights, wherein, scheduling weights can choose at random when initial assignment, and it is directly proportional with the bandwidth that is connected queue, for characterizing bandwidth many and few that give connection queue.In addition, if first moment was t 1, t constantly 1for the arbitrary moment after initial time 0.At moment t 1, obtaining the first the first frame error rate that connects queue is e 1(t 1), and carve at this moment, the first assurance scheduling weights that connect queue are
In the embodiment of the present application, described node device also comprises:
The first judging unit 202, for judging whether described the first frame error rate is more than or equal to a default frame error rate.
In specific implementation process, default frame error rate th fERfor the frame error rate thresholding that causes the adjustment of connection queue weights that user sets, the default frame error rate th of general setting fERbe 1%, also can be set as 2%.
In the embodiment of the present application, described node device also comprises:
The first control unit 203, for when described the first frame error rate is more than or equal to described default frame error rate, is reduced to the second scheduling weights by actual schedule weights from described the first scheduling weights.
Further, described the first control unit 203 specifically comprises:
First obtains subelement, for when described the first frame error rate is more than or equal to described default frame error rate, based on described the first frame error rate, obtains the first compensation share;
First controls subelement, for based on described the first compensation share, actual schedule weights is reduced to described the second scheduling weights from described the first scheduling weights.
In specific implementation process, as the first frame error rate e 1(t 1)>=th fERtime, according to formula 1: obtain the first compensation share m 1(t 1), wherein, Δ is frame error rate division unit interval, its size arranges as required, is generally made as 0.5%.Obtaining the first compensation share m 1(t)=m 1(t 1) afterwards, according to formula 2: by actual schedule weights φ 1(t 1) from be reduced to
In the embodiment of the present application, described node device also comprises;
The second judging unit, for when described the first frame error rate is less than described default frame error rate, judges whether described the first connection queue is to lag behind to connect queue.
In specific implementation process, wireless network is at fixed time, and active service amount is greater than its leading connection that is connected to that guarantees volume of services, and active service amount is less than it and guarantees that being connected to of volume of services lags behind and connect, if connected, neither do not lag behind in advance yet, be referred to as synchronous connection.In the embodiment of the present application, with M (t), representing to lag behind connects collection of queues, uses represent anhysteretic articulation set, comprise leading connection and be synchronously connected.
In the embodiment of the present application, described node device also comprises:
Second obtains unit, for when described the first connection queue is described hysteresis connection queue, obtain the second frame error rate constantly of first before the first compensation constantly, wherein, described the first compensation is constantly that frame error rate is for the first time lower than moment of described default frame error rate.
In specific implementation process, if the first connection queue i=1 belongs to M (t), obtain the first compensation t constantly rthe first moment t before r-1the second frame error rate e 1(t r-1), wherein, as a certain moment t rthe frame error rate of previous moment be more than or equal to default frame error rate, and t constantly rframe error rate be less than default frame error rate, i.e. e i(t r-1)>=th fERand e i(t r) <th fERtime, claim t rfor the compensation moment.
In the embodiment of the present application, described node device also comprises:
The 3rd obtains unit, for based on described the second frame error rate, obtains the second compensation share;
The second control unit, for based on described the second compensation share, brings up to the 3rd scheduling weights by actual schedule weights from described the first scheduling weights.
In specific implementation process, obtaining the second frame error rate e 1(t r-1) afterwards, according to formula 3: obtain the second compensation share again according to above-mentioned formula 2: by actual schedule weights from bring up to
In the embodiment of the present application, described node device also comprises:
The 3rd control unit, for when described the first connection queue is not described hysteresis connection queue, keeping actual schedule weights is described the first scheduling weights.
In specific implementation process, if the first connection queue i=1 belongs to m 1(t)=0, and then actual schedule weights remain and guarantee scheduling weights
By foregoing description, can be based on formula 1,2,3, obtain as follows for determine the formula 4 that connects the actual compensation of queue share with for definite formula 5 that is connected queue actual schedule weights:
m i(0)=0
Formula 4: m i ( t ) = e i ( t ) &Delta; if e i ( t ) &GreaterEqual; th FER 0 if e i ( t ) < th FER andi &Element; M &OverBar; ( t ) - e i ( t r - 1 ) &Delta; if e i ( t ) < th FER andi &Element; M ( t )
&phi; i ( 0 ) = &phi; i G
Formula 5: &phi; i ( t ) = &phi; i G - e i ( t ) &Delta; ife i ( t ) &GreaterEqual; th FER &phi; i G ife i ( t ) < th FER andi &Element; M &OverBar; ( t ) &phi; i G + e i ( t r - 1 ) &Delta; ife i ( t ) < th FER andi &Element; M ( t )
Take that to exist A, B, tri-of C to connect queues in node device be example below, and the operation principle of a pair of the application's of associative list node device is elaborated.
Table one
Suppose to exist A, B, tri-of C to connect queue in node device, default frame error rate is th fER, Δ is 0.5%, and system is in constantly initialization in 0 o'clock, take and guarantees to dispatch weights as 10 being example, and all connections scheduling weights are all set to and guarantee scheduling weights 10.In the moment 1, there is error code in the channel that connects queue A, frame error rate rises to 1% from 0, therefore, and based on formula 4 and formula 5, obtaining connecting the compensation share of queue A 1 o'clock moment is 2, actual schedule weights are 8, then, and the moment 2 and 3 o'clock constantly, the compensation share that in like manner can obtain queue A is respectively 2,4, and actual schedule weights are respectively 8,6.4 o'clock moment, the frame error rate of queue A was less than default frame error rate, and due to the process moment 1,2,3, queue A belongs to the connection M (t) that lags behind, and the compensation of queue A moment t rfor the moment 4,3 frame error rate is 1% constantly, based on formula 4 and formula 5, obtaining the compensation share of 4 o'clock queue A is constantly-4, actual schedule weights are 14, at 5 o'clock constantly, equally based on the compensation frame error rate in the previous moment moment 3 constantly, and formula 4 and formula 5, the compensation share that obtains queue A is-4, and actual schedule weights are 14, final, by two compensation, at 6 o'clock constantly, connect A and obtain full remuneration at the volume of services of the time period of moment 1-3 internal loss.
From the above, within the time period of moment 1-3, although the actual schedule weights of queue B and queue C do not change, but its proportion in total scheduling weights rises, therefore, be equivalent to reduce the bandwidth that queue A is distributed, increased the bandwidth to queue B and queue C distribution, solve the technical problem of the bandwidth waste existing in prior art, realized the technique effect effectively bandwidth being utilized.In addition, within the time period of moment 4-5, although the actual schedule weights of queue B and queue C do not change, but its proportion in total scheduling weights declines, therefore, be equivalent to reduce the bandwidth to queue B and queue C distribution, to measure by way of compensation compensation queue A, and, the frame error rate that is the eve based on the compensation moment in the process of compensation compensates, guaranteed the level and smooth decline of Connection Service amount and bandwidth, solved the poor technical problem of fairness of the compensation of existing existence, guaranteed that the bandwidth of queue and volume of services smoothly decline.
The electronic equipment of introducing due to the present embodiment is to implement the electronic equipment that in the embodiment of the present application, information processing method adopts, so based on information processing method in the embodiment of the present application, the embodiment that those skilled in the art can understand electronic equipment in the embodiment of the present application with and various version, so introduce no longer in detail for this electronic equipment at this.As long as those skilled in the art implement the electronic equipment that in the embodiment of the present application, information processing method adopts, all belong to the scope of the application institute wish protection.
The one or more technical schemes that provide in the embodiment of the present application, at least have following technique effect or advantage:
In the embodiment of the present invention, by acquisition first, connect the first frame error rate of queue, when described the first frame error rate is more than or equal to a default frame error rate, actual schedule weights are reduced to the second scheduling weights from described the first scheduling weights, solved due to the connection queue assignment too much bandwidth poor to channel status, there is the technical problem of waste bandwidth, realized the technique effect effectively bandwidth being utilized;
Again, by when described the first connection queue is described hysteresis connection queue, obtain second frame error rate in first first moment before in the compensation moment, based on described the second frame error rate, obtain the second compensation share, based on described the second compensation share, actual schedule weights are brought up to the 3rd scheduling weights from described the first scheduling weights, solved because the connection queue in wireless network has in advance, lag behind, synchronous divides, when the connection that channel status is worsened compensates, there is the poor technical problem of fairness of compensation, realized and guaranteed to connect bandwidth and the level and smooth technique effect declining of volume of services.
Obviously, those skilled in the art can carry out various changes and modification and not depart from the spirit and scope of the present invention the present invention.Like this, if within of the present invention these are revised and modification belongs to the scope of the claims in the present invention and equivalent technologies thereof, the present invention is also intended to comprise these changes and modification interior.

Claims (10)

1. a wireless connections dispatching method, is applied in the node device of wireless network, and described energy-saving device has at least one the connection queue that comprises the first connection queue, it is characterized in that, described method comprises:
In first moment, when the described first assurance scheduling weights that connect queue are the first scheduling weights, obtain the first frame error rate of described the first connection queue;
Judge whether described the first frame error rate is more than or equal to a default frame error rate;
When described the first frame error rate is more than or equal to described default frame error rate, actual schedule weights are reduced to the second scheduling weights from described the first scheduling weights.
2. the method for claim 1, is characterized in that, described when described the first frame error rate is more than or equal to described default frame error rate, and actual schedule weights are reduced to described the second scheduling weights from described the first scheduling weights, specifically comprises:
When described the first frame error rate is more than or equal to described default frame error rate, based on described the first frame error rate, obtain the first compensation share;
Based on described the first compensation share, actual schedule weights are reduced to described the second scheduling weights from described the first scheduling weights.
3. the method for claim 1, is characterized in that, described judge whether described the first frame error rate is more than or equal to a default frame error rate after, described method also comprises:
When described the first frame error rate is less than described default frame error rate, judge whether described the first connection queue is to lag behind to connect queue;
Described first, connecting queue is described hysteresis while connecting queue, obtains the second frame error rate constantly of first before the first compensation constantly, and wherein, described the first compensation is constantly that frame error rate is for the first time lower than moment of described default frame error rate.
4. method as claimed in claim 3, is characterized in that, after second frame error rate in first moment at quarter before described acquisition the first compensation constantly, described method also comprises:
Based on described the second frame error rate, obtain the second compensation share;
Based on described the second compensation share, actual schedule weights are brought up to the 3rd scheduling weights from described the first scheduling weights.
5. method as claimed in claim 3, is characterized in that, described, judges whether described the first connection queue is that after hysteresis connects queue, described method also comprises:
When described the first connection queue is not described hysteresis connection queue, keeping actual schedule weights is described the first scheduling weights.
6. a node device, is applied in wireless network, and described node device has at least one the connection queue that comprises the first connection queue, it is characterized in that, described node device comprises:
First obtains unit, in first moment, when the described first assurance scheduling weights that connect queue are the first scheduling weights, obtains the first frame error rate of described the first connection queue;
The first judging unit, for judging whether described the first frame error rate is more than or equal to a default frame error rate;
The first control unit, for when described the first frame error rate is more than or equal to described default frame error rate, is reduced to the second scheduling weights by actual schedule weights from described the first scheduling weights.
7. node device as claimed in claim 6, is characterized in that, described the first control unit specifically comprises:
First obtains subelement, for when described the first frame error rate is more than or equal to described default frame error rate, based on described the first frame error rate, obtains the first compensation share;
First controls subelement, for based on described the first compensation share, actual schedule weights is reduced to described the second scheduling weights from described the first scheduling weights.
8. node device as claimed in claim 6, is characterized in that, described node device also comprises:
The second judging unit, for when described the first frame error rate is less than described default frame error rate, judges whether described the first connection queue is to lag behind to connect queue;
Second obtains unit, for when described the first connection queue is described hysteresis connection queue, obtain the second frame error rate constantly of first before the first compensation constantly, wherein, described the first compensation is constantly that frame error rate is for the first time lower than moment of described default frame error rate.
9. node device as claimed in claim 8, is characterized in that, described node device also comprises:
The 3rd obtains unit, for based on described the second frame error rate, obtains the second compensation share;
The second control unit, for based on described the second compensation share, brings up to the 3rd scheduling weights by actual schedule weights from described the first scheduling weights.
10. node device as claimed in claim 8, is characterized in that, described node device also comprises:
The 3rd control unit, for when described the first connection queue is not described hysteresis connection queue, keeping actual schedule weights is described the first scheduling weights.
CN201310060418.7A 2013-02-26 2013-02-26 A kind of wireless connection dispatching method and node device Active CN104010376B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310060418.7A CN104010376B (en) 2013-02-26 2013-02-26 A kind of wireless connection dispatching method and node device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310060418.7A CN104010376B (en) 2013-02-26 2013-02-26 A kind of wireless connection dispatching method and node device

Publications (2)

Publication Number Publication Date
CN104010376A true CN104010376A (en) 2014-08-27
CN104010376B CN104010376B (en) 2018-04-27

Family

ID=51370830

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310060418.7A Active CN104010376B (en) 2013-02-26 2013-02-26 A kind of wireless connection dispatching method and node device

Country Status (1)

Country Link
CN (1) CN104010376B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1404242A (en) * 2001-08-31 2003-03-19 三菱电机株式会社 Bandwidth renewing method and bandwidth renewing apparatus
CN102868633A (en) * 2012-09-12 2013-01-09 中国联合网络通信集团有限公司 Grouped data scheduling method and system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1620782A (en) * 2002-02-22 2005-05-25 连宇通信有限公司 Priority control method in wireless pocket data channel
US8356431B2 (en) * 2007-04-13 2013-01-22 Hart Communication Foundation Scheduling communication frames in a wireless network
CN101436996B (en) * 2008-12-19 2010-12-15 广东工业大学 Method for scheduling packet feedback based on short time fairness

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1404242A (en) * 2001-08-31 2003-03-19 三菱电机株式会社 Bandwidth renewing method and bandwidth renewing apparatus
CN102868633A (en) * 2012-09-12 2013-01-09 中国联合网络通信集团有限公司 Grouped data scheduling method and system

Also Published As

Publication number Publication date
CN104010376B (en) 2018-04-27

Similar Documents

Publication Publication Date Title
CN103781118B (en) Integrated processes is distributed with resource based on multiple services heterogeneous wireless network Access Control
CN101164262B (en) Method and apparatus for scheduling transmissions via an enhanced dedicated channel
CN103002559B (en) Control to strengthen method and the wireless transmitter/receiver unit of dedicated channel transmission
CN102711129B (en) The determination method and device of net planning parameter
CA2442901A1 (en) Scheduling of wireless packet data transmissions
WO2008084986A3 (en) Method of transmitting and receiving scheduling information in a wireless communication system
CN103428883B (en) A kind of dispatching method of physical downlink control channel resource and equipment
CN105224393B (en) A kind of scheduling virtual machine mechanism of JT-CoMP under C-RAN frameworks
KR20130073551A (en) Operation method of access point and wireless communication system using access point
CN102625323B (en) Network plan method and device
JP2008521323A5 (en)
Casoni et al. A low-latency and high-throughput scheduler for emergency and wireless networks
US9813205B2 (en) Uplink CoMP set selecting method and system, and device
Liu et al. Qoe-driven uplink scheduling for haptic communications over 5g enabled tactile internet
CN103222325B (en) Descending and the implementation method of uplink baseband resource pool and base station
CN103281258B (en) A kind of data transmission method for uplink and device
CN103731926A (en) Cross-carrier dispatching method and device of time division duplex system
CN101119131B (en) Method for estimating uplink load of user facility
CN113596738A (en) Information acquisition method, information determination method, information acquisition device, information determination device and related equipment
CN106411482A (en) Downlink HARQ feedback method and device under TDD system
CN107426809B (en) WVN power and cache allocation method based on virtual user queue model
CN104010376A (en) Wireless connection scheduling method and node device
CN104519574B (en) A kind of enhancing transmission time interval (tti) bundle transmission method and device
Gräupl et al. Method to emulate the L-band digital aeronautical communication system for SESAR evaluation and verification
CN108541059B (en) Power control method and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant