WO2014071636A1 - Procédé et dispositif d'émission de paquets - Google Patents

Procédé et dispositif d'émission de paquets Download PDF

Info

Publication number
WO2014071636A1
WO2014071636A1 PCT/CN2012/084474 CN2012084474W WO2014071636A1 WO 2014071636 A1 WO2014071636 A1 WO 2014071636A1 CN 2012084474 W CN2012084474 W CN 2012084474W WO 2014071636 A1 WO2014071636 A1 WO 2014071636A1
Authority
WO
WIPO (PCT)
Prior art keywords
token
tokens
message
time
add
Prior art date
Application number
PCT/CN2012/084474
Other languages
English (en)
Chinese (zh)
Inventor
孙艳平
王运富
黄雪峰
Original Assignee
华为技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201280002899XA priority Critical patent/CN103229465A/zh
Priority to PCT/CN2012/084474 priority patent/WO2014071636A1/fr
Publication of WO2014071636A1 publication Critical patent/WO2014071636A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/43—Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR]
    • H04L47/431—Assembling or disassembling of packets, e.g. segmentation and reassembly [SAR] using padding or de-padding

Definitions

  • the present invention relates to the field of communications, and in particular, to a method and an apparatus for transmitting a message. Background technique
  • the token bucket algorithm is the most common algorithm used for traffic shaping (Traffic Shaping) and rate limiting ( Rate Limiting).
  • Traffic Shaping Traffic Shaping
  • Rate Limiting Rate Limiting
  • the token bucket algorithm can also be used to control the number of data sent to the network and allow the transmission of bursty data.
  • the token bucket algorithm places tokens in the bucket according to the user's actual needs according to the speed set by the user. When the number of tokens reaches the bucket capacity, the number of tokens does not increase.
  • sending packets if the number of tokens is sufficient to send packets. The packet is sent normally, and the number of tokens is also reduced during the sending process. If the number of tokens is too small to send a packet, the packet is discarded.
  • a token bucket is also a tool for controlling data traffic. When a token bucket has no token, the packet is not sent. It can be sent only after a new token is generated in the bucket. This limits the traffic of the packet. It can only be less than or equal to the speed at which tokens are generated, and the purpose of limiting traffic is achieved.
  • the method of filling a token by a token bucket is a timed padding.
  • the padding method is simple to implement, but the operation is frequent. When a packet with a long length is sent and the rate is high, multiple times occur. After the padding is enabled, the packet is allowed to pass. This increases the number of times the system needs to calculate the token during the packet sending process. Summary of the invention
  • the embodiment of the invention provides a method and a device for transmitting a message, which can reduce the number of calculations of the token requirement in the message sending process.
  • the first aspect provides a method for sending a packet, including: receiving a packet, and calculating, according to the length of the packet, a request for sending the packet Number of cards TL; Get the number of currently available tokens in the token bucket T add ; If the currently available number of tokens T ADD is less than the number of tokens TL required to send the message, calculate the delay time T delay and start Timing, the delay time is:! ⁇ ⁇ - Ding ⁇ ) ⁇ , where V represents the filling rate of the token;
  • the acquiring the number of currently available tokens in the token bucket specifically includes:
  • T c indicates that the number of tokens remaining in the token bucket of the previous message is sent
  • T flll indicates that the last packet is sent.
  • a time interval dT at which the time 1 ⁇ of the received message is received and the filling time T flll is calculated ; the time interval dT is multiplied by the filling rate V of the token, and then rounded down, plus
  • the number of tokens T c is obtained as the number of currently available tokens T add , that is, D2, LdT*Vj.
  • the method further includes:
  • the token flag is obtained from the token information table, and when the token flag is positive, the step of calculating the delay time is performed.
  • the method specifically includes: if the current available number of tokens T ADD is smaller than a number of tokens TL required to send the packet, The card flag is modified to be negative to indicate that the subsequent message is not processed; the token flag is modified to be positive at the end of the delay time to indicate that the subsequent message is processed.
  • the method further includes:
  • T delay -TjJ updates the number of tokens T e of the token information table, at which time T flll indicates that the message is sent
  • the method further includes:
  • the second aspect provides a device for sending a message, including: a token processor and a delay device, wherein: the token processor is configured to receive a packet, and calculate a sending station according to the length of the packet. The number of tokens TL required for the message; and the number of currently available tokens T ADD in the token bucket;
  • the delay if the token processor for the acquired current is less than the number of available tokens T add the packet transmission required number of tokens T L, the calculated delay time T delay and start timing
  • the token processor further includes:
  • the token information obtaining unit is configured to obtain the number of tokens T c and the filling time T fm from the token information table, where T c represents the number of tokens remaining in the token bucket after the last packet is sent, T flll After the transmission time indicates a packet; timing unit, for calculating the packet receiving time T n T flll with the filling time interval dT;
  • the delay device is further configured to obtain a token flag from the token information table, when the token flag is positive, Used to calculate the delay time Tdelay .
  • the token processor is further configured to: if the currently available number of tokens T add is smaller than a token required to send the packet When the number T L is set, the token flag is modified to be negative to indicate that the subsequent message is not processed; and the token flag is modified to be positive at the end of the delay time to indicate that the subsequent message is processed continuously. .
  • the token processor is further configured to use T N +T DELAY updates the fill time T FLLL in the token information table to LT ADD + V *T DELAY -T L J Updating the number of tokens T c of the token information table, at which time T flll indicates the time at which the message is sent,
  • the token processor is further configured to: if the currently available number of tokens T add is greater than or equal to an order required to send the packet The number of cards TL, the filling time T FLLL of the token information table is updated at the time T N of receiving the message, the number of tokens T C of the token information table is updated by T ADD -TL , and then the sending place Said message.
  • an apparatus for transmitting a message comprising: at least one processor, a memory, a communication interface, and a bus, wherein the at least one processor, the memory, and the communication interface are connected by a bus and complete communication with each other;
  • the processor is further configured to obtain the token number T c and the filling time T fl11 from the token information table, where T c indicates that the last message is sent.
  • the processor is further configured to obtain a token identifier from the token information table, and when the token identifier is positive, The delay time Tdelay is calculated.
  • the processor is further configured to: if the currently available number of tokens T add is smaller than a number of tokens T L required to send the packet, Then, the token flag is modified to be negative to indicate that the subsequent message is not processed; and the token flag is modified to be positive at the end of the delay time to indicate that the subsequent message is processed.
  • the processor is further configured to use T n +T delay Updating the padding time T flll in the token information table, and updating the token number T c of the token information table by LT add +v* T delay -Tjj.
  • T FLLL indicates that the message is sent.
  • T c represents the number of tokens remaining in the token bucket after the message is sent.
  • the processor is further configured to: if the currently available number of tokens T ADD is greater than or equal to the number of tokens required to send the packet, TL And updating the filling time T FM of the token information table at the time T N of receiving the message, updating the number of tokens T C of the token information table by T ADD -TL, and transmitting the message .
  • the method and device for sending a message provided by the embodiment of the present invention can enable the release of the message after the token is filled in at least one time in the delay period, and the message is prevented from being filled for a plurality of times. After the permission is allowed to occur, the delay processing can reduce the number of calculations of the token requirement during the message transmission.
  • FIG. 1 is a schematic flowchart of a method for sending a message according to an embodiment of the present invention
  • FIG. 2 is a schematic flowchart of a method for sending a message according to another embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of an apparatus for sending a message according to an embodiment of the present invention
  • FIG. 4 is a schematic structural diagram of an apparatus for sending a message according to another embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of an apparatus for transmitting a message according to another embodiment of the present invention.
  • the token bucket algorithm is one of the most commonly used algorithms in traffic shaping and rate limiting (Rate Limiting) in the communications field.
  • the token bucket algorithm is used to control the amount of data sent to the network and to allow the transmission of bursty data. Therefore, some methods to limit network traffic need to be taken to avoid the problems that burst traffic brings to the network.
  • the invention is based on a network processor or related software (for example, a programmable device such as a Field-Programmable Gate Array (FPGA)), and a method for delay processing by controlling a token bucket in a message processing process
  • the method for sending a message which is provided by the present invention, as shown in FIG. 1 , includes the following processes:
  • the number of tokens to be consumed in the current packet corresponds to the length of the text body. That is, the number of tokens to be consumed corresponding to the length L of the packet is T L , where the number of tokens corresponding to the length of the packet is exactly an integer.
  • the number of tokens required to obtain a packet is TL.
  • the number of tokens required for the packet length is a decimal number
  • the number of tokens required to be received is rounded up to obtain the required number of tokens. To ensure that the number of tokens that meet the minimum requirements for message delivery can be provided during the subsequent token filling process.
  • the token information table contains the token flag T P . s , the number of tokens T E and the padding time T FLLL ; where T E represents the number of tokens remaining in the token bucket of the previous message, and T FLLL represents the time of transmitting the last message.
  • T E represents the number of tokens remaining in the token bucket of the previous message
  • T FLLL represents the time of transmitting the last message.
  • the token flag T P is indicated . s is positive.
  • the number of tokens remaining in the token bucket of the previous message is T C.
  • the time at which the last message is sent is T FLLL is 50 seconds.
  • the unit of T FLLL is only in seconds. To illustrate, in this embodiment, microseconds, milliseconds, or The number of cycles in the FPGA system is in units.
  • the step 102 specifically includes:
  • T C indicates the number of tokens remaining in the token bucket of the previous message
  • T FLLL indicates the time when the last packet was sent.
  • the current filling time ⁇ ⁇ can be understood as the current message arrival time T a réelle, where T ailler is the current message arrival time, ⁇ ⁇ is the current filling time;
  • the end time of the supplementary token can be understood as the time when the number of tokens required for the previous message is filled, if it is represented by T fill ; if the time interval is represented by dT, the time interval is:
  • the number of tokens filled in the time interval is: dT is multiplied by the filling rate V, and the original number of tokens in the token bucket is T C (that is, the last message recorded in the token information table)
  • T C that is, the last message recorded in the token information table
  • T add T c + LdT * VJ ; where the product of dT * V may not be an integer. If it is not an integer, you can use rounding down (for example, 3.8 to take an integer down to 3) to calculate the D.
  • T delay ( T L - T add ) / V , where V represents the filling rate of the token.
  • the delay time here can be carried in decimals. For example, when the unit of calculating the delay time is calculated in seconds or seconds, the delay time is also a decimal, but when using FPGA as the computing environment, Since in the computing environment of the FPGA, the time value is generally in the form of a pulse, that is, the number of time periods is calculated. When an incomplete time period occurs, it is sometimes difficult to implement in the FP GA computing environment.
  • the delay time in the environment generally adopts the upward rounding strategy, and the upward rounding strategy ensures that the minimum number of tokens can be provided for the transmission of the message within the delay time.
  • the method for sending a message provided by the embodiment of the present invention can enable the release of the message after the token is filled in at least one time in the delay time period, and the message is prevented from being filled after being filled for a plurality of times. The case of allowing the passage occurs, so that the delay processing can reduce the number of calculations of the token requirement during the message transmission.
  • the method for sending a message includes the following process:
  • the 201. Receive a packet, and calculate a number of tokens TL required to send the packet according to the length of the packet.
  • the number of tokens that need to be consumed in the current packet corresponds to the length of the text body. That is, the number of tokens that need to be consumed corresponding to the length L of the packet is T L .
  • the number of tokens required for the packet is an integer
  • the number of tokens required to obtain the packet is TL
  • the number of tokens required for the packet is a decimal, in order to meet the transmission requirement of the packet, Round up to get the required number of tokens "TL1. Therefore, the number of tokens required for the message can be obtained by rounding up.
  • T C indicates that the number of tokens remaining in the token bucket of the previous message is sent
  • T FLLL indicates that the last packet is sent.
  • the number of currently available tokens in the token bucket can be obtained by querying the token information table; where the token information is represented by, for example, Table 2:
  • the token information table contains the token flag T P . s , number of tokens T E and filling time T As shown in Table 2, the token flag T p is represented. s is positive, sending the packet on a token remaining in the token bucket number T c is 100, the time to transmit a complete packet T flll 50 seconds, of course, where T flll unit only seconds Example To illustrate, in this embodiment, microseconds, milliseconds, or the number of cycles in the FPGA system can also be used.
  • the received message is calculated time T n and the filling time interval dT T fill;
  • the current token flag Tp. s is positive ( "1")
  • the current fill time T n will be appreciated that with the current packet arrival time T a "- induced, where T a" packet arrival time of the current, the current fill time T n;
  • Last The end time of the supplementary token can be understood as the time when the number of tokens required for the previous message is filled, if it is represented by T fill ; if the time interval is represented by dT, the time interval is:
  • the number of tokens filled in the time interval is obtained by multiplying the number of tokens by the filling rate V, and the number of original tokens in the token bucket is T c (that is, the last packet transmission recorded in the token information table) After the number of tokens updated T c ) , the current number of available tokens T add is:
  • T add T c + LdT *Vj ; where the product of dT * V may not be an integer, so it can be calculated by rounding down (for example, 3.8 is down to an integer of 3).
  • T delay ( T L - T add ) / V, where V represents the filling rate of the token.
  • the delay time may not be rounded. In actual situations, the delay time may also be a decimal number.
  • the reason for calculating the delay time is as an example in the computing environment of the embodiment of the present invention. For seconds, seconds, the delay time is also decimal and can be calculated. However, in a computing environment such as FPGA, the delay time will be in the form of a pulse.
  • T delay "(T L - T add ) / V l , where V represents the filling rate of the token, and "1 represents rounding up to ensure that there are enough tokens to send the current message. .
  • T P If the current number of available tokens T ADD ⁇ T L , T P will be. s is set to "0" (previously mentioned, 0 means negative).
  • the delay time refers to adding the remaining number of tokens to the minimum time for satisfying the token consumption.
  • the token information in the token information table is The token flag is set to "1", where 1 is positive.
  • T DELAY -T L j updates the token number T c of the token information table, U indicates rounding down.
  • T c LT a dd + V* Tdelay-T L J ;
  • the present invention can be acquired at the end of step 206 for updating T ADD filling time T fll T N + T dela y , and the number of tokens T C token update information table +V *T dela y - T L , so step 210 can be performed at any step between 206 and the time the message is sent.
  • the method further includes:
  • T c T add - min((T add -L):H), that is, T add -L and the token bucket depth H take the minimum value.
  • H is the depth of the token bucket, indicating that the currently available number of tokens T add is greater than or equal to the number of tokens consumed by the packet.
  • the depth H of the token bucket can be set according to the amount of burst data tolerated. When the token bucket depth H is set to be larger, the packet rate that is passed is closer to the set rate, so that the amount of burst data that the token bucket can tolerate is larger, that is, the number of tokens in the token bucket can fully satisfy the report.
  • the request for sending packets, and thus the rate of filling the tokens achieves the purpose of limiting packet traffic.
  • the fill time is in accordance with D. . Updated, but since the calculation process is performed under the same clock system, the clock period that is ignored by the original calculation value and the number of tokens after the decimal point due to the ignored clock cycle will be calculated when the next message arrives. The calculation process is compensated, so in the long run, the time is not wasted, and the token bucket token is not consumed.
  • the method for sending a message provided by the embodiment of the present invention can enable the release of the message after the token is filled in at least one time in the delay time period, and the message is prevented from being filled after being filled for a plurality of times. The case of allowing the passage occurs, so that the delay processing can reduce the number of calculations of the token requirement during the message transmission.
  • An embodiment of the present invention provides a device 3 for transmitting a message.
  • the method includes: a token processor 31 and a delay unit 32.
  • the token processor 31 is configured to receive a packet according to the packet.
  • the length of the token is TL; and the number of currently available tokens T ADD in the token bucket is obtained;
  • the token processor 31 is further configured to send a message when the delay time ends.
  • the device for sending a message according to the embodiment of the present invention can enable the release of the message after the token is filled in the delay time period by using the delay processing, thereby avoiding the release of the message. The case that the message is allowed to pass after being filled for a plurality of times occurs, so that the delay processing can reduce the number of calculations of the token requirement during the message sending process.
  • the token processor 31 further includes: a token information acquiring unit 31 1 , a timing unit 312, and a token calculating unit 313, where:
  • the token information obtaining unit 31 1 is configured to obtain the number of tokens T c and the filling time T fl11 from the token information table, where T c represents the number of tokens remaining in the token bucket of the previous message, T flll Indicates the time at which the last article was sent;
  • the timing unit 312 is configured to calculate a time interval dT between the time T n of the received text and the filling time T fill ; the token calculating unit 313 is configured to multiply the time interval dT by the filling rate V of the token, and then round down, Together with the number of tokens T c , the current number of available tokens T add is obtained , that is, D2, LdT *VJ.
  • the token processor 31 is further configured to update the time T N of receiving the message if the currently available number of tokens T ADD is greater than or equal to the number of tokens TL required to send the message.
  • the padding time T FLLL of the token information table updates the token number T C of the token information table with T ADD -TL and transmits the message.
  • the device provided by the embodiment of the present invention supports sending the packet in a normal processing manner, because the number of currently available tokens is greater than or equal to the number of tokens that are required to be sent by the packet.
  • the delay device 32 is further configured to obtain a token flag from the token information table, and when the token flag is positive, to calculate the delay time T dela y.
  • the token processor 31 is further configured to: if the currently available number of tokens T add is smaller than the number of tokens T L required to send the packet, modify the token flag to be negative to indicate that the subsequent packet is not processed; The token flag is modified to be positive at the end of the delay time to indicate that the subsequent message continues to be processed. Further, the token processor 31 is further configured to update the token time T flll in the T n +T delay update token information table, and update the token of the token information table with LT add + V *T dela y - T L j The number T c , at this time, T flll represents the time at which the message is sent, and T c represents the number of remaining tokens in the token bucket after the message is sent.
  • the device for sending a message which is provided by the embodiment of the present invention, can enable the release of the message after the token is filled in at least one time in the delay period, so as to avoid the message being filled after multiple times. Allow the passage of the situation, so that it can be processed by delay It is enough to reduce the number of calculations of the token demand during the message sending process.
  • the device 5 for transmitting a message includes: at least one processor 51, a memory 52, a communication interface 53, and a bus 54, the at least one processing The device 51, the memory 52 and the communication interface 53 are connected by a bus 54 and complete communication with each other.
  • the bus 54 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus. Wait.
  • ISA Industry Standard Architecture
  • PCI Peripheral Component
  • EISA Extended Industry Standard Architecture
  • the bus 54 can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only one thick line is shown in Figure 5, but it does not mean that there is only one bus or one type of bus. among them:
  • Memory 52 is for storing executable program code, including computer operating instructions.
  • the memory 52 may include a high speed RAM memory and may also include a non-volatile memory, for example at least one disk memory.
  • the processor 51 may be a Central Processing Unit (CPU), or an Application Specific Integrated Circuit (ASIC), or one or more configured to implement the embodiments of the present invention. integrated circuit.
  • the communication interface 53 is mainly used to implement communication between devices in this embodiment.
  • the processor 52 is configured to receive the packet TL by the communication interface 53 and calculate the number of tokens TL required to send the packet according to the length of the packet.
  • the processor 52 is further configured to obtain the currently available token number T add in the token bucket.
  • the processor 52 is further configured to send a message through the communication interface 54 when the delay time ends, where V represents the filling rate of the token.
  • the device for sending a message which is provided by the embodiment of the present invention, can enable the release of the message after the token is filled in at least one time in the delay period, so as to avoid the message being filled after multiple times. The case of allowing the passage occurs, so that the delay processing can reduce the number of calculations of the token requirement during the message transmission.
  • the processor 52 is further configured to obtain the token number T c and the padding from the token information table.
  • Time T flll where T c indicates the number of tokens remaining in the token bucket of the previous message, T flll indicates the time when the last message was sent; and is also used to calculate the time 1 ⁇ and the padding time of the received message.
  • T flll interval dT is also used to multiply the time interval dT by the token filling rate V, and then round down, plus the number of tokens T c , to obtain the current available number of tokens T add , ie D ⁇ L dT *VJ.
  • the processor 52 is further configured to: if the currently available number of tokens T add is greater than or equal to the number of tokens TL required to send the message, update the padding time T of the token information table at the time T N of receiving the message. fm, in order to update the token T add -Tj ⁇ token information table number T c, and message transmission.
  • the device provided by the embodiment of the present invention supports sending the packet in a normal processing manner, because the number of currently available tokens is greater than or equal to the number of tokens that are required to be sent by the packet.
  • the processor 52 is further configured to obtain a token flag from the token information table, and when the token flag is positive, used to calculate the delay time Tdelay .
  • the processor 52 is further configured to: if the currently available number of tokens T add is less than the number of tokens T L required to send the message, modify the token flag to be negative to indicate that the subsequent packet is not processed; At the end, the token flag is modified to be positive to indicate that the subsequent message continues to be processed.
  • the processor 52 is further configured to update the padding time T flll of the token information table with T n +T dela y, and update the token number T c of the token information table by LT add + V* T delay -TjJ.
  • T flll indicates the time at which the packet is sent
  • T c indicates the number of tokens remaining in the token bucket after the packet is sent.
  • the device for sending a message which is provided by the embodiment of the present invention, can enable the release of the message after the token is filled in at least one time in the delay period, so as to avoid the message being filled after multiple times.
  • the case of allowing the passage occurs, so that the delay processing can reduce the number of calculations of the token requirement during the message transmission.
  • the device for sending a message which is provided in the foregoing embodiments, may be used to perform the method corresponding to the embodiment shown in FIG. 1 and FIG. 2, and the details already described in the embodiment shown in FIG. 1 and FIG. 2 are not described herein. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention appartient au domaine des communications. Elle concerne un procédé et un dispositif d'émission de paquets, capable de réduire le nombre de calculs des jetons nécessaires durant le processus d'émission de paquets. Le procédé consiste à : recevoir un paquet et calculer, d'après la longueur de paquet, le nombre de jetons TL utilisés pour émettre le paquet (101) ; acquérir le nombre de jetons actuellement disponibles Tadd dans un seau à jetons (102) ; si le nombre de jetons actuellement disponibles Tadd est inférieur au nombre de jetons TL utilisés pour émettre le paquet, calculer alors le temps de retard Tdelay et commencer à chronométrer le temps, le temps de retard étant Tdelay = (TL-Tadd)/V, où V est la vitesse de remplissage des jetons (103) ; et émettre le paquet lorsque le temps de retard expire (104). La présente invention est applicable à l'émetteur de paquet de réseau.
