CN102264103A - Method and device for sending data - Google Patents
Method and device for sending data Download PDFInfo
- Publication number
- CN102264103A CN102264103A CN2010101946578A CN201010194657A CN102264103A CN 102264103 A CN102264103 A CN 102264103A CN 2010101946578 A CN2010101946578 A CN 2010101946578A CN 201010194657 A CN201010194657 A CN 201010194657A CN 102264103 A CN102264103 A CN 102264103A
- Authority
- CN
- China
- Prior art keywords
- data
- flow control
- control speed
- value
- data volume
- 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
Links
Images
Abstract
The invention discloses a method and a device for sending data, which relate to the field of communication and are used for solving the problem that a data sending rate cannot be dynamically adjusted. The method comprises the following steps of: before the data is sent, determining the current stored data volume of a data buffer which is used for storing data to be sent; determining a flow control rate corresponding to the data volume according to a preset corresponding relation between buffer data volume and the flow control rate; determining the current volume of the data which can be sent; reading the data from the data buffer according to the data volume; and sending the read data according to the determined flow control rate. Visibly, by the method and the device, the aim of dynamically adjusting the data sending rate according to the data volume in the data buffer is fulfilled.
Description
Technical field
The present invention relates to the communications field, relate in particular to a kind of data transmission method for uplink and device.
Background technology
In the use of radio network controller (RNC), the veneer of RNC needs frequently to send data-message to webmaster, such as tracking message report, alarm report etc., for the stability that ensures RNC equipment and alleviate flow attack, must carry out flow control to the transmission of data to webmaster.
Need at first to apply for the data buffer zone of a fixed size in the prior art, determine the transmission rate of a fixed size, the data that needs reported webmaster are kept in the data buffer zone, transmission timer is regularly taken out a certain amount of data from the data buffer zone, and these data are sent to webmaster according to the transmission rate of determining.The data that then need to report after the data buffer zone is full will be dropped, and free space be arranged, as shown in Figure 1 in the data buffer zone.
In realizing process of the present invention, the inventor finds to exist in the prior art following technical problem:
When adopting the fixed-rate transmission data, if this transmission rate is less, from buffering area, overflow the problem that causes data to be dropped thereby then be easy to generate data, if this transmission rate is bigger, then cause system's instantaneous load overweight again easily, thereby influence the stability of system.
Owing to adopt constant transmissions speed, especially when transmission rate hour, may cause data to be dropped, the more important thing is because webmaster and do not know that some data is dropped, being reflected on the network management interface may be exactly that some message is not received, therefore makes maintenance, research staff that deviation is appearred in the judgement of problem easily.
Owing to used the buffering area of fixed size, when data volume is less, but still can take more resource, when data volume is very big, and the internal memory of system can't make full use of the resource of system when well-to-do again, causes abandoning of data.
Summary of the invention
The embodiment of the invention provides a kind of data to send and device, is used to solve the problem that can't dynamically adjust the data transmission rate.
A kind of data transmission method for uplink, this method comprises:
Be identified for storing the current data quantity stored in data buffer zone of data to be sent; According to the corresponding relation of predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of described data volume correspondence;
Determine the current data volume that sends,, and send the data that read according to described Flow Control speed according to this data volume reading of data from described data buffer zone.
A kind of data sending device, this device comprises:
The Flow Control rate determination unit is used to be identified for storing the current data quantity stored in data buffer zone of data to be sent; According to the corresponding relation of predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of described data volume correspondence;
The data volume determining unit is used for determining the current data volume that sends;
Data-reading unit is used for according to described data volume determining unit established data amount, reading of data from described data buffer zone;
Data transmission unit is used for sending the data that described data-reading unit reads according to described Flow Control speed.
Among the present invention, before carrying out the data transmission, be identified for storing the current data quantity stored in data buffer zone of data to be sent, corresponding relation according to predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of this data volume correspondence, determine the current data volume that sends then, and, send the data that read according to the Flow Control speed of determining according to this data volume reading of data from the data buffer zone.As seen, the present invention has realized the purpose according to the big or small dynamic adjusting data transmission rate of the data volume in the data buffer zone.
Description of drawings
Fig. 1 is a Flow Control scheme principle schematic of the prior art;
The method flow schematic diagram that Fig. 2 provides for the embodiment of the invention;
Fig. 3 A is the Flow Control scheme principle schematic in the embodiment of the invention;
Fig. 3 B is the storage schematic flow sheet in the embodiment of the invention;
Fig. 3 C is the data transmission flow schematic diagram in the embodiment of the invention;
The apparatus structure schematic diagram that Fig. 4 provides for the embodiment of the invention.
Embodiment
For solve can not the dynamic adjusting data transmission rate problem, the embodiment of the invention provides a kind of data transmission method for uplink, in this method, before carrying out the data transmission, the Flow Control speed of the current data quantity stored correspondence of specified data buffering area, data in the reading of data buffering area then, and send the data that read according to this Flow Control speed.
Referring to Fig. 2, the data transmission method for uplink that the embodiment of the invention provides specifically may further comprise the steps:
Step 20: the current data quantity stored in data buffer zone that is identified for storing data to be sent;
Step 21: according to the corresponding relation of predefined amount of buffered data and Flow Control speed, the Flow Control speed of established data amount correspondence in the determining step 10;
Step 22: determine the current data volume that sends;
Step 23:, and send the data that read according to the Flow Control speed of determining in the step 21 according to established data amount reading of data from the data buffer zone in the step 22.
The corresponding relation of employed amount of buffered data and Flow Control speed can be set as follows in the step 21, sets step and can be positioned at before the step 21:
At first, determine Flow Control speed basic value and Flow Control speed maximum, Flow Control speed basic value and Flow Control speed maximum are the rate value greater than 0, and Flow Control speed maximum is greater than Flow Control speed basic value.
Then, determine at least one Flow Control speed median, this Flow Control speed median is greater than Flow Control speed basic value and less than Flow Control speed maximum;
Then, the data volume interval division that the maximum amount of data that the minimum data amount that will can be stored by the current data buffering area and this data buffer zone can be stored constitutes is a plurality of subintervals, each subinterval is an amount of buffered data interval, the number in amount of buffered data interval is identical with Flow Control speed number, and the number that described Flow Control speed number is a Flow Control speed median adds 2; The minimum data amount that the data buffer zone can be stored can be 0 or other numerical value of setting arbitrarily;
At last, set up the one-to-one relationship between the interval and Flow Control speed basic value of amount of buffered data, Flow Control speed maximum, the Flow Control speed median, this corresponding relation is the corresponding relation of employed amount of buffered data and Flow Control speed in the step 21.
Above-mentioned definite Flow Control speed basic value and Flow Control speed maximum, its specific implementation can be as follows:
Calculate the ratio of setting data task data volume that produces and the cycle duration that produces data, result of calculation is defined as Flow Control speed basic value; The maximum Flow Control speed that allows during with predefined system busy is defined as Flow Control speed maximum.
Above-mentioned definite at least one Flow Control speed median, its specific implementation can be as follows:
When Flow Control speed basic value and Flow Control speed maximum are 2 integral number power, determine n according to following formula
Max-1 Flow Control speed median V
n:
n
max＝Log
2V
max-Log
2V
base；
Wherein, n is 1 to n
MaxValue between-1, V
BaseBe described Flow Control speed basic value, V
MaxBe Flow Control speed maximum.
The data volume interval division that the maximum amount of data that the above-mentioned minimum data amount that will can be stored by the current data buffering area and this data buffer zone can be stored constitutes is a plurality of subintervals, and its specific implementation can be as follows:
Will be by the 0 maximum amount of data M that can store with the current data buffering area
NThe data volume interval division that constitutes is n
Max+ 1 subinterval; M
NValue be M or Q, M is predefined buffering area basic capacity value, Q is greater than M, the value of Q can be the integral multiple of M, for example the value of Q is 2M;
The start point data value in p subinterval is M
P-1, the endpoint data value is M
p, p is 1 to n
MaxValue between+1;
M
0=0; Value at p is n
Max+ 1 and M
NValue when being Q, M
pValue be Q; M under other situations
NValue be 2
(p-1)* M
Base, wherein,
The above-mentioned one-to-one relationship of setting up between the interval and Flow Control speed basic value of each amount of buffered data, Flow Control speed maximum, each Flow Control speed median, its specific implementation can be as follows:
For each p value, set up p subinterval and V
P-1Corresponding relation.
In the step 12, can determine the current data volume T that sends according to following formula
u:
T
u＝T+T
r；
T＝V
n/Q；
T
r＝Min(0，T
u-1-L
s)；
Wherein, V
nBe described Flow Control speed, Q is the number of times that per second sends data; Min represents to get two minimum values in the value, T
U-1The last data volume of determining that sends of expression, T
U-1Initial value be 0; L
sThe last actual data volume that sends of expression, L
sInitial value be 0;
Accordingly, in the step 23, according to this data volume reading of data from described data buffer zone, its specific implementation can be as follows:
At T
uGreater than 0 and the data buffer zone in when storing data, reading of data amount size is more than or equal to T from the data buffer zone
uData.
Below the present invention is specifically described:
This paper has provided a kind of adaptive flow control methods on the basis of existing scheme, use the strategy of dynamically adjusting Flow Control speed and dynamic adjusting data buffering area, guarantee to the full extent that in support equipment stability data can not be dropped, the principle of this programme as shown in Figure 3A.During the use traffic control strategy, two factors of the loss ratio of data and Flow Control speed and data buffer zone are relevant.When Flow Control speed is big more, data were dropped when buffering area was also big more probability is just more little, but Flow Control speed and buffering area can not be infinitely great, how to establish the key that comparatively suitable Flow Control speed and buffering area are exactly this method.Bottom provides several key algorithms of this programme and process.
Flow Control speed determines that principle and rank dividing mode are as follows:
At first provide a base value and a maximum, base value V for Flow Control speed
BaseRepresent maximum V
MaxRepresent that these two values generally can be estimated by experience, such as V in general communication system
BaseCan get 8kbps, V
MaxCan get 32kbps.Behind the base value and maximum of having established Flow Control speed, need carry out rank to Flow Control speed and divide, following general value principle and the rank partitioning algorithm that provides Flow Control speed respectively.
The value principle of Flow Control speed is as follows:
V
BaseGenerally can get Flow Control task Flow Control average, that is: the cycle duration of data volume/generation data of producing generally speaking of setting data task; V
MaxThe maximum Flow Control speed that the system of generally can getting can allow when busy.These two values should be 2 integral number powers.
Flow Control speed rank dividing mode is as follows:
The rank of Flow Control speed represents that with n rank is fixing since 0, until its maximum, rank is the current use base value Flow Control speed of 0 expression, and rank is that maximum is represented current use maximum Flow Control speed.Other maximum of level n
MaxExpression, computing formula is as follows:
n
max＝Log
2V
max-Log
2V
base
Equally, be easy to release the employed Flow Control speed of each rank V
n, formula is as follows:
For instance, can get V
BaseBe 8kbps, V
Max32kbps, then rank maximum: n
Max=Log
232-Log
28=2 that is to say, can divide 3 ranks, the Flow Control speed of 0 grade of Flow Control correspondence
The Flow Control speed of 1 grade of Flow Control correspondence is 16kbps, and the Flow Control speed of 2 grades of Flow Control correspondences is 32kbps.
It is as follows that the data buffer zone size determines to reach the interval division mode:
In communication equipment, frequently carry out the application of internal memory and the efficient that release can influence system, therefore generally speaking, the size of data buffer zone should be definite substantially initial the time, and concrete size should allow the internal memory that uses and the average amount of data task to combine with system.Can allow it to carry out buffering area expansion for important data task, soon full such as the buffering area that initially provides, and also Flow Control speed has been maximum, this time is not in order to allow loss of data then the data buffer zone can be enlarged as far as possible.
How expanding of buffering area also is to allow to use internal memory situation etc. relevant according to system, if there is more relatively internal memory to use in the system, then buffering area can repeatedly expand, simple in order to describe, this programme advises that the data buffer zone extending method that uses is the expansion of carrying out once that doubles, such as being initially 256KB, can consider buffering area is extended to 512KB when overflowing when data are critical so.After having determined initial data buffer zone size, just need carry out interval division to the data buffering area, the following interval division algorithm that provides the expansion of data buffer zone respectively and discharge algorithm and data buffer zone according to the rank of Flow Control speed.
The expansion and the delivery mode of data buffer zone are as follows:
Need carry out the judgement whether data buffer zone is expanded or discharged in storage during to buffering area, represent data buffer zone initial value size (being buffering area basic capacity value), use β respectively with M
mM and β
fM represents to expand buffer area data volume threshold value and buffer release district data volume threshold value, β
mAnd β
fIt is a coefficient.For fear of the shake (just discharged internal memory and needed to apply for internal memory again) of system, β
fNeed compare β
mLittle, general β
mGet 0.7 or 0.8, β
fGet 0.6, that is to say, the data quantity stored sum surpasses β in the data volume of data to be sent and data buffer zone
mM needs then to apply for that a block size is that the internal memory of M is expanded current data buffer zone, and the data quantity stored sum is less than β in the data volume of data to be sent and data buffer zone
fDuring M, and existed when expanding buffering area, then needed to discharge the memory space of data buffer zone so that the data buffer capacity value equals the data buffer zone initial value.
The interval division mode of data buffer zone is as follows: according to the rank that Flow Control speed is divided the data buffering area is carried out interval division.Suppose that Flow Control buffering area initial value size is M, then can be divided into M N interval, N=n
Max+ 1, and the N span be [1, n
Max+ 1], and promptly (0, M
1], (M
1, M
2] ... (M
N-1, M
N], being calculated as follows of interval threshold value then:
M wherein
BaseExpression is corresponding to the base value of the data buffer zone of Flow Control speed base value, and computational methods are as follows:
So just can obtain the mapping relations in Flow Control speed and interval, data buffer zone, V0 → (0, M1], V1 → (M1, M2] ... Vn → (MN-1, MN].So just can use dynamic flow speed to carry out the control of flow easily, promptly when the data of storage fall within certain interval, then use the pairing Flow Control speed in this interval according to these mapping relations.
Continue to use the data of a last example, use 3 grades of Flow Controls, wherein Flow Control rank maximum n
MaxBe 2, tentation data buffering area initial value M=256KB, then
M
1=64KB, M
2=128KB, M
3=256KB, if used double to expand the method for adjustment of buffering after, M then
3=512KB.The corresponding relation of Flow Control speed rank and data buffer zone is as follows like this:
V0 → (0KB, 64KB], V1 → (64KB, 128KB], V2 → (128KB, 256KB], if adopt buffering to double expansion, then V2 → (128KB, 512KB].Like this, when the data in the buffering area when 64KB is following, then use 0 grade of Flow Control speed, get final product by that analogy.
Flow Control token strategy is as follows:
In communication system, at interval the carrying out of long period wrapped data greatly and sends high many of efficient than the data that frequently send away a parcel, and the impact that system brought is much smaller.So the transmission frequency that the strategy of employing timer generation Flow Control token comes control data in this programme, so-called token is exactly the data volume that can send.Adopted the 200ms timer in this programme, promptly per second carries out the transmission of 5 secondary data, then can send data volume at every turn and be
(unit of Vn is bps, and promptly bit/s sends just per 1/5 second at every turn and once sends, and the s in the unit just can fall approximately like this, thereby the unit that obtains is bit, if do not do specified otherwise, hereinafter mentioned computing is not always the case.)
Each Flow Control timer comes then, need and cushion trivial corresponding relation according to Flow Control speed, determines the Flow Control speed of use, checks promptly which buffering area is current data of having stored drop between, then just uses the pairing Flow Control speed in this interval.
The packet that often sends in the communication system is a kind of bounded packet rather than data flow, must send a complete packet at least when promptly sending data at every turn, otherwise the data that send will be incomplete, can not recognition data thereby cause webmaster to receive, therefore each actual data that send may token quantity more than, the following computational methods that specifically describe the Flow Control token.
Represent the new token quantity that each Flow Control timer is produced with T, use V
nExpression Flow Control speed is used T
uExpression available tokens quantity, T
rRepresent remaining token quantity last time, L wherein
sThe data volume of expression transmission last time, T
U-1The token number that expression is last available, so following formula is arranged:
T
u＝T+T
r
Min represents to get two minimum values in the value, from T
rComputing formula in remained token quantity T as can be seen last time
rNever can be greater than 0, this is because the principle that has adopted token not save bit by bit in this programme.When the token timer arrives, offset remaining token quantity T last time with the new token quantity T that produces
rObtain available tokens quantity T
uIf, should be worth smaller or equal to 0, then stop to send, wait for that the token timer arrives next time.If should be worth greater than 0, and data are arranged in the buffering area, and then complete packet is taken out in circulation, sends, and each circulation all needs to deduct the data volume that has sent from available tokens quantity, up to available token number smaller or equal to 0 or the data buffer zone be sky.
The reason that why adopts token not save bit by bit is exactly to prevent that buffering area from not having data to send the token that the result has accumulated flood tide for a long time, data have been filled up when the data buffer zone so suddenly, and because a large amount of effective tokens is arranged, the system that so just makes has sent mass data at short notice, thereby has lost the meaning of Flow Control.
For instance, simple in order to describe, we suppose to use fixing Flow Control speed, and this speed is 8kbps, when then each Flow Control timer comes, and the new token quantity T=V that produces
n/ 5=8000b/5=1000B/5=200Bytes, (1Byte=8bit, Byte represent that with B bit represents with b).This available tokens is counted T
u=T+T
r, because T the most initial the time
rBe 0, so this available tokens is counted T
u=T+T
r=200+0=200Bytes.Explanation in two kinds of situation:
First kind of situation supposed that the data that 500Bytes is arranged in the buffering area will send (because these data are complete packets, can not cut apart, must once distribute), after being sent completely, wait for that next Flow Control regularly arrives, when next time, the Flow Control timer arrived, available token number was calculated as follows T
u=T+T
r=200+Tr, the token number T that can use last time
U-1=200, L
s=500, T then
r=Min (0, T
U-1-L
s)=Min (0,200-500)=-300Bytes, so T
u=-100Bytes in other words, can not send even if there are data to send in the buffering area, because there is not token to use.
Second kind of situation supposes to have in the buffering area data of 100Bytes to send, and after being sent completely, waits for that next Flow Control regularly arrives, and when next Flow Control timer arrived, available token number was calculated as follows T
u=T+T
r=200+Tr, available token number is calculated as follows T
u=T+T
r=200+T
r, the token number T that can use last time
U-1=200, L
s=100, T then
r=Min (0, T
U-1-L
s)=Min (0,200-100)=0Bytes, so T
u=200Bytes if in the buffering area data are arranged like this, can also send, up to available tokens smaller or equal to 0.
This programme comprises that two processes are data storage procedure and data transmission procedure, and data storage procedure is to be triggered by the data task, and data transmission procedure then is to be triggered by the Flow Control timer, and bottom provides the detailed description of two processes.
The text description of data storage procedure is as follows, and flow chart is shown in Fig. 3 B:
Step 1: when producing data to be sent, calculate expection storage data volume, i.e. data quantity stored sum in the data volume of data to be sent and the current data buffering area;
Step 2: whether judge expection storage data volume greater than expansion buffer area data volume threshold value, if, then arrive step 3, otherwise, to step 6;
Step 3: judge whether to have applied for the expansion buffering area, promptly whether the capability value of current data buffering area is predefined buffering area basic capacity value, if, then arrive step 5, otherwise, to step 4;
Step 4: buffering area is expanded in application, promptly expands the capacity of current data buffering area;
Step 5: whether the data volume of judging data to be sent is less than or equal to storable data volume between the free area of current data buffering area, if, then arrive step 9, otherwise, to step 10;
Step 6: judge whether to have applied for the expansion buffering area, promptly whether the capability value of current data buffering area is greater than predefined buffering area basic capacity value; If, then arrive step 7, otherwise, to step 9;
Step 7: whether judge expection storage data volume less than buffer release district data volume threshold value, if, then arrive step 8, otherwise, to step 9;
Step 8: the buffer pool size that discharges expansion;
Step 9: in the data buffer zone, flow process finishes with storage to be sent;
Step 10: abandon data to be sent and produce the data Discard alarm, flow process finishes.
The text description of data transmission procedure is as follows, and flow chart is shown in Fig. 3 C:
Step 1: during the Flow Control timer expiry, determine the data volume of current data buffer stores; According to the corresponding relation of predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of this data volume correspondence; And generate new token, new token quantity T=V
n/ Q, V
nBe the Flow Control speed of determining, Q is the number of times that per second sends data;
Step 2: calculate effective token quantity T
u=T+T
r, T
rFor last data send remaining token quantity, T
r=Min (0, T
U-1-L
s), T
U-1Represent the data volume that sends definite when last data send; L
sThe data volume of representing actual transmission when last data send;
Step 3: whether judge effective token quantity greater than 0, if, then arrive step 4, otherwise, to step 7;
Step 4: judge whether there are data in the current data buffering area, if, then arrive step 5, otherwise, to step 8;
Step 5: from the data buffer zone, read bag data and transmission;
Step 6: upgrade effective token quantity, new effective token quantity equals the data volume that old effective token quantity deducts transmission, to step 3;
Step 7: it is effective token quantity that residue token quantity is set, and this implementation finishes.
Step 8: it is 0 that residue token quantity is set, and this implementation finishes.
Referring to Fig. 4, the embodiment of the invention also provides a kind of data sending device, and this device comprises:
Flow Control rate determination unit 40 is used to be identified for storing the current data quantity stored in data buffer zone of data to be sent; According to the corresponding relation of predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of described data volume correspondence;
Data volume determining unit 41 is used for determining the current data volume that sends;
Data-reading unit 42 is used for according to described data volume determining unit established data amount, reading of data from described data buffer zone;
This device also comprises:
Corresponding relation setup unit 44 is used for determining Flow Control speed basic value and Flow Control speed maximum that Flow Control speed maximum is greater than Flow Control speed basic value;
Determine at least one Flow Control speed median, this Flow Control speed median is greater than described Flow Control speed basic value and less than described Flow Control speed maximum;
The data volume interval division that the maximum amount of data that the minimum data amount that will can be stored by the current data buffering area and this data buffer zone can be stored constitutes is a plurality of subintervals, each subinterval is an amount of buffered data interval, the number in amount of buffered data interval is identical with Flow Control speed number, and the number that described Flow Control speed number is a Flow Control speed median adds 2;
Set up the one-to-one relationship between the interval and Flow Control speed basic value of amount of buffered data, Flow Control speed maximum, the Flow Control speed median, and this corresponding relation is passed to described Flow Control rate determination unit as the corresponding relation of amount of buffered data and Flow Control speed.
Described corresponding relation setup unit 44 is used for:
Calculate the ratio of setting data task data volume that produces and the cycle duration that produces data, result of calculation is defined as Flow Control speed basic value;
The maximum Flow Control speed that allows during with predefined system busy is defined as Flow Control speed maximum.
Described corresponding relation setup unit 44 is used for:
When described Flow Control speed basic value and Flow Control speed maximum are 2 integral number power, determine n according to following formula
Max-1 Flow Control speed median V
n:
n
max＝Log
2V
max-Log
2V
base；
Wherein, n is 1 to n
MaxValue between-1, V
BaseBe described Flow Control speed basic value, V
MaxBe Flow Control speed maximum.
Described corresponding relation setup unit 44 is used for:
Will be by the 0 maximum amount of data M that can store with the current data buffering area
NThe data volume interval division that constitutes is n
Max+ 1 subinterval; M
NValue be M or Q, M is predefined buffering area basic capacity value, Q is greater than M;
The start point data value in p subinterval is M
P-1, the endpoint data value is M
p, p is 1 to n
MaxValue between+1;
M
0=0; Value at p is n
Max+ 1 and M
NValue when being Q, M
pValue be Q; M under other situations
NValue be 2
(p-1)* M
Base, wherein,
Described corresponding relation setup unit 44 is used for:
For each p value, set up p subinterval and V
P-1Corresponding relation.
Described data volume determining unit is used for:
Determine the current data volume T that sends according to following formula
u:
T
u＝T+T
r；
T＝V
n/Q；
T
r＝Min(0，T
u-1-L
s)；
Wherein, V
nBe described Flow Control speed, Q is the number of times that per second sends data; Min represents to get two minimum values in the value, T
U-1The last data volume of determining that sends of expression, T
U-1Initial value be 0; L
sThe last actual data volume that sends of expression, L
sInitial value be 0;
Described data-reading unit 42 is used for:
At T
uGreater than 0 and the data buffer zone in when storing data, reading of data amount size is more than or equal to T from described data buffer zone
uData.
This device further comprises:
Whether determine expection storage data volume greater than predefined expansion buffer area data volume threshold value, if then when described data buffer capacity value is predefined buffering area basic capacity value, expand the capacity of described buffering area; Described expansion buffer area data volume threshold value is less than described buffering area basic capacity value;
The data to be sent that produce are put into data buffer zone after the capacity extension.
Described data storage cell 45 also is used for:
When determining that expection storage data volume is not more than predefined expansion buffer area data volume threshold value, determine expection storage data volume whether less than predefined buffer release district data volume threshold value and described data buffer capacity value greater than predefined buffering area basic capacity value, if then discharge the memory space of described data buffer zone so that the data buffer capacity value equals described buffering area basic capacity value; Described buffer release district data volume threshold value is less than described buffering area basic capacity value; Described buffer release district data volume threshold value is less than described expansion buffer area data volume threshold value;
The data to be sent that produce are put into data buffer zone after the space discharges.
The value of described expansion buffer area data volume threshold value is β
m* M, the value of described buffer release district data volume threshold value is β
f* M, β
mAnd β
fFor greater than 0 and less than 1 decimal, β
mGreater than β
f, M is described buffering area basic capacity value.
To sum up, beneficial effect of the present invention comprises:
In the scheme that the embodiment of the invention provides, before carrying out the data transmission, be identified for storing the current data quantity stored in data buffer zone of data to be sent, corresponding relation according to predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of this data volume correspondence, determine the current data volume that sends then, and, send the data that read according to the Flow Control speed of determining according to this data volume reading of data from the data buffer zone.As seen, the present invention has realized the purpose according to the big or small dynamic adjusting data transmission rate of the data volume in the data buffer zone.
The data that the present invention program can be used in the equipment such as the Access Network, core net of Telecommunication network equipment send, report process, such as message tracking, alarm report etc.
The present invention program has realized dynamic adjustment Flow Control speed, in support equipment stability, has guaranteed that to the full extent data are not dropped.Also avoided carrying out within limits the trouble of manual adjustment speed, and energy proactive notification webmaster when data are dropped, so that in time carry out manual intervention, for example can consider under the situation that system allows, whether the flank speed threshold value is enlarged, perhaps whether use repeatedly buffering area expansion etc.
The present invention program has realized dynamic adjustment buffer size, makes that the resource of system can more abundant effective utilization.
Those skilled in the art should understand that embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt complete hardware embodiment, complete software implementation example or in conjunction with the form of the embodiment of software and hardware aspect.And the present invention can adopt the form that goes up the computer program of implementing in one or more computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) that wherein include computer usable program code.
The present invention is that reference is described according to the flow chart and/or the block diagram of method, equipment (system) and the computer program of the embodiment of the invention.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or the block diagram and/or square frame and flow chart and/or the block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, make the instruction of carrying out by the processor of computer or other programmable data processing device produce to be used for the device of the function that is implemented in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame appointments.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, make the instruction that is stored in this computer-readable memory produce the manufacture that comprises command device, this command device is implemented in the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame.
These computer program instructions also can be loaded on computer or other programmable data processing device, make on computer or other programmable devices and to carry out the sequence of operations step producing computer implemented processing, thereby the instruction of carrying out on computer or other programmable devices is provided for being implemented in the step of the function of appointment in flow process of flow chart or a plurality of flow process and/or square frame of block diagram or a plurality of square frame.
Although described the preferred embodiments of the present invention, in a single day those skilled in the art get the basic creative notion of cicada, then can make other change and modification to these embodiment.So claims are intended to all changes and the modification that are interpreted as comprising preferred embodiment and fall into the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.
Claims (21)
1. a data transmission method for uplink is characterized in that, this method comprises:
Be identified for storing the current data quantity stored in data buffer zone of data to be sent; According to the corresponding relation of predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of described data volume correspondence;
Determine the current data volume that sends,, and send the data that read according to described Flow Control speed according to this data volume reading of data from described data buffer zone.
2. the method for claim 1 is characterized in that, the corresponding relation of setting amount of buffered data and Flow Control speed comprises:
Determine Flow Control speed basic value and Flow Control speed maximum, Flow Control speed maximum is greater than Flow Control speed basic value;
Determine at least one Flow Control speed median, this Flow Control speed median is greater than described Flow Control speed basic value and less than described Flow Control speed maximum;
The data volume interval division that the maximum amount of data that the minimum data amount that will can be stored by the current data buffering area and this data buffer zone can be stored constitutes is a plurality of subintervals, each subinterval is an amount of buffered data interval, the number in amount of buffered data interval is identical with Flow Control speed number, and the number that described Flow Control speed number is a Flow Control speed median adds 2;
Set up the one-to-one relationship between amount of buffered data interval and Flow Control speed basic value, Flow Control speed maximum, the Flow Control speed median.
3. method as claimed in claim 2 is characterized in that, described definite Flow Control speed basic value and Flow Control speed maximum comprise:
Calculate the ratio of setting data task data volume that produces and the cycle duration that produces data, result of calculation is defined as Flow Control speed basic value;
The maximum Flow Control speed that allows during with predefined system busy is defined as Flow Control speed maximum.
4. as claim 2 or 3 described methods, it is characterized in that, when described Flow Control speed basic value and Flow Control speed maximum are 2 integral number power, describedly determine that at least one Flow Control speed median comprises:
Determine n according to following formula
Max-1 Flow Control speed median V
n:
n
max＝Log
2V
max-Log
2V
base；
Wherein, n is 1 to n
MaxValue between-1, V
BaseBe described Flow Control speed basic value, V
MaxBe Flow Control speed maximum.
5. method as claimed in claim 4 is characterized in that, the data volume interval division that the maximum amount of data that the described minimum data amount that will can be stored by the current data buffering area and this data buffer zone can be stored constitutes is that a plurality of subintervals comprise:
Will be by the 0 maximum amount of data M that can store with the current data buffering area
NThe data volume interval division that constitutes is n
Max+ 1 subinterval; M
NValue be M or Q, M is predefined buffering area basic capacity value, Q is greater than M;
The start point data value in p subinterval is M
P-1, the endpoint data value is M
p, p is 1 to n
MaxValue between+1;
M
0=0; Value at p is n
Max+ 1 and M
NValue when being Q, M
pValue be Q; M under other situations
NValue be 2
(p-1)* M
Base, wherein,
6. method as claimed in claim 5 is characterized in that, the described one-to-one relationship of setting up between the interval and Flow Control speed basic value of each amount of buffered data, Flow Control speed maximum, each Flow Control speed median comprises:
For each p value, set up p subinterval and V
P-1Corresponding relation.
7. the method for claim 1 is characterized in that, determines the current data volume T that sends according to following formula
u:
T
u＝T+T
r；
T＝V
n/Q；
T
r＝Min(0，T
u-1-L
s)；
Wherein, V
nBe described Flow Control speed, Q is the number of times that per second sends data; Min represents to get two minimum values in the value, T
U-1The last data volume of determining that sends of expression, T
U-1Initial value be 0; L
sThe last actual data volume that sends of expression, L
sInitial value be 0;
Describedly comprise according to this data volume reading of data from described data buffer zone:
At T
uGreater than 0 and the data buffer zone in when storing data, reading of data amount size is more than or equal to T from described data buffer zone
uData.
8. the method for claim 1 is characterized in that, this method further comprises:
When producing data to be sent, calculate data quantity stored sum in the data volume of these data to be sent and the described data buffer zone, with result of calculation as expection storage data volume;
Whether determine expection storage data volume greater than predefined expansion buffer area data volume threshold value, if then when described data buffer capacity value is predefined buffering area basic capacity value, expand the capacity of described buffering area; Described expansion buffer area data volume threshold value is less than described buffering area basic capacity value;
The data to be sent that produce are put into data buffer zone after the capacity extension.
9. method as claimed in claim 8 is characterized in that, when determining that expection storage data volume is not more than predefined expansion buffer area data volume threshold value, this method further comprises:
Determine expection storage data volume whether less than predefined buffer release district data volume threshold value and described data buffer capacity value greater than predefined buffering area basic capacity value, if then discharge the memory space of described data buffer zone so that the data buffer capacity value equals described buffering area basic capacity value; Described buffer release district data volume threshold value is less than described buffering area basic capacity value;
The data to be sent that produce are put into data buffer zone after the space discharges.
10. method as claimed in claim 9 is characterized in that, described buffer release district data volume threshold value is less than described expansion buffer area data volume threshold value.
11. method as claimed in claim 10 is characterized in that, the value of described expansion buffer area data volume threshold value is β
m* M, the value of described buffer release district data volume threshold value is β
f* M, β
mAnd β
fFor greater than 0 and less than 1 decimal, β
mGreater than β
f, M is described buffering area basic capacity value.
12. a data sending device is characterized in that, this device comprises:
The Flow Control rate determination unit is used to be identified for storing the current data quantity stored in data buffer zone of data to be sent; According to the corresponding relation of predefined amount of buffered data and Flow Control speed, determine the Flow Control speed of described data volume correspondence;
The data volume determining unit is used for determining the current data volume that sends;
Data-reading unit is used for according to described data volume determining unit established data amount, reading of data from described data buffer zone;
Data transmission unit is used for sending the data that described data-reading unit reads according to described Flow Control speed.
13. device as claimed in claim 12 is characterized in that, this device also comprises:
The corresponding relation setup unit is used for determining Flow Control speed basic value and Flow Control speed maximum that Flow Control speed maximum is greater than Flow Control speed basic value;
Determine at least one Flow Control speed median, this Flow Control speed median is greater than described Flow Control speed basic value and less than described Flow Control speed maximum;
The data volume interval division that the maximum amount of data that the minimum data amount that will can be stored by the current data buffering area and this data buffer zone can be stored constitutes is a plurality of subintervals, each subinterval is an amount of buffered data interval, the number in amount of buffered data interval is identical with Flow Control speed number, and the number that described Flow Control speed number is a Flow Control speed median adds 2;
Set up the one-to-one relationship between the interval and Flow Control speed basic value of amount of buffered data, Flow Control speed maximum, the Flow Control speed median, and this corresponding relation is passed to described Flow Control rate determination unit as the corresponding relation of amount of buffered data and Flow Control speed.
14. device as claimed in claim 13 is characterized in that, described corresponding relation setup unit is used for:
Calculate the ratio of setting data task data volume that produces and the cycle duration that produces data, result of calculation is defined as Flow Control speed basic value;
The maximum Flow Control speed that allows during with predefined system busy is defined as Flow Control speed maximum.
15., it is characterized in that described corresponding relation setup unit is used for as claim 13 or 14 described devices:
When described Flow Control speed basic value and Flow Control speed maximum are 2 integral number power, determine n according to following formula
Max-1 Flow Control speed median V
n:
n
max＝Log
2V
max-Log
2V
base；
Wherein, n is 1 to n
MaxValue between-1, V
BaseBe described Flow Control speed basic value, V
MaxBe Flow Control speed maximum.
16. device as claimed in claim 15 is characterized in that, described corresponding relation setup unit is used for:
Will be by the 0 maximum amount of data M that can store with the current data buffering area
NThe data volume interval division that constitutes is n
Max+ 1 subinterval; M
NValue be M or Q, M is predefined buffering area basic capacity value, Q is greater than M;
The start point data value in p subinterval is M
P-1, the endpoint data value is M
p, p is 1 to n
MaxValue between+1;
M
0=0; Value at p is n
Max+ 1 and M
NValue when being Q, M
pValue be Q; M under other situations
NValue be 2
(p-1)* M
Base, wherein,
17. device as claimed in claim 16 is characterized in that, described corresponding relation setup unit is used for:
For each p value, set up p subinterval and V
P-1Corresponding relation.
18. device as claimed in claim 12 is characterized in that, described data volume determining unit is used for:
Determine the current data volume T that sends according to following formula
u:
T
u＝T+T
r；
T＝V
n/Q；
T
r＝Min(0，T
u-1-L
s)；
Wherein, V
nBe described Flow Control speed, Q is the number of times that per second sends data; Min represents to get two minimum values in the value, T
U-1The last data volume of determining that sends of expression, T
U-1Initial value be 0; L
sThe last actual data volume that sends of expression, L
sInitial value be 0;
Described data volume reading unit is used for:
At T
uGreater than 0 and the data buffer zone in when storing data, reading of data amount size is more than or equal to T from described data buffer zone
uData.
19. device as claimed in claim 12 is characterized in that, this device further comprises:
Data storage cell is used for when producing data to be sent, and data quantity stored sum in the data volume of calculating these data to be sent and the described data buffer zone is stored data volume with result of calculation as expection;
Whether determine expection storage data volume greater than predefined expansion buffer area data volume threshold value, if then when described data buffer capacity value is predefined buffering area basic capacity value, expand the capacity of described buffering area; Described expansion buffer area data volume threshold value is less than described buffering area basic capacity value;
The data to be sent that produce are put into data buffer zone after the capacity extension.
20. device as claimed in claim 19 is characterized in that, described data storage cell also is used for:
When determining that expection storage data volume is not more than predefined expansion buffer area data volume threshold value, determine expection storage data volume whether less than predefined buffer release district data volume threshold value and described data buffer capacity value greater than predefined buffering area basic capacity value, if then discharge the memory space of described data buffer zone so that the data buffer capacity value equals described buffering area basic capacity value; Described buffer release district data volume threshold value is less than described buffering area basic capacity value;
The data to be sent that produce are put into data buffer zone after the space discharges.
21. device as claimed in claim 20 is characterized in that, described buffer release district data volume threshold value is less than described expansion buffer area data volume threshold value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010194657.8A CN102264103B (en) | 2010-05-28 | 2010-05-28 | Method and device for sending data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010194657.8A CN102264103B (en) | 2010-05-28 | 2010-05-28 | Method and device for sending data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102264103A true CN102264103A (en) | 2011-11-30 |
| CN102264103B CN102264103B (en) | 2014-05-07 |
Family
ID=45010504
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010194657.8A Active CN102264103B (en) | 2010-05-28 | 2010-05-28 | Method and device for sending data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102264103B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102695058A (en) * | 2012-05-30 | 2012-09-26 | 北京世纪鼎点软件有限公司 | Vast-scale buffering policy-based audio/video code stream control method |
| CN103973407A (en) * | 2014-05-28 | 2014-08-06 | 北京经纬恒润科技有限公司 | Data transmission rate matching method and device of remote data transmission system |
| CN104503417A (en) * | 2015-01-13 | 2015-04-08 | 华自科技股份有限公司 | System for monitoring hydropower station |
| CN104869073A (en) * | 2014-02-26 | 2015-08-26 | 中兴通讯股份有限公司 | Flow control method and device |
| CN105591954A (en) * | 2015-10-28 | 2016-05-18 | 杭州华三通信技术有限公司 | Message control method and device |
| CN105843819A (en) * | 2015-01-15 | 2016-08-10 | 中国移动通信集团河南有限公司 | Method and device for exporting data |
| CN106788877A (en) * | 2015-11-24 | 2017-05-31 | 中国移动通信集团浙江有限公司 | A kind of data service upstream rate method of adjustment, terminal and radio network controller |
| CN108770023A (en) * | 2018-06-12 | 2018-11-06 | Oppo广东移动通信有限公司 | Wireless communication transmission method, device, mobile terminal and computer read/write memory medium |
| CN108881970A (en) * | 2017-05-15 | 2018-11-23 | 豪威科技股份有限公司 | The method and apparatus of buffer area perception emission rate control for real-time video streaming Transmission system |
| CN109245981A (en) * | 2018-10-25 | 2019-01-18 | 浙江中控技术股份有限公司 | A kind of dispatching method and system of field bus communication |
| CN109391694A (en) * | 2018-10-26 | 2019-02-26 | 深圳壹账通智能科技有限公司 | Document transmission method and relevant device based on SFTP |
| CN112261634A (en) * | 2020-10-19 | 2021-01-22 | Tcl通讯（宁波）有限公司 | Bluetooth transmission control method, device, terminal equipment and storage medium |
| CN113806072A (en) * | 2021-08-10 | 2021-12-17 | 中标慧安信息技术股份有限公司 | Data processing method and system based on edge calculation |
| CN115913462A (en) * | 2022-11-09 | 2023-04-04 | 中国人民解放军32039部队 | Network data sending method and data sending module based on pre-planning |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050239435A1 (en) * | 2003-03-31 | 2005-10-27 | Eiji Ikeda | Wireless communication network and flow control method |
| US20060034168A1 (en) * | 2004-08-13 | 2006-02-16 | Alcatel | Method for data flow control in a mobile communications system |
| CN1941954A (en) * | 2005-09-29 | 2007-04-04 | 中兴通讯股份有限公司 | Method for controlling HSDPA flow based on feedback mode |
| CN101204048A (en) * | 2005-04-01 | 2008-06-18 | Ip无线有限公司 | Flow control in a cellular communication system |
-
2010
- 2010-05-28 CN CN201010194657.8A patent/CN102264103B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050239435A1 (en) * | 2003-03-31 | 2005-10-27 | Eiji Ikeda | Wireless communication network and flow control method |
| US20060034168A1 (en) * | 2004-08-13 | 2006-02-16 | Alcatel | Method for data flow control in a mobile communications system |
| CN101204048A (en) * | 2005-04-01 | 2008-06-18 | Ip无线有限公司 | Flow control in a cellular communication system |
| CN1941954A (en) * | 2005-09-29 | 2007-04-04 | 中兴通讯股份有限公司 | Method for controlling HSDPA flow based on feedback mode |
Non-Patent Citations (3)
| Title |
|---|
| 《复旦大学博士学位论文》 20051115 刘岩 网络流量控制若干关键技术研究 全文 1-21 , * |
| MARC C.NECKER,ANDREAS WEBER: "Impact of Iub flow control on HSDPA system performance", 《IEEE》, 14 September 2005 (2005-09-14) * |
| 刘岩: "网络流量控制若干关键技术研究", 《复旦大学博士学位论文》, 15 November 2005 (2005-11-15) * |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102695058B (en) * | 2012-05-30 | 2014-07-02 | 北京世纪鼎点软件有限公司 | Vast-scale buffering policy-based audio/video code stream control method |
| CN102695058A (en) * | 2012-05-30 | 2012-09-26 | 北京世纪鼎点软件有限公司 | Vast-scale buffering policy-based audio/video code stream control method |
| CN104869073B (en) * | 2014-02-26 | 2019-09-06 | 中兴通讯股份有限公司 | A kind of flow control methods and device |
| CN104869073A (en) * | 2014-02-26 | 2015-08-26 | 中兴通讯股份有限公司 | Flow control method and device |
| CN103973407A (en) * | 2014-05-28 | 2014-08-06 | 北京经纬恒润科技有限公司 | Data transmission rate matching method and device of remote data transmission system |
| CN103973407B (en) * | 2014-05-28 | 2017-08-11 | 北京经纬恒润科技有限公司 | The message transmission rate matching process and device of remote data transmission system |
| CN104503417A (en) * | 2015-01-13 | 2015-04-08 | 华自科技股份有限公司 | System for monitoring hydropower station |
| CN104503417B (en) * | 2015-01-13 | 2017-06-23 | 华自科技股份有限公司 | A kind of Hydropower Station Monitor system |
| CN105843819A (en) * | 2015-01-15 | 2016-08-10 | 中国移动通信集团河南有限公司 | Method and device for exporting data |
| CN105591954A (en) * | 2015-10-28 | 2016-05-18 | 杭州华三通信技术有限公司 | Message control method and device |
| CN106788877A (en) * | 2015-11-24 | 2017-05-31 | 中国移动通信集团浙江有限公司 | A kind of data service upstream rate method of adjustment, terminal and radio network controller |
| CN106788877B (en) * | 2015-11-24 | 2020-03-10 | 中国移动通信集团浙江有限公司 | Data service uplink rate adjusting method, terminal and wireless network controller |
| CN108881970B (en) * | 2017-05-15 | 2021-10-22 | 豪威科技股份有限公司 | Method and apparatus for transmission rate control for real-time video streaming systems |
| CN108881970A (en) * | 2017-05-15 | 2018-11-23 | 豪威科技股份有限公司 | The method and apparatus of buffer area perception emission rate control for real-time video streaming Transmission system |
| CN108770023A (en) * | 2018-06-12 | 2018-11-06 | Oppo广东移动通信有限公司 | Wireless communication transmission method, device, mobile terminal and computer read/write memory medium |
| CN109245981A (en) * | 2018-10-25 | 2019-01-18 | 浙江中控技术股份有限公司 | A kind of dispatching method and system of field bus communication |
| CN109245981B (en) * | 2018-10-25 | 2021-06-22 | 浙江中控技术股份有限公司 | Scheduling method and system for field bus communication |
| CN109391694A (en) * | 2018-10-26 | 2019-02-26 | 深圳壹账通智能科技有限公司 | Document transmission method and relevant device based on SFTP |
| CN109391694B (en) * | 2018-10-26 | 2022-07-26 | 深圳壹账通智能科技有限公司 | SFTP-based file transmission method and related equipment |
| CN112261634A (en) * | 2020-10-19 | 2021-01-22 | Tcl通讯（宁波）有限公司 | Bluetooth transmission control method, device, terminal equipment and storage medium |
| CN112261634B (en) * | 2020-10-19 | 2023-08-08 | 深圳市嘀嘟科技有限公司 | Bluetooth transmission control method and device, terminal equipment and storage medium |
| CN113806072A (en) * | 2021-08-10 | 2021-12-17 | 中标慧安信息技术股份有限公司 | Data processing method and system based on edge calculation |
| CN115913462A (en) * | 2022-11-09 | 2023-04-04 | 中国人民解放军32039部队 | Network data sending method and data sending module based on pre-planning |
| CN115913462B (en) * | 2022-11-09 | 2023-08-08 | 中国人民解放军32039部队 | Network data transmission method and data transmission module based on advance planning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102264103B (en) | 2014-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102264103B (en) | Method and device for sending data | |
| Sharma et al. | Optimal energy management policies for energy harvesting sensor nodes | |
| CN102622273B (en) | Self-learning load prediction based cluster on-demand starting method | |
| CN107483351B (en) | Current limiting method and device | |
| CN102314191B (en) | Adjusting frequency of self-adaptive memory | |
| US20120149422A1 (en) | Method of transmit power control for a random access channel and the computer program product thereof | |
| US20110128889A1 (en) | Method for Selecting and Configuring Network Supernodes | |
| US9351170B2 (en) | Renewable energy base station and coverage adjustment method therefor, and wireless cellular system | |
| CN101772061A (en) | Sleeping timer control method and device and communication system | |
| EP2501202A1 (en) | Communication base station and processing method for power amplification thereof | |
| CN110571838B (en) | Energy storage battery early peak load reduction control method and device | |
| US20170257728A1 (en) | Method and apparatus for energy adaptive resource allocation in energy harvesting network | |
| CN113490184B (en) | Random access resource optimization method and device for intelligent factory | |
| CN101815323A (en) | Self-adaptive communication method in wireless sensor network cluster | |
| CN106899678B (en) | High-efficiency data transmission method and system for dynamically balancing energy Internet network bandwidth | |
| CN103476074A (en) | Method and equipment for resource preemption | |
| US20200036186A1 (en) | Smart grid timing synchronization method, system, device and computer readable storage medium | |
| CN106878958A (en) | Fast propagation method based on adjustable duty cycle in the self-defined wireless network of software | |
| CN102780621A (en) | Method and device for sending uplink data packets and network equipment | |
| CN103458520A (en) | Allocation method and device of uplink frequency domain resources | |
| CN113659597A (en) | Flywheel energy storage control method and device | |
| CN103957602A (en) | Dynamic access control method for dynamic channel of wireless sensor network | |
| CN103929776B (en) | A kind of jamming control method and device of MTC device access network | |
| CN110602798B (en) | Distributed determination method for optimal parameters of LTE network machine communication random access | |
| CN108964096B (en) | Energy storage configuration method, system and device for consuming electric energy abandoned by new energy |
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 |