CN102694723A - Method and device for scheduling quality of service for variable-length messages - Google Patents
Method and device for scheduling quality of service for variable-length messages Download PDFInfo
- Publication number
- CN102694723A CN102694723A CN2012101519986A CN201210151998A CN102694723A CN 102694723 A CN102694723 A CN 102694723A CN 2012101519986 A CN2012101519986 A CN 2012101519986A CN 201210151998 A CN201210151998 A CN 201210151998A CN 102694723 A CN102694723 A CN 102694723A
- Authority
- CN
- China
- Prior art keywords
- time
- message
- actual
- arrival
- expected
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000004364 calculation method Methods 0.000 abstract description 2
- 238000004891 communication Methods 0.000 abstract description 2
- 238000013461 design Methods 0.000 description 12
- 230000004907 flux Effects 0.000 description 7
- 101000969630 Homo sapiens Monocarboxylate transporter 10 Proteins 0.000 description 4
- 102100021425 Monocarboxylate transporter 10 Human genes 0.000 description 4
- 101100152436 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) TAT2 gene Proteins 0.000 description 3
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000003111 delayed effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method and a device for scheduling quality of service for variable-length messages, which relates to the technical field of communication network and can consume fewer sources when the specification is determined. The scheme comprises the following steps: determining the time intervals of the messages according to the fixed length and configuration bandwidth of the pre-set messages, and scheduling the calculation of the actual transmitting time of next report according to the time intervals; obtaining the actual length of the current received report, and determining the time increment according to the actual length and the time intervals; updating the expected time at which the next report arrives, and transmitting the next report according to the actual transmitting time. The scheme provided by the embodiment of the invention can be applied when the quality of service for variable-length messages is scheduled.
Description
Technical field
The present invention relates to the communication network technology field, relate in particular to a kind of method and device of elongated message flow control service dispatch.
Background technology
QOS (Quality Of Service based on time scale; The flow control service) dispatching method adopts ATM (Asynchronous Transfer Mode; Asynchronous transfer mode) flow control algorithm GCRA (Generic Cell Rate Algorithm, Generic Cell Rate Algorithm) in the agreement.
The main thought of GCRA: ATM cell is a fixed length, can calculate equispaced T=(the 53*8)/M between the ATM cell according to the QOS configured bandwidth, and wherein, M is that the ATM cell regular length is 53 bytes according to the bandwidth of QOS configuration.According to the current cell Ta time of advent (Arrive Time receives time of data before the QOS Flow Control), according to the time of advent that TAT=Ta+T can accurately calculate next cell, wherein, TAT is the expectation data arrives time.When Ta >=TAT1, actual flow is lower than configured bandwidth, and then flow is not broken a contract, and the transmitting time of cell is Ta, transmits immediately after promptly receiving signal, and next signal theory time of advent is TAT2=Ta+T; When Ta＜TAT1 and Ta＞TAT1-L, Ta does not then break a contract in preset cell tolerance time of advent value scope, and the transmitting time of cell is Ta, transmits immediately after promptly receiving signal, and next signal theory time of advent is TAT2=TAT1+T; When Ta＜TAT-P, then flow promise breaking, the transmitting time that postpones this cell realizes that the flow of sending direction is level and smooth, and wherein, P is a cell tolerance time of advent value, and next signal theory time of advent is TAT2=TAT1+T.
When data, just dispatch, scheduling performance depends on the source flux specification, not influenced by configured bandwidth, and the logistics resource of cost is less, but the GCRA algorithm is applicable to the fixed length field, and existing algorithm can't support elongated message to use.Elongated message QOS algorithm commonly used can leak the scheduling of bucket based on credit; Regularly increase credit according to configured bandwidth, when needing scheduling, constantly poll credit is leaked the water level of bucket; When a credit leakage bucket water level is accumulated to the preset water level threshold value, then allow to send a data message.
Yet; When adopting in the prior art dispatching method that leaks bucket based on credit to dispatch, because scheduling performance disposed total bandwidth and influence, total configured bandwidth is tens of times of source flux specification often; Therefore when design specification was confirmed, the resource that causes credit leakage bucket to expend was more.
Summary of the invention
Embodiments of the invention provide a kind of method and device of elongated message flow control service dispatch, in the time of can working as design specification and confirm, consume less resource.
For achieving the above object, embodiments of the invention adopt following technical scheme:
A kind of method of elongated message flow control service dispatch comprises:
Confirm the time interval between the message based on preset message regular length and configured bandwidth, and dispatch the calculating of the actual transmitting time of next message based on the said time interval;
Obtain the physical length of the current message that receives, confirm incremental time according to the said physical length and the said time interval;
Upgrade the expected time that said next message arrives based on said incremental time, and send said next message based on said actual transmitting time.
A kind of device of elongated message flow control service dispatch comprises:
Computing unit is used for confirming the time interval between the message according to preset message regular length and configured bandwidth, and dispatches the calculating of the actual transmitting time of next message according to the said time interval;
Acquiring unit is used to obtain the physical length of the current message that receives;
Said computing unit also is used for, and confirms incremental time according to the said physical length and the said time interval;
Updating block is used for upgrading the expected time that said next message arrives according to said incremental time;
Transmitting element is used for sending said next message according to said actual transmitting time.
The embodiment of the invention provides a kind of method and device of elongated message flow control service dispatch; Through confirming the time interval between the message, and dispatch the calculating of the actual transmitting time of next message based on the said time interval based on preset message regular length and configured bandwidth; Obtain the physical length of the current message that receives, confirm incremental time based on the said physical length and the said time interval; Upgrade the expected time that said next message arrives based on said incremental time, and send said next message based on said actual transmitting time.When dispatching with the dispatching method that leaks bucket based on credit in the prior art; Because scheduling performance is disposed total bandwidth and is influenced; Total configured bandwidth tends to number and decuples the source flux specification, therefore when design specification is confirmed, causes credit to leak the low heterogeneous ratio of resource that bucket expends; When the scheme that the embodiment of the invention provides can be worked as design specification and confirms, consume less resource.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art; To do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below; Obviously, the accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills; Under the prerequisite of not paying creative work property, can also obtain other accompanying drawing according to these accompanying drawings.
The flow chart of the method for a kind of elongated message flow control service dispatch that Fig. 1 provides for the embodiment of the invention 1;
The block diagram of the device of a kind of elongated message flow control service dispatch that Fig. 2 provides for the embodiment of the invention 1;
The flow chart of the method for a kind of elongated message flow control service dispatch that Fig. 3 provides for the embodiment of the invention 2;
The sketch map of the method for a kind of elongated message flow control service dispatch that Fig. 4 provides for the embodiment of the invention 2;
The flow chart of the method for the another kind of elongated message flow control service dispatch that Fig. 5 provides for the embodiment of the invention 2;
The sketch map of the calculating of the actual transmitting time of the next message of the scheduling that Fig. 6 provides for the embodiment of the invention 2;
The sketch map of the expected time that the next message of the renewal that Fig. 7 provides for the embodiment of the invention 2 arrives;
The sketch map of the method for the another kind of elongated message flow control service dispatch that Fig. 8 provides for the embodiment of the invention 2;
The block diagram of the device of a kind of elongated message flow control service dispatch that Fig. 9 provides for the embodiment of the invention 2.
Embodiment
To combine the accompanying drawing in the embodiment of the invention below, the technical scheme in the embodiment of the invention is carried out clear, intactly description, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills are not making the every other embodiment that is obtained under the creative work prerequisite, all belong to the scope of the present invention's protection.
The embodiment of the invention provides the method for elongated message flow control service dispatch, and as shown in Figure 1, this method comprises:
Optional, confirm the actual time of arrival of said current message and the expected time that said current message arrives;
The expected time whether actual time of arrival of judging said current message arrives greater than said current message and message tolerance time of advent value and;
Expected time that arrives greater than said current message when actual time of arrival of said current message and message tolerance time of advent value and the time, the actual transmitting time of confirming said next message is the actual time of arrival of said current message;
When the actual time of arrival of said current message be not more than expected time that said current message arrives and message tolerance time of advent value and the time, whether the actual time of arrival of judging said current message poor greater than expected time of said current message arrival and message tolerance time of advent value;
During expected time that arrives greater than said current message when actual time of arrival of said current message and message tolerance time of advent value poor, the actual transmitting time of confirming said next message is the actual time of arrival of said current message;
When the actual time of arrival of said current message was not more than expected time that said current message arrives and message tolerance time of advent value poor, the actual transmitting time of confirming said next message was the expected time of said current message arrival.
Optional, confirm incremental time according to X=L2*T/L1, wherein, X is an incremental time, and L2 is the physical length of the current message that receives, and T is the time interval between the message of confirming, and L1 is the regular length of preset message.
Optional, confirm the actual time of arrival of said current message and the expected time that said current message arrives;
Whether the expected time of judging said current message arrival is greater than the said actual time of arrival;
When expected time that said current message arrives during greater than said actual time of arrival, then upgrade expected time that said next message arrives and be reach the said time time and said incremental time and;
When the expected time that said current message arrives is not more than said actual time of arrival, then upgrade expected time that said next message arrives and be expected time that said current message arrives and said incremental time and.
The embodiment of the invention provides a kind of method of elongated message flow control service dispatch; Confirm the time interval between the message through preset message regular length of basis and configured bandwidth, and dispatch the calculating of the actual transmitting time of next message according to the said time interval; Obtain the physical length of the current message that receives, confirm incremental time according to the said physical length and the said time interval; Upgrade the expected time that said next message arrives according to said incremental time, and send said next message according to said actual transmitting time.When dispatching with the dispatching method that leaks bucket based on credit in the prior art; Because scheduling performance is disposed total bandwidth and is influenced; Total configured bandwidth tends to number and decuples the source flux specification, therefore when design specification is confirmed, causes credit to leak the low heterogeneous ratio of resource that bucket expends; When the scheme that the embodiment of the invention provides can be worked as design specification and confirms, consume less resource.
The embodiment of the invention provides a kind of device of elongated message flow control service dispatch, and as shown in Figure 2, this device comprises: computing unit 201, acquiring unit 202, updating block 203;
Acquiring unit 202 is used to obtain the physical length of the current message that receives and the expected time that said current message arrives;
Said computing unit 201 also is used for, and confirms incremental time according to the said physical length and the said time interval;
Optional, said computing unit 201 specifically is used for:
Confirm incremental time according to X=L2*T/L1, wherein, X is an incremental time, and L2 is the physical length of the current message that receives, and T is the time interval between the message of confirming, L1 is the regular length of preset message.
Updating block 203 is used for upgrading the expected time that said next message arrives according to said incremental time;
Transmitting element 204 is used for sending said next message according to said actual transmitting time.
The embodiment of the invention provides a kind of device of elongated message flow control service dispatch; Through according to preset message regular length and configured bandwidth, computing unit is confirmed the time interval between the message and is dispatched the calculating of the actual transmitting time of next message according to the said time interval; Acquiring unit obtains the physical length of the current message that receives, and according to the said physical length and the said time interval, said computing unit is confirmed incremental time; Updating block upgrades the expected time that said next message arrives according to said incremental time, and transmitting element sends said next message according to said actual transmitting time.When dispatching with the dispatching method that leaks bucket based on credit in the prior art; Because scheduling performance is disposed total bandwidth and is influenced; Total configured bandwidth tends to number and decuples the source flux specification, therefore when design specification is confirmed, causes credit to leak the low heterogeneous ratio of resource that bucket expends; When the scheme that the embodiment of the invention provides can be worked as design specification and confirms, consume less resource.
Embodiment 2
The embodiment of the invention provides the method for elongated message flow control service dispatch; The application scenarios of present embodiment is: the calculating of dispatching the actual transmitting time of next message takes place with the expected time of upgrading said next message arrival synchronously; The calculating of the actual transmitting time of a message of every scheduling; Then upgrade the expected time that once said next message arrives, as shown in Figure 3, this method comprises:
Optional, calculate the time interval between the message according to T=L1*8/M, wherein, T is the time interval between the said message, L1 is preset message regular length, the bandwidth of M configuration;
As shown in Figure 4, the actual time of arrival of current message is Ta (K), and K representes that current message is a K message; The expected time that the current message of confirming arrives is TAT (K), then, judges that whether Ta (K) is greater than [TAT (K)+P]; Wherein, P is a message tolerance time of advent value;
When Ta (K)＞[TAT (K)+P], explain that the actual flow that uses when sending current message is lower than configured bandwidth, does not then need limited flow, then the actual transmitting time Ts=Ta (K) of next message;
When Ta (K)≤[TAT (K)+P], explain that the actual flow that uses when sending current message is higher than configured bandwidth, at this moment, continue to judge that whether Ta (K) is greater than [TAT (K)-P];
When Ta (K)＞[TAT (K)-P]; Be higher than configured bandwidth though the actual flow that uses when sending current message is described, allow a certain amount of burst, therefore in tolerance based on actual conditions; Do not need limited flow, the then actual transmitting time Ts=Ta (K) of next message this moment;
When Ta (K)≤[TAT (K)-P], explain that the actual flow that uses when sending current message is higher than configured bandwidth, then need limited flow, then the actual transmitting time Ts=TAT (K) of next message is level and smooth with the flow of realizing sending direction.
Step 302 is obtained the physical length of the current message that receives, and confirms incremental time according to the said physical length and the said time interval;
Optional, after the current message that receives, said current message is written in the memory, according to actual transmitting time; Control is read message and is sent from memory, read message from memory after, obtain the physical length of said current message; Confirm incremental time according to X=L2*T/L1, wherein, X is an incremental time; L2 is the physical length of the current message that receives, and T is the time interval between the message of confirming, L1 is the regular length of preset message.
Step 303 is upgraded the expected time that said next message arrives according to said incremental time;
Optional, as shown in Figure 4, confirm the actual time of arrival Ta (K) of said current message, the expected time that said current message arrives is TAT (K);
Judge that whether Ta (K) is greater than [TAT (K)+P];
When Ta (K)＞[TAT (K)+P], TAT (K+1)=Ta (K)+X then;
When Ta (K)≤[TAT (K)+P], judge that whether Ta (K) is greater than [TAT (K)-P];
When Ta (K)＞[TAT (K)-P], TAT (K+1)=TAT (K)+X then;
When Ta (K)≤[TAT (K)-P], TAT (K+1)=TAT (K)+X then.
Step 304 is sent said next message according to said actual transmitting time.
The embodiment of the invention provides a kind of method of elongated message flow control service dispatch; Confirm the time interval between the message through preset message regular length of basis and configured bandwidth, and dispatch the calculating of the actual transmitting time of next message according to the said time interval; Obtain the physical length of the current message that receives, confirm incremental time according to the said physical length and the said time interval; Upgrade the expected time that said next message arrives according to said incremental time, and send said next message according to said actual transmitting time.The scheme that embodiments of the invention provide is controlled elongated message flow control service dispatch based on time scale, and scheduling accurately; Scheduling performance only depends on the source flux specification; Not disposed total bandwidth influences, and when satisfying scheduling performance, the resource of consumption is less.
The embodiment of the invention provides the method for another kind of elongated message flow control service dispatch; The application scenarios of present embodiment is: the calculating and the asynchronous generation of expected time of upgrading said next message arrival of dispatching the actual transmitting time of next message; And only after obtaining the physical length of said current message, upgrade the expected time that said next message arrives, promptly at expected time reproducting periods not according to the said incremental time that calculates; Can dispatch according to predetermined interval temporarily; Proofread and correct the deviation of scheduling before again after waiting to obtain the message physical length, as shown in Figure 5, this method comprises:
Step 501 is confirmed the time interval between the message according to preset message regular length and configured bandwidth, and is dispatched the calculating of the actual transmitting time of next message according to the said time interval;
As shown in Figure 6, dispatch next message actual transmitting time be calculated as an independent flow process, the loop iteration that is calculated as of actual transmitting time calculates, and promptly calculates Ts (K) one by one;
Need to prove, in the embodiment of the invention calculating of actual transmitting time identical with the calculating of actual transmitting time in the accompanying drawing 4, specifically can with reference in the accompanying drawing 4 about the calculating of actual transmitting time, do not give unnecessary details one by one at this.Need to prove; Difference is that the expected time that current message arrives is respectively TAT (K) and TAT (J) when calculating actual transmitting time among Fig. 6 and Fig. 4; Be that Fig. 4 is that the calculating of dispatching the actual transmitting time of next message takes place with the expected time of upgrading said next message arrival synchronously, promptly Ts (K) is identical with the subscript of TAT (K); Fig. 6 is the calculating and the asynchronous generation of expected time of upgrading said next message arrival of the actual transmitting time of the next message of scheduling, and promptly Ts (K) is different with the subscript of TAT (J).
Step 502 is sent said next message according to the actual transmitting time of said next message;
At this moment; According to the time interval between the preset message regular length calculating message and the actual transmitting time of next message; And send said next message according to the actual transmitting time of next message, and this flow process is an independently flow process, the expected time that said next message arrives is asynchronous fully with upgrading; Be time scheduling arbitrarily before the message physical length is not fed back, the expected time that the next message that calculating obtains arrives is constant.
The calculation procedure of the expected time that next message arrives this moment is:
Confirm the actual time of arrival Ta (K) of said current message, the expected time TAT (J) that current message arrives;
Judge that whether Ta (K) is greater than TAT (J);
When Ta (K)＞TAT (J), TAT (J+1)=Tc (K)+T then;
When Ta (K)≤TAT (J), TAT (J+1)=TAT (J)+T then.
Wherein, T is the time interval between the message, and Tc (K) is the overall summary counter of QOS, and the even of simulated time flows.Because of the calculating of the actual transmitting time Ts of next message is serial, when therefore upgrading Ts, Tc just is equivalent to Ta.
Step 503 is obtained the physical length of the current message that receives, and confirms incremental time according to the said physical length and the said time interval;
Optional, confirm incremental time according to X=L2*T/L1, wherein, X is an incremental time, and L2 is the physical length of the current message that receives, and T is the time interval between the message of confirming, and L1 is the regular length of preset message.
Step 504 is upgraded the expected time that said next message arrives according to said incremental time;
Optional, as shown in Figure 7, judge that whether Tc is greater than TAT (J);
When Tc＞TAT (J), TAT (J+1)=Tc+X then;
When Tc≤TAT (J), TAT (J+1)=TAT (J)+X then.
From seeing for a long time, if TAT lags behind Tc, transmitted traffic is described greater than configured bandwidth, TAT need increase the accuracy that incremental time guarantees current limliting on the TAT basis; If TAT, explains that actual flow is lower than configuration early than Tc, the TAT renewal needs or not limited flow then to increase and decrease incremental time on the Tc basis;
The incremental time that TAT upgrades is X, promptly revises the TAT increment in proportion according to physical length, and the longer explanation of message transmitted traffic is big more, and then the TAT increment also should increase.
As shown in Figure 8; Can control message according to Ts reads constantly and sends; Only after obtaining the physical length information of message; Just upgrade the expected time that next message arrives, the actual transmitting time of next message is recomputated in the comparison of the expected time TAT of the real time Tc that arrives through next message then and the next message arrival of renewal.
Step 505 is sent said next message according to said actual transmitting time.
For example, the Flow Control of existing 1K bar stream, every traffic specification all is maximum 1Gbps; Then 1k*1Gbps=1Tbps in fact just disposes specification; Professional actual total flow is subject to band width in physical, and professional actual total flow has only 10Gbps, when adopting mode of leaking bucket credit of the prior art to dispatch; Total poll ability of design needs 1Tbps, therefore needs more parallel processing resource; When the time scale mode that adopts the embodiment of the invention to provide; 1k bar stream can a shared group scheduling device continuous productive process, and according to the Time Triggered scheduling events, dispatching only needs greater than the actual total flow 10Gbps of business; The overall performance of design requires significantly to reduce, and the resource cost also can reduce.
The embodiment of the invention provides a kind of method of elongated message flow control service dispatch; Confirm the time interval between the message through preset message regular length of basis and configured bandwidth, and dispatch the calculating of the actual transmitting time of next message according to the said time interval; Obtain the physical length of the current message that receives, confirm incremental time according to the said physical length and the said time interval; Upgrade the expected time that said next message arrives according to said incremental time, and send said next message according to said actual transmitting time.The scheme that embodiments of the invention provide; Control elongated message flow control service dispatch based on time scale, scheduling performance only depends on the source flux specification, and not disposed total bandwidth influences; And the cycle of scheduling does not receive memory to read delayed impact; Can improve scheduling performance significantly, and when design specification was confirmed, the resource of consumption was less.
The embodiment of the invention provides a kind of device of elongated message flow control service dispatch, and as shown in Figure 9, this device comprises: computing unit 901, determination module 9011; First judge module, 9012, the first computing modules, 9013, the second judge modules, 9014, the second computing modules 9015; Acquiring unit 902, control unit 903, updating block 904, determination module 9041; Judge module 9042, the first update module 9043, the second update module 9044, transmitting element 905;
Optional, cover half piece 9011 really in the said computing unit 901 is used for confirming actual time of arrival of said current message;
Expected time that arrives greater than said current message when actual time of arrival of said current message and message tolerance time of advent value and the time; First computing module 9013 in the said computing unit 901 is used for confirming that the actual transmitting time of said next message is the actual time of arrival of said current message;
When the actual time of arrival of said current message be not more than expected time that said current message arrives and message tolerance time of advent value and the time; Second judge module 9014 in the said computing unit 901, the expected time whether actual time of arrival that is used to judge said current message arrives greater than said current message and message tolerance time of advent value poor;
During expected time that arrives greater than said current message when actual time of arrival of said current message and message tolerance time of advent value poor; Said first computing module 9013 also is used for, and the actual transmitting time of confirming said next message is the actual time of arrival of said current message;
When the actual time of arrival of said current message is not more than expected time that said current message arrives and message tolerance time of advent value poor; Second computing module 9015 in the said computing unit 901 is used for confirming that the actual transmitting time of said next message is the expected time that said current message arrives.
Acquiring unit 902 is used to obtain the physical length of the current message that receives;
Said computing unit 901 also is used for, and confirms incremental time according to the said physical length and the said time interval;
Said computing unit 901 specifically is used for: confirm incremental time according to X=L2*T/L1, wherein, X is an incremental time, and L2 is the physical length of the current message that receives, and T is the time interval between the message of confirming, L1 is the regular length of preset message.
Need to prove that the calculating of dispatching the actual transmitting time of next message takes place with the expected time of upgrading said next message arrival synchronously; Perhaps, dispatch the calculating and the asynchronous generation of expected time of upgrading said next message arrival of the actual transmitting time of next message;
When the calculating of the actual transmitting time of the next message of scheduling during with the expected time asynchronous generation of upgrading that said next message arrives; Said control unit 903 also is used for; Only after obtaining the physical length of said current message, upgrade the expected time that said next message arrives according to the said incremental time that calculates.
Updating block 904 is used for upgrading the expected time that said next message arrives according to said incremental time;
Optional, cover half piece 9041 really in the said updating block 904 is used for confirming the actual time of arrival of said current message and the expected time that said current message arrives;
Expected time that arrives greater than said actual time of arrival or said current message when expected time that said current message arrives and said message tolerance time of advent value and the time; First update module 9043 in the said updating block 904, then upgrade expected time that said next message arrives and be reach the said time time and said incremental time and;
When the expected time that said current message arrives be not more than expected time that said actual time of arrival or said current message arrive and said message tolerance time of advent value and the time; Second update module 9044 in the said updating block 904, then be used to upgrade expected time that said next message arrives and be expected time that said current message arrives and said incremental time and.
Transmitting element 905 is used for sending said next message according to said actual transmitting time.
The embodiment of the invention provides a kind of device of elongated message flow control service dispatch; Through according to preset message regular length and configured bandwidth, computing unit is confirmed the time interval between the message and is dispatched the calculating of the actual transmitting time of next message according to the said time interval; Acquiring unit obtains the physical length of the current message that receives, and according to the said physical length and the said time interval, said computing unit is confirmed incremental time; Updating block upgrades the expected time that said next message arrives according to said incremental time, and transmitting element sends said next message according to said actual transmitting time.When the scheme that the embodiment of the invention provides can be worked as design specification and confirms, consume less resource.
The above; Be merely embodiment of the present invention, but protection scope of the present invention is not limited thereto, any technical staff who is familiar with the present technique field is in the technical scope that the present invention discloses; Can expect easily changing or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion by said protection range with claim.
Claims (13)
1. the method for an elongated message flow control service dispatch is characterized in that, comprising:
Confirm the time interval between the message based on preset message regular length and configured bandwidth, and dispatch the calculating of the actual transmitting time of next message based on the said time interval;
Obtain the physical length of the current message that receives, confirm incremental time according to the said physical length and the said time interval;
Upgrade the expected time that said next message arrives based on said incremental time, and send said next message based on said actual transmitting time.
2. method according to claim 1 is characterized in that,
The calculating of dispatching the actual transmitting time of next message takes place with the expected time of upgrading said next message arrival synchronously; Perhaps,
Dispatch the calculating and the asynchronous generation of expected time of upgrading said next message arrival of the actual transmitting time of next message.
3. method according to claim 2 is characterized in that,
When the calculating of the actual transmitting time of the next message of scheduling with upgrade expected time that said next message arrives when taking place synchronously, the expected time that once said next message arrives is then upgraded in the calculating of the actual transmitting time of a message of every scheduling.
4. method according to claim 2 is characterized in that,
When the calculating of the actual transmitting time of the next message of scheduling during with the expected time asynchronous generation of upgrading that said next message arrives; Only after obtaining the physical length of said current message, upgrade the expected time that said next message arrives according to the said incremental time that calculates.
5. according to claim 3 or 4 described methods, it is characterized in that the calculating of the actual transmitting time of the next message of said scheduling comprises:
Confirm the actual time of arrival of said current message and the expected time that said current message arrives;
The expected time whether actual time of arrival of judging said current message arrives greater than said current message and message tolerance time of advent value and;
Expected time that arrives greater than said current message when actual time of arrival of said current message and message tolerance time of advent value and the time, the actual transmitting time of confirming said next message is the actual time of arrival of said current message;
When the actual time of arrival of said current message be not more than expected time that said current message arrives and message tolerance time of advent value and the time, whether the actual time of arrival of judging said current message poor greater than expected time of said current message arrival and message tolerance time of advent value;
During expected time that arrives greater than said current message when actual time of arrival of said current message and message tolerance time of advent value poor, the actual transmitting time of confirming said next message is the actual time of arrival of said current message;
When the actual time of arrival of said current message was not more than expected time that said current message arrives and message tolerance time of advent value poor, the actual transmitting time of confirming said next message was the expected time of said current message arrival.
6. according to each described method among the claim 1-5, it is characterized in that, saidly confirm that according to the said physical length and the said time interval incremental time comprises:
Confirm incremental time according to X=L2*T/L1, wherein, X is an incremental time, and L2 is the physical length of the current message that receives, and T is the time interval between the message of confirming, L1 is the regular length of preset message.
7. method according to claim 1 is characterized in that, saidly upgrades the expected time that said next message arrives according to said incremental time and comprises:
Confirm the actual time of arrival of said current message and the expected time that said current message arrives;
Judge expected time that expected time that whether the said actual time of arrival arrives greater than said current message or said current message arrive and said message tolerance time of advent value and;
The expected time that expected time that arrives greater than said current message when the said actual time of arrival or said current message arrive and said message tolerance time of advent value and the time, then upgrade expected time that said next message arrives and be said actual reach time and said incremental time and;
When the said actual time of arrival be not more than expected time that expected time that said current message arrives or said current message arrive and said message tolerance time of advent value and the time, then upgrade expected time that said next message arrives and be expected time that said current message arrives and said incremental time and.
8. the device of an elongated message flow control service dispatch is characterized in that, comprising:
Computing unit is used for confirming the time interval between the message according to preset message regular length and configured bandwidth, and dispatches the calculating of the actual transmitting time of next message according to the said time interval;
Acquiring unit is used to obtain the physical length of the current message that receives;
Said computing unit also is used for, and confirms incremental time according to the said physical length and the said time interval;
Updating block is used for upgrading the expected time that said next message arrives according to said incremental time;
Transmitting element is used for sending said next message according to said actual transmitting time.
9. device according to claim 8 is characterized in that, said device also comprises:
Control unit; Be used for when the calculating of the actual transmitting time of the next message of scheduling with upgrade expected time that said next message arrives when taking place synchronously; The expected time that once said next message arrives is then upgraded in the calculating of the actual transmitting time of a message of every scheduling.
10. device according to claim 8 is characterized in that,
Said control unit also is used for; When the calculating of the actual transmitting time of the next message of scheduling during with the expected time asynchronous generation of upgrading that said next message arrives; Only after obtaining the physical length of said current message, upgrade the expected time that said next message arrives according to the said incremental time that calculates.
11., it is characterized in that said computing unit comprises according to claim 9 or 10 described devices:
Determination module is used for confirming the actual time of arrival of said current message and the expected time that said current message arrives;
First judge module, the expected time whether actual time of arrival that is used to judge said current message arrives greater than said current message and message tolerance time of advent value and;
First computing module; Expected time that is used for arriving greater than said current message and message tolerance time of advent value when actual time of arrival of said current message and the time, the actual transmitting time of confirming said next message is the actual time of arrival of said current message;
Second judge module; Be used for when the actual time of arrival of said current message be not more than expected time that said current message arrives and message tolerance time of advent value and the time, whether the actual time of arrival of judging said current message poor greater than expected time of said current message arrival and message tolerance time of advent value;
Said first computing module also is used for; During expected time that arrives greater than said current message when actual time of arrival of said current message and message tolerance time of advent value poor, the actual transmitting time of confirming said next message is the actual time of arrival of said current message;
Second computing module; Be used for when the actual time of arrival of said current message is not more than expected time that said current message arrives and message tolerance time of advent value poor, the actual transmitting time of confirming said next message is the expected time of said current message arrival.
12. each described device is characterized in that according to Claim 8-11, said computing unit specifically is used for:
Confirm incremental time according to X=L2*T/L1, wherein, X is an incremental time, and L2 is the physical length of the current message that receives, and T is the time interval between the message of confirming, L1 is the regular length of preset message.
13. device according to claim 8 is characterized in that, said updating block comprises:
Determination module is used for confirming the actual time of arrival of said current message and the expected time that said current message arrives;
Judge module, be used to judge expected time that whether expected time that said current message arrives arrive greater than said actual time of arrival or said current message and said message tolerance time of advent value and;
First update module; The expected time that is used for arriving greater than said actual time of arrival or said current message and said message tolerance time of advent value when expected time that said current message arrives and the time, then upgrade expected time that said next message arrives and be reach the said time time and said incremental time and;
Second update module; Be used for when the expected time that said current message arrives be not more than expected time that said actual time of arrival or said current message arrive and said message tolerance time of advent value and the time, then upgrade expected time that said next message arrives and be expected time that said current message arrives and said incremental time and.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210151998.6A CN102694723B (en) | 2012-05-16 | 2012-05-16 | Method and device for scheduling quality of service for variable-length messages |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210151998.6A CN102694723B (en) | 2012-05-16 | 2012-05-16 | Method and device for scheduling quality of service for variable-length messages |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102694723A true CN102694723A (en) | 2012-09-26 |
| CN102694723B CN102694723B (en) | 2015-06-03 |
Family
ID=46860012
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210151998.6A Expired - Fee Related CN102694723B (en) | 2012-05-16 | 2012-05-16 | Method and device for scheduling quality of service for variable-length messages |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102694723B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105553613A (en) * | 2015-12-10 | 2016-05-04 | 中国航空工业集团公司西安航空计算技术研究所 | Partition time-triggered communication-based data integrity detection method |
| CN109547414A (en) * | 2018-10-29 | 2019-03-29 | 中国人民解放军战略支援部队信息工程大学 | Fixed length message format reverse method based on bright light effect |
| CN110995598A (en) * | 2019-11-12 | 2020-04-10 | 芯创智（北京）微电子有限公司 | Variable-length message data processing method and scheduling device |
| CN111862494A (en) * | 2020-07-15 | 2020-10-30 | 深圳市海恒智能科技有限公司 | Book borrowing and returning method and system based on face recognition of terminal self-service equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030128667A1 (en) * | 2001-12-14 | 2003-07-10 | The Furukawa Electric Co., Ltd. | Policing control method and apparatus, and network system using the policing control apparatus |
| US6724726B1 (en) * | 1999-10-26 | 2004-04-20 | Mitsubishi Denki Kabushiki Kaisha | Method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract |
| CN1798099A (en) * | 2004-12-29 | 2006-07-05 | 华为技术有限公司 | Method for implementing dynamic speed adjustment for data packets based on logic |
-
2012
- 2012-05-16 CN CN201210151998.6A patent/CN102694723B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6724726B1 (en) * | 1999-10-26 | 2004-04-20 | Mitsubishi Denki Kabushiki Kaisha | Method of putting a flow of packets of a network for transporting packets of variable length into conformity with a traffic contract |
| US20030128667A1 (en) * | 2001-12-14 | 2003-07-10 | The Furukawa Electric Co., Ltd. | Policing control method and apparatus, and network system using the policing control apparatus |
| CN1798099A (en) * | 2004-12-29 | 2006-07-05 | 华为技术有限公司 | Method for implementing dynamic speed adjustment for data packets based on logic |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105553613A (en) * | 2015-12-10 | 2016-05-04 | 中国航空工业集团公司西安航空计算技术研究所 | Partition time-triggered communication-based data integrity detection method |
| CN109547414A (en) * | 2018-10-29 | 2019-03-29 | 中国人民解放军战略支援部队信息工程大学 | Fixed length message format reverse method based on bright light effect |
| CN109547414B (en) * | 2018-10-29 | 2021-04-20 | 中国人民解放军战略支援部队信息工程大学 | Fixed-length message format reversing method based on lighting effect |
| CN110995598A (en) * | 2019-11-12 | 2020-04-10 | 芯创智（北京）微电子有限公司 | Variable-length message data processing method and scheduling device |
| CN110995598B (en) * | 2019-11-12 | 2022-03-04 | 芯创智（北京）微电子有限公司 | Variable-length message data processing method and scheduling device |
| CN111862494A (en) * | 2020-07-15 | 2020-10-30 | 深圳市海恒智能科技有限公司 | Book borrowing and returning method and system based on face recognition of terminal self-service equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102694723B (en) | 2015-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102893656B (en) | The storage medium of relay, QoS control method and storage QoS control program | |
| EP3245777B1 (en) | A base station and a method thereto | |
| CN102694723A (en) | Method and device for scheduling quality of service for variable-length messages | |
| CN103236893A (en) | Network message synchronizing method for process levels of intelligent substation | |
| CN103347259A (en) | Flow prompt method and system | |
| CN104662845A (en) | Optical wireless access system | |
| CN101599905B (en) | Method, device and system for realizing addition of traffic shaping token | |
| CN104753818A (en) | Queue scheduling method and device | |
| CN101340390A (en) | Scheduling apparatus and method for real-time service | |
| WO2020109867A3 (en) | Multi-mode communication device, method and system | |
| EP0887973A2 (en) | Timing reference for scheduling data traffic on multiple ports | |
| CN107105496A (en) | A kind of method and device, system for obtaining, returning to uplink timing advance | |
| CN101883294B (en) | Method and device for allocating uplink bandwidth | |
| CN104038966A (en) | Data flow scheduling method and apparatus under long term evolution network | |
| CN102970250A (en) | Method and apparatus for bandwidth allocation in distributed router system and network device | |
| CN103683502A (en) | Drive control method and drive control device for switch circuit of process level device of intelligent substation | |
| CN103139925A (en) | Upstream data dispatch method used for local thermodynamic equilibrium (LTE) system and device | |
| CN103026671B (en) | A kind of method and apparatus of traffic shaping | |
| CN103580768A (en) | Time synchronizing method and device | |
| WO2006028662A3 (en) | Management of event order of occurrence on a network | |
| CN109597652A (en) | Specification analytic method, system, computer readable storage medium and communication manager | |
| CN101238452A (en) | A system and method for transmitting data | |
| CN102377641A (en) | Realization method for token bucket algorithm | |
| CN109314656A (en) | Light transmitting device and bandwidth allocation methods | |
| CN107968782A (en) | A kind of message compression storage method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170601 Address after: 510640 Guangdong City, Tianhe District Province, No. five, road, public education building, unit 371-1, unit 2401 Patentee after: Guangdong Gaohang Intellectual Property Operation Co., Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: Huawei Technologies Co., Ltd. |
|
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Meng Degang Inventor before: Xu Xiaofeng Inventor before: Tu Jun Inventor before: Lei Chun |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170905 Address after: 063000 Hebei province Tangshan City Caofeidian area Tanghai Xinli District No. 558 light two Patentee after: Meng Degang Address before: 510640 Guangdong City, Tianhe District Province, No. five, road, public education building, unit 371-1, unit 2401 Patentee before: Guangdong Gaohang Intellectual Property Operation Co., Ltd. |
|
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 541199 Lingui County, Guilin, Lingui County, Lingui Town, Xinglin Road, No. 1, unit 202, Room 202 Patentee after: Meng Degang Address before: 063000 Hebei province Tangshan City Caofeidian area Tanghai Xinli District No. 558 light two Patentee before: Meng Degang |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150603 Termination date: 20180516 |