PCT/CN2012/084474 2012-11-12 2012-11-12 Procédé et dispositif d'émission de paquets WO2014071636A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201280002899XA CN103229465A (zh) 2012-11-12 2012-11-12 一种发送报文的方法和设备
PCT/CN2012/084474 WO2014071636A1 (fr) 2012-11-12 2012-11-12 Procédé et dispositif d'émission de paquets

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2012/084474 WO2014071636A1 (fr) 2012-11-12 2012-11-12 Procédé et dispositif d'émission de paquets

Publications (1)

Publication Number Publication Date
WO2014071636A1 true WO2014071636A1 (fr) 2014-05-15

Family

ID=48838350

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/084474 WO2014071636A1 (fr) 2012-11-12 2012-11-12 Procédé et dispositif d'émission de paquets

Country Status (2)

Country Link
CN (1) CN103229465A (fr)
WO (1) WO2014071636A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114338434A (zh) * 2020-09-25 2022-04-12 深圳市中兴微电子技术有限公司 激励报文发送方法、装置、电子设备及存储介质

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104580004B (zh) * 2014-12-24 2017-12-01 盛科网络（苏州）有限公司 采用非整数令牌实现流量整形的装置及方法
US20180212885A1 (en) * 2017-01-20 2018-07-26 Google Inc. Device and method for scalable traffic shaping at a receiver with a time-indexed data structure
CN108768572B (zh) * 2018-04-13 2019-11-08 烽火通信科技股份有限公司 一种基于令牌的时间戳生成系统及方法
CN114979012B (zh) * 2022-05-31 2024-06-21 郑州浪潮数据技术有限公司 一种网络流量的限流方法、系统、装置及计算机存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1601963A (zh) * 2003-09-26 2005-03-30 华为技术有限公司 基于令牌桶算法的接入速率限制方法
CN1852227A (zh) * 2005-08-25 2006-10-25 华为技术有限公司 一种网络设备有效防攻击的方法
CN101026561A (zh) * 2007-02-09 2007-08-29 中兴通讯股份有限公司 一种令牌桶填充速率配置方法及其装置
US7457313B2 (en) * 2000-09-25 2008-11-25 General Instrument Corporation Hierarchical prioritized round robin (HPRR) scheduling

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100471176C (zh) * 2006-09-12 2009-03-18 华为技术有限公司 队列调度方法及装置
CN102413042A (zh) * 2011-11-14 2012-04-11 盛科网络（苏州）有限公司 基于时戳更新令牌桶的流量监管的方法及系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7457313B2 (en) * 2000-09-25 2008-11-25 General Instrument Corporation Hierarchical prioritized round robin (HPRR) scheduling
CN1601963A (zh) * 2003-09-26 2005-03-30 华为技术有限公司 基于令牌桶算法的接入速率限制方法
CN1852227A (zh) * 2005-08-25 2006-10-25 华为技术有限公司 一种网络设备有效防攻击的方法
CN101026561A (zh) * 2007-02-09 2007-08-29 中兴通讯股份有限公司 一种令牌桶填充速率配置方法及其装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114338434A (zh) * 2020-09-25 2022-04-12 深圳市中兴微电子技术有限公司 激励报文发送方法、装置、电子设备及存储介质

