CN110086728B - Method for sending message, first network equipment and computer readable storage medium - Google Patents
Method for sending message, first network equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN110086728B CN110086728B CN201810075675.0A CN201810075675A CN110086728B CN 110086728 B CN110086728 B CN 110086728B CN 201810075675 A CN201810075675 A CN 201810075675A CN 110086728 B CN110086728 B CN 110086728B
- Authority
- CN
- China
- Prior art keywords
- time
- network device
- packet
- queue
- transmission delay
- 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.)
- Active
Links
Images
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/22—Traffic shaping
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
本申请提供了一种发送报文的方法、第一网络设备及计算机可读存储介质。所述方法包括：第一网络设备从第二网络设备接收业务流中的第一报文，所述第一报文包括第一时间标签；所述第一网络设备计算第二时间，将所述第一报文中的所述第一时间标签替换为第二时间标签以获得第二报文，将所述第二报文入队到所述第一网络设备的第二队列中，所述第二时间标签指示允许所述第二报文离开所述第二队列的所述第二时间；所述第一网络设备从所述第二队列中出队所述第二报文，向所述第三网络设备发送所述第二报文。本申请提供的技术方案中第一网络设备既可以降低业务流中报文的抖动，更贴合实际传输状况，又可以降低流量整形的复杂度。
The present application provides a method for sending a message, a first network device and a computer-readable storage medium. The method includes: a first network device receives a first message in a service flow from a second network device, the first message includes a first time stamp; the first network device calculates the second time, and converts the The first time tag in the first packet is replaced with a second time tag to obtain a second packet, and the second packet is queued into the second queue of the first network device, and the second packet is queued. The second time stamp indicates the second time when the second packet is allowed to leave the second queue; the first network device dequeues the second packet from the second queue, and sends the second packet to the second queue. The third network device sends the second packet. In the technical solution provided by the present application, the first network device can not only reduce the jitter of the packets in the service flow, be more suitable for the actual transmission situation, but also reduce the complexity of traffic shaping.
Description
Technical Field
The present application relates to the field of communications, and more particularly, to a method for sending a packet, a first network device, and a computer-readable storage medium.
Background
After a service flow enters a network, a burst may be generated in a network device due to reasons such as service flow aggregation, and the burst service flow may be sent in the network at a rate higher than the limiting rate of the service flow. The bursty traffic streams may affect each other, resulting in uncertainty in the packet delay in the traffic stream. Therefore, there is a need to shape traffic in a network device to eliminate or suppress bursts of traffic.
In a network device, traffic shaping is a technique for shaping a traffic stream passing through a shaper according to a set parameter (e.g., traffic stream limiting rate). In the traditional traffic shaping method, aggregation shaping is to converge a plurality of service flows into a traffic shaping queue, and a shaper shapes all the service flows in the traffic shaping queue according to the same preset traffic limiting rate. The flow-by-flow rate-limiting shaping is that each service flow corresponds to a flow shaping queue and a shaper, although the respective shaping of each service flow can be realized, when the number of the service flows is large, the complexity of the flow shaping is high, and the realization and the maintenance are difficult.
Therefore, it is an urgent problem to implement separate shaping for each traffic stream with low complexity.
Disclosure of Invention
The application provides a method for sending a message, a first network device and a computer readable storage medium, which can reduce the jitter of the message in a service flow, better fit the actual transmission condition and reduce the complexity of flow shaping.
In a first aspect, a method for sending a packet is provided, including: a first network device receives a first message in a service flow from a second network device, wherein the first message comprises a first time label, and the first time label indicates a first time for allowing the first message to leave a first queue of the second network device; the first network device calculates second time, replaces the first time tag in the first message with a second time tag to obtain a second message, and enqueues the second message in a second queue of the first network device, wherein the second time tag indicates the second time for allowing the second message to leave the second queue; the first network device receiving a third packet in a traffic flow from the second network device, the third packet including a third time tag, the third time tag indicating a third time at which the third packet is allowed to leave the first queue of the second network device; the first network device calculates a fourth time, replaces the third time tag in the third message with a fourth time tag to obtain a fourth message, enqueues the fourth message in the second queue of the first network device, where the fourth time tag indicates the fourth time for allowing the fourth message to leave the second queue, a difference between the fourth time and the second time is not less than a maximum transmission delay of the second queue, and the maximum transmission delay of the second queue is a maximum transmission delay of transmission delays from the second network device to the first network device of all messages in the service flows enqueued in the second queue; the first network device dequeues the second message from the second queue and sends the second message to the third network device, wherein the time for dequeuing the second message from the second queue is not earlier than the second time; and the first network equipment dequeues the fourth message from the second queue and sends the fourth message to the third network equipment, wherein the time for dequeuing the fourth message from the second queue is not earlier than the fourth time.
In the foregoing technical solution, the first network device may regard at least one sub-flow passing through the same traffic shaping queue as the same service flow, and shape the service flow by the normalized delay based on the maximized transmission delay. The flow shaping mode reduces the jitter of the messages in the service flow, is more suitable for the actual transmission condition, enables the quantity of the flow shaping queue and the shaper to get rid of the dependence on the quantity of the sub-flows in the service flow, and reduces the complexity of the flow shaping.
In one possible implementation, the calculating the fourth time includes: taking the larger of the pre-stored transmission delay and the transmission delay of the third packet as the maximum transmission delay, where the pre-stored transmission delay is the maximum transmission delay of the transmission delays from the second network device to the first network device of all the packets in the service flow that have enqueued the second queue before the third packet, and the transmission delay of the third packet is the transmission delay of the third packet from the second network device to the first network device; updating the pre-stored value of the transmission delay to the value of the maximum transmission delay; calculating a shaping delay, wherein the shaping delay is the difference between the maximum transmission delay and the transmission delay of the third message; and calculating the fourth time according to the shaping delay and the current time, wherein the current time is the time when the fourth time is calculated by the first network equipment, and the difference between the fourth time and the current time is not less than the shaping delay.
In the above technical solution, the maximum transmission delay is continuously updated in the message transmission process, and the service flow can be shaped by the normalized delay. The flow shaping mode reduces the jitter of the messages in the service flow, is more suitable for the actual transmission condition, can ensure that the quantity of the flow shaping queue and the shaper get rid of the dependence on the quantity of the sub-flows in the service flow, and reduces the complexity of the flow shaping.
In a possible implementation manner, the transmission delay of the third packet is a difference between the current time and the third time.
In the above technical solution, the delay condition of the third packet can be reflected more accurately by selecting the difference between the current time (i.e. the time when the fourth time is calculated) and the third time.
In one possible implementation, the traffic flow includes at least one sub-flow, the at least one sub-flow includes the first packet and the third packet, and a difference between the third time and the first time is not less than an expected transmission time of the first packet from the second network device to the first network device at a limiting rate of the at least one sub-flow.
In the above technical solution, before the first network device receives the first packet and the third packet in one sub-flow of the service flow from the second network device, the first packet and the third packet have performed flow shaping based on a flow-by-flow speed limit calculation method in the second network device. The method can realize the respective shaping of the messages in the service flow, and simultaneously ensure that the quantity of the flow shaping queue and the shaper get rid of the dependence on the quantity of the sub-flows, thereby reducing the complexity of the flow shaping.
In a possible implementation manner, a difference between the third time and the first time is not less than a maximum transmission delay of the first queue, where the maximum transmission delay of the first queue is a maximum transmission delay of transmission delays from a last-hop network device of the second network device to the second network device of all packets in the service flows enqueued in the first queue.
In the above technical solution, before the first network device receives the first packet and the third packet in the service flow from the second network device, the first packet and the third packet have already performed traffic shaping based on a jitter reduction calculation method in the second network device. In the technical scheme, the first network device performs jitter reduction and flow shaping, so that the jitter newly generated when the message is transmitted from the last-hop network device (namely, the second network device) to the first network device can be reduced.
In a second aspect, a first network device is provided, which includes: an input interface module, configured to receive a first packet in a service flow from a second network device, where the first packet includes a first time tag indicating a first time at which the first packet is allowed to leave a first queue of the second network device; a message processing module: the time control unit is used for calculating second time and replacing the first time label in the first message with a second time label to obtain a second message; a flow management module: means for enqueuing the second packet in a second queue of the first network device, the second time tag indicating the second time at which the second packet is allowed to leave the second queue; an input interface module, further configured to receive a third packet in a traffic flow from the second network device, where the third packet includes a third time tag indicating a third time at which the third packet is allowed to leave the first queue of the second network device; the message processing module is further configured to calculate fourth time, and replace the third time tag in the third message with a fourth time tag to obtain a fourth message; a traffic management module, configured to enqueue the fourth packet in the second queue of the first network device, where the fourth time tag indicates a fourth time when the fourth packet is allowed to leave the second queue, a difference between the fourth time and the second time is not less than a maximum transmission delay of the second queue, and the maximum transmission delay of the second queue is a maximum transmission delay of transmission delays from the second network device to the first network device of all packets in the service flow enqueued in the second queue; an output interface module, configured to dequeue the second packet from the second queue and send the second packet to the third network device, where a time for dequeuing the second packet from the second queue is not earlier than the second time; the input interface module is further configured to dequeue the fourth packet from the second queue and send the fourth packet to the third network device, where a time for dequeuing the fourth packet from the second queue is not earlier than the fourth time.
In one possible implementation, the calculating the fourth time includes: taking the larger of the pre-stored transmission delay and the transmission delay of the third packet as the maximum transmission delay, where the pre-stored transmission delay is the maximum transmission delay of the transmission delays from the second network device to the first network device of all the packets in the service flow that have enqueued the second queue before the third packet, and the transmission delay of the third packet is the transmission delay of the third packet from the second network device to the first network device; updating the pre-stored value of the transmission delay to the value of the maximum transmission delay; calculating a shaping delay, wherein the shaping delay is the difference between the maximum transmission delay and the transmission delay of the third message; and calculating the fourth time according to the shaping delay and the current time, wherein the current time is the time when the fourth time is calculated, and the difference between the fourth time and the current time is not less than the shaping delay.
In a possible implementation manner, the transmission delay of the third packet is a difference between the current time and the third time.
In one possible implementation, the traffic flow includes at least one sub-flow, the at least one sub-flow includes the first packet and the third packet, and a difference between the third time and the first time is not less than an expected transmission time of the first packet from the second network device to the first network device at a limiting rate of the at least one sub-flow.
In a possible implementation manner, a difference between the third time and the first time is not less than a maximum transmission delay of the first queue, where the maximum transmission delay of the first queue is a maximum transmission delay of transmission delays from a last-hop network device of the second network device to the second network device of all packets in the service flows enqueued in the first queue.
In a third aspect, a communication system is provided, where the communication system includes a first network device, a second network device, and a fourth network device, where the first network device is configured to perform the method according to the first aspect or any possible implementation manner of the first aspect, where the traffic flow includes at least one sub-flow, and the at least one sub-flow includes the first packet and the third packet; before the first network device receives the first packet in the at least one sub-flow from the second network device, the second network device receives a fifth packet in the at least one sub-flow from the fourth network device, where the fifth packet includes a fifth time tag indicating a fifth time at which the fifth packet is allowed to leave a third queue of the fourth network device; the second network device calculates the first time, replaces the fifth time tag in the fifth message with the first time tag to obtain the first message, and enqueues the first message to the first queue of the second network device; before the first network device receives the third packet in the at least one sub-flow from the second network device, the second network device receives a sixth packet in the at least one sub-flow from the fourth network device, the sixth packet including a sixth time tag indicating a sixth time at which the sixth packet is allowed to leave the third queue of the fourth network device; the second network device calculates the third time, replaces the sixth time tag in the sixth message with the third time tag to obtain the third message, and enqueues the third message into the second queue, where a difference between the third time and the first time is not less than an expected transmission time of the first message from the second network device to the first network device at the limiting rate of the at least one sub-flow; the second network device dequeues the first message from the first queue and sends the first message to the first network device, wherein the time for dequeuing the first message from the first queue is not earlier than the first time; and the second network equipment dequeues the third message from the first queue and sends the third message to the first network equipment, wherein the time for dequeuing the third message from the first queue is not earlier than the third time.
In a fourth aspect, there is provided a network device comprising a memory for storing computer instructions and a processor for executing the computer instructions stored in the memory, the processor being configured to perform the method as described in the first aspect or any possible implementation manner of the first aspect as described above when the computer instructions are executed.
In a fifth aspect, there is provided a computer readable storage medium comprising computer instructions which, when executed on a computer, cause the computer to perform the method as described in the first aspect above or any possible implementation manner of the first aspect.
A sixth aspect provides a computer program product comprising computer instructions which, when run on a computer, cause the computer to perform the method as described in the first aspect above or any possible implementation manner of the first aspect.
Drawings
Fig. 1 is a diagram of an example system architecture of a network device according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of a communication system according to an embodiment of the present invention.
Fig. 3 is a schematic flowchart of a method for sending a packet according to an embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a node in a network according to an embodiment of the present invention.
Fig. 5 is a schematic flow chart of checking the message qualification time according to an embodiment of the present invention.
Fig. 6 is a schematic flow chart of one possible implementation of step 340 in fig. 3.
Fig. 7 is a schematic variable diagram of a debounce calculation method according to an embodiment of the present invention.
Fig. 8 is a schematic calculation flow chart of a debounce calculation method provided by the embodiment of the present invention.
Fig. 9 is a schematic flow chart of a flow-by-flow speed limit calculation method provided by the embodiment of the invention.
Fig. 10 is a variable diagram of a flow-by-flow speed limit calculation method according to an embodiment of the present invention.
Fig. 11 is a schematic calculation flow chart of a flow-by-flow speed limit calculation method provided by the embodiment of the invention.
Fig. 12 is a schematic structural diagram of a first network device according to an embodiment of the present invention.
Fig. 13 is a schematic structural diagram of a network device according to an embodiment of the present invention.
Detailed Description
The technical solution in the present application will be described below with reference to the accompanying drawings.
Fig. 1 is a diagram of an example system architecture of a network device that can be applied to an embodiment of the present invention. As shown in fig. 1 (a). The network device may include an input interface module 110 (e.g., a Media Access Control (MAC) module), a Packet Processing (PP) module 120, a Traffic Manager (TM) module 130, and an output interface module 140 (e.g., a Media Access Control (MAC) module). The PP module 120 may be configured to perform processing on a packet in a service flow, as an example, the PP module 120 may perform functions of segmenting the service flow and obtaining each packet, for example, the PP module 120 may be responsible for analyzing, classifying, forwarding, searching and header processing of a received packet, and the PP module 120 may further send a queuing request of the packet to the TM module 130 according to the processing result. TM module 130 may manage the packets in the traffic flow, for example, may perform functions of queuing, discarding, scheduling, and classifying the packets in the traffic flow. The input interface module 110 and the output interface module 140 may also be integrated into one component. The PP module 120 and the TM module 130 may be implemented by hardware, or may be implemented by hardware and software.
The messages in the traffic flow may be transmitted to the network device by the link, and the input interface module 110 (which may also be referred to as a receive Rx module of the network device) in the network device may receive the messages. PP module 120 may then parse the message, and then the message may be enqueued (enqueue) to a traffic shaping queue in TM module 130 for dequeue (dequeue). When the packets in the traffic flow satisfy the dequeue condition, the shaper may perform dequeue enabling, and then the scheduler may schedule the packets in the traffic flow to dequeue. Finally, the message may be sent to the link by the output interface module (also referred to as the Tx module of the network device) 140, and may be transmitted to the next network device on the transmission path. The shaping queues, shapers, and schedulers in TM module 130 may be implemented in hardware or in combination with software.
Optionally, the above service flow may include one or more sub-flows, and the messages of the service flow include the messages of all sub-flows included in the service flow. When a traffic flow includes one sub-flow, the one sub-flow may be regarded as one traffic flow; when a traffic flow includes a plurality of sub-flows, the plurality of sub-flows may be regarded as one traffic flow. For example, as shown in fig. 1(b), the service flow may include sub-flow 1, sub-flow 2, and sub-flow 3, and the packets of the service flow may include packets of sub-flow 1, packets of sub-flow 2, and packets of sub-flow 3. The multiple sub-streams may be buffered in the same or different shaping queues. The multiple sub-flows may have different destinations, for example, and the network device may enqueue the packets in the shaping queue corresponding to the sub-flow according to the identifications of the packets in the sub-flow (e.g., the destinations of the packets).
The embodiment of the invention provides a method for sending a message, which can reduce the jitter of the message in a service flow, better fit the actual transmission condition and reduce the complexity of flow shaping. Embodiments of the present invention are described in detail below with reference to fig. 2-5.
The embodiment of the present invention does not specifically limit the number of network devices in the network and the connection relationship between the network devices. For example, fig. 2 is a schematic structural diagram of a communication system according to an embodiment of the present invention. As shown in fig. 2, the communication system 200 shown in fig. 2 may include a fourth network device (also referred to as simply network device 4)210, a second network device (also referred to as simply network device 2)220, a first network device (also referred to as simply network device 1)230, and a third network device (also referred to as simply network device 3) 240. The fourth network device may be a previous hop network device of the second network device, the second network device may be a previous hop network device of the first network device, and the first network device may be a previous hop network device of the third network device.
The type of the network device mentioned in fig. 2 is not specifically limited in the embodiment of the present invention, and may be, for example, a switch, a router, a hub, a gateway, a bridge, a Network Interface Card (NIC), a Wireless Access Point (WAP), a printer, a modem, an optical fiber transceiver, an optical cable, and the like. Network devices may also sometimes be referred to as network nodes or hops (hops).
Fig. 3 is a schematic flowchart of a method for sending a packet according to an embodiment of the present invention. The method of FIG. 3 may include steps 310-360, and the steps 310-360 are described in detail below.
In step 310, a first network device receives a first packet in a traffic flow from a second network device.
The traffic flow in the embodiment of the present invention may also be sometimes referred to as traffic (traffic).
Optionally, in this embodiment of the present invention, a traffic flow may include at least one sub-flow, and the at least one sub-flow may include the first packet. Before the first network device receives the first packet in the traffic flow from the second network device, the second network device may receive a fifth packet in at least one sub-flow in the traffic flow from the fourth network device. The fifth packet includes a fifth time tag indicating a fifth time at which the fifth packet is allowed to leave a third queue of the fourth network device. The second network device may replace the fifth time tag with the calculated first time to obtain the first packet, and may enqueue the first packet in the first queue of the second network device. The second network device may dequeue the first packet from the first queue, and the second network device may send the first packet to the first network device, such that the time to dequeue the first packet from the first queue is no earlier than the first time.
In this embodiment of the present invention, a first network device may receive a first packet in a service flow from a second network device, where the first packet may include a first time tag. The first time tag may be used to indicate a first time (also referred to as a first eligible time) at which the first packet in the traffic flow is enabled out of a first queue in the second network device by the shaper in order to meet a restriction requirement of traffic shaping (e.g., may be a restriction rate of a sub-flow to which the first packet in the traffic flow belongs).
In step 320, the first network device calculates a second time, replaces the first time tag in the first packet with a second time tag to obtain a second packet, and enqueues the second packet in a second queue of the first network device.
In this embodiment of the present invention, the first network device may receive the first packet sent by the second network device, and before the first network device enqueues the first packet in the second queue of the first network device, the first network device may calculate the second time. After the first time stamp may be replaced with a second time stamp to obtain a second packet, the second packet may be enqueued in a second queue of the first network device.
In this embodiment of the present invention, the second time stamp may be used to indicate a second time (which may also be referred to as a second qualified time) when the second packet in the traffic flow is considered by the shaper to be able to go out of the second queue in the first network device, in order to meet a restriction requirement of traffic shaping (for example, may be a limit rate of a sub-flow to which the second packet in the traffic flow belongs).
The module for calculating the second time of the first network device in the embodiment of the present invention is not specifically limited, and may be any module capable of calculating the qualified time of the first packet in front of the TM module in the network device. As an example, the function of calculating the qualifying time of the first message may be performed by a PP module in the network device. Alternatively, the function of calculating the qualified time of the message may be performed by the TM module.
The method by which the first network device calculates the second qualifying time at step 320 may also be referred to as debounce calculation. Optionally, in some embodiments, the first network device may also calculate the second qualifying time using a flow-by-flow rate limit calculation. The debounce calculation method and the flow-by-flow speed limit calculation method will be described in detail with reference to specific embodiments.
The application scenarios of the above-mentioned two methods for calculating the second qualified time are not specifically limited in the embodiments of the present invention. Referring to fig. 4, as an example, the per-flow rate limit calculation method may be selected at both the edge node and the central node in the network. As another example, the debounce calculation method may be selected at both the edge node and the central node in the network (in which case the sub-streams in the traffic flow may have been shaped using the per-flow rate limit calculation method before reaching the edge node into the network). As another example, the flow-by-flow rate limit calculation method may be selected at an edge node (edge node) in the network, and the debounce calculation method may be selected at a core node (core node) in the network. The former network device can execute the flow-by-flow speed-limiting method, and the latter device can execute the jitter reduction method, so as to realize jitter reduction while respectively shaping the messages in the service flow, thus the quantity of the flow shaping queue and the shaper can get rid of the dependence on the quantity of the sub-flows, and the complexity of the flow shaping is reduced. For example, in fig. 2, the second network device may perform a flow-by-flow rate limit calculation method, and the first network device may perform a debounce calculation method. The previous hop network device can execute the jitter reduction calculation method again by the current device on the basis of executing the jitter reduction calculation method, so that the jitter newly generated when the message is transmitted from the previous hop network device to the current network device can be reduced, and the flow shaping effect of the whole network transmission is improved. For another example, the fourth network device in fig. 2 performs a flow-by-flow speed limit calculation method, and the second network device and the first network device may perform a jitter reduction calculation method. As another example, different calculation methods may also be configured at any node in the network according to the actual needs of the user. For example, in some network nodes, if it is necessary to ensure that the output packet meets the shaping constraint condition and also needs a label with qualified time, a flow-by-flow speed limit calculation method may be selected. For another example, in some network nodes, the sub-streams in the traffic flow all satisfy the shaping constraint and the packets have time tags of the qualified time, then the jitter reduction calculation method may be selected.
In step 330, the first network device receives a third packet in the traffic flow from the second network device.
Optionally, in this embodiment of the present invention, the at least one sub-stream may further include the third packet. Before the first network device receives the third packet in the at least one sub-stream of the traffic flow from the second network device, the second network device may receive a sixth packet in the at least one sub-stream of the traffic flow from the fourth network device. The sixth packet includes a sixth time label indicating a sixth time at which the sixth packet is allowed to leave a third queue of the fourth network device. The second network device may replace the sixth time stamp with the calculated third time to obtain the first packet, and may enqueue the third packet in the first queue of the second network device. The second network device may dequeue the third packet from the first queue, and the second network device may send the third packet to the first network device, such that the time to dequeue the third packet from the first queue is not earlier than the third time.
In this embodiment of the present invention, the first network device may receive, from the second network device, a third packet in the service flow, where the third packet may include a third time tag. The third time tag may be used to indicate a third time (which may also be referred to as a third qualified time) at which the third packet in the traffic flow is considered by the shaper to be able to go out of the first queue in the second network device in order to meet a restriction requirement of traffic shaping (which may be, for example, a restriction rate of a sub-flow to which the third packet in the traffic flow belongs). In step 340, the first network device calculates a fourth time, replaces the third time tag in the third packet with the fourth time tag to obtain a fourth packet, and enqueues the fourth packet in the second queue of the first network device.
In this embodiment of the present invention, the fourth time tag indicates the fourth time for allowing the fourth packet to leave the second queue, a difference between the fourth time and the second time is not less than the maximum transmission delay of the second queue, and the maximum transmission delay of the second queue may be the maximum transmission delay of the transmission delays from the second network device to the first network device of all packets in the service flow queued in the second queue.
The fourth time calculated in step 340 corresponds to the second time calculated in step 320, which may specifically refer to the description of step 320, and is not described herein again.
In step 350, the first network device dequeues the second packet from the second queue, and sends the second packet to the third network device.
The first network device may enable dequeuing of the second packet from the second queue, and may cause the second packet to leave the traffic shaping queue no earlier than the second eligible time. The third network device may receive a second packet sent by the first network device, where the second packet may include a second time tag. The second time tag may be used to indicate a second qualifying time for allowing the second packet to leave a second queue in the first network device.
The first network device dequeuing the second packet from the second queue may include a function to check the time to pass for the second packet, which may be performed by a traffic shaper in the TM module. The method for checking the qualified time of the second packet will be described in detail below with reference to specific embodiments. And after the first network equipment dequeues the second message from the second queue, sending the second message to third network equipment.
In step 360, the first network device dequeues the fourth packet from the second queue, and sends the fourth packet to the third network device.
Step 360 corresponds to step 350, and reference may be specifically made to the description of step 350, which is not described herein again.
In this embodiment of the present invention, the first network device may regard at least one sub-flow passing through the same traffic shaping queue as the same service flow, and shape the service flow by the normalized delay based on the maximized transmission delay. The flow shaping mode reduces the jitter of the messages in the service flow, is more suitable for the actual transmission condition, enables the quantity of the flow shaping queue and the shaper to get rid of the dependence on the quantity of the sub-flows in the service flow, and reduces the complexity of the flow shaping.
The method for checking the qualified time of the packet according to the embodiment of the present invention is described in detail below with reference to specific examples. It should be noted that the example of fig. 5 is merely to help those skilled in the art understand the embodiments of the present invention, and is not intended to limit the embodiments of the present invention to the specific values or specific scenarios illustrated. It will be apparent to those skilled in the art that various equivalent modifications or variations are possible in light of the example given in figure 5, and such modifications or variations also fall within the scope of the embodiments of the invention.
Fig. 5 is a schematic flow chart of checking the message qualification time according to an embodiment of the present invention. Referring to fig. 5, message a may define the following variables:
tel: the time of eligibility of message a in the current network device (current hop, e.g., first network device);
tcur: (current time) current time.
The flow of fig. 5 may include steps 510-540, which are described in detail below.
In step 510: inputting a message a (nth message) in the service flow, wherein a time tag carried by the message a records the qualified time of the message in the current network device (current hop).
In step 520: and comparing the current time with the qualified time of the message A in the current network equipment, and controlling the time of the message A leaving the flow shaping queue. If the current time of message a is greater than or equal to the qualifying time, proceed to step 530. If the current time of the message A is less than the qualified time, the size relationship between the current time of the message A and the qualified time of the message A in the current network equipment is continuously compared.
In step 530: the message A meets the shaping constraint condition, and can leave the flow shaping queue corresponding to the message A by being enabled by the shaper in the TM module.
In step 540: and outputting the message A with the time label (recording the qualified time Tel of the message A in the current network equipment in the time label).
In this embodiment of the present invention, the first network device may regard at least one sub-flow passing through the same traffic shaping queue as the same service flow, and shape the service flow by the normalized delay based on the maximized transmission delay. The flow shaping mode reduces the jitter of the messages in the service flow, is more suitable for the actual transmission condition, enables the quantity of the flow shaping queue and the shaper to get rid of the dependence on the quantity of the sub-flows in the service flow, and reduces the complexity of the flow shaping.
Fig. 6 is a schematic flow chart of one possible implementation of step 340 in fig. 3, and the method of fig. 6 may also be referred to as a debounce calculation method (by which a fourth qualifying time is calculated). The method of FIG. 6 may include steps 610-640, which are described in detail below in relation to steps 610-640, respectively.
In step 610, the larger of the pre-stored transmission delay and the transmission delay of the third packet is taken as the maximum transmission delay.
In this embodiment of the present invention, the pre-stored transmission delay may be the maximum transmission delay among transmission delays from the second network device to the first network device of all the messages in the service flow that have enqueued the second queue before the third message. The transmission delay of the third packet may be, for example, a transmission delay of the third packet from the second network device to the first network device.
In the embodiment of the present invention, there are various specific implementation manners for determining the transmission delay of the third packet, and the specific implementation manner may be any one of the manners for indicating the transmission delay of the third packet from the second network device to the first network device. For example, the transmission delay of the third packet may be a difference between the current time and the third qualified time. Wherein the current time may be a time when the fourth qualifying time is calculated by the first network device.
In the embodiment of the invention, the difference between the current time (namely the time when the fourth time is calculated) and the third time is selected for the transmission delay of the third message, so that the delay condition of the third message can be more accurately reflected.
In step 620, the pre-stored value of the transmission delay is updated to the value of the maximum transmission delay.
In the embodiment of the present invention, the pre-stored value of the transmission delay may be updated to the value of the maximum transmission delay, and may be stored, so as to facilitate comparison and calculation of the next packet. Thus, the first network device can continuously record the maximum transmission delay among the transmission delays of all the packets in the traffic flow enqueued in the second queue on the first network device (transmission delay from the second network device to the first network device).
In step 630, a shaping delay is calculated, where the shaping delay is a difference between the maximum transmission delay and the transmission delay of the third packet.
In this embodiment of the present invention, the shaping delay may be a time length of the fourth packet that needs to be adjusted in the first network device. That is to say, the fourth packet may determine, in the first network device, a time length that needs to be adjusted by the fourth packet according to a time interval between the transmission delay of the third packet and the maximum transmission delay of the third packet that is obtained in advance.
In step 640, the fourth time is calculated according to the shaping delay and a current time, the current time is a time when the fourth time is calculated by the first network device, and a difference between the fourth time and the current time is not less than the shaping delay.
It should be appreciated that if the transmission delay of the third packet is less than the maximum transmission delay (i.e. the time taken by the third packet from the second network device to the first network device is less than the maximum transmission delay, at which time the qualifying time of the third packet needs to be adjusted backwards, and the time for sending the third packet backwards is delayed in order to reduce jitter), a fourth time (which indicates the time at which the fourth packet can leave the second queue) may be calculated based on the shaping delay and the current time (i.e. the time at which the fourth time is calculated by the first network device), and the difference between the fourth time and the current time may be made not less than the shaping delay (i.e. the qualifying time of the packet may be adjusted backwards such that the qualifying time is equal to or later than the sum of the current qualifying time and the length of time that needs to be adjusted). Therefore, the transmission delay of the message of the service flow in the shaping queue can be adjusted to the maximum transmission delay, the delay normalization can be realized, and the jitter of message transmission is reduced.
In the jitter reduction calculation method provided by the embodiment of the present invention, the number of the traffic shaping queues and the shapers in the first network device may not depend on the number of the sub-streams in the service flow entering the first network device. As an example, a shaping queue and a shaper may be configured for the traffic flow, and the same shaping queue and shaper may be used for the sub-flows in the traffic flow. Likewise, the first network device may also set another shaping queue and another shaper for another traffic flow. The other traffic flow may, for example, have a different previous hop device or a different next hop device than the previous traffic flow.
In the embodiment of the invention, the maximum transmission delay is continuously updated in the message transmission process, and the service flow can be shaped by the normalized delay. The flow shaping mode reduces the jitter of the messages in the service flow, is more suitable for the actual transmission condition, can ensure that the quantity of the flow shaping queue and the shaper get rid of the dependence on the quantity of the sub-flows in the service flow, and reduces the complexity of the flow shaping.
The debounce calculation method according to the embodiment of the present invention is described in more detail below with reference to specific examples. It should be noted that the examples of fig. 7-8 are merely intended to assist those skilled in the art in understanding embodiments of the present invention, and are not intended to limit embodiments of the present invention to the specific values or specific contexts illustrated. It will be apparent to those skilled in the art that various equivalent modifications or variations are possible in light of the examples given in figures 7-8, and such modifications or variations are intended to be included within the scope of embodiments of the present invention.
Fig. 7 is a schematic variable diagram of a jitter reduction calculation method according to an embodiment of the present invention, and as shown in fig. 7, in an adjacent network device 2 (a current network device) and a network device 1(a previous hop of the current network device), a message a (an nth message) may define the following variables:
d, Dhop: per-hop delay of message a: the starting point of the time interval is the qualified time t of the message A in the network device 12The end point of the time interval is the qualified time t of the message A in the network device 25；
Dcon: transmission delay of message a: the starting point of the time interval is the qualified time t of the message A in the network device 12The end point of the time interval is the current time t of the message A in the network device 24(calculation of t5Time of day);
ds: delay time of the message a (time that the message a needs to be delayed in the network device 2 in order to satisfy the requirement of the rate limit of the sub-stream of the service flow where the message a is located (for example, the rate limit of the sub-stream is 20 megabits per second (Mbits/s));
dmax: in the module for calculating the qualified time of the message A, the network device 2 calculates the maximum value of the transmission delay (Dcon) of all messages enqueued in the shaping queue before the message A in the service flow;
tcur: (Current time) Current time (t)4)；
Tel: the qualified time of the message in the current network equipment;
timestamp: and (4) time labels.
Referring to fig. 7, the transmission delay Dcon (t) of the message a between the network device 1 and the network device 2 may be obtained4-t2) And the maximum value Dmax of the transmission delay of all messages before the message A and the transmission delay Dcon (t) of the message A can be used4-t2) The time interval between the messages A and the network device 2 is the current time t of the message A4Delay Ds (t)5-t4) The message A can be obtained at the network equipment 2Time to pass t5。
Calculation flow of debounce method referring to fig. 8, the flow of fig. 8 may include steps 810-870, which are described in detail below.
In step 810: inputting a message A in the service flow, wherein the time tag carried by the message A records the qualified time of the message in the last-hop network equipment.
In step 820: and reading the qualified time in the time label of the message A and assigning a variable Tel.
In step 830: and measuring the transmission delay Dcon of the message A as Tcur-Tel.
In step 840: the maximum value Dmax of the transmission delay of the update message is max { Dmax, Dcon }.
In step 850: and calculating the delay time Ds of the message A as Dmax-Dcon.
In step 860: and updating the qualified time and the time tag Timestamp ═ Tel ═ Tcur + Ds of the message A.
In step 870: and outputting the message A with the time label (recording the qualified time Tel of the message A in the network equipment 2 in the time label).
Optionally, in some embodiments, a difference between the third time and the first time is not less than a maximum transmission delay of the first queue, where the maximum transmission delay of the first queue is a maximum transmission delay of transmission delays of all packets in the traffic flow enqueued in the first queue from a last-hop network device of the second network device to the second network device (which is equivalent to that the first packet and the third packet have been subjected to traffic shaping in the first network device through a jitter reduction calculation method).
In this embodiment of the present invention, before the first network device receives the first packet and the third packet in the service flow from the second network device, the first packet and the third packet have already performed, in the second network device, traffic shaping based on a jitter reduction calculation method. In the technical scheme, the first network device performs jitter reduction and flow shaping, so that the jitter newly generated when the message is transmitted from the last-hop network device (namely, the second network device) to the first network device can be reduced.
Optionally, in some embodiments, the traffic flow includes at least one sub-flow, where the at least one sub-flow includes the first packet and the third packet, and a difference between the third time and the first time is not less than an expected transmission time of the first packet from the second network device to the first network device at a limiting rate of the sub-flow where the first packet and the third packet are located (which is equivalent to that the first packet and the third packet in one sub-flow have been subjected to traffic shaping in the first network device by a flow-by-flow rate-limiting calculation method).
In this embodiment of the present invention, before the first network device receives the first packet and the third packet in one sub-flow of the service flow from the second network device, the first packet and the third packet have performed flow shaping based on a flow-by-flow speed limit calculation method in the second network device. The method can realize the respective shaping of the messages in the service flow, and simultaneously ensure that the quantity of the flow shaping queue and the shaper get rid of the dependence on the quantity of the sub-flows, thereby reducing the complexity of the flow shaping.
In this embodiment of the present invention, before receiving the first packet and the third packet sent by the second network device, the first network device may further receive a fifth packet and a sixth packet sent by the fourth network device, and the second network device may perform shaping processing on the fifth packet and the sixth packet by using a flow-by-flow speed limit calculation method, so as to obtain the first qualified time of the first packet and the third qualified time of the third packet.
Fig. 9 is a schematic flow chart of a possible implementation manner of the flow-by-flow speed limit calculation method according to the embodiment of the present invention, where the method of fig. 9 may include steps 910-930, and the steps 910-930 are described in detail below.
In the flow-by-flow speed limit calculation method according to the embodiment of the present invention, the message received by the network device may or may not include a time tag. When the time label is included, the network device replaces the original time label included in the message with a new time label indicating the new qualified time after calculating the new qualified time so as to obtain the message sent to the next hop network device. When the time tag is not included, the network device adds a new time tag indicating the new qualified time to the message after calculating the new qualified time to obtain the message sent to the next hop network device.
It should be understood that the traffic flow may include at least one sub-flow, and the network device may set a shaping queue and a shaper for each sub-flow in the traffic flow when performing the flow-by-flow rate-limiting calculation method, so as to shape the traffic of each sub-flow according to the limiting rate of each sub-flow respectively.
In step 910, the second network device receives a fifth packet in the at least one sub-flow from the fourth network device.
In this embodiment of the present invention, before the first network device receives the first packet in at least one sub-stream from the second network device, the second network device may first receive a fifth packet in the at least one sub-stream from the fourth network device. The fifth packet may include a fifth time tag indicating a fifth time at which the fifth packet is allowed to leave a third queue in the fourth network device.
In step 920, the second network device calculates the first time, replaces the fifth time tag in the fifth packet with the first time tag to obtain the first packet, and enqueues the first packet in the first queue of the second network device.
In this embodiment of the present invention, the second network device may receive the fifth packet sent by the fourth network device, and before the second network device enqueues the fifth packet in the first queue of the second network device, the second network device may calculate the first time. After the fifth time stamp may be replaced with the first time stamp to obtain the first packet, the first packet may be enqueued in the first queue of the second network device.
In step 930, the second network device receives a sixth packet in the at least one sub-flow from the fourth network device.
In this embodiment of the present invention, before the first network device receives the third packet in the at least one sub-stream from the second network device, the second network device may first receive a sixth packet in the at least one sub-stream from the fourth network device. The sixth packet may include a sixth time label indicating a sixth time at which the sixth packet is allowed to leave the third queue in the fourth network device.
In this embodiment of the present invention, a difference between a fifth time corresponding to a fifth packet and a sixth time corresponding to a sixth packet in at least one sub-stream received by a second network device from a fourth network device is not less than an expected transmission time of the fifth packet from the fourth network device to the second network device at a rate limited by the at least one sub-stream. In other words, for the fifth packet and the sixth packet in the same sub-stream, the time interval between the fifth time corresponding to the fifth packet and the sixth time corresponding to the sixth packet may be measured. If the time interval is less than the expected transmission time of the fifth packet from the fourth network device to the second network device at the sub-flow rate limit, the sixth time may be adjusted such that the time interval between the sixth time and the fifth time is greater than the expected transmission time of the fifth packet from the fourth network device to the second network device at the sub-flow rate limit (at this time, the fifth packet and the sixth packet may satisfy the sub-flow rate limit).
In step 940, the second network device calculates the third time, replaces the sixth time tag in the sixth packet with the second time tag to obtain the second packet, and enqueues the second packet in the first queue of the second network device.
In this embodiment of the present invention, the second network device may receive the sixth packet sent by the fourth network device, and before the second network device enqueues the sixth packet in the first queue of the second network device, the second network device may calculate the third time. After the sixth time stamp may be replaced with the third time stamp to obtain the third packet, the third packet may be enqueued in the first queue of the second network device.
In this embodiment of the present invention, a difference between a first time corresponding to a first packet and a third time corresponding to a third packet in at least one sub-stream calculated by a second network device is not less than an expected transmission time of the first packet from the second network device to the first network device at a rate limited by the at least one sub-stream. In other words, for a first packet and a third packet in the same sub-stream, a time interval between a first time corresponding to the first packet and a third time corresponding to the third packet may be measured. If the time interval is less than the expected transmission time of the first packet from the second network device to the first network device at the rate limit of the sub-stream, the third time may be adjusted such that the time interval between the third time and the first time is greater than the expected transmission time of the first packet from the second network device to the first network device at the rate limit of the sub-stream (at which point the first packet and the third packet may satisfy the rate limit of the sub-stream).
In step 950, the second network device dequeues the first packet from the first queue and sends the first packet to the first network device.
The second network device may enable dequeuing of the first packet from the first queue, and may cause the first packet to leave the first queue no earlier than a first qualifying time of the second packet in the second network device. The first network device may receive a first packet sent by the second network device, where the first packet may include a first time tag. The first time tag may be used to indicate a first qualifying time to allow the first packet to leave a first queue in a second network device.
In step 960, the second network device dequeues the third packet from the first queue and sends the third packet to the first network device.
The second network device may enable dequeuing of the third packet from the first queue, and may cause the third packet to leave the first queue no earlier than a third qualified time of the third packet in the second network device. The first network device may receive a third packet sent by the second network device, where the third packet may include a third time tag. The third time tag may be used to indicate a third qualified time for allowing the third packet to leave the first queue in the second network device.
In the embodiment of the invention, the limiting rate of each sub-stream can be maintained by a flow-by-flow rate-limiting calculation method, the qualified time of the messages is delayed, and the messages of each sub-stream in the service flow can meet the constraint condition of the limiting rate of each sub-stream. And the qualified time of the message in the current network equipment can be recorded on the time label of the message, so that reference can be provided for the subsequent use of a jitter reduction calculation method.
The flow-by-flow speed limit calculation method according to the embodiment of the present invention will be described in more detail with reference to specific examples. It should be noted that the examples of fig. 10-11 are merely intended to assist those skilled in the art in understanding embodiments of the present invention, and are not intended to limit embodiments of the present invention to the specific values or specific scenarios illustrated. It will be apparent to those skilled in the art that various equivalent modifications or variations are possible in light of the examples given in figures 10-11, and such modifications or variations are intended to be included within the scope of embodiments of the present invention.
Fig. 10 is a schematic diagram of variables of a flow-by-flow speed limit calculation method according to an embodiment of the present invention, as shown in fig. 10, in an nth packet and an n-1 st packet of a service flow, the nth packet and the n-1 st packet belong to adjacent packets in a same sub-flow, and the nth packet may define the following variables:
r: limiting the speed of the sub-flow to which the nth message and the (n-1) th message belong in the service flow;
l: the length of the message (the length of the nth message is denoted as Ln);
de: the interval between the qualified time of the n-1 th message and the qualified time of the n-th message (when n is less than or equal to 1, De is 0);
and Dt: the transmission time of the nth message transmitted at the limited rate of the service flow where the nth message is located (when n is less than or equal to 0, Dt is 0), and Dt (n-1) is represented as Dt corresponding to the nth-1 message;
and Dg: a time interval from the qualified time of the (n-1) th message to the arrival time of the (n) th message (when n is less than or equal to 1, Dg is 0);
tel-pre: the previous adjacent message (n-1 message) of the nth message is in the qualified time of the current network device (if n is 1, Tel-pre is 0);
tel: the qualified time of the nth message in the current network equipment;
tcur: (current time) current time;
timestamp: and (4) time labels.
Referring to fig. 10, the time when the qualification time of the nth packet is calculated, i.e., the current time Tcur, may be obtained, Dg between the nth packet and the n-1 th packet may be measured, and if Dg < Dt (n-1), the current time Tcur of the nth packet may be delayed by a period of time (delay time Ds) such that the interval between the qualification times of the n-1 th packet and the nth packet is greater than or equal to the transmission time of the n-1 th packet at the limiting rate of the sub-stream, i.e.,: de ≧ Dg + Ds ≧ Dt (n-1).
Flow of calculation of the flow-by-flow rate limiting method referring to fig. 11, the flow of fig. 11 may include steps 1110-1180, which are described in detail below.
In step 1110: message a (nth message) in the incoming traffic stream, which may be time-stamped.
In step 1120: judging the size of n, if n is not equal to 1 (not the first message in the service flow), going to step 1130, if n is equal to 1 (message a is the first message in the service flow), going to step 640.
In step 1130: the interval Dg between the qualified time of the previous message (n-1 th message) of the message a and the arrival time of the message a (n-th message) is calculated as Tcur-Tel-pre.
In step 1140: and calculating the delay time Ds of the message A as max {0, Dt-Dg } (the initial value of Dt is 0, and the Dt at the moment is the Dt value of the previous message of the message A).
In step 1150: and calculating the qualified time and the time label Timestamp ═ Tel ═ Tcur + Ds of the message A.
In step 1160: the qualifying time Tel-pre ═ Tel (Dg used to calculate the next message of message a) for message a is stored.
In step 1170: and calculating and storing the transmission time Dt of the message A at the limiting rate of the sub-flow, namely Ln/r (Ds for calculating the next message of the message A).
In step 1180: and outputting the message A with the time label (recording the qualified time Tel of the message A in the current network equipment in the time label, replacing the existing time label when the arrived message comprises the time label, and adding the time label when the arrived message does not comprise the time label).
The method for sending a packet according to the embodiment of the present invention is described in detail above with reference to fig. 3 to 11, and the network device according to the embodiment of the present invention is described in detail below with reference to fig. 12 to 13.
Fig. 12 is a schematic structural diagram of a first network device according to an embodiment of the present invention. The first network device 1200 in fig. 12 may execute the method for sending a message described in any of fig. 3-11. The first network device 1200 of fig. 12 may include an input interface module 1201, a message processing module 1202, a traffic management module 1203, and an output interface module 1204. The input interface module 1201 may be, for example, the input interface module 110 in fig. 1, the message processing module 1202 may be, for example, the message processing module 120 in fig. 1, the traffic management module 1203 may be, for example, the traffic management module 130 in fig. 1, and the output interface module 1204 may be, for example, the output interface module 140 in fig. 1.
The input interface module 1201 may be configured to receive a first packet in a traffic flow from a second network device, where the first packet includes a first time tag indicating a first time at which the first packet is allowed to leave a first queue of the second network device.
The input interface module 1201 is further configured to receive a third packet in a traffic flow from the second network device, where the third packet includes a third time tag, and the third time tag indicates a third time when the third packet is allowed to leave the first queue of the second network device.
The message processing module 1202 may be configured to calculate a second time, and replace the first time tag in the first message with a second time tag to obtain a second message.
The message processing module 1202 may be further configured to calculate a fourth time, and replace the third time tag in the third message with the fourth time tag to obtain a fourth message.
The traffic management module 1203 may be further configured to enqueue the fourth packet in the second queue of the first network device, where the fourth time tag indicates a fourth time that the fourth packet is allowed to leave the second queue, a difference between the fourth time and the second time is not less than a maximum transmission delay of the second queue, and the maximum transmission delay of the second queue is a maximum transmission delay of transmission delays from the second network device to the first network device of all packets in the service flow enqueued in the second queue.
The output interface module 1204 may be configured to dequeue the second packet from the second queue and send the second packet to the third network device, where the time for dequeuing the second packet from the second queue is not earlier than the second time.
The input interface module 1204 may be further configured to dequeue, by the first network device, the fourth packet from the second queue and send the fourth packet to the third network device, where the time for dequeuing the fourth packet from the second queue is not earlier than the fourth time.
Fig. 13 is a schematic structural diagram of a network device according to an embodiment of the present invention. The network device 1300 in fig. 13 may execute the method for sending a packet described in any of fig. 3-11. Network device 1300 of fig. 13 may include memory 1301 and processor 1302. Memory 1301 may be used to store programs. A processor 1302 may be used to execute programs stored in the memory. When the program stored in the memory 1301 is executed, the processor 1302 may be configured to perform the method for sending a message described in any of the above embodiments.
In the above embodiments, all or part of the implementation may be realized by software, hardware, firmware or any other combination. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a Digital Video Disk (DVD)), or a semiconductor medium (e.g., a Solid State Disk (SSD)), among others.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (15)
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110071415.8A CN112866135A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
| CN201810075675.0A CN110086728B (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
| CN202110071410.5A CN112866134A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810075675.0A CN110086728B (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
Related Child Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110071415.8A Division CN112866135A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
| CN202110071410.5A Division CN112866134A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110086728A CN110086728A (en) | 2019-08-02 |
| CN110086728B true CN110086728B (en) | 2021-01-29 |
Family
ID=67412202
Family Applications (3)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110071415.8A Pending CN112866135A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
| CN202110071410.5A Pending CN112866134A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
| CN201810075675.0A Active CN110086728B (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
Family Applications Before (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110071415.8A Pending CN112866135A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
| CN202110071410.5A Pending CN112866134A (en) | 2018-01-26 | 2018-01-26 | Method for sending message, first network equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (3) | CN112866135A (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114095397A (en) | 2020-07-31 | 2022-02-25 | 华为技术有限公司 | Method, apparatus, device and readable storage medium for transmitting message |
| CN114095454A (en) * | 2020-07-31 | 2022-02-25 | 华为技术有限公司 | Method for sending data packet and network equipment |
| CN114095453A (en) * | 2020-07-31 | 2022-02-25 | 华为技术有限公司 | Method and related device for scheduling data packets |
| CN114513477A (en) * | 2020-11-17 | 2022-05-17 | 华为技术有限公司 | Message processing method and related device |
| CN114666809A (en) * | 2020-12-23 | 2022-06-24 | 华为技术有限公司 | Data transmission method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6304569B1 (en) * | 1997-03-27 | 2001-10-16 | Siemens Aktiengesellschaft | Method for the reception of message cells from low-priority connections from only one of a number of redundant transmission paths |
| CN101002438A (en) * | 2004-05-12 | 2007-07-18 | 诺基亚公司 | Rate shaper algorithm |
| CN101674174A (en) * | 2008-09-12 | 2010-03-17 | 华为技术有限公司 | Method and equipment for increasing clock stability |
| CN102497310A (en) * | 2011-12-05 | 2012-06-13 | 西安电子科技大学 | Service flow shaping method and device for cascaded port of avionics full duplex switched Ethernet (AFDX) switch |
| CN103026671A (en) * | 2011-08-01 | 2013-04-03 | 华为技术有限公司 | Method and device for traffic shaping |
-
2018
- 2018-01-26 CN CN202110071415.8A patent/CN112866135A/en active Pending
- 2018-01-26 CN CN202110071410.5A patent/CN112866134A/en active Pending
- 2018-01-26 CN CN201810075675.0A patent/CN110086728B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6304569B1 (en) * | 1997-03-27 | 2001-10-16 | Siemens Aktiengesellschaft | Method for the reception of message cells from low-priority connections from only one of a number of redundant transmission paths |
| CN101002438A (en) * | 2004-05-12 | 2007-07-18 | 诺基亚公司 | Rate shaper algorithm |
| CN101674174A (en) * | 2008-09-12 | 2010-03-17 | 华为技术有限公司 | Method and equipment for increasing clock stability |
| CN103026671A (en) * | 2011-08-01 | 2013-04-03 | 华为技术有限公司 | Method and device for traffic shaping |
| CN102497310A (en) * | 2011-12-05 | 2012-06-13 | 西安电子科技大学 | Service flow shaping method and device for cascaded port of avionics full duplex switched Ethernet (AFDX) switch |
Non-Patent Citations (1)
| Title |
|---|
| 基于DiffServ模型的层次化QoS研究;刘辰;《中国优秀硕士学位论文全文数据库》;20090630;I139-31 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110086728A (en) | 2019-08-02 |
| CN112866135A (en) | 2021-05-28 |
| CN112866134A (en) | 2021-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110086728B (en) | Method for sending message, first network equipment and computer readable storage medium | |
| CN109479032B (en) | Congestion avoidance in network devices | |
| WO2019157978A1 (en) | Method for scheduling packet, first network device, and computer readable storage medium | |
| KR100431191B1 (en) | An apparatus and method for scheduling packets by using a round robin based on credit | |
| US9608927B2 (en) | Packet exchanging device, transmission apparatus, and packet scheduling method | |
| Mazzini et al. | A closed form solution of Bernoullian two-classes priority queue | |
| CN107483363B (en) | A hierarchical weighted round-robin scheduling device and method | |
| CN112887206B (en) | Router Queue Scheduling Method Based on Dynamic Priority in Quantum Metropolitan Area Network | |
| US20060146708A1 (en) | Packet transfer control method and packet transfer control circuit | |
| Mohammadpour et al. | Improved delay bound for a service curve element with known transmission rate | |
| WO2016082603A1 (en) | Scheduler and dynamic multiplexing method for scheduler | |
| KR101737516B1 (en) | Method and apparatus for packet scheduling based on allocating fair bandwidth | |
| CN111131061B (en) | Data transmission method and network equipment | |
| CN101465794B (en) | Method and apparatus for scheduling packet | |
| JP3623420B2 (en) | Traffic control method | |
| CN101534254A (en) | A queue report method, a device and a passive optical network | |
| CN105915468A (en) | Service scheduling method and device | |
| CN114257554B (en) | Scheduling method for improving bandwidth utilization rate of BE (flow element) stream of TSN (traffic channel network) | |
| KR20120055947A (en) | Method and apparatus for providing Susbscriber-aware per flow | |
| WO2022068617A1 (en) | Traffic shaping method and device | |
| KR101681613B1 (en) | Apparatus and method for scheduling resources in distributed parallel data transmission system | |
| Patel et al. | Comparative analysis of congestion control algorithms using ns-2 | |
| CN103107955B (en) | Packet Transport Network array dispatching method and device | |
| KR101093500B1 (en) | Real-time scheduling device for flow class based on reservation / registration and its method | |
| US10742710B2 (en) | Hierarchal maximum information rate enforcement |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |