CN103068060B - Mixed insertion network resource regulating method, equipment and system - Google Patents
Mixed insertion network resource regulating method, equipment and system Download PDFInfo
- Publication number
- CN103068060B CN103068060B CN201310026973.8A CN201310026973A CN103068060B CN 103068060 B CN103068060 B CN 103068060B CN 201310026973 A CN201310026973 A CN 201310026973A CN 103068060 B CN103068060 B CN 103068060B
- Authority
- CN
- China
- Prior art keywords
- time
- packet buffer
- buffer queue
- queue
- message
- 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.)
- Active
Links
Abstract
The invention provides a kind of mixed insertion network resource regulating method, equipment and system.Wherein, described method comprises: in a poll, if the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, then time sum of eating dishes without rice or wine in described polled packet buffer queue is less than or equal at least one message of described fiducial time and puts into transmit queue, otherwise, increase the fiducial time of described polled packet buffer queue.The technical scheme that the embodiment of the present invention provides can improve the fairness of time scheduling of eating dishes without rice or wine effectively, and then promotes the overall performance of network.
Description
Technical field
The present invention relates to computer network communication technology, particularly relate to a kind of mixed insertion network resource regulating method, equipment and system.
Background technology
The wireless network protocol that each hardware device of access of radio network is supported is had nothing in common with each other, and great majority all belong to 802.11 agreements or its Extended Protocol, as 802.11a, 802.11b, 802.11g and 802.11n.This several different procotol all develops by 802.11, and 802.11 is IEEE(InstituteofElectricalandElectronicsEngineers, Institute of Electrical and Electric Engineers) WLAN standard that customizes.Table 1 lists the table of comparisons of each wireless network protocol of 802.11 families, as can be seen from Table 1 theoretical maximum data transfer rate 802.11n>802.11g=802.11a>802. 11b> tradition 802.11.
The each wireless network protocol table of comparisons of table 1
| Agreement | Frequency | Coded system | Maximum data transfer rate |
| Tradition 802.11 | 2.4GHz | FHSS or DSSS | 2Mbps |
| 802.11a | 5GHz | OFDM | 54Mbps |
| 802.11b | 2.4GHz | HR-DSSS | 11Mbps |
| 802.11g | 2.4GHz | OFDM | 54Mbps |
| 802.11n | 2.4GHz or 5GHz | OFDM | 600Mbps (theoretical value) |
In mixing access scene, wireless access point device (the AccessPoint of wireless network access services is provided, hereinafter referred to as AP) support 802.11a, 802.11b, 802.11g and 802.11n agreement simultaneously, therefore AP allows the access of different networks protocol terminal, AP and these terminals (Station, hereinafter referred to as STA) constitute the application scenarios mixing access, as shown in Figure 1.As can be seen from Figure 1, these STA, as notebook, mobile phone and PDA(PersonalDigitalAssistant, personal digital assistant) etc., the interface-free resources of sharing A P, and the interface-free resources of wireless network is comparatively limited, support that the STA of different networks agreement seizes the difference of interface-free resources ability, cause each STA Consumer's Experience also difference to some extent.
Under mixing access scene, there is a common problem: be compatible low speed terminal, AP has to expend the more time and waits for and the message processing low speed STA, and the flow that this part time of eating dishes without rice or wine brings is few, causes the overall performance of network very low.Fig. 2 shows the flow waveform figure of the corresponding STA of each agreement under 802.11b and 802.11g two kinds of procotols access scenes.Support that the theoretic message transmission rate of STA of 802.11g procotol should be greater than the STA supporting 802.11b agreement, but when described 802.11b and 802.11g two kinds of procotols access simultaneously, support that the message transmission rate of the STA of 802.11g procotol is unexpectedly also low than the STA of the support 802.11b procotol of low speed.Similarly, the flow waveform figure of the corresponding STA of each agreement under 802.11g and 802.11n as shown in Figure 3 two kinds of procotols access scenes.The flow waveform figure of the corresponding STA of each agreement under 802.11b, 802.11g and 802.11n shown in Fig. 4 tri-kinds of procotol access scenes.As can be seen from above-mentioned Fig. 2, Fig. 3 and Fig. 4, when low speed STA exists, the flow of high speed STA is restricted, and network performance is poor.
It is unequal that the basic reason producing above-mentioned phenomenon is that AP distributes to time of eating dishes without rice or wine of each STA.Employing tradition DCF(DistributedCoordinationFunction as shown in Figure 5, distributed coordination function) the machine-processed time devided modulation condition diagram of eating dishes without rice or wine produced.In Fig. 5, rectangle characterizes shared by single message and eats dishes without rice or wine the time, and the length on the long limit of rectangle characterizes the length of time of eating dishes without rice or wine shared by single message.The rectangle long length of side in Fig. 5, is numbered 1 ', 2 ', 3 ', 4 ', 5 ' and 6 ' rectangle represent low speed STA single message shared by eat dishes without rice or wine the time; The long limit of rectangle is short, eats dishes without rice or wine the time shared by the single message that the rectangle being numbered 1,2,3,4,5 and 6 represents high speed STA.As can be seen from Figure 5, tradition DCF mechanism is the mechanism based on message throughput priority access, interface-free resources is caused to be distributed uneven, lack fairness, the major part time of eating dishes without rice or wine of AP is all allocated to low speed STA, cause the flow of high speed STA to be greatly limited, the advantage of high-speed terminal cannot be embodied.
At present, in prior art, there is a kind of token bucket algorithm, to solve the problem of above-mentioned eat dishes without rice or wine time devided modulation inequality, network performance difference.This token bucket algorithm determines whether message is put into transmit queue according to the token number in token bucket.Particularly, as shown in Figure 6, after the message of STA1, STA2 and STA3 arrives AP according to order of arrival, the STAMAC(MediaAccessControl that AP carries according to each message, medium access control) message of each STA put into corresponding packet buffer queue by address.As shown in Figure 6, the message that the message that the message of STA1 enters the first packet buffer queue 21, STA2 enters the second message buffer queue 22, STA3 enters the 3rd packet buffer queue 23.Each STA has respective token bucket 1, and the token number of each barrel of the inside is equal.Wherein, described token was made up of the time of eating dishes without rice or wine, and at set intervals, needed to add certain token in bucket.In packet buffer queue, single message puts into the condition of transmit queue 3 is that the token number of bucket need be greater than shared by single message and eats dishes without rice or wine the time.Often a message is put into transmit queue 3, namely token bucket deducts shared by this single message and eats dishes without rice or wine the time; If single message does not meet above-mentioned condition, then continue to be cached in packet buffer queue, when packet buffer queue full, abandon the message of follow-up arrival.
After time series of eating dishes without rice or wine in Fig. 64 shows and adopts token bucket algorithm, AP distributes to eating dishes without rice or wine the time of each STA.As can be seen from time series 4 of eating dishes without rice or wine, because the token number in bucket each in token bucket algorithm is identical, single message takies the time of eating dishes without rice or wine few high speed STA natural energy and sends more messages, therefore the equity dispatching of the time of eating dishes without rice or wine can be reached, the fairness solved existing for above-mentioned traditional DCF mechanism is poor, the problem that network performance is low.But this token bucket algorithm still also exists many deficiencies, and actual effect is unsatisfactory.These deficiencies are embodied in: the speed that in token bucket algorithm, token produces usually is fixing, the interpolation waiting for token is needed when next round is dispatched, and the token this time added last round ofly puts into total time of the eating dishes without rice or wine sum of all messages of transmit queue, if the token number this time need added is more, then there is longer time delay in next round scheduling meeting.In addition, the dispatching message of next round is subject to the impact of last round of token number, because namely each token is destroyed with rear, if last round of dispatching message generation accident causes in bucket do not have token, will cause the consequence that this terminal message cannot send.There is error and also there is the problem of dispatching message time delay in the time of eating dishes without rice or wine shared by single message, the time scheduling fairness of eating dishes without rice or wine of token bucket algorithm can not be ensured completely, therefore, adopt token bucket algorithm carry out the eating dishes without rice or wine fairness of time scheduling also to there is certain defect, and then the network performance of hybrid access networks also have certain room for promotion.
Summary of the invention
Many aspects of the present invention provide a kind of mixed insertion network resource regulating method, equipment and system, to promote network performance.
First aspect of the present invention, provides a kind of mixed insertion network resource regulating method, comprising:
In a poll, if the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, then time sum of eating dishes without rice or wine in described polled packet buffer queue is less than or equal at least one message of described fiducial time and puts into transmit queue, otherwise, increase the fiducial time of described polled packet buffer queue.
Second aspect of the present invention, provides a kind of wireless access point device, comprising:
Scheduler module, for in a poll, when the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, time sum of eating dishes without rice or wine is less than or equal at least one message of described fiducial time puts into transmit queue in described polled packet buffer queue;
Fiducial time, adjusting module, in a poll, when the time of eating dishes without rice or wine shared by single message is greater than the fiducial time of described polled packet buffer queue in polled packet buffer queue, increased the fiducial time of described polled packet buffer queue.
3rd aspect of the present invention, provides a kind of hybrid access networks system, comprising: the described wireless access point device that the embodiment of the present invention provides and at least two terminals.
As shown from the above technical solution, the technical scheme that the embodiment of the present invention provides is by when in packet buffer queue, shared by single message, the time of eating dishes without rice or wine is greater than the fiducial time of this packet buffer queue, increase the fiducial time of this packet buffer queue, send to limit the message of time of eating dishes without rice or wine shared by single message larger low speed STA when this poll, low speed STA is allowed to wait for poll next time, the high speed STA making the time of eating dishes without rice or wine shared by single message few preferentially obtains this poll transmission route, after making each poll, high speed STA preferentially sends message, and low speed STA only could send message when the fiducial time of buffer queue corresponding to this low speed STA increases to and is more than or equal in buffer queue corresponding to this low speed STA and eats dishes without rice or wine the time shared by single message.Compared to existing token bucket algorithm, whether the embodiment of the present invention just can determine the transmission of message timely by the judgement of eating dishes without rice or wine time and fiducial time shared by single message, there is not the time delay producing token when adopting token algorithm, and the situation of cutout can not be produced, therefore the embodiment of the present invention can effectively ensure to eat dishes without rice or wine the fairness of time scheduling, in addition, owing to adopting the embodiment of the present invention, the message of high speed STA is sent and have precedence over low speed STA, therefore network performance have also been obtained further lifting.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below.Apparently, the accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is a concrete structure schematic diagram of the hybrid access networks system of AP and each terminal composition in prior art;
Fig. 2, for adopting prior art, supports the flow waveform comparison diagram of these two kinds of protocol terminals respectively under 802.11b and 802.11g two kinds of procotol access scenes;
Fig. 3, for adopting prior art, supports the flow waveform comparison diagram of these two kinds of protocol terminals respectively under 802.11g and 802.11n two kinds of procotol access scenes;
Fig. 4, for adopting prior art, supports the flow waveform comparison diagram of these three kinds of protocol terminals respectively under 802.11b, 802.11g and 802.11n tri-kinds of procotol access scenes;
Fig. 5 is the schematic diagram of the time devided modulation situation of eating dishes without rice or wine adopting prior art tradition DCF mechanism to produce;
Fig. 6 adopts prior art token bucket algorithm to carry out eating dishes without rice or wine the schematic diagram of time scheduling;
Fig. 7 is the schematic flow sheet of mixed insertion network resource regulating method embodiment one provided by the invention;
Fig. 8 is the schematic flow sheet of mixed insertion network resource regulating method embodiment two provided by the invention;
Fig. 9 is the schematic flow sheet of mixed insertion network resource regulating method embodiment three provided by the invention;
Figure 10 adopts described mixed insertion network resource regulating method provided by the invention to carry out eating dishes without rice or wine the schematic diagram of an embody rule example of time scheduling;
Figure 11 adopts described mixed insertion network resource regulating method provided by the invention to carry out eating dishes without rice or wine the schematic diagram of another embody rule example of time scheduling;
Figure 12 adopts described mixed insertion network resource regulating method provided by the invention to carry out eating dishes without rice or wine the scheduling process schematic diagram of another embody rule example of time scheduling;
Figure 13, for adopting described mixed insertion network resource regulating method provided by the invention, supports the flow waveform comparison diagram of these three kinds of protocol terminals respectively under 802.11b, 802.11g and 802.11n tri-kinds of procotol access scenes;
Figure 14 is the structural representation of wireless access point device embodiment one provided by the invention;
Figure 15 is the structural representation of wireless access point device embodiment two provided by the invention;
Figure 16 is the structural representation of wireless hybrid access networks system embodiment one provided by the invention.
Embodiment
For making the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
As shown in Figure 7, the schematic flow sheet of mixed insertion network resource regulating method embodiment one provided by the invention.As shown in Figure 7, the method described in the present embodiment one comprises:
Step 101, in a poll, if the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, then time sum of eating dishes without rice or wine in described polled packet buffer queue is less than or equal at least one message of described fiducial time and puts into transmit queue, otherwise, increase the fiducial time of described polled packet buffer queue.
Particularly, the message of multiple STA is according to after order of arrival arrival AP, and the message of each STA is put into corresponding packet buffer queue by the STAMAC address that AP carries according to each message.The packet buffer queue of each terminal of AP poll.Wherein, the fiducial time of each packet buffer queue is stored in AP.The AP employing message controlled in each buffer queue of each poll described fiducial time puts into the quantity of transmit queue, and with justice is that each STA distributes interface-free resources.Particularly, when shared by the single message in a certain packet buffer queue, the time of eating dishes without rice or wine is greater than the fiducial time of this packet buffer queue, message neither one this time in poll in this packet buffer queue can put into transmit queue, and increase the fiducial time of this packet buffer queue, to wait for poll next time.AP sends in low speed STA to make the message prior of high speed STA, and ensure to distribute to high speed STA again relative impartial with the time of eating dishes without rice or wine of low speed STA, AP is provided with the identical initial baseline time fiducial time of each packet buffer queue, and stores.After a poll, if the fiducial time of some packet buffer queues increases, then the fiducial time of this packet buffer queue stored is updated to the fiducial time after increase by AP, when being polled to this packet buffer queue in order to AP next time, by judging time of eating dishes without rice or wine shared by single message in this packet buffer queue and the fiducial time after upgrading, determine that the message in this packet buffer queue can put into the quantity of transmit queue.The wherein said initial baseline time specifically can be set to AP can allow at least one message be cached with in time of eating dishes without rice or wine shared by single message minimum packet buffer queue can put into the time of transmit queue in a poll.Such as, suppose there are three packet buffer queues, the time of eating dishes without rice or wine shared by single message in first packet buffer queue is 100 microseconds, the time of eating dishes without rice or wine shared by single message in second packet buffer queue is 200 microseconds, shared by single message in 3rd packet buffer queue, the time of eating dishes without rice or wine is 300 microseconds, then AP can arrange the initial baseline time of each buffer queue for being more than or equal to 100 microseconds, and be less than or equal to the arbitrary value of 300 microseconds, be that the low speed STA of 300 microseconds can not send message in a poll to allow the time of eating dishes without rice or wine shared by single message, maybe can only send a message, the time of eating dishes without rice or wine shared by single message is allowed to be that the high speed STA of 100 microseconds sends multiple message in a poll, with the interface-free resources of each high speed STA of equilibrium assignment and low speed STA, further raising overall performance of network.
The present embodiment AP is by the fiducial time of judge to eat dishes without rice or wine shared by single message in polled packet buffer queue time and this packet buffer queue, determine that the message in this polled packet buffer queue puts into the quantity of transmit queue, to make the time of eating dishes without rice or wine shared by the single message of the larger STA of supported data transmission rate shorter, the message number being placed into transmit queue in fiducial time is more; On the contrary, the time of eating dishes without rice or wine shared by the single message of the STA that supported data transmission rate is less is longer, and the message being placed into transmit queue within fiducial time is fewer, even puts into transmit queue without message.It can thus be appreciated that the fiducial time of each packet buffer queue is the threshold value that a message puts into transmit queue quantity.
Such as, in a concrete mixed insertion network, as in 802.11b, 802.11g and 802.11n tri-kinds of procotol access networks, shared by the single message supposing the STA1 supporting 802.11n procotol, the time of eating dishes without rice or wine is 100 microseconds, shared by the single message of the STA2 of support 802.11g procotol, the time of eating dishes without rice or wine is 200 microseconds, and shared by the single message of the STA3 of support 802.11b procotol, the time of eating dishes without rice or wine is 300 microseconds.For ensureing that AP distributes to the fairness of the time of eating dishes without rice or wine of the STA supporting each procotol, the fiducial time that AP arranges packet buffer queue corresponding to each STA is initial baseline time 200 microsecond.When AP is polled to packet buffer queue corresponding to STA1, by judgement, AP show that 100 microseconds are less than initial baseline time 200 microsecond, then two messages in the queue of STA1 packet buffer are put into transmit queue.Wherein, time of eating dishes without rice or wine sum 200 microsecond of these two messages equals microsecond described fiducial time 200.When AP is polled to the queue of STA2 packet buffer, by judgement, AP show that 200 microseconds equal initial baseline time 200 microsecond, then a message in packet buffer queue corresponding for STA2 is put into transmit queue.When AP is polled to packet buffer queue corresponding to STA3, by judgement, AP show that 300 microseconds are greater than initial baseline time 200 microsecond, message in the packet buffer queue that then this time poll STA3 is corresponding can not put into transmit queue, increase the fiducial time of packet buffer queue corresponding to STA3, and the initial baseline time is updated to the fiducial time after increase.Here it should be noted that: the process putting into transmit queue at least one message time sum of eating dishes without rice or wine in described polled packet buffer queue being less than or equal to described fiducial time, if described transmit queue is full, then abandon the message failing to put into described transmit queue.The eat dishes without rice or wine fairness of time devided modulation of AP refers to: be support that the STA of different networks agreement distributes relatively impartial eating dishes without rice or wine the time, here equalization is a relative concept, due to each STA single message shared by eat dishes without rice or wine time difference, AP be can not be completely average interface-free resources is distributed to each STA's, AP can only, when taking into account network performance, be the distribution interface-free resources of each STA justice as far as possible.
Wherein, in packet buffer queue, shared by single message, the time of eating dishes without rice or wine is determined to draw by AP.Particularly, preamble length, the number of retransmissions of this single message and the frame aggregation mode etc. of this single message that AP carries according to single message in the length of single message in the transmission rate of current transmission message, packet buffer queue, packet buffer queue, determine to eat dishes without rice or wine the time shared by single message.Wherein, the transmission rate of the current transmission message of AP is an assembly average, it is not exact value, it is an estimated value that the length of single message is multiplied by the time of eating dishes without rice or wine shared by single message that this transmission rate draws, there is certain error of calculation, but the time of eating dishes without rice or wine ensure that certain fairness in ratio shared by the single message of all STA that AP calculates, the error of time of eating dishes without rice or wine shared by each single message that therefore AP calculates does not affect the scheduling fairness of method described in the present embodiment.
The technical scheme that the present embodiment provides is by when in packet buffer queue, shared by single message, the time of eating dishes without rice or wine is greater than the fiducial time of this packet buffer queue, increase the fiducial time of this packet buffer queue, send to limit the message of time of eating dishes without rice or wine shared by single message larger low speed STA when this poll, low speed STA is allowed to wait for poll next time, the high speed STA making the time of eating dishes without rice or wine shared by single message few preferentially obtains this poll transmission route, after making each poll, high speed STA preferentially sends message, and low speed STA only could send message when the fiducial time of buffer queue corresponding to this low speed STA increases to and is more than or equal in buffer queue corresponding to this low speed STA and eats dishes without rice or wine the time shared by single message.Compared to existing token bucket algorithm, whether the present embodiment just can determine the transmission of message timely by the judgement of eating dishes without rice or wine time and fiducial time shared by single message, there is not the time delay producing token when adopting token algorithm, and the situation of cutout can not be produced, therefore the present embodiment can effectively ensure to eat dishes without rice or wine the fairness of time scheduling, in addition, owing to adopting the present embodiment, the message of high speed STA is sent and have precedence over low speed STA, therefore network performance have also been obtained further lifting.
Further, as shown in Figure 8, the flow chart of described mixed insertion network resource regulating method embodiment two provided by the invention.As shown in the figure, the present embodiment two, on the basis of described embodiment one, also comprises the steps:
Step 102, in a poll, there is message if only have in a packet buffer queue in all packet buffer queues, then all messages in a described packet buffer queue are put into transmit queue.
Each embodiment provided by the invention is by increasing above-mentioned steps, when all can there is no message in other packet buffer queues, there are all messages in unique packet buffer queue of message to put into transmit queue residue, to reduce AP poll number of processes, improve AP and to eat dishes without rice or wine time scheduling processing speed.
In method step 101 described in above-described embodiment one and embodiment two, increase described fiducial time, can specifically adopt following steps to realize:
First, default adjusted value is obtained.
Wherein, this default adjusted value is that AP prestores.
Then, the fiducial time of described polled packet buffer queue increases described default adjusted value, to increase described fiducial time.
Particularly, AP increases described default adjusted value on described fiducial time, and is updated to the fiducial time after increasing described default adjusted value the fiducial time stored.
Increase fiducial time by " catching up with step by step " mode of this fixing increase of the present embodiment, effectively can ensure the granularity of AP dispatching message, and implementation is simple.
Or, in the step 101 of method described in above-described embodiment one and embodiment two, increase described fiducial time, also can specifically adopt following steps to realize:
Adopt the fiducial time that the default described polled terminal of computing formula increase is corresponding; Wherein, this computing formula preset is the increasing function of described fiducial time.
Particularly, described increasing function can be: linear increasing function (as y=ax+b, a>0), multinomial increasing function are (as y=a
1x
3+ a
2, a1>0), exponential increasing function is (as y=ae
x, a>0) or power exponent increasing function (as in interval [0 ,+∞], y=x
2) etc.This increasing function specifically can set according to practical experience or the actual running results.
More specifically, described increasing function, the adjustment formula namely increasing fiducial time is: base_time=(TMAX+TMIN+n*SPIN_TIME-AT), (n>=1).Wherein, base_time is the fiducial time after increasing; TMAX eats dishes without rice or wine the time shared by single message maximum in buffer queues all during last round of poll; TMIN is the first preset value; N is the polled number of times failing message to put into transmit queue of this message buffer queue; SPIN_TIME is the second preset value; AT eats dishes without rice or wine the time shared by message single in this message buffer queue.Wherein, described first preset value can specifically initial baseline time.Described second preset value is specially a unit interval of presetting, and this unit interval is an empirical value, in actual applications this unit interval desirable 50 microseconds.
The adjusting range of fiducial time determines the frequency of AP scheduling, and the frequency of AP scheduling directly can affect the stability of network system.Adopt increasing function to adjust fiducial time in the present embodiment, the adjusting range of each fiducial time can be adjusted according to the actual conditions of network dynamically, there is better flexibility, and then contribute to the stability promoting various Access Network situation lower network system.
Further, as shown in Figure 9, the flow chart of described mixed insertion network resource regulating method embodiment three provided by the invention.As shown in Figure 9, the present embodiment three, on the basis of described embodiment one, also comprises the steps:
Step 103, according to preset time period, periodically the fiducial time of each packet buffer queue is reset to the initial baseline time.
Particularly, the fiducial time of each packet buffer queue, according to preset time period, is periodically reset to the initial baseline time by AP.In actual applications, AP is after constantly adopting the method poll described in embodiment one repeatedly, the fiducial time of the packet buffer queue that time of eating dishes without rice or wine shared by single message larger low speed terminal is corresponding can constantly increase, until low speed terminal single message shared by till the time of eating dishes without rice or wine is less than or equal to the fiducial time after increase.After this, message all can be put into transmit queue when each poll of AP by this low speed terminal and high-speed terminal.For ensureing the fairness of dispatching after low speed terminal obtains transmission route, AP can adopt regular being reset the fiducial time of each packet buffer queue of the present embodiment, to allow high-speed terminal again obtain preferential transmission route, to promote the overall performance of network further.
Certainly, the present embodiment three also based on above-described embodiment two, on the basis of above-described embodiment two, can also comprise above-mentioned steps 103.Further, here it should be noted that: described preset time period can rule of thumb artificially set, or the procotol that AP supports according to each STA when forward slip value access, the initial baseline time of each buffer queue, and the increase mode of fiducial time sets described preset time period.Particularly, in a certain period, AP receives the message supporting that three STA of 802.11b, 802.11g and 802.11n send, and the message of each STA is put into corresponding packet buffer queue by the STAMAC address that AP carries according to each message.Suppose, as shown in Figure 10, shared by the single message of the STA1 of support 802.11n procotol, the time of eating dishes without rice or wine is 100 microseconds, and the message of STA1 is placed into the first packet buffer queue 21.Shared by the single message of the STA2 of support 802.11g procotol, the time of eating dishes without rice or wine is 200 microseconds, and the message of STA2 is placed into the second message buffer queue 22.Shared by the single message of the STA3 of support 802.11b procotol, the time of eating dishes without rice or wine is 300 microseconds, and the message of STA3 is placed into the 3rd packet buffer queue 23.The fiducial time of each packet buffer queue is set to initial time 100 microsecond by AP, each time in poll, if the message in a certain packet buffer queue can not be put into transmit queue, the fiducial time of this packet buffer queue adopts above-mentioned fixing increase mode of " catching up with step by step " to increase fiducial time, namely fixes increase by 100 microsecond.As shown in Figure 10, in Figure 10, the four lines of below is respectively the view of transmit queue after four polls.After first time poll, a message in first buffer queue 21 puts into transmit queue, message in second buffer queue 22 and the 3rd buffer queue 23 could not put into transmit queue, obtain transmit queue 41, respectively the fiducial time of the second buffer queue and the 3rd buffer queue is updated to 200 microseconds.After second time poll, another message in first buffer queue 21 puts into transmit queue, a message in second buffer queue 22 puts into transmit queue, message in 3rd buffer queue 23 still can not put into transmit queue, obtain transmit queue 42, the fiducial time of the 3rd buffer queue is updated to 300 microseconds.For the third time after poll, another message in first buffer queue 21 puts into transmit queue, another message in second buffer queue 22 puts into transmit queue, a message in 3rd buffer queue 23 puts into transmit queue, obtain transmit queue 43, the message now sending STA1 in team 43 occupies the interface-free resources of AP300 microsecond, and the message of STA2 occupies the interface-free resources of AP400 microsecond, and the message of STA3 occupies the interface-free resources of AP300 microsecond.If carry out the 4th poll again, then after the 4th poll, another message in first buffer queue 21 puts into transmit queue, another message in second buffer queue 22 puts into transmit queue, another message in 3rd buffer queue 23 puts into transmit queue, obtain transmit queue 44, the message now observing STA1 in transmit queue 44 occupies the interface-free resources of AP400 microsecond, the message of STA2 occupies the interface-free resources of AP600 microsecond, and the message of STA3 occupies the interface-free resources of AP600 microsecond.After 4th poll, time of eating dishes without rice or wine shared by single message large low speed STA takies AP interface-free resources and can get more and more, therefore, relatively impartial in order to ensure that AP distributes to the interface-free resources of each STA, and ensure that network performance is unaffected, after third time poll, the fiducial time of each packet buffer queue just should be reset to the initial baseline time by AP.Therefore, in this application example, preset time period, should be poll for the first time and starts to the third time end of polling(EOP) AP time used.In actual application, the situation of the message that each STA received due to AP day part sends is different, and when must have that in actual scene, this preset time period is set to 2 seconds by experience, network performance is better.
Below in conjunction with the example shown in Figure 11 and Figure 12, the described method that various embodiments of the present invention provide is further described.
Figure 11 shows an embody rule example and adopts the method that provides of various embodiments of the present invention to carry out eating dishes without rice or wine the schematic diagram of time scheduling.As can be seen from Figure 11, the message of three STA is according to after order of arrival arrival AP, and each message is put into corresponding packet buffer queue by the STAMAC address that AP carries according to each message.Then the method that AP adopts various embodiments of the present invention to provide is dispatched, and the message in all STA packet buffer queue messages is put into transmit queue.4 messages are cached with in the queue of STA1 packet buffer.4 messages are cached with in the queue of STA2 packet buffer.6 messages are cached with in the queue of STA3 packet buffer.Suppose, it is 300 microseconds that AP takies by the message calculating STA1 the time of eating dishes without rice or wine, and it is 200 microseconds that the message of STA2 takies the time of eating dishes without rice or wine, and it is 100 microseconds that the message of STA3 takies the time of eating dishes without rice or wine.AP stores the fiducial time of STA1, STA2 and STA3 packet buffer queue, and the fiducial time of each packet buffer queue is 200 microseconds.When often taking turns poll, if when the message in this packet buffer queue cannot put into transmit queue, the fiducial time of this packet buffer queue adds 50 microseconds.In actual applications, AP the order from STA1 to STA3 can carry out this poll, also the order from STA3 to STA1 can carry out poll.The order of this example AP from STA3 to STA1 carries out poll.Particularly, the scheduling process of the method that the various embodiments of the present invention that described AP adopts provide, as shown in figure 12, specific as follows:
First round poll, when AP is polled to the queue of STA3 packet buffer, obtains microsecond fiducial time 200 of STA3 packet buffer queue.Time of eating dishes without rice or wine 100 microsecond of the single message that AP judges in the queue of STA3 packet buffer is less than microsecond fiducial time 200, then 2 messages in the queue of STA3 packet buffer are put into transmit queue.When AP is polled to the queue of STA2 packet buffer, obtain microsecond fiducial time 200 of STA2 packet buffer queue.Time of eating dishes without rice or wine 200 microsecond of the single message that AP judges in the queue of STA2 packet buffer equals microsecond fiducial time 200, then 1 message in the queue of STA2 packet buffer is put into transmit queue.When AP is polled to the queue of STA1 packet buffer, obtain microsecond fiducial time 200 of STA1 packet buffer queue.Time of eating dishes without rice or wine 300 microsecond of the single message that AP judges in the queue of STA1 packet buffer is greater than microsecond fiducial time 200, then in the fiducial time 200 of STA1 packet buffer queue, microsecond adds 50 microseconds, and microsecond fiducial time 200 of the STA1 packet buffer queue stored is updated to 250 microseconds, wait for next round poll.
Second poll, when AP is polled to the queue of STA3 packet buffer, obtains microsecond fiducial time 200 of STA3 packet buffer queue.Time of eating dishes without rice or wine 100 microsecond of the single message that AP judges in the queue of STA3 packet buffer is less than microsecond fiducial time 200, then 2 messages in the queue of STA3 packet buffer are put into transmit queue.When AP is polled to the queue of STA2 packet buffer, obtain microsecond fiducial time 200 of STA2 packet buffer queue.Time of eating dishes without rice or wine 200 microsecond of the single message that AP judges in the queue of STA2 packet buffer equals microsecond fiducial time 200, then 1 message in the queue of STA2 packet buffer is put into transmit queue.When AP is polled to the queue of STA1 packet buffer, obtain microsecond fiducial time 250 of STA1 packet buffer queue.Time of eating dishes without rice or wine 300 microsecond of the single message that AP judges in the queue of STA1 packet buffer is greater than microsecond fiducial time 250, then in the fiducial time 250 of STA1 packet buffer queue, microsecond adds 50 microseconds, and microsecond fiducial time 250 of the STA1 packet buffer queue stored is updated to 300 microseconds, wait for next round poll.
Third round poll, when AP is polled to the queue of STA3 packet buffer, obtains microsecond fiducial time 200 of STA3 packet buffer queue.Time of eating dishes without rice or wine 100 microsecond of the single message that AP judges in the queue of STA3 packet buffer is less than microsecond fiducial time 200, then 2 messages in the queue of STA3 packet buffer are put into transmit queue.When AP is polled to the queue of STA2 packet buffer, obtain microsecond fiducial time 200 of STA2 packet buffer queue.Time of eating dishes without rice or wine 200 microsecond of the single message that AP judges in the queue of STA2 packet buffer equals microsecond fiducial time 200, then 1 message in the queue of STA2 packet buffer is put into transmit queue.When AP is polled to the queue of STA1 packet buffer, obtain microsecond fiducial time 300 of STA1 packet buffer queue.Time of eating dishes without rice or wine 300 microsecond of the single message that AP judges in the queue of STA1 packet buffer equals microsecond fiducial time 300, then 1 message in the queue of STA1 packet buffer is put into transmit queue.
Fourth round poll, when AP is polled to the queue of STA3 packet buffer, the queue of STA3 packet buffer is empty, and now, AP continues the queue of poll STA2 packet buffer.When AP is polled to the queue of STA2 packet buffer, obtain microsecond fiducial time 200 of STA2 packet buffer queue.Time of eating dishes without rice or wine 200 microsecond of the single message that AP judges in packet buffer queue equals microsecond fiducial time 200, then 1 message in the queue of STA2 packet buffer is put into transmit queue.When AP is polled to the queue of STA1 packet buffer, obtain microsecond fiducial time 300 of STA1 packet buffer queue.Time of eating dishes without rice or wine 300 microsecond of the single message that AP judges in the queue of STA1 packet buffer equals microsecond fiducial time 300, then 1 message in the queue of STA1 packet buffer is put into transmit queue.
5th poll, when AP is polled to the queue of STA3 packet buffer, the queue of STA3 packet buffer is empty, and now, AP continues the queue of poll STA2 packet buffer.When AP is polled to the queue of STA2 packet buffer, the queue of STA2 packet buffer is empty, and now, AP continues the queue of poll STA1 packet buffer.Because the buffer queue of STA3 and STA2 is empty, then 2 messages remaining in the buffer queue of STA1 are put into transmit queue by AP.
All 14 messages in STA1, STA2 and STA3, through above-mentioned five polls, are all put into transmit queue by AP.The queue of the periodic poll of AP each STA packet buffer, constantly forwards the message of each STA.
Further, the described method that the various embodiments described above provide, it is also conceivable to supporting that the STA of different network protocol distributes different weight and comes in addition perfect.According to actual demand of arranging net in environment, when needing performance of the entire network the highest, distribute higher weights can to 802.11n user; When 802.11b or 802.11g Consumer's Experience needs to promote, 802.11b or 802.11g user Geng Gao weight can be given.Under this programme is applicable to 5G frequency range, 802.11a/11n mixing accesses scene, and the scene of various mixing access.
Each embodiment of the method provided by the invention is applied in concrete mixing access scene, by supporting the flow of each counterpart terminal of 802.11b, 802.11g and 802.11n procotol in actual test mixing access network, as shown in figure 13.As can be seen from Figure 13, the actual measurement data transmission rate of the terminal of the 802.11n that support theory message transmission rate is maximum is also maximum.The actual measurement data transmission rate of the terminal of the 802.11g that support theory message transmission rate is placed in the middle is also placed in the middle.And the actual measurement data transmission rate of the terminal of the slowest 802.11b of support theory message transmission rate is also the slowest.From this application example, the scheduling fairness of each embodiment of the method provided by the invention is good, and does not deposit the time delay of token bucket algorithm in the prior art and the problem of cutout, and the overall performance of network is further improved.
It should be noted that: for aforesaid each embodiment of the method, in order to simple description, therefore it is all expressed as a series of combination of actions, but those skilled in the art should know, the present invention is not by the restriction of described sequence of movement, because according to the present invention, some step can adopt other orders or carry out simultaneously.Secondly, those skilled in the art also should know, the embodiment described in specification all belongs to preferred embodiment, and involved action and module might not be that the present invention is necessary.In the above-described embodiments, the description of each embodiment is all emphasized particularly on different fields, in certain embodiment, there is no the part described in detail, can see the associated description of other embodiments.
One of ordinary skill in the art will appreciate that: all or part of step realizing above-mentioned each embodiment of the method can have been come by the hardware that program command is relevant.Aforesaid program can be stored in a computer read/write memory medium.This program, when performing, performs the step comprising above-mentioned each embodiment of the method; And aforesaid storage medium comprises: ROM, RAM, magnetic disc or CD etc. various can be program code stored medium.
As shown in figure 14, the structural representation of wireless access point device AP embodiment one provided by the invention.As shown in Figure 14, the comprising of AP described in the present embodiment one: scheduler module 10 and fiducial time adjusting module 20.Wherein, described scheduler module 10 is in a poll, when the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, time sum of eating dishes without rice or wine is less than or equal at least one message of described fiducial time puts into transmit queue in described polled packet buffer queue.Described fiducial time, adjusting module 20 was in a poll, when the time of eating dishes without rice or wine shared by single message is greater than the fiducial time of described polled packet buffer queue in polled packet buffer queue, increased the fiducial time of described polled packet buffer queue.
The technical scheme that the present embodiment provides is by when in packet buffer queue, shared by single message, the time of eating dishes without rice or wine is greater than the fiducial time of this packet buffer queue, increase the fiducial time of this packet buffer queue, send to limit the message of time of eating dishes without rice or wine shared by single message larger low speed STA when this poll, low speed STA is allowed to wait for poll next time, the high speed STA making the time of eating dishes without rice or wine shared by single message few preferentially obtains this poll transmission route, after making each poll, high speed STA preferentially sends message, and low speed STA only could send message when the fiducial time of buffer queue corresponding to this low speed STA increases to and is more than or equal in buffer queue corresponding to this low speed STA and eats dishes without rice or wine the time shared by single message.Compared to existing token bucket algorithm, whether the present embodiment just can determine the transmission of message timely by the judgement of eating dishes without rice or wine time and fiducial time shared by single message, there is not the time delay producing token when adopting token algorithm, and the situation of cutout can not be produced, therefore the present embodiment can effectively ensure to eat dishes without rice or wine the fairness of time scheduling, in addition, owing to adopting the present embodiment, the message of high speed STA is sent and have precedence over low speed STA, therefore network performance have also been obtained further lifting.
Further, scheduler module 10 described in above-described embodiment, also in a poll, when only have in all packet buffer queues in a packet buffer queue have message time, all messages in a described packet buffer queue are put into transmit queue.When adopting the present embodiment all can there is no a message in other packet buffer queues, residue also had all messages in unique packet buffer queue of message to put into transmit queue, to reduce AP poll number of processes, improve AP and to eat dishes without rice or wine time scheduling processing speed.
Again further, described scheduler module 10 is also for putting into the process of transmit queue at least one message time sum of eating dishes without rice or wine in described polled packet buffer queue being less than or equal to described fiducial time, when described transmit queue is full, abandon the message failing to put into described transmit queue.
Further, as shown in figure 15, the structural representation of described AP embodiment two provided by the invention.As shown in figure 15, described in the present embodiment two, AP is based on above-described embodiment one, also comprises: arrange module 50.The described module 50 that arranges for for arranging the identical initial baseline time, and stores fiducial time of each packet buffer queue.Wherein, the time of described initial baseline time at least one message be cached with in time of eating dishes without rice or wine shared by single message minimum packet buffer queue can be allowed in a poll to put into described transmit queue.
AP described in the present embodiment two, as shown in figure 15, specifically can also comprise: reset module 60.The fiducial time of each packet buffer queue, for according to preset time period, is periodically reset to the described initial baseline time by described replacement module 60.
Wherein, in the various embodiments described above, described fiducial time adjusting module 20, specifically in a poll, when in polled packet buffer queue, the time of eating dishes without rice or wine shared by single message is greater than the fiducial time of described polled packet buffer queue, obtain and preset adjusted value, and on described fiducial time, increase described default adjusted value, to increase described fiducial time.
Or, described fiducial time adjusting module 20, specifically in a poll, when the time of eating dishes without rice or wine shared by single message is greater than the fiducial time of described polled packet buffer queue in polled packet buffer queue, the increasing function preset is adopted to increase described fiducial time.
As shown in figure 16, the structural representation of wireless hybrid access networks system embodiment one provided by the invention.As shown in figure 16, described wireless hybrid access networks system, comprises wireless access point device 30 and at least two terminals 40.Wherein, described wireless access point device 30, i.e. AP, for in a poll, if the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, then time sum of eating dishes without rice or wine in described polled packet buffer queue is less than or equal at least one message of described fiducial time and puts into transmit queue, otherwise, increase the fiducial time of described polled packet buffer queue.Described at least two terminals 40 communicate to connect with described wireless access point device 30 respectively.The described AP that AP described in the present embodiment can adopt above-mentioned each device embodiment to provide.
The technical scheme that the present embodiment provides is by when in packet buffer queue, shared by single message, the time of eating dishes without rice or wine is greater than the fiducial time of this packet buffer queue, increase the fiducial time of this packet buffer queue, send to limit the message of time of eating dishes without rice or wine shared by single message larger low speed STA when this poll, low speed STA is allowed to wait for poll next time, the high speed STA making the time of eating dishes without rice or wine shared by single message few preferentially obtains this poll transmission route, after making each poll, high speed STA preferentially sends message, and low speed STA only could send message when the fiducial time of buffer queue corresponding to this low speed STA increases to and is more than or equal in buffer queue corresponding to this low speed STA and eats dishes without rice or wine the time shared by single message.Compared to existing token bucket algorithm, whether the present embodiment just can determine the transmission of message timely by the judgement of eating dishes without rice or wine time and fiducial time shared by single message, there is not the time delay producing token when adopting token algorithm, and the situation of cutout can not be produced, therefore the present embodiment can effectively ensure to eat dishes without rice or wine the fairness of time scheduling, in addition, owing to adopting the present embodiment, the message of high speed STA is sent and have precedence over low speed STA, therefore network performance have also been obtained further lifting.
Those skilled in the art can be well understood to, and for convenience and simplicity of description, the equipment of foregoing description and the specific works process of network system, with reference to the corresponding process in preceding method embodiment, can not repeat them here.
In several embodiment provided by the present invention, should be understood that, disclosed system and equipment, can realize by another way.Such as, apparatus embodiments described above is only schematic, such as, the division of described module, be only a kind of logic function to divide, actual can have other dividing mode when realizing, such as multiple module or assembly can in conjunction with or can be integrated in a module.
Last it is noted that above embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to previous embodiment to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein portion of techniques feature; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (14)
1. a mixed insertion network resource regulating method, is characterized in that, comprising:
In a poll, if the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, then time sum of eating dishes without rice or wine in described polled packet buffer queue is less than or equal at least one message of described fiducial time and puts into transmit queue, otherwise, increase the fiducial time of described polled packet buffer queue.
2. mixed insertion network resource regulating method according to claim 1, is characterized in that, also comprise:
In a poll, there is message if only have in a packet buffer queue in all packet buffer queues, then all messages in a described packet buffer queue are put into transmit queue.
3. mixed insertion network resource regulating method according to claim 1 and 2, it is characterized in that, put into the process of transmit queue at least one message time sum of eating dishes without rice or wine in described polled packet buffer queue being less than or equal to described fiducial time, also comprise:
If described transmit queue is full, then abandon the message failing to put into described transmit queue.
4. mixed insertion network resource regulating method according to claim 1 and 2, is characterized in that, the fiducial time of the described polled packet buffer queue of described increase, comprising:
Obtain and preset adjusted value;
The fiducial time of described polled packet buffer queue increases described default adjusted value, to increase described fiducial time;
Or, the fiducial time of the described polled packet buffer queue of described increase, be specially:
The increasing function preset is adopted to increase the fiducial time of described polled packet buffer queue.
5. mixed insertion network resource regulating method according to claim 1 and 2, is characterized in that, before poll, also comprises:
Fiducial time for each packet buffer queue arranges the identical initial baseline time, and stores.
6. mixed insertion network resource regulating method according to claim 5, is characterized in that, also comprise:
According to preset time period, periodically the fiducial time of each packet buffer queue is reset to the described initial baseline time.
7. mixed insertion network resource regulating method according to claim 5, it is characterized in that, the time of described initial baseline time at least one message be cached with in time of eating dishes without rice or wine shared by single message minimum packet buffer queue can be allowed in a poll to put into described transmit queue.
8. a wireless access point device, is characterized in that, comprising:
Scheduler module, for in a poll, when the time of eating dishes without rice or wine shared by single message is less than or equal to the fiducial time of described polled packet buffer queue in polled packet buffer queue, time sum of eating dishes without rice or wine is less than or equal at least one message of described fiducial time puts into transmit queue in described polled packet buffer queue;
Fiducial time, adjusting module, in a poll, when the time of eating dishes without rice or wine shared by single message is greater than the fiducial time of described polled packet buffer queue in polled packet buffer queue, increased the fiducial time of described polled packet buffer queue.
9. wireless access point device according to claim 8, it is characterized in that, described scheduler module, also in a poll, when only have in all packet buffer queues in a packet buffer queue have message time, all messages in a described packet buffer queue are put into transmit queue.
10. wireless access point device according to claim 8 or claim 9, is characterized in that, also comprise:
Described scheduler module, also for putting into the process of transmit queue at least one message time sum of eating dishes without rice or wine in described polled packet buffer queue being less than or equal to described fiducial time, when described transmit queue is full, abandon the message failing to put into described transmit queue.
11. wireless access point devices according to claim 8 or claim 9, it is characterized in that, described fiducial time adjusting module, specifically in a poll, when in polled packet buffer queue, the time of eating dishes without rice or wine shared by single message is greater than the fiducial time of described polled packet buffer queue, obtain and preset adjusted value, and on described fiducial time, increase described default adjusted value, to increase described fiducial time;
Or, described fiducial time adjusting module, specifically in a poll, when the time of eating dishes without rice or wine shared by single message is greater than the fiducial time of described polled packet buffer queue in polled packet buffer queue, the increasing function preset is adopted to increase described fiducial time.
12. wireless access point devices according to claim 8 or claim 9, is characterized in that, also comprise: arrange module, for for arranging the identical initial baseline time, and store fiducial time of each packet buffer queue.
13. wireless access point devices according to claim 12, is characterized in that, also comprise: reset module, for according to preset time period, periodically the fiducial time of each packet buffer queue is reset to the described initial baseline time.
14. 1 kinds of wireless hybrid access networks systems, is characterized in that, comprise arbitrary described wireless access point device and at least two terminals in the claims 8 ~ 13.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310026973.8A CN103068060B (en) | 2013-01-24 | 2013-01-24 | Mixed insertion network resource regulating method, equipment and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310026973.8A CN103068060B (en) | 2013-01-24 | 2013-01-24 | Mixed insertion network resource regulating method, equipment and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103068060A CN103068060A (en) | 2013-04-24 |
| CN103068060B true CN103068060B (en) | 2016-01-27 |
Family
ID=48110473
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310026973.8A Active CN103068060B (en) | 2013-01-24 | 2013-01-24 | Mixed insertion network resource regulating method, equipment and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103068060B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103326844B (en) * | 2013-06-19 | 2016-03-23 | 成都飞鱼星科技股份有限公司 | Based on 802.11 agreement resource allocation methods in composite mode |
| CN103441954B (en) * | 2013-08-27 | 2016-09-28 | 福建星网锐捷网络有限公司 | A kind of file transmitting method, device and the network equipment |
| CN107343293A (en) * | 2016-04-29 | 2017-11-10 | 迈普通信技术股份有限公司 | A kind of link keep-alive method and equipment |
| CN106385387B (en) * | 2016-09-27 | 2019-08-02 | 中国科学院空间应用工程与技术中心 | A kind of resource regulating method, system and the application of Information Network link |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873634A (en) * | 2010-06-18 | 2010-10-27 | 杭州华三通信技术有限公司 | Method and device for scheduling bandwidth on WLAN basis |
| CN101883400A (en) * | 2010-07-06 | 2010-11-10 | 迈普通信技术股份有限公司 | Data transmission method and access control equipment in wireless local area network |
| CN102547868A (en) * | 2012-01-05 | 2012-07-04 | 福建星网锐捷网络有限公司 | Message scheduling method, message scheduling device and network equipment |
-
2013
- 2013-01-24 CN CN201310026973.8A patent/CN103068060B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873634A (en) * | 2010-06-18 | 2010-10-27 | 杭州华三通信技术有限公司 | Method and device for scheduling bandwidth on WLAN basis |
| CN101883400A (en) * | 2010-07-06 | 2010-11-10 | 迈普通信技术股份有限公司 | Data transmission method and access control equipment in wireless local area network |
| CN102547868A (en) * | 2012-01-05 | 2012-07-04 | 福建星网锐捷网络有限公司 | Message scheduling method, message scheduling device and network equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103068060A (en) | 2013-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Luo et al. | A packet scheduling approach to QoS support in multihop wireless networks | |
| CN103220726B (en) | A kind of dynamic adjusting method of EDCA parameter value and relevant apparatus | |
| US10009280B2 (en) | Method and apparatus for providing an efficient multi-client access | |
| CN110113808A (en) | System and method for power control | |
| WO2017005040A1 (en) | Method and device for transmission instruction, transmission triggering and transmission implementation for multi-station | |
| CN103068060B (en) | Mixed insertion network resource regulating method, equipment and system | |
| CN1842979A (en) | System and method for adaptive polling in a WLAN | |
| Kuo et al. | A CSMA-based MAC protocol for WLANs with automatic synchronization capability to provide hard quality of service guarantees | |
| CN102843775B (en) | Dispatching method, dispatching device and network equipment | |
| CN102547868B (en) | Method for dispatching message, device and the network equipment | |
| CN103152834A (en) | Intelligent allocation method for wireless flow | |
| Sharma et al. | Energy-efficient resource scheduling within DRX cycles for LTE-a networks with carrier aggregation | |
| CN113329439B (en) | Resource allocation method based on transmission delay | |
| Karaca et al. | An opportunistic backoff scheme for dense IEEE 802.11 WLANs | |
| CN103327649A (en) | Access equipment site scheduling method and access equipment | |
| Li et al. | Power allocation to achieve maximum throughput in multi-radio multi-channel mesh network | |
| Hayajneh et al. | Multimedia traffic over WLANs: QoS support and performance evaluation | |
| Wang et al. | Increasing opportunistic gain in small cells through energy-aware user cooperation | |
| Liu et al. | A novel internal collision managing mechanism of IEEE 802.11 e EDCA | |
| Oliveira et al. | Maximum-throughput access control in wireless LANs through max-weight-inspired policies | |
| Vijay et al. | Quality of Service Improvements in IEEE 802.11 AX Wi-Fi | |
| Zhai et al. | Large-Scale Micro-Power Sensors Access Scheme Based on Hybrid Mode in IoT Enabled Smart Grid | |
| WO2019157628A1 (en) | Information transmission method, communication device, and storage medium | |
| Wu et al. | An energy-efficient MAC protocol with downlink traffic scheduling strategy in IEEE 802.11 infrastructure WLANs | |
| KR20140034539A (en) | Fairness enhancement scheme for multimedia traffic in ieee 802.11e wireless lans |
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 | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Cangshan District of Fuzhou City, Fujian province 350002 Jinshan Road No. 618 Garden State Industrial Park 19 floor Patentee after: RUIJIE NETWORKS Co.,Ltd. Address before: Cangshan District of Fuzhou City, Fujian province 350002 Jinshan Road No. 618 Garden State Industrial Park 19 floor Patentee before: Beijing Star-Net Ruijie Networks Co.,Ltd. |