Also Published As

Publication number Publication date
CN103229465A (zh) 2013-07-31

Similar Documents

Publication Publication Date Title
TWI336576B (en) A scheduler system and method thereof
WO2014071636A1 (fr) Procédé et dispositif d'émission de paquets
WO2019062596A1 (fr) Dispositif et procédé de traitement de service basés sur une architecture de service
JP6523995B2 (ja) 情報処理装置、送信装置、受信装置及び方法
CN103975569B (zh) 用于仲裁时间敏感数据传输的方法和装置
CN102932919B (zh) 上行链路探测参考信号的资源配置方法及装置
JP2011530954A (ja) 通信システム内の変更されたタイムスタンプを提供するための方法及び装置
WO2014187114A1 (fr) Procédé de transmission de fichier, appareil, et support de stockage
CN107342848A (zh) 一种自适应码流传输方法、装置及设备
JP2011192068A5 (ja) プログラマブルコントローラおよびマスタ通信回路
WO2017161967A1 (fr) Procédé de surveillance d'un trafic de données en paquets par seconde, dispositif, et support de stockage informatique
CN106559735A (zh) 蓝牙数据发送控制方法及装置
CN109314630B (zh) 链路处理方法、设备及存储介质
WO2011026281A1 (fr) Procédé de renvoi de minimessage et centre de service de minimessages
CN107710810A (zh) 具有延迟容忍的业务的设备的非活动处理
EP4264892A2 (fr) Réacheminement à base de latence garantie
WO2014075488A1 (fr) Procédé et appareil de gestion de file d'attente
WO2014131335A1 (fr) Procédé de transmission de données et appareil de transfert de données
WO2014067322A1 (fr) Procédé d'envoi de message et dispositif associé
WO2015127717A1 (fr) Procédé et dispositif de contrôle de trafic, et support de stockage informatique
CN109150722A (zh) 一种业务转发的方法及网络设备
WO2015085938A1 (fr) Procédé et appareil pour lancer une durée d'un temporisateur de remise en ordre
CN115550173A (zh) 一种基于wfbp和链路特性的动态计算通信调度方法
CN104796994B (zh) 无线通信系统的资源调度方法
CN111385219B (zh) 借用硬件中断实现高性能高精度软件tcp限速的方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12887893

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12887893

Country of ref document: EP

Kind code of ref document: A1