CN117729271A - Message processing method and device and electronic equipment - Google Patents
Message processing method and device and electronic equipment Download PDFInfo
- Publication number
- CN117729271A CN117729271A CN202311737511.7A CN202311737511A CN117729271A CN 117729271 A CN117729271 A CN 117729271A CN 202311737511 A CN202311737511 A CN 202311737511A CN 117729271 A CN117729271 A CN 117729271A
- Authority
- CN
- China
- Prior art keywords
- message
- messages
- sent
- token bucket
- token
- 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
- 238000003672 processing method Methods 0.000 title abstract description 20
- 238000000034 method Methods 0.000 claims abstract description 38
- 238000012545 processing Methods 0.000 claims abstract description 24
- 230000005540 biological transmission Effects 0.000 claims description 17
- 230000008707 rearrangement Effects 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 abstract description 6
- 239000002699 waste material Substances 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 9
- 238000007493 shaping process Methods 0.000 description 9
- 230000008569 process Effects 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000011156 evaluation Methods 0.000 description 3
- YYYARFHFWYKNLF-UHFFFAOYSA-N 4-[(2,4-dimethylphenyl)diazenyl]-3-hydroxynaphthalene-2,7-disulfonic acid Chemical compound CC1=CC(C)=CC=C1N=NC1=C(O)C(S(O)(=O)=O)=CC2=CC(S(O)(=O)=O)=CC=C12 YYYARFHFWYKNLF-UHFFFAOYSA-N 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a message processing method, a message processing device and electronic equipment. The method relates to the field of message distribution, and comprises the following steps: acquiring a plurality of messages to be sent; based on the token bucket, respectively distributing tokens for a plurality of messages to be sent to obtain first tokens respectively corresponding to the messages to be sent and color identifiers respectively corresponding to the messages to be sent; based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, the messages to be sent are put into a plurality of cache queues, wherein the cache queues correspond to different service types; and based on the first tokens respectively corresponding to the messages to be sent, sending the messages according to preset message sending rules respectively corresponding to the cache queues. The invention solves the technical problems of low message sending efficiency and bandwidth resource waste existing in the message processing method in the related technology.
Description
Technical Field
The present invention relates to the field of message distribution, and in particular, to a message processing method, a device and an electronic device.
Background
The internet message distribution system has wide application in the field of system interface information interaction, and messages are exchanged in each system (one request corresponds to one response) through one network communication protocol. Normal message exchange depends on many factors, such as whether the two interacting parties trust (certificates), whether the interacting network is connected, whether the network bandwidth capacity is sufficient, etc., and the network bandwidth capacity is easily ignored in the industry system, so that message processing efficiency is low when the bandwidth capacity is insufficient. And in the related art, when the message processing is performed, the message is prevented from being blocked in the network transmission mainly by providing a bandwidth large enough, but the method easily causes the waste of bandwidth resources.
In view of the above problems, no effective solution has been proposed at present.
Disclosure of Invention
The embodiment of the invention provides a message processing method, a message processing device and electronic equipment, which at least solve the technical problems of low message sending efficiency and bandwidth resource waste existing in the message processing method in the related technology.
According to an aspect of an embodiment of the present invention, there is provided a message processing method, including: acquiring a plurality of messages to be sent; based on a token bucket, respectively distributing tokens to the plurality of messages to be sent to obtain first tokens respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket; based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, placing the messages to be sent into a plurality of cache queues, wherein the cache queues correspond to different service types; and based on the first tokens respectively corresponding to the messages to be sent, sending the messages according to preset message sending rules respectively corresponding to the cache queues.
According to another aspect of the embodiment of the present invention, there is also provided a message processing apparatus, including: the message acquisition module is used for acquiring a plurality of messages to be sent; the token distribution module is used for respectively distributing tokens to the messages to be sent based on a token bucket to obtain first tokens respectively corresponding to the messages to be sent and color identifiers respectively corresponding to the messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket; the message Wen Rulie module is configured to put the plurality of messages to be sent into a plurality of cache queues based on service types respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, where the plurality of cache queues correspond to different service types; and the message sending module is used for sending the message according to preset message sending rules respectively corresponding to the plurality of cache queues based on the first tokens respectively corresponding to the plurality of messages to be sent.
According to another aspect of the embodiments of the present invention, there is further provided an electronic device, including one or more processors and a memory, where the memory is configured to store one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement any one of the packet processing methods.
In the embodiment of the invention, a plurality of messages to be sent are obtained; based on a token bucket, respectively distributing tokens to the plurality of messages to be sent to obtain first tokens respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket; based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, placing the messages to be sent into a plurality of cache queues, wherein the cache queues correspond to different service types; based on the first tokens respectively corresponding to the messages to be sent, the messages are sent according to preset message sending rules respectively corresponding to the cache queues, the purposes of storing the messages into the corresponding cache queues according to service types and carrying out targeted classified sending on the basis of the message sending rules corresponding to the cache queues are achieved, and therefore the technical effects of improving the message sending efficiency and reducing the occupied bandwidth resources are achieved, and further the technical problems that the message sending efficiency is low and the bandwidth resources are wasted in the message processing method in the related technology are solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiments of the invention and together with the description serve to explain the invention and do not constitute a limitation on the invention. In the drawings:
FIG. 1 is a flow chart of a message processing method according to an embodiment of the invention;
FIG. 2 is a schematic diagram of an alternative FIFO queue in accordance with an embodiment of the invention;
fig. 3 is a combined queue schematic diagram of an alternative PQ queue and WFQ queue in accordance with an embodiment of the present invention;
FIG. 4 is a flow chart of an alternative message processing method according to an embodiment of the invention;
FIG. 5 is an alternative token bucket process flow diagram in accordance with embodiments of the invention;
fig. 6 is an alternative GTS traffic shaping schematic diagram in accordance with an embodiment of the present invention;
fig. 7 is a schematic diagram of a message processing apparatus according to an embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
First, in order to facilitate understanding of the embodiments of the present invention, some terms or nouns referred to in the present invention will be explained below:
generalized token bucket (Generalized Token Bucket, GTS) traffic shaping techniques are one technique for traffic control in a network. It smoothes network traffic by limiting the rate at which packets are sent to better manage network load and ensure quality of service.
In accordance with an embodiment of the present invention, there is provided a method embodiment of message processing, it being noted that the steps shown in the flowchart of the figures may be performed in a computer system, such as a set of computer executable instructions, and, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in an order other than that shown or described herein.
Fig. 1 is a flowchart of a message processing method according to an embodiment of the present invention, as shown in fig. 1, the method includes the following steps:
step S102, a plurality of messages to be sent are obtained.
Optionally, the plurality of messages to be sent come from different user terminals and correspond to a plurality of service types, where the service types are determined according to numbers in a header of the messages to be sent, and may include, but not be limited to: an order type, a query type, a refund type, a payment type, and so on.
Step S104, respectively distributing tokens to a plurality of messages to be sent based on a token bucket to obtain first tokens respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket.
Optionally, token allocation is performed on a plurality of messages to be sent based on the token bucket, specifically, the plurality of messages to be sent can be respectively input into the token bucket, the token bucket can determine a corresponding first token according to the message length of each message to be sent in the plurality of messages to be sent, and meanwhile, the token bucket can label different color identifiers for each message according to the relationship between the message capacity of each message and the token bucket capacity so as to distinguish the message length characteristics of the plurality of messages.
In an alternative embodiment, the token bucket includes a first token bucket and a second token bucket, and based on the token bucket, tokens are respectively allocated to a plurality of messages to be sent, so as to obtain first tokens respectively corresponding to the plurality of messages to be sent, and color identifiers respectively corresponding to the plurality of messages to be sent, including: the method comprises the steps of respectively taking a plurality of messages to be sent as first messages, and obtaining a first token corresponding to the first messages and a color identifier corresponding to the first messages in the following manner: acquiring the message length of a first message, the capacity of a first token bucket corresponding to a first token bucket, and the capacity of a second token bucket corresponding to a second token bucket; determining the relation among the message length, the first token bucket capacity and the second token bucket capacity; based on the relation, a token bucket is adopted to distribute tokens for the first message, and the first token corresponding to the first message and the color identifier corresponding to the first message are obtained.
Optionally, the token bucket is a single-speed double-bucket token bucket, and comprises a first token bucket and a second token bucket, wherein the first token bucket is marked as a CBS token bucket (C bucket for short) and the second token bucket is marked as an EBS (E bucket for short); before the token bucket is put into use, the token bucket needs to be initialized and configured, which specifically comprises the following steps: 1) Initializing the capacity of a CBS token bucket as the capacity of a dedicated line bandwidth, wherein the unit is byte bit; 2) Initializing the capacity of an EBS token bucket to be 1.2 times of the bandwidth capacity of a special line, wherein the unit is bit; 3) Initializing a committed information rate (Committed Information Rate, CIR): the CIR is used for indicating the speed of adding new tokens in the token bucket, namely filling the token bucket in a time period delta T, and the CIR is calculated according to the following formula: cir=cbs/Δt. Wherein CBS (Committed Burst Size) is a committed burst size, which is used to define a maximum burst size before a partial traffic rate exceeds the CIR, i.e., a burst size indicating the capacity of the C-bucket, which can be passed instantaneously; EBS (Excess Burst Size) is an excess burst size that defines the maximum traffic size allowed for each burst, i.e., the peak burst traffic that represents the capacity of the E-bucket through which the burst can pass instantaneously. In the above manner, by setting the relations among the lengths of the messages, the capacity of the first token bucket and the capacity of the second token bucket, the messages to be sent can be distinguished and identified according to the lengths of the messages.
In an alternative embodiment, based on the relationship, a token bucket is used to assign a token to a first message, so as to obtain a first token corresponding to the first message and a color identifier corresponding to the first message, including: under the condition that the relation indicates that the message length of the first message is smaller than or equal to the capacity of the first token bucket, the first token bucket is adopted to distribute tokens for the first message, a first token corresponding to the first message is obtained, and the color identifier corresponding to the first message is determined to be a first color identifier; under the condition that the relation indicates that the message length of the first message is larger than the first token bucket capacity and smaller than the second token bucket capacity, a second token bucket is adopted to distribute tokens for the first message, a first token corresponding to the first message is obtained, and a color identifier corresponding to the first message is determined to be a second color identifier, wherein the second token bucket capacity is larger than the first token bucket capacity; and under the condition that the relation indicates that the message length of the first message is greater than the capacity of the second token bucket, suspending to allocate tokens for the first message, and determining the color mark corresponding to the first message as a third color mark, wherein the first color mark, the second color mark and the third color mark are different.
Optionally, based on the size relation between the message length and the first token bucket capacity and the second token bucket capacity, the plurality of messages to be sent can be classified into three types, and different token generation modes can be adopted for different types of messages to be sent. For example, for a message with a message length less than the capacity of the first token bucket, the message may be marked as a first color identifier (e.g., green), and the first token bucket for handling regular traffic may be used asThe message generates a corresponding number of tokens, i.e. when the message length B is smaller than or equal to the first token bucket capacity T CBS (i.e.B.ltoreq.T CBS ) In the case of (2), T CBS Reduce B, based on updated first token bucket capacity T' CBS ＝T CBS -B generating a corresponding number of tokens for the message to be sent. For messages with message length between the first token bucket capacity and the second token bucket capacity, the messages can be marked as a second color mark (such as yellow), and the second token bucket for processing burst traffic is adopted to generate corresponding quantity of tokens for the messages, namely, when the message length B is larger than the first token bucket capacity T CBS And is less than the second token bucket capacity T EBS (i.e., T_CBS)<B.ltoreq.T_EBS), T is taken as EBS Reduce B, T CBS Not decreasing, based on updated second token bucket capacity T' CBS ＝T CBS -B generating a corresponding number of tokens for the message to be sent. For messages with a message length greater than the capacity of the second message bucket, the messages can be marked as a third color mark (such as red), and discarded from the token bucket, at this time T CBS And T EBS Neither is reduced.
The normal flow rate and the burst flow rate can be controlled separately in the above manner. For example, regular traffic may be controlled by C-bucket, while bursty traffic may be controlled by E-bucket, thereby better smoothing network traffic. By setting different parameters, such as the token generation rate and the capacity of the token bucket, different types of traffic can be controlled more flexibly, so that the network can be better adapted to different traffic characteristics. And by controlling the conventional traffic and the burst traffic respectively, the service quality can be better ensured, and the network is prevented from being congested due to the burst traffic.
Step S106, based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, the messages to be sent are put into a plurality of cache queues, wherein the cache queues correspond to different service types.
Optionally, the service type may be used to determine to which buffer queue the message to be sent is stored, and the color identifier may be used to indicate a message length characteristic of the message to be sent, and based on the color identifier, an enqueuing manner of the message to be sent may be determined. Through the combination of the service types and the color identifications respectively corresponding to the messages to be sent, the messages to be sent can be put into a plurality of caches according to a specific enqueue sequence, so that the classified storage of the messages to be sent is realized.
In an alternative embodiment, based on the service types respectively corresponding to the plurality of messages to be sent and the color identifiers respectively corresponding to the plurality of messages to be sent, the method includes the steps of: the method comprises the steps of sequentially storing a plurality of messages to be sent, wherein the service type of the messages to be sent is a list type or a query type, in a first cache queue according to message receiving time and corresponding color identifiers; storing the message to be sent with the business type of refund type in a second cache queue; and storing the message to be transmitted, of which the service type is the payment type, into a third cache queue.
Optionally, for services of the ordering type or the query type, in some specific periods, the situation that the concurrency of the services is large may occur in the double 11, the double 12, etc., and at this time, more messages are received from the user side, and the messages can be put into corresponding first buffer queues according to the message receiving time and the corresponding color identifier, so as to ensure that the messages can be normally processed and forwarded under the condition that the concurrency is large, where each service type corresponds to one buffer queue, and two first buffer queues are set to be used for storing the to-be-sent messages of the ordering type and the to-be-sent messages of the query type respectively. The burst quantity of the refund type message is not large, so that a second buffer queue is independently arranged for storing the type message; the payment type message needs to be ensured to be processed according to the message priority, and meanwhile, the condition that the message with low priority is never sent needs to be avoided, so that a third buffer queue is independently arranged for storing the message. By the method, aiming at the characteristics of the messages to be sent of the order type, the inquiry type, the payment type and the refund type, the cache queues of the multiple messages to be sent are allocated and sent in a targeted manner, so that the message processing efficiency is improved.
Step S108, based on the first tokens respectively corresponding to the messages to be sent, the messages are sent according to preset message sending rules respectively corresponding to the cache queues.
Optionally, storing a plurality of messages to be sent into corresponding buffer queues according to the service type, wherein the buffer queues respectively correspond to message sending rules which accord with the characteristics of the service type of the messages, and sending the messages according to the corresponding message sending rules so as to improve the processing efficiency of the messages.
In an alternative embodiment, the sending of the message according to the preset message sending rule corresponding to each of the plurality of cache queues includes: transmitting the messages stored in the first buffer queue according to a first message transmission rule, wherein the first buffer queue is a first-in first-out queue, and the first message transmission rule is used for indicating: a message first-out queue stored in a first cache queue; transmitting the messages stored in the second buffer queue according to a second message transmission rule, wherein the second buffer queue is a priority queue, and the second message transmission rule is used for indicating: message first-out queues with priority arranged in the front; and transmitting the messages stored in the third buffer memory queue according to a third message transmission rule, wherein the third buffer memory queue is a combined queue of a priority queue and a weighted fair queue, the third message transmission rule is used for indicating that the priority is arranged in the front, and the messages in the front are subjected to the priority rearrangement.
Optionally, the characteristic that burst quantity is large under the specific conditions of the to-be-sent messages of the ordering type and the query type can be stored in a first-in first-out FIFO (first-in first-out) queue, when the messages are listed, the messages are listed in the first-in queue according to the messages with early receiving time, and a plurality of messages received in the same time period enter the queue according to the sequence of green, yellow and red color marks; FIG. 2 is a schematic diagram of an alternative FIFO queue according to an embodiment of the present invention, as shown in FIG. 2, in the process of queuing messages, the messages are queued in the order of green, yellow, and red; when the user goes out of the queue, the user can be ensured to order, pay and acquire the payment result according to the principle of first in first out in the above mode. The burst quantity of the refund type message is not very large, so that all messages can be ensured to be sent normally, a priority PQ queue can be adopted, and the priority sequence of the messages, namely, a message first-out queue with high priority, can be determined based on the priority of a message sending account, thereby ensuring that all the messages can be sent smoothly, ensuring that the corresponding messages of the account with high priority are processed preferentially, and further improving the user experience. In the embodiment of the invention, fig. 3 is a schematic diagram of an optional combination queue of a PQ queue and a WFQ queue, as shown in fig. 3, a message of a payment type in a plurality of messages to be sent is periodically polled in a periodic polling manner, and a priority and a weight corresponding to each message in the message are determined, and the message is stored in the queue and the output queue according to a combination sequence of the priority and the weight; based on the queue, all messages in the queue can be ensured to be sent smoothly, and meanwhile, the account with high priority can be ensured to be processed with the corresponding message priority, so that the aim of further improving the user experience can be achieved.
In an alternative embodiment, based on the first tokens respectively corresponding to the messages to be sent, the sending of the messages according to the preset message sending rules respectively corresponding to the cache queues includes: determining a message type corresponding to a second message output from a plurality of cache queues according to a corresponding preset message sending rule; inquiring whether the message type is a preset type or not; and forwarding the second message to a preset position under the condition that the message type is a preset type and the message length of the second message is smaller than or equal to the capacity of the first token bucket.
Optionally, before forwarding the message, each message (i.e., the second message) output from the multiple cache queues needs to determine whether the second message is a message of a predetermined type according to a message type, if not, forwarding the second message directly based on the allocated first token, if yes, further determining whether traffic shaping is required for the second message according to a message length of the second message, and if the message length of the second message is smaller and smaller than a first token bucket capacity, forwarding the second message based on the allocated first token. By the method, for special messages, namely messages with the message type being the preset type, the requirement on the message forwarding speed is high, and the messages with special service requirements can be ensured to be forwarded and processed normally by performing secondary judgment on the message length of the messages with the preset type.
In an alternative embodiment, the method further comprises: storing the second message to a target cache queue under the condition that the message type is a preset type and the message length of the second message is larger than the preset message length; according to a target message sending rule corresponding to the target cache queue, each message in the target cache queue is taken out and input into a token bucket, and a token is added into the token bucket according to a corresponding preset token adding rate, so that a second token corresponding to each message is obtained; and sending each message to a preset position based on the second token corresponding to each message.
Optionally, for a second message with a predetermined message type and a larger message length, traffic shaping is performed on the second message based on a generalized token bucket (Generalized Token Bucket, GTS) traffic shaping technology, and a new token (i.e., a second token) is allocated to the second message. Specifically, the second message needs to be stored in a target buffer queue (i.e., a GTS buffer queue), and for each message stored in the target buffer queue, the second message needs to be sequentially dequeued into a token bucket, and a token is added into the token bucket according to a corresponding predetermined token adding rate (e.g., a committed information rate CIR) to obtain a second token allocated to each message; and transmitting each message output from the target cache queue to a predetermined location based on the second token. By the method, the message with special service requirements can be ensured to be normally sent.
In an alternative embodiment, the method further comprises: and forwarding the second message to a preset position based on the first token corresponding to the second message under the condition that the message type is not the preset type.
Optionally, if the second message output in the plurality of cache queues is not a message of a predetermined type, it indicates that the second message is a general message, and the second message is forwarded directly based on the allocated first token without special processing.
Through the steps S102 to S108, the purposes of storing the messages into the corresponding cache queues according to the service types and carrying out targeted classified transmission of the messages based on the message transmission rules corresponding to the cache queues can be achieved, so that the technical effects of improving the message transmission efficiency and reducing the occupation of bandwidth resources are achieved, and the technical problems of low message transmission efficiency and bandwidth resource waste in the message processing method in the related art are solved.
Based on the foregoing embodiment and the optional embodiments, an optional implementation manner is provided in the present invention, and fig. 4 is a flowchart of an optional packet processing method according to an embodiment of the present invention, as shown in fig. 4, where the method includes:
Step S1, classifying the inlet flow: and dividing the received messages into a list type message, a payment type message, a query type message, a refund type message and the like (the messages are provided with message numbers) according to the number dimension in the message header and the service type.
Step S2, carrying out message evaluation by adopting a token bucket of a single-speed double bucket, and distributing tokens for a plurality of messages to be sent, wherein the method specifically comprises the following sub-steps:
step S21, a token bucket initialization process, including:
initializing the capacity of a CBS token bucket as the bandwidth capacity of a special line, wherein the unit is bit;
initializing the capacity of an EBS token bucket to be 1.2 times of the bandwidth capacity of a special line, wherein the unit is bit;
initializing a committed information rate (Committed Information Rate, CIR): the unit is Kbps, the CIR is used for indicating the speed of adding new tokens in the token bucket, namely, the token bucket is filled in a time period delta T, and the CIR calculation formula is as follows: cir=cbs/Δt.
Step S22, a token bucket evaluation phase, including generating tokens, consuming tokens, and determining whether a data packet (i.e. a message to be sent) passes, is an optional token bucket processing flowchart according to an embodiment of the present invention, as shown in fig. 5, and specifically includes:
Step S221, generating a token: adding tokens to the token bucket at preset time intervals delta T by CIR, adding a first CBS token bucket firstly, adding a second EBS token bucket after being full, and discarding redundant tokens if the number of the tokens in the bucket has corresponding capacity;
step S222, consumption token: inputting a message to be sent consumes tokens in a bucket, and messages with large message length consume more tokens than messages with small message length;
step S223, judging whether or not: the results of the input message to be sent after passing through the token bucket include output from the CBS token bucket (subsequently marked blue by rule), output from the EBS token bucket (subsequently marked yellow by rule), and discard from the EBS token bucket (subsequently marked red by rule).
When evaluating the arriving message to be sent, i.e. determining the color identity, the following rules are followed:
if the message length B of the message to be sent is smaller than or equal to the first token bucket capacity T CBS B is less than or equal to T CBS Will T CBS Reduce B, based on updated first token bucket capacity T' CBS ＝T CBS -B generating a corresponding number of tokens for the message to be sent, the message of this type being marked green in step S3;
if the message length B of the message to be sent is larger than the first token bucket capacity T CBS And is less than the second token bucket capacity T EBS T, i.e CBS <B≤T EBS Will T EBS Reduce B, T CBS Not decreasing, based on updated second token bucket capacity T' CBS ＝T CBS -B generating a corresponding number of tokens for the message to be sent, the message of this type being marked yellow in step S3;
if the message length of the message to be sent is larger than the second message barrel capacity, B>T EBS T is then CBS And T EBS No decrease, this type of message is marked red in step S3.
Step S3, report Wen Biaoji: and (3) respectively marking three different colors (green-B, yellow-G and red-R) for a plurality of messages to be sent according to different service types aiming at the token bucket evaluation result in the step S2, and particularly assigning a number Flag in a message header.
Step S4, creating a queue and placing the message with the mark in the step S3 into the queue:
FIFO first-in first-out queues: creating FIFO queues for the messages of the ordering type and the inquiring type in the plurality of messages to be sent respectively, wherein each queue sequentially enters the queues according to the message identifications of green B, yellow G and red R, so that the user is ensured to order, pay and acquire payment results first;
PQ priority queue: respectively creating a PQ queue for a plurality of messages to be sent, wherein the messages of refund type have high priority and fall back with low priority, and meanwhile, considering the situation that refund amount burst amount cannot be very large, the refund cannot be refunded all the time with low priority is ignored;
PQ priority queue in combination with WFQ weighted fair queue: respectively creating a PQ+WFQ combined queue for a plurality of messages to be sent, wherein the messages of payment type are forwarded first with high priority, and meanwhile, the situation that the messages with low priority are never sent is avoided;
step S5, shaping GTS traffic: traffic shaping is based on queuing of buffered packets. For each message of the buffer queue created in the step S4, firstly classifying the output message according to the message type, if the message does not need to be subjected to GTS processing, the message is continuously sent, and the message does not need to be continuously processed through a token bucket; if required, comparing with tokens in the token bucket, fig. 6 is an alternative GTS traffic shaping schematic diagram according to an embodiment of the present invention, as shown in fig. 6, specifically including the following procedures:
step S51, message size B-T of entering token bucket processing CBS If not more than 0, sending a message, otherwise, entering a flow of the step S51;
and step S52, the message is cached in a queue, a token is placed in the token bucket by the token bucket according to the set promise information rate CIR, the message cached in the GTS cache queue is preferentially compared with the token bucket token, the flow of step S51 is entered until the message sending in the GTS cache queue is completed, and then the flow of step S51 is entered.
The embodiment of the invention at least can realize the following technical effects: 1) By means of a token bucket algorithm of a single-speed double bucket and a GTS (traffic shaping technology), different service qualities can be provided for different service types; 2) The expansibility is strong, the occupation of resources is less, and the network bandwidth is fully utilized on the premise of not influencing the service quality.
The embodiment also provides a message processing device, which is used for implementing the above embodiment and the preferred implementation manner, and the description is omitted herein. As used below, the terms "module," "apparatus" may be a combination of software and/or hardware that implements a predetermined function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
According to an embodiment of the present invention, there is further provided an embodiment of an apparatus for implementing the above-mentioned message processing method, and fig. 7 is a schematic structural diagram of a message processing apparatus according to an embodiment of the present invention, as shown in fig. 7, where the above-mentioned message processing apparatus includes: a message acquisition module 700, a token allocation module 702, a message Wen Rulie module 704, and a message sending module 706, wherein:
The message obtaining module 700 is configured to obtain a plurality of messages to be sent;
the token distribution module 702 is connected to the message acquisition module 700, and is configured to distribute tokens for a plurality of messages to be sent respectively based on a token bucket, to obtain first tokens corresponding to the plurality of messages to be sent respectively, and color identifiers corresponding to the plurality of messages to be sent respectively, where the color identifiers are determined based on a relationship between a message length of the corresponding message and a capacity of the token bucket;
the message Wen Rulie module 704 is connected to the token allocation module 702, and is configured to place the plurality of messages to be sent into a plurality of cache queues based on the service types respectively corresponding to the plurality of messages to be sent and the color identifiers respectively corresponding to the plurality of messages to be sent, where the plurality of cache queues correspond to different service types;
the message sending module 706 is connected to the message Wen Rulie module 704, and is configured to send a message according to a preset message sending rule corresponding to each of the plurality of cache queues based on the first tokens corresponding to each of the plurality of messages to be sent.
In the embodiment of the present invention, a message obtaining module 700 is configured to obtain a plurality of messages to be sent; the token distribution module 702 is connected to the message acquisition module 700, and is configured to distribute tokens for a plurality of messages to be sent respectively based on a token bucket, to obtain first tokens corresponding to the plurality of messages to be sent respectively, and color identifiers corresponding to the plurality of messages to be sent respectively, where the color identifiers are determined based on a relationship between a message length of the corresponding message and a capacity of the token bucket; the message Wen Rulie module 704 is connected to the token allocation module 702, and is configured to place the plurality of messages to be sent into a plurality of cache queues based on the service types respectively corresponding to the plurality of messages to be sent and the color identifiers respectively corresponding to the plurality of messages to be sent, where the plurality of cache queues correspond to different service types; the message sending module 706 is connected to the message Wen Rulie module 704, and is configured to send a message according to preset message sending rules corresponding to the plurality of cache queues based on the first tokens corresponding to the plurality of messages to be sent respectively, so as to achieve the purpose of storing the message into the corresponding cache queues according to the service type and purposefully performing message classification sending based on the message sending rules corresponding to the cache queues, thereby achieving the technical effects of improving the message sending efficiency and reducing the occupation of bandwidth resources while further solving the technical problems of low message sending efficiency and bandwidth resource waste existing in the message processing method in the related art.
In an alternative embodiment, the aforementioned report Wen Rulie module includes: the first storage sub-module is used for sequentially storing a plurality of messages to be sent, which are of a service type of a list type or a query type, into a first cache queue according to the message receiving time and the corresponding color identification; the second storage submodule is used for storing the messages to be sent, of which the service type is the refund type, into a second cache queue; and the third storage sub-module is used for storing the message to be sent, of which the service type is the payment type, into a third cache queue.
In an optional embodiment, the foregoing message sending module includes: the first sending submodule is used for sending the messages stored in the first cache queue according to a first message sending rule, wherein the first cache queue is a first-in first-out queue, and the first message sending rule is used for indicating: a message first-out queue stored in a first cache queue; the second sending submodule is used for sending the messages stored in the second cache queue according to a second message sending rule, wherein the second cache queue is a priority queue, and the second message sending rule is used for indicating: message first-out queues with priority arranged in the front; and the third sending submodule is used for sending the messages stored in the third cache queue according to a third message sending rule, wherein the third cache queue is a combined queue of the priority queue and the weighted fair queue, the third message sending rule is used for indicating that the priority is arranged in the front, and the messages in the front are subjected to priority rearrangement.
In an alternative embodiment, the token allocation module includes: the first acquisition sub-module is used for acquiring the message length of the first message, the first token bucket capacity corresponding to the first token bucket and the second token bucket capacity corresponding to the second token bucket; the first determining submodule is used for determining the relation among the message length, the first token bucket capacity and the second token bucket capacity; and the second acquisition sub-module is used for distributing tokens to the first messages by adopting token buckets based on the relation to obtain the first tokens corresponding to the first messages and the color identifiers corresponding to the first messages.
In an alternative embodiment, the second obtaining sub-module includes: a third obtaining sub-module, configured to, when the relationship indicates that the message length of the first message is less than or equal to the capacity of the first token bucket, allocate a token for the first message by using the first token bucket, obtain a first token corresponding to the first message, and determine that a color identifier corresponding to the first message is a first color identifier; a fourth obtaining sub-module, configured to allocate a token to the first message by using a second token bucket when the relationship indicates that the message length of the first message is greater than the first token bucket capacity and less than the second token bucket capacity, and determine that the color identifier corresponding to the first message is a second color identifier, where the second token bucket capacity is greater than the first token bucket capacity; and the fifth acquisition sub-module is used for suspending the token distribution for the first message and determining the color identifier corresponding to the first message as a third color identifier under the condition that the relation indicates that the message length of the first message is larger than the capacity of the second token bucket, wherein the first color identifier, the second color identifier and the third color identifier are different.
In an optional embodiment, the foregoing message sending module includes: the second determining submodule is used for determining a message type corresponding to a second message output from the plurality of cache queues according to a corresponding preset message sending rule; the first query submodule is used for querying whether the message type is a preset type or not; and the first sending sub-module is used for forwarding the second message to a preset position under the condition that the message type is a preset type and the message length of the second message is smaller than or equal to the capacity of the first token bucket.
In an alternative embodiment, the apparatus further comprises: the fourth storage sub-module is used for storing the second message to the target cache queue under the condition that the message type is a preset type and the message length of the second message is larger than the preset message length; a sixth obtaining submodule, configured to take out and input each message in the target cache queue into a token bucket according to a target message sending rule corresponding to the target cache queue, and add a token into the token bucket according to a corresponding predetermined token adding rate, so as to obtain a second token corresponding to each message; and the second sending submodule is used for sending each message to a preset position based on the second token corresponding to each message.
In an alternative embodiment, the apparatus further comprises: and the third sending sub-module is used for forwarding the second message to a preset position based on the first token corresponding to the second message under the condition that the message type is not the preset type.
It should be noted that each of the above modules may be implemented by software or hardware, for example, in the latter case, it may be implemented by: the above modules may be located in the same processor; alternatively, the various modules described above may be located in different processors in any combination.
It should be noted that, the above-mentioned message obtaining module 700, the token allocating module 702, the message Wen Rulie module 704, and the message sending module 706 correspond to the steps S102 to S108 in the embodiment, and the above-mentioned modules are the same as the examples and application scenarios implemented by the corresponding steps, but are not limited to the disclosure of the above-mentioned embodiments. It should be noted that the above modules may be run in a computer terminal as part of the apparatus.
It should be noted that, the optional or preferred implementation manner of this embodiment may be referred to the related description in the embodiment, and will not be repeated herein.
The message processing apparatus may further include a processor and a memory, where the message acquisition module 700, the token allocation module 702, the message Wen Rulie module 704, the message sending module 706, and the like are stored as program modules in the memory, and the processor executes the program modules stored in the memory to implement corresponding functions.
The processor comprises a kernel, the kernel accesses the memory to call the corresponding program module, and the kernel can be provided with one or more than one. The memory may include volatile memory, random Access Memory (RAM), and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM), among other forms in computer readable media, the memory including at least one memory chip.
According to an embodiment of the present application, there is also provided an embodiment of a nonvolatile storage medium. Optionally, in this embodiment, the nonvolatile storage medium includes a stored program, where the program is controlled to execute any one of the packet processing methods by a device where the nonvolatile storage medium is located when the program runs.
Alternatively, in this embodiment, the above-mentioned nonvolatile storage medium may be located in any one of the computer terminals in the computer terminal group in the computer network or in any one of the mobile terminals in the mobile terminal group, and the above-mentioned nonvolatile storage medium includes a stored program.
Optionally, the program controls the device in which the nonvolatile storage medium is located to perform the following functions when running: acquiring a plurality of messages to be sent; respectively distributing tokens for a plurality of messages to be sent based on a token bucket to obtain first tokens respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket; based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, the messages to be sent are put into a plurality of cache queues, wherein the cache queues correspond to different service types; and based on the first tokens respectively corresponding to the messages to be sent, sending the messages according to preset message sending rules respectively corresponding to the cache queues.
According to an embodiment of the present application, there is also provided an embodiment of a processor. Optionally, in this embodiment, the processor is configured to run a program, where any one of the packet processing methods is executed when the program runs.
According to an embodiment of the present application, there is also provided an embodiment of a computer program product adapted to perform a program initializing the steps of any one of the above-mentioned message processing methods when executed on a data processing device.
Optionally, the computer program product mentioned above, when executed on a data processing device, is adapted to perform a program initialized with the method steps of: acquiring a plurality of messages to be sent; respectively distributing tokens for a plurality of messages to be sent based on a token bucket to obtain first tokens respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket; based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, the messages to be sent are put into a plurality of cache queues, wherein the cache queues correspond to different service types; and based on the first tokens respectively corresponding to the messages to be sent, sending the messages according to preset message sending rules respectively corresponding to the cache queues.
The embodiment of the invention provides an electronic device, which comprises a processor, a memory and a program stored on the memory and capable of running on the processor, wherein the following steps are realized when the processor executes the program: acquiring a plurality of messages to be sent; respectively distributing tokens for a plurality of messages to be sent based on a token bucket to obtain first tokens respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket; based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, the messages to be sent are put into a plurality of cache queues, wherein the cache queues correspond to different service types; and based on the first tokens respectively corresponding to the messages to be sent, sending the messages according to preset message sending rules respectively corresponding to the cache queues.
The above-described order of embodiments of the invention is merely for illustration and does not represent the advantages or disadvantages of the embodiments.
In the foregoing embodiments of the present invention, the descriptions of the embodiments are emphasized, and for a portion of this disclosure that is not described in detail in this embodiment, reference is made to the related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed technology content may be implemented in other manners. The above-described embodiments of the apparatus are merely exemplary, and the division of the modules may be a logic function division, and there may be another division manner when actually implemented, for example, a plurality of modules or components may be combined or may be integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with respect to each other may be through some interface, module or indirect coupling or communication connection of modules, electrical or otherwise.
The modules described above as separate components may or may not be physically separate, and components shown as modules may or may not be physical modules, i.e., may be located in one place, or may be distributed over a plurality of modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in each embodiment of the present invention may be integrated into one processing module, or each module may exist alone physically, or two or more modules may be integrated into one module. The integrated modules may be implemented in hardware or in software functional modules.
The integrated modules described above, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer readable non-volatile storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or in part or all of the technical solution or in part in the form of a software product stored in a non-volatile storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods of the embodiments of the present invention. And the aforementioned nonvolatile storage medium includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely a preferred embodiment of the present invention and it should be noted that modifications and adaptations to those skilled in the art may be made without departing from the principles of the present invention, which are intended to be comprehended within the scope of the present invention.
Claims (10)
1. A method for processing a message, comprising:
acquiring a plurality of messages to be sent;
based on a token bucket, respectively distributing tokens to the plurality of messages to be sent to obtain first tokens respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket;
based on the service types respectively corresponding to the messages to be sent and the color identifications respectively corresponding to the messages to be sent, placing the messages to be sent into a plurality of cache queues, wherein the cache queues correspond to different service types;
and based on the first tokens respectively corresponding to the messages to be sent, sending the messages according to preset message sending rules respectively corresponding to the cache queues.
2. The method of claim 1, wherein the placing the plurality of messages to be sent into the plurality of cache queues based on the service types respectively corresponding to the plurality of messages to be sent and the color identifications respectively corresponding to the plurality of messages to be sent comprises:
The method comprises the steps of sequentially storing to-be-sent messages with service types of an order type or a query type in a first cache queue according to message receiving time and corresponding color identifiers;
storing the message to be sent, of which the service type is a refund type, in a second cache queue;
and storing the message to be transmitted, of which the service type is the payment type, into a third cache queue.
3. The method according to claim 2, wherein the sending the message according to the preset message sending rules corresponding to the plurality of cache queues respectively includes:
transmitting the messages stored in the first buffer queue according to a first message transmission rule, wherein the first buffer queue is a first-in first-out queue, and the first message transmission rule is used for indicating: firstly storing a message first-out queue in the first cache queue;
transmitting the message stored in the second buffer queue according to a second message transmission rule, wherein the second buffer queue is a priority queue, and the second message transmission rule is used for indicating: message first-out queues with priority arranged in the front;
And transmitting the messages stored in the third buffer memory queue according to a third message transmission rule, wherein the third buffer memory queue is a combined queue of a priority queue and a weighted fair queue, and the third message transmission rule is used for indicating that the priority is arranged in the front and the messages in the front are subjected to the priority rearrangement.
4. The method of claim 1, wherein the token bucket comprises a first token bucket and a second token bucket, the assigning tokens to the plurality of messages to be sent respectively based on the token bucket, to obtain first tokens corresponding to the plurality of messages to be sent respectively, and color identifiers corresponding to the plurality of messages to be sent respectively, comprises:
the messages to be sent are respectively used as first messages, and a first token corresponding to the first messages and a color identifier corresponding to the first messages are obtained in the following mode:
acquiring the message length of the first message, the first token bucket capacity corresponding to the first token bucket, and the second token bucket capacity corresponding to the second token bucket;
determining the relation among the message length, the first token bucket capacity and the second token bucket capacity;
And based on the relation, allocating tokens for the first message by adopting the token bucket to obtain a first token corresponding to the first message and a color identifier corresponding to the first message.
5. The method of claim 4, wherein the assigning tokens to the first messages using the token bucket based on the relationship to obtain first tokens corresponding to the first messages and color identifications corresponding to the first messages comprises:
when the relation indicates that the message length of the first message is smaller than or equal to the capacity of the first token bucket, allocating tokens for the first message by adopting the first token bucket to obtain a first token corresponding to the first message, and determining that a color identifier corresponding to the first message is a first color identifier;
when the relation indicates that the message length of the first message is larger than the first token bucket capacity and smaller than the second token bucket capacity, allocating a token to the first message by adopting the second token bucket to obtain a first token corresponding to the first message, and determining a color identifier corresponding to the first message as a second color identifier, wherein the second token bucket capacity is larger than the first token bucket capacity;
And under the condition that the relation indicates that the message length of the first message is greater than the capacity of the second token bucket, suspending to distribute tokens for the first message, and determining that the color identifier corresponding to the first message is a third color identifier, wherein the first color identifier, the second color identifier and the third color identifier are different.
6. The method of claim 4, wherein the sending the message according to the preset message sending rule corresponding to each of the plurality of cache queues based on the first tokens corresponding to each of the plurality of messages to be sent comprises:
determining a message type corresponding to a second message output from the plurality of cache queues according to a corresponding preset message sending rule;
inquiring whether the message type is a preset type or not;
and forwarding the second message to a preset position under the condition that the message type is the preset type and the message length of the second message is smaller than or equal to the capacity of the first token bucket.
7. The method of claim 6, wherein the method further comprises:
storing the second message to a target cache queue under the condition that the message type is the preset type and the message length of the second message is larger than the preset message length;
According to a target message sending rule corresponding to the target cache queue, each message in the target cache queue is taken out and input into the token bucket, and a token is added into the token bucket according to a corresponding preset token adding rate, so that a second token corresponding to each message is obtained;
and transmitting each message to the preset position based on the second token corresponding to each message.
8. The method according to claim 6 or 7, characterized in that the method further comprises:
and forwarding the second message to the preset position based on the first token corresponding to the second message under the condition that the message type is not the preset type.
9. A message processing apparatus, comprising:
the message acquisition module is used for acquiring a plurality of messages to be sent;
the token distribution module is used for respectively distributing tokens to the messages to be sent based on a token bucket to obtain first tokens respectively corresponding to the messages to be sent and color identifiers respectively corresponding to the messages to be sent, wherein the color identifiers are determined based on the relation between the message length of the corresponding messages and the capacity of the token bucket;
The message Wen Rulie module is configured to put the plurality of messages to be sent into a plurality of cache queues based on service types respectively corresponding to the plurality of messages to be sent and color identifiers respectively corresponding to the plurality of messages to be sent, where the plurality of cache queues correspond to different service types;
and the message sending module is used for sending the message according to preset message sending rules respectively corresponding to the plurality of cache queues based on the first tokens respectively corresponding to the plurality of messages to be sent.
10. An electronic device comprising one or more processors and a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of message processing of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311737511.7A CN117729271A (en) | 2023-12-16 | 2023-12-16 | Message processing method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311737511.7A CN117729271A (en) | 2023-12-16 | 2023-12-16 | Message processing method and device and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117729271A true CN117729271A (en) | 2024-03-19 |
Family
ID=90206555
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311737511.7A Pending CN117729271A (en) | 2023-12-16 | 2023-12-16 | Message processing method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117729271A (en) |
-
2023
- 2023-12-16 CN CN202311737511.7A patent/CN117729271A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6934250B1 (en) | Method and apparatus for an output packet organizer | |
| US6882642B1 (en) | Method and apparatus for input rate regulation associated with a packet processing pipeline | |
| US9185047B2 (en) | Hierarchical profiled scheduling and shaping | |
| US6757249B1 (en) | Method and apparatus for output rate regulation and control associated with a packet pipeline | |
| JP4762996B2 (en) | Method and apparatus for ordering packets for routing in a network with indirect determination of packets to be treated with priority | |
| EP3955550B1 (en) | Flow-based management of shared buffer resources | |
| US6829649B1 (en) | Method an congestion control system to allocate bandwidth of a link to dataflows | |
| US9935884B2 (en) | Application data flow management in an IP network | |
| US6795870B1 (en) | Method and system for network processor scheduler | |
| KR100463697B1 (en) | Method and system for network processor scheduling outputs using disconnect/reconnect flow queues | |
| US9998400B2 (en) | Attribution of congestion contributions | |
| Wójcik et al. | Flow oriented approaches to QoS assurance | |
| US8248932B2 (en) | Method and apparatus for fairly sharing excess bandwidth and packet dropping amongst subscribers of a data network | |
| CN107835133B (en) | Stream priority control method based on multi-attribute decision | |
| JP2004266389A (en) | Method and circuit for controlling packet transfer | |
| CN112600684A (en) | Bandwidth management and configuration method of cloud service and related device | |
| EP2063580B1 (en) | Low complexity scheduler with generalized processor sharing GPS like scheduling performance | |
| KR20120055947A (en) | Method and apparatus for providing Susbscriber-aware per flow | |
| CN117729271A (en) | Message processing method and device and electronic equipment | |
| US20090073878A1 (en) | Usage based queuing with accounting for wireless access points | |
| CN115915260A (en) | Resource scheduling method and device, communication method and device, and readable storage medium | |
| EP2667554B1 (en) | Hierarchal maximum information rate enforcement | |
| CN118540287A (en) | Self-adaptive approximate fairness queue scheduling method based on network processor | |
| KR100757194B1 (en) | A Fair Packet Scheduling Method with a High Resource Utilization and Low Implementation Complexity | |
| Domżał et al. | Flow-Oriented Approaches |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |