CN102404206A - Enqueueing processing method and device - Google Patents
Enqueueing processing method and device Download PDFInfo
- Publication number
- CN102404206A CN102404206A CN2011103458925A CN201110345892A CN102404206A CN 102404206 A CN102404206 A CN 102404206A CN 2011103458925 A CN2011103458925 A CN 2011103458925A CN 201110345892 A CN201110345892 A CN 201110345892A CN 102404206 A CN102404206 A CN 102404206A
- Authority
- CN
- China
- Prior art keywords
- message
- formation
- random
- abandon
- drop
- 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.)
- Pending
Links
Images
Landscapes
- Telephonic Communication Services (AREA)
Abstract
The invention provides an enqueueing processing method and a device. The method comprise the following steps of receiving message for requesting to enqueue; determining that the number of the present free space for allowing to cache the message is more than zero and is not more than the free space threshold, or determining that the number of the occupied space in the queue is not less than the occupied space threshold and is less than the total number of the space for allowing to cache the message, and then judging if discarding the message according to the random number produced by the random number generator; and adding the message to the queue. On a condition that a plurality of streams distributed uniformly enter one queue, the invention embodiment randomly discards the message waiting for enqueueing when the queue approaches to the congestion state and enables the probability if each stream entering the queue to be the same so that the distribution of each stream in the queue tends to be uniform.
Description
Technical field
The embodiment of the invention relates to computer technology, relates in particular to a kind of processing method and equipment of joining the team.
Background technology
Congestion Avoidance is to take place when congested at network, according to certain drop policy dropping packets, to avoid congested generation.It is a kind of passive type congestion avoidance mechanism commonly used that rear of queue abandons (Tail-Drop is called for short TD).Traditional switch all uses rear of queue to abandon usually and avoids congested.The basic skills that existing rear of queue abandons is; The current degree of depth of formation surpasses tail drop threshold value (the Tail-Drop Threshold of formation; Be called for short TDTH) time falls current packet loss of just preparing to join the team, when promptly the buffer memory message outnumbers formation and allows the maximum number of buffer memory with the current message of just preparing to join the team by discarding.
When equally distributed many streams got into same formation in order before joining the team, if join the team bandwidth greater than going out group bandwidth, the formation meeting was in congestion state, thereby the current degree of depth that flows to the Da Shiyin formation surpasses the tail drop threshold value of formation and is dropped.Every probability that flows into team depends on and flows to moment of reaching formation and go out team's relativeness constantly.And for equally distributed many streams before joining the team, the distributions rule is fixed when joining the team, and correspondingly flows to the moment that reaches formation and the relativeness that goes out team's moment and also fixes.Thereby in the time of can causing part stream to arrive, the degree of depth of formation all surpasses the tail drop threshold value of formation and is added into formation at every turn; And the tail drop threshold value that other stream is each all can to surpass formation when arriving because of the degree of depth of formation can not be joined the team the join the team probability of probability greater than other stream of the stream that promptly has.Therefore, press the rear of queue discarding method and handle many when flowing into same formation, under the congested situation of formation, can produce the phenomenon pockety between the stream of back of joining the team.
Summary of the invention
The embodiment of the invention provides a kind of processing method and equipment of joining the team, and in order to solve in the prior art many when flowing into same formations, can produce the defective pockety between the stream of back of joining the team under the congested situation of formation.
The embodiment of the invention provides a kind of processing method of joining the team, and comprising:
The request of reception adds the message of formation;
The free space number of confirming current permission buffer memory message in the formation is greater than zero and during smaller or equal to freespace threshold; Perhaps; The space number of confirming to have taken up room in the formation is more than or equal to taking up room threshold value and when allowing the gross space of buffer memory message to count less than formation, judges whether to abandon said message according to the random number of the current generation of randomizer; The free space number of current permission buffer memory message is that said formation allows in gross space number and the said formation of buffer memory message the difference of occupation space number in the said formation; The free space number of formation when said freespace threshold is beginning random drop message, the said threshold value that taken up room is that formation allows the gross space number of buffer memory message and the difference of freespace threshold;
When confirming not abandon said message, said message is added said formation.
The embodiment of the invention provides a kind of treatment facility of joining the team, and comprising:
Receiver module is used to receive the message that request adds formation;
The space judge module; Whether the free space number that is used for judging the current permission buffer memory of said formation message is greater than zero and smaller or equal to freespace threshold; Perhaps, judge that the space number that taken up room in the formation is whether more than or equal to taking up room threshold value and allow the gross space number of buffer memory message less than formation;
The random drop judge module; The free space number that is used for confirming the current permission buffer memory of formation message is greater than zero and during smaller or equal to freespace threshold; Perhaps; The space number of confirming to have taken up room in the formation is more than or equal to taking up room threshold value and when allowing the gross space of buffer memory message to count less than formation, judges whether to abandon said message according to the random number of the current generation of randomizer; The free space number of current permission buffer memory message is that said formation allows in gross space number and the said formation of buffer memory message the difference of occupation space number in the said formation; The free space number of formation when said freespace threshold is beginning random drop message, the said threshold value that taken up room is that formation allows the gross space number of buffer memory message and the difference of freespace threshold;
The module of joining the team when being used for confirming not abandon said message, adds said formation with said message.。
Join the team processing method and equipment that the embodiment of the invention provides; Through comparing the free space number and the freespace threshold of current permission buffer memory message in the formation; Or the threshold value that takes up room of the space number that has taken up room in the comparison formation and this formation, confirm the current congestion state that whether is close in of formation.When confirming that formation is current and being close in congestion state, get into congestion state, the message that the current wait of random drop is joined the team for avoiding formation.The a plurality of streams that are evenly distributed get under the formation situation simultaneously; The distributions rule is fixed during owing to join the team; Flowing to the moment that reaches formation and the relativeness that goes out team's moment also fixes; Begin random drop when being close in congestion state and wait for the message of joining the team in that formation is current; The stream that all can be dropped when the stream that can avoid asks to add formation at every turn and have all can be added into the phenomenon of formation at every turn when asking to add formation, make that every probability that flows into formation is identical, thereby the distribution of each stream is tending towards even in the formation.
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 one to the accompanying drawing of required use in embodiment or the description of the Prior Art below introduces simply; Obviously, the accompanying drawing in describing below 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.
A kind of process flow figure that joins the team that Fig. 1 provides for the embodiment of the invention;
Fig. 2 A is another kind that the embodiment of the invention the provides process flow figure that joins the team;
Fig. 2 B is another process flow figure that joins the team that the embodiment of the invention provides;
A kind of treatment facility example structure sketch map of joining the team that Fig. 3 provides for the embodiment of the invention;
The another kind that Fig. 4 provides for the embodiment of the invention treatment facility example structure sketch map of joining the team;
Another treatment facility example structure sketch map of joining the team that Fig. 5 provides for the embodiment of the invention;
Another treatment facility example structure sketch map of joining the team that Fig. 6 provides for the embodiment of the invention.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the invention clearer; To combine the accompanying drawing in the embodiment of the invention below; Technical scheme in the embodiment of the invention is carried out clear, intactly description; Obviously, described embodiment 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 paying the every other embodiment that is obtained under the creative work prerequisite, all belong to the scope of the present invention's protection.
The processing method of joining the team that the embodiment of the invention is provided is applied to the telecommunication apparatus network access testing, can when many streams get into a formation simultaneously, make the distribution of each stream of back of joining the team be tending towards even.In addition, the processing method of joining the team that the embodiment of the invention provides also can solve existing network when congested on the microcosmic same port listen the uneven problem of a plurality of customer traffics, promote user QoS and experience.The treatment facility of joining the team in following examples can use field programmable gate array (FPGA) or application-specific integrated circuit (ASIC) (ASIC) to realize, also can use software to realize.
A kind of process flow figure that joins the team that Fig. 1 provides for the embodiment of the invention.As shown in Figure 1, present embodiment comprises:
Step 11: the treatment facility of joining the team receives the message that request adds formation.
Step 12: the free space number that the treatment facility of joining the team is confirmed current permission buffer memory message in the formation is greater than zero and during smaller or equal to freespace threshold; Perhaps; The space number of confirming to have taken up room in the formation is more than or equal to taking up room threshold value and when allowing the gross space of buffer memory message to count less than formation, judges whether to abandon the message that current request is joined the team according to the random number of the current generation of randomizer.Wherein, In the formation free space number of current permission buffer memory message be the formation gross space number that allows the buffer memory message with formation in the difference of occupation space number, the threshold value that taken up room is the gross space number of formation permission buffer memory message and the difference of freespace threshold.
Step 13: when confirming not abandon the message that current request joins the team, the message that the treatment facility of joining the team is joined the team current request adds formation.
The free space number of current permission buffer memory message can obtain through the difference of calculating the space number that has taken up room in gross space number that formation allows the buffer memory message and the formation.Allow the gross space number of buffer memory message to be TDTH in the existing TD method, TDTH is less than the gross space number of formation buffer memory.The space numerical table that has taken up room in the formation shows that the actual number that takies of current queue spatial cache is the degree of depth of current queue, also can be regarded as in the formation message number of buffer memory, representes the space number that has taken up room in the formation with CQDP.
When the message that the request of receiving is joined the team, a kind of processing method of joining the team is at first to calculate the free space number (TDTH-CQDP) of current permission buffer memory message in the formation.The free space number of formation when freespace threshold N is beginning random drop message.Then, through the free space number and the freespace threshold of current permission buffer memory message in the formation relatively, can confirm that formation is current whether to be close in congestion state or not to be in congestion state.
The free space number of current permission buffer memory message is confirmed the current congestion state that is close in of formation greater than zero and during smaller or equal to freespace threshold in the formation.For avoiding formation to get into congestion state, determine whether to abandon the message that current wait is joined the team through random number.Promptly when formation is close in congestion state, the message that the random drop current request is joined the team.
When the free space number of current permission buffer memory message is greater than freespace threshold in the formation, confirm the current congestion state that also do not close on of formation, confirm not abandon the message that current request is joined the team that the message that current request is joined the team adds said formation.When the free space number of current permission buffer memory message equals zero in the said formation, show that formation has not had free space, confirm the current congestion state that has been in of formation, confirm to abandon the message that current request is joined the team.
During message that the request of receiving is joined the team, the another kind processing method of joining the team is, the threshold value that takes up room of the space number that has taken up room in the formation and this formation is compared, and formation is current whether is close in congestion state or has not been in congestion state with definite.Wherein, the threshold value that taken up room is that formation allows the gross space number of buffer memory message and the difference of freespace threshold.If the space number that has taken up room in the formation, is confirmed the current congestion state that also do not close on of formation less than the threshold value that takes up room, to confirm not abandon the message that current request is joined the team, the message that current request is joined the team adds said formation; If equal the gross space number that formation allows the buffer memory message, show that formation has not had free space, then confirm the current congestion state that has been in of formation, confirm to abandon the message that current request is joined the team; If the space number that has taken up room in the formation is confirmed the current congestion state that is close in of formation more than or equal to taking up room threshold value and allow the gross space number of buffer memory message less than formation.For avoiding formation to get into congestion state, determine whether to abandon the message that current wait is joined the team through random number.Promptly when formation is close in congestion state, the message that the random drop current request is joined the team.Space number that has taken up room in the formation and formation allow the gross space number of buffer memory message.
The processing method of joining the team that the embodiment of the invention provides; Through comparing the free space number and the freespace threshold of current permission buffer memory message in the formation; Or the threshold value that takes up room of the space number that has taken up room in the comparison formation and this formation, confirm the current congestion state that whether is close in of formation.When confirming that formation is current and being close in congestion state, get into congestion state, the message that the current wait of random drop is joined the team for avoiding formation.The a plurality of streams that are evenly distributed get under the formation situation simultaneously; The distributions rule is fixed during owing to join the team; Flowing to the moment that reaches formation and the relativeness that goes out team's moment also fixes; Begin random drop when being close in congestion state and wait for the message of joining the team in that formation is current; The stream that all can be dropped when the stream that can avoid asks to add formation at every turn and have all can be added into the phenomenon of formation at every turn when asking to add formation, make that every probability that flows into formation is identical, thereby the distribution of each stream is tending towards even in the formation.
Fig. 2 A is another kind that the embodiment of the invention the provides process flow figure that joins the team.Present embodiment is through the free space number and the freespace threshold of current permission buffer memory message in the formation relatively, confirms that formation is current whether to be close in congestion state or not to be in congestion state, and shown in Fig. 2 A, present embodiment comprises:
Step 21: the message that the request of reception is joined the team.
Step 22: the free space number (TDTH-CQDP) that calculates current permission buffer memory message in the formation.
Step 23: whether the free space number of judging current permission buffer memory message in the formation equals zero.If execution in step 27, otherwise execution in step 24.
The free space number of current permission buffer memory message equals zero in the formation, confirms the current congestion state that has been in of formation, the message that the request of abandoning is joined the team.
Step 24: whether the free space number of judging current permission buffer memory message in the formation is smaller or equal to freespace threshold N.If execution in step 25, otherwise execution in step 28.
The free space number of formation when freespace threshold is beginning random drop message.Can set freespace threshold according to real needs.The free space number of current permission buffer memory message is greater than freespace threshold in the formation, confirms that free time of permission buffer memory message of formation current residual is also more, also do not close on congestion state, therefore above-mentioned message added formation.
The free space number of current permission buffer memory message is confirmed the current congestion state that closes on of formation smaller or equal to freespace threshold in the formation, below determines whether to abandon above-mentioned message through random number.
Step 25: produce random number through tandom number generator,, confirm to produce the random chance of random number according to the random number of the current generation of said randomizer and the random period of said randomizer.
Step 26: judge whether random chance reaches preset drop probability.If execution in step 27, otherwise execution in step 28.
If said random chance reaches preset drop probability, the message that the request of abandoning is joined the team.If said random chance does not reach preset drop probability, the message that request is joined the team adds formation.
Step 27: abandon the message that current request is joined the team.
Step 28: the message that current request is joined the team adds formation.
For example, the producible random number of tandom number generator is the arbitrary integer between " 1 to 255 ", and the random period of tandom number generator is 256, and preset drop probability is 50%.When the free space number of current permission buffer memory message is smaller or equal to freespace threshold in confirming formation, starts this tandom number generator and produce a random number.If the random number that produces is 100, random chance (random chance=random number/random period) be (100/256) * 100%, and promptly random chance is less than 50%, so random chance do not reach preset drop probability, with above-mentioned message adding formation.The freespace threshold recommended value is 1, and preset drop probability recommended value is 50%.
According to different application scenes, the seed of configuration freespace threshold N, preset drop probability P and tandom number generator, thus reach the effect of better joining the team.For example, under test scene, there is the K bar to flow into same formation, disposes freespace threshold N=1 so, preset drop probability P=1/K, when formation will be expired, every stream had identical chance to join the team, thereby reaches uniform purpose.Again for example: can be in network application according to the number of users of network planning port formation, configuration N and P.
In addition, when determining whether to abandon above-mentioned message through random number, also can adopt following method: at first dispose a preset random number that abandons, this preset random number that abandons equals preset random period * preset drop probability.Shown in Fig. 2 B, after step 24, comprise:
Step 29: start tandom number generator and produce a random number.
Step 210: whether the random number of judging the current generation of randomizer reaches the preset random number that abandons.If then execution in step 27, otherwise execution in step 28.
When the free space number of current permission buffer memory message is smaller or equal to freespace threshold in confirming formation, starts this tandom number generator and produce a random number.Abandon random number if the random number that tandom number generator produces reaches preset, confirm to abandon the message that current request is joined the team.If the random number that tandom number generator produces does not reach the preset random number that abandons, the message that current request is joined the team adds formation.
For example, the producible random number of tandom number generator is the arbitrary integer between " 1 to 255 ", and preset random period is 256, and preset random drop number is 50%.Presetting and abandoning random number is 256 * 50%=128.If the random number that produces is 100,100 less than 128, promptly random number does not reach preset random drop number, and the message that current request is joined the team adds formation.
If judge through the space number that has taken up room in the formation whether formation closes on congestion state; It is following to go up concrete queue processing process: during message that the request of receiving is joined the team; Judge at first whether the space number that has taken up room in the formation equals the gross space number that formation allows the buffer memory message; If then abandon the message of current request formation.Otherwise, judge that further the space number that taken up room in the formation is whether smaller or equal to the threshold value that takes up room of this formation.If the space number that has taken up room in the formation is greater than the threshold value that takes up room of this formation, the message of then current request being joined the team adds formation.If the space number that has taken up room in the formation is smaller or equal to the threshold value that takes up room of this formation; Then produce random number through tandom number generator; According to the random number of the current generation of said randomizer and the random period of said randomizer, confirm to produce the random chance of random number.If said random chance reaches preset drop probability, the message that the request of abandoning is joined the team.If said random chance does not reach preset drop probability, the message that request is joined the team adds formation.The space number that in formation, has taken up room takes up room during threshold value smaller or equal to this formation, also can adopt following method to handle: to start this tandom number generator and produce a random number.Abandon random number if the random number that tandom number generator produces reaches preset, confirm to abandon the message that current request is joined the team.If the random number that tandom number generator produces does not reach the preset random number that abandons, the message that current request is joined the team adds formation.
A kind of treatment facility structural representation of joining the team that Fig. 3 provides for the embodiment of the invention.As shown in Figure 3, present embodiment comprises:
Random drop judge module 33; Be used for free space number that space judge module 32 confirms the current permission buffer memory of formation messages greater than zero and during smaller or equal to freespace threshold; Perhaps; The space number of confirming to have taken up room in the formation is more than or equal to taking up room threshold value and when allowing the gross space of buffer memory message to count less than formation, judges whether to abandon said message according to the random number of the current generation of randomizer; The free space number of current permission buffer memory message is that said formation allows in gross space number and the said formation of buffer memory message the difference of occupation space number in the said formation; The free space number of formation when said freespace threshold is beginning random drop message, the said threshold value that taken up room is that formation allows the gross space number of buffer memory message and the difference of freespace threshold.
The module 34 of joining the team when being used for random drop judge module 33 and confirming not abandon said message, adds said formation with said message.
Further, as shown in Figure 4, also comprise: determination module 35.
The module 34 of joining the team when also being used for determination module 35 and confirming not abandon said message, adds said formation with said message.
The working mechanism of above-mentioned each module can repeat no more at this referring to describing among the corresponding embodiment of Fig. 1.
The treatment facility of joining the team that the embodiment of the invention provides through comparing the free space number and the freespace threshold of current permission buffer memory message in the formation, is confirmed the current congestion state that whether is close in of formation.Confirm the current congestion state that is close in of formation.For avoiding formation to get into congestion state, the message that the current wait of random drop is joined the team.The a plurality of streams that are evenly distributed get under the formation situation simultaneously; The distributions rule is fixed during owing to join the team; Flowing to the moment that reaches formation and the relativeness that goes out team's moment also fixes; Begin random drop when being close in congestion state and wait for the message of joining the team in that formation is current; The stream that all can be dropped when the stream that can avoid asks to add formation at every turn and have all can be added into the phenomenon of formation at every turn when asking to add formation, make that every probability that flows into formation is identical, thereby the distribution of each stream is tending towards even in the formation.
Another treatment facility structural representation of joining the team that Fig. 5 provides for the embodiment of the invention.As shown in Figure 5, on Fig. 3 or Fig. 4 basis, random drop judge module 33 comprises: random chance confirms that unit 331, drop probability judging unit 332 and first random drop confirm unit 333.
Random chance is confirmed unit 331, is used for according to the random number of the current generation of said randomizer and the random period of said randomizer, confirms to produce the random chance of said random number.
Drop probability judging unit 332 is used to judge whether the said random chance that random chance confirms that unit 331 is confirmed reaches preset drop probability.
First random drop is confirmed unit 333, is used for confirming to abandon said message if drop probability judging unit 332 confirms that said random chance reaches preset drop probability; If drop probability judging unit 332 confirms that said random chance does not reach preset drop probability, confirm not abandon said message.
Present embodiment compares random chance and the preset random drop probability that tandom number generator produces a random number, determines whether to abandon the message that current request adds formation.The working mechanism of above-mentioned each module can repeat no more at this referring to describing among the corresponding embodiment of Fig. 2 A.
Another treatment facility structural representation of joining the team that Fig. 6 provides for the embodiment of the invention.As shown in Figure 6, on Fig. 3 or Fig. 4 basis, random drop judge module 33 comprises: random drop counts judging unit 334 and second random drop is confirmed unit 335.
Random drop is counted judging unit 334, is used to judge that the random number of the current generation of said randomizer reaches preset random drop number.
Second random drop is confirmed unit 335, is used for confirming that the random number of the current generation of said randomizer reaches preset random drop number, confirms to abandon said message if random drop is counted judging unit 334; If counting judging unit 334, random drop confirms that the random number of the current generation of said randomizer does not reach preset random drop number, confirms not abandon said message.
Present embodiment compares random chance and the preset random number that tandom number generator produces a random number, determines whether to abandon the message that current request adds formation.The working mechanism of above-mentioned each module can repeat no more at this referring to describing among the corresponding embodiment of Fig. 2 B.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be accomplished through the relevant hardware of program command; Aforesaid program can be stored in the computer read/write memory medium; This program the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
What should explain at last is: above embodiment is only in order to explaining technical scheme of the present invention, but not to its restriction; Although with reference to previous embodiment the present invention has been carried out detailed explanation, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these are revised or replacement, do not make the scope of the essence disengaging various embodiments of the present invention technical scheme of relevant art scheme.
Claims (8)
1. the processing method of joining the team is characterized in that, comprising:
The request of reception adds the message of formation;
The free space number of confirming current permission buffer memory message in the formation is greater than zero and during smaller or equal to freespace threshold; Perhaps; The space number of confirming to have taken up room in the formation is more than or equal to taking up room threshold value and when allowing the gross space of buffer memory message to count less than formation, judges whether to abandon said message according to the random number of the current generation of randomizer; The free space number of current permission buffer memory message is that said formation allows in gross space number and the said formation of buffer memory message the difference of occupation space number in the said formation; The free space number of formation when said freespace threshold is beginning random drop message, the said threshold value that taken up room is that formation allows the gross space number of buffer memory message and the difference of freespace threshold;
When confirming not abandon said message, said message is added said formation.
2. method according to claim 1 is characterized in that, after said reception request adds the message of formation, also comprises:
When the free space number of current permission buffer memory message is greater than freespace threshold in the said formation, confirm not abandon said message, said message is added said formation; Perhaps,
The space number that has taken up room in the said formation has taken up room during threshold value less than said, confirms not abandon said message, and said message is added said formation.
3. method according to claim 1 and 2 is characterized in that, said random number according to the current generation of randomizer judges whether to abandon said message and comprises:
According to the random number of the current generation of said randomizer and the random period of said randomizer, confirm to produce the random chance of said random number;
If said random chance reaches preset drop probability, confirm to abandon said message;
If said random chance does not reach preset drop probability, confirm not abandon said message.
4. method according to claim 1 and 2 is characterized in that, said random number according to the current generation of randomizer judges whether to abandon said message and comprises:
The random number of judging the current generation of said randomizer reaches preset random drop number;
If the random number of the current generation of said randomizer reaches said preset random drop number, confirm to abandon said message;
If the random number of the current generation of said randomizer does not reach said preset random drop number, confirm not abandon said message.
5. the treatment facility of joining the team is characterized in that, comprising:
Receiver module is used to receive the message that request adds formation;
The space judge module; Whether the free space number that is used for judging the current permission buffer memory of said formation message is greater than zero and smaller or equal to freespace threshold; Perhaps, judge that the space number that taken up room in the formation is whether more than or equal to taking up room threshold value and allow the gross space number of buffer memory message less than formation;
The random drop judge module; The free space number that is used for confirming the current permission buffer memory of formation message is greater than zero and during smaller or equal to freespace threshold; Perhaps; The space number of confirming to have taken up room in the formation is more than or equal to taking up room threshold value and when allowing the gross space of buffer memory message to count less than formation, judges whether to abandon said message according to the random number of the current generation of randomizer; The free space number of current permission buffer memory message is that said formation allows in gross space number and the said formation of buffer memory message the difference of occupation space number in the said formation; The free space number of formation when said freespace threshold is beginning random drop message, the said threshold value that taken up room is that formation allows the gross space number of buffer memory message and the difference of freespace threshold;
The module of joining the team when being used for confirming not abandon said message, adds said formation with said message.
6. according to the said treatment facility of joining the team of claim 5, it is characterized in that, also comprise:
Determination module; The free space number that is used for the current permission buffer memory of said formation message is during greater than freespace threshold, and perhaps, the space number that has taken up room in the said formation has taken up room during threshold value less than said; Confirm not abandon said message, said message is added said formation.
7. according to claim 5 or the 6 said treatment facilities of joining the team, it is characterized in that said random drop judge module comprises:
Random chance is confirmed the unit, is used for according to the random number of the current generation of said randomizer and the random period of said randomizer, confirms to produce the random chance of said random number;
The drop probability judging unit is used to judge whether said random chance reaches preset drop probability;
First random drop is confirmed the unit, is used for confirming to abandon said message if said random chance reaches preset drop probability; If said random chance does not reach preset drop probability, confirm not abandon said message.
8. according to claim 5 or the 6 said treatment facilities of joining the team, it is characterized in that said random drop judge module comprises:
Random drop is counted judging unit, is used to judge that the random number of the current generation of said randomizer reaches preset random drop number;
Second random drop is confirmed the unit, is used for confirming to abandon said message if the random number of the current generation of said randomizer reaches preset random drop number; If the random number of the current generation of said randomizer does not reach preset random drop number, confirm not abandon said message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103458925A CN102404206A (en) | 2011-11-04 | 2011-11-04 | Enqueueing processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103458925A CN102404206A (en) | 2011-11-04 | 2011-11-04 | Enqueueing processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102404206A true CN102404206A (en) | 2012-04-04 |
Family
ID=45886009
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103458925A Pending CN102404206A (en) | 2011-11-04 | 2011-11-04 | Enqueueing processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102404206A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104102693A (en) * | 2014-06-19 | 2014-10-15 | 广州华多网络科技有限公司 | Object processing method and device |
| CN106603290A (en) * | 2016-12-15 | 2017-04-26 | 天津交控科技有限公司 | Network management software performance optimization processing method and device |
| CN107070613A (en) * | 2017-03-22 | 2017-08-18 | 公安部交通管理科学研究所 | Reliable data transmission method under distributed network environment |
| CN107846341A (en) * | 2016-09-20 | 2018-03-27 | 华为技术有限公司 | Method, relevant apparatus and the system of schedules message |
| CN107959637A (en) * | 2017-10-23 | 2018-04-24 | 新华三技术有限公司 | Message caching method and device |
| CN108055556A (en) * | 2017-11-16 | 2018-05-18 | 北京达佳互联信息技术有限公司 | Data processing method and device |
| CN113454957A (en) * | 2019-02-22 | 2021-09-28 | 华为技术有限公司 | Memory management method and device |
-
2011
- 2011-11-04 CN CN2011103458925A patent/CN102404206A/en active Pending
Non-Patent Citations (1)
| Title |
|---|
| 刘锦堂: "厦门电信城域网的QoS研究与项目部署", 《北京邮电大学硕士学位论文》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104102693A (en) * | 2014-06-19 | 2014-10-15 | 广州华多网络科技有限公司 | Object processing method and device |
| CN104102693B (en) * | 2014-06-19 | 2017-10-24 | 广州华多网络科技有限公司 | Object processing method and device |
| CN107846341A (en) * | 2016-09-20 | 2018-03-27 | 华为技术有限公司 | Method, relevant apparatus and the system of schedules message |
| CN106603290A (en) * | 2016-12-15 | 2017-04-26 | 天津交控科技有限公司 | Network management software performance optimization processing method and device |
| CN107070613A (en) * | 2017-03-22 | 2017-08-18 | 公安部交通管理科学研究所 | Reliable data transmission method under distributed network environment |
| CN107070613B (en) * | 2017-03-22 | 2020-04-10 | 公安部交通管理科学研究所 | Reliable data transmission method in distributed network environment |
| CN107959637A (en) * | 2017-10-23 | 2018-04-24 | 新华三技术有限公司 | Message caching method and device |
| CN108055556A (en) * | 2017-11-16 | 2018-05-18 | 北京达佳互联信息技术有限公司 | Data processing method and device |
| US11218780B2 (en) | 2017-11-16 | 2022-01-04 | Beijing Dajia Internet Information Technology Co., Ltd. | Data processing Method and device |
| CN113454957A (en) * | 2019-02-22 | 2021-09-28 | 华为技术有限公司 | Memory management method and device |
| US11695710B2 (en) | 2019-02-22 | 2023-07-04 | Huawei Technologies Co., Ltd. | Buffer management method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102404206A (en) | Enqueueing processing method and device | |
| KR102317523B1 (en) | Packet control method and network device | |
| CN111294969B (en) | BSR triggering method and device, storage medium and user equipment | |
| CN109067578A (en) | A kind of method and apparatus of rapidly channel switching | |
| WO2021098730A1 (en) | Switching network congestion management method and apparatus, device, and storage medium | |
| US9345041B2 (en) | Adjusting delaying of arrival of data at a base station | |
| CN107547442A (en) | Data transfer buffer queue distribution method and device | |
| CN104718735A (en) | Congestion notification in a network | |
| CN102857440A (en) | Data processing method and switchboard | |
| CN109995608B (en) | Network rate calculation method and device | |
| US20090119694A1 (en) | Audience Monitoring of IP Multicast Stream | |
| US9258236B2 (en) | Per-class scheduling with rate limiting | |
| Georgiadis et al. | Minimal evacuation times and stability | |
| US8194669B1 (en) | Method and system for identifying media type transmitted over an atm network | |
| CN107733812A (en) | A kind of data packet dispatching method, device and equipment | |
| US8660001B2 (en) | Method and apparatus for providing per-subscriber-aware-flow QoS | |
| US10039028B2 (en) | Congestion in a wireless network | |
| WO2022035935A1 (en) | Multi-packet sliding window scheduler and method for input-queued switches | |
| US11765602B2 (en) | Supervision of data in a wireless network | |
| Lin et al. | Throughput-optimal LIFO policy for bounded delay in the presence of heavy-tailed traffic | |
| US8832309B2 (en) | Generating packets with low overhead or selectable sequence number generation | |
| US8848587B2 (en) | Multicasting network packets | |
| CN112511385B (en) | Test flow data generation method and device and electronic equipment | |
| US9397915B2 (en) | Reducing time period of data travel in a wireless network | |
| WO2023165199A1 (en) | Communication method, apparatus, 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 | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120404 |