CN114726805B - Message processing method and device - Google Patents
Message processing method and device Download PDFInfo
- Publication number
- CN114726805B CN114726805B CN202210313837.6A CN202210313837A CN114726805B CN 114726805 B CN114726805 B CN 114726805B CN 202210313837 A CN202210313837 A CN 202210313837A CN 114726805 B CN114726805 B CN 114726805B
- Authority
- CN
- China
- Prior art keywords
- message
- queue
- scheduling
- scheduling queue
- sending period
- 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
- 238000003672 processing method Methods 0.000 title abstract description 8
- 230000005540 biological transmission Effects 0.000 claims abstract description 26
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000004590 computer program Methods 0.000 claims description 3
- 238000004806 packaging method and process Methods 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 claims description 2
- 230000003139 buffering effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
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/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/26—Special purpose or proprietary protocols or architectures
Abstract
The application provides a message processing method and device. The method is applied to any forwarding device in a deterministic network and comprises: when a message is received, determining a sending period of the message and a corresponding scheduling queue thereof; when the number of the messages in the scheduling queue is judged to be not smaller than the set number threshold value set for the scheduling queue, recalculating the sending period of the messages according to the time when the messages are received, the preset offset time, the preset sending period duration and the total number of the preset sending periods; selecting a scheduling queue meeting preset conditions from scheduling queues with queue numbers larger than the queue numbers of the scheduling queues, and determining the selected scheduling queue as a scheduling queue corresponding to the recalculated transmission period; and buffering the related message into the selected scheduling queue and forwarding the related message when waiting for reaching the recalculated transmission period. The application can improve the message forwarding efficiency.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for processing a message.
Background
The DIP technology is a novel quality of service (Quality of Service, qoS) guarantee technology, and the core is a periodic scheduling mechanism.
In one application scenario, for any forwarding device in a deterministic network, the received message is typically processed using a segment-routing based periodic queuing forwarding (Cyclic Specific Queuing and Forwarding, CSQF) mechanism. However, in this message processing process, since the sending period of the message and the scheduling queue of the message to be buffered determined by the forwarding device are planned in advance by a software defined network (Software Defined Network, SDN) controller in the deterministic network, there is a tendency that fewer messages in the scheduling queues corresponding to some sending periods, such as the scheduling queue corresponding to the sending period 2 (denoted as Q6) and the scheduling queue corresponding to the sending period 3 (denoted as Q5) shown in fig. 1, so that the message forwarding rate is low.
Disclosure of Invention
In order to overcome the problems in the related art, the application provides a message processing method and a message processing device.
According to a first aspect of an embodiment of the present application, there is provided a method of processing a message, the method being applied to any forwarding device in a deterministic network, the method comprising:
when a message is received, determining a sending period of the message and a corresponding scheduling queue thereof;
when judging that the number of the messages in the scheduling queue is not smaller than the set number threshold value set for the scheduling queue, recalculating the sending period of the messages according to the time when the messages are received, the preset offset time, the preset sending period duration and the total number of the preset sending periods;
selecting a scheduling queue meeting a preset condition from scheduling queues with queue numbers larger than the queue numbers of the scheduling queues, and determining the selected scheduling queue as a scheduling queue corresponding to a recalculated transmission period, wherein the number of messages in the selected scheduling queue is smaller than that of the messages in the scheduling queue;
when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached;
when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when reaching a recalculated sending period;
and when the message is a SRv message carrying an original data message and is a tail node, the message is unpacked into the original data message and then is cached in a selected dispatching queue to be forwarded when a recalculated sending period is reached.
According to a second aspect of an embodiment of the present application, there is provided a message processing apparatus for application to any forwarding device in a deterministic network, the apparatus comprising:
the determining module is used for determining the sending period of the message and the corresponding scheduling queue when the message is received;
the calculation module is used for recalculating the sending period of the message according to the time when the message is received, the preset offset time, the preset sending period duration and the total value of the preset sending period when the number of the messages in the dispatching queue is not less than the set number threshold value set for the dispatching queue;
the first processing module is used for selecting a scheduling queue meeting a preset condition from scheduling queues with queue numbers larger than the queue numbers of the scheduling queues, and determining the selected scheduling queue as a scheduling queue corresponding to the recalculated transmission period, wherein the number of messages in the selected scheduling queue is smaller than that of the messages in the scheduling queue; and
when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached;
when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when reaching a recalculated sending period;
and when the message is a SRv message carrying an original data message and is a tail node, the message is unpacked into the original data message and then is cached in a selected dispatching queue to be forwarded when a recalculated sending period is reached.
The technical scheme provided by the embodiment of the application can comprise the following beneficial effects:
in the embodiment of the application, for any forwarding device in a deterministic network, after receiving a message, determining a sending period of the message and a scheduling queue corresponding to the sending period; then judging whether the number of the messages in the dispatching queues is not less than a set number threshold value set for the dispatching queues, and if yes, re-calculating the sending period of the messages according to the time when the messages are received, the preset offset time, the preset sending period duration and the total number of the preset sending periods, selecting dispatching queues meeting preset conditions from the dispatching queues with the queue numbers greater than the queue numbers of the dispatching queues, and determining the selected dispatching queues as dispatching queues corresponding to the re-calculated sending periods; finally, when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached; when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when the recalculated sending period is reached; when the message is SRv message carrying original data message and is the tail node, the message is unpacked into the original data message and then is buffered in the selected dispatching queue to be forwarded when the recalculated sending period is reached.
In the message processing flow, the forwarding device can flexibly adjust the sending period of the message and the corresponding scheduling queue based on the message buffer condition in the scheduling queue corresponding to the sending period of the message, so that the message forwarding rate is improved to a certain extent.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.
FIG. 1 is a schematic diagram of a conventional forwarding and sending cycle of a message and a corresponding relationship of a sending queue thereof;
FIG. 2 is a flow chart of a message processing method according to an embodiment of the present application;
FIG. 3 is a schematic diagram of a deterministic network according to an embodiment of the present application;
FIG. 4 is a schematic structural diagram of a message processing apparatus according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the application. Rather, they are merely examples of apparatus and methods consistent with aspects of the application as detailed in the accompanying claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any or all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used herein to describe various information, these information should not be limited by these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the application. The word "if" or "if" as used herein may be interpreted as "at … …" or "at … …", depending on the context.
The embodiments of the present application will be described in detail.
The embodiment of the application provides a message processing method, which is applied to any forwarding device in a deterministic network, as shown in fig. 1, and can comprise the following steps:
s2, when receiving the message, determining the sending period of the message and a corresponding scheduling queue thereof.
S22, when the number of the messages in the scheduling queue is judged to be not smaller than the set number threshold value set for the scheduling queue, the sending period of the messages is recalculated according to the time when the messages are received, the preset offset time, the preset sending period duration and the total numerical value of the preset sending period.
S23, selecting a scheduling queue meeting preset conditions from scheduling queues with queue numbers larger than the queue numbers of the scheduling queues, and determining the selected scheduling queue as the scheduling queue corresponding to the recalculated transmission period.
In this step, the number of messages in the selected scheduling queue is smaller than the number of messages in the scheduling queue.
And S24, when the message is an original data message, packaging the message into a SRv message, and caching the SRv message into a selected scheduling queue to wait for reaching a recalculated transmission period and forwarding the message.
And S25, when the message is a SRv message carrying the original data message and is a transit node, the message is cached in the selected scheduling queue and is forwarded when the recalculated sending period is reached.
S26, when the message is a SRv message carrying an original data message and is a tail node, the message is unpacked into the original data message and then is cached in a selected dispatching queue to be forwarded when a recalculated sending period is reached.
It should be noted that, in the embodiment of the present application, after the step S21 is performed, if it is determined that the number of the messages in the scheduling queue is smaller than the set number threshold set for the scheduling queue, the forwarding device still processes the message according to the existing manner, that is, when the message is the original data message, packages the message into a SRv message, and caches the message into the scheduling queue corresponding to the determined sending period, and forwards the message when the message waits for reaching the determined sending period. Here, the forwarding device is a source node.
When the message is SRv message carrying original data message and is a transit node, the message is cached in a scheduling queue corresponding to the determined transmission period and is forwarded when the determined transmission period is waited for.
When the message is SRv message carrying original data message and is a tail node, the message is unpacked into the original data message and then is buffered in a scheduling queue corresponding to the determined transmission period, and the message is forwarded when the determined transmission period is waited.
Specifically, in the step S21, no matter whether the forwarding device is a source node, a transit node, or a tail node, a specific determining process of determining the sending period of the packet and the scheduling queue corresponding to the sending period is a prior art, and will not be described in detail herein.
It should be noted that, the sending periods of the above-mentioned messages and the corresponding scheduling queues determined by the source node, the transit node and the tail node are all deployed in advance by the SDN controller in the deterministic network. The source node directly determines the sending period of the message and the corresponding scheduling queue thereof from the local; and the transit node and the tail node both obtain the sending period of the message and the corresponding scheduling queue by analyzing the area field in the message.
In the step S22, the set number threshold, the preset offset time, the preset transmission period duration, and the total number of preset transmission periods may be set according to the actual network requirements of the deterministic network.
In addition, in the above step S22, the forwarding device may specifically recalculate the transmission period of the packet by:
the sending period of the message is obtained through recalculation according to the following formula:
equation one: a= [ (b+c)/D ] E, wherein,
a is the sending period of the recalculated message;
b is the time when the forwarding device receives the message;
c is a preset offset time;
d is a preset sending period duration;
e is the total number of preset sending periods. Specifically, in step S23, when the forwarding device selects a scheduling queue satisfying the preset condition from among the scheduling queues having a queue number greater than that of the scheduling queue, the forwarding device may specifically select a scheduling queue having a minimum difference between the queue number and the queue number of the scheduling queue and having a free rate not less than a set threshold from among the scheduling queues having a queue number greater than that of the scheduling queue.
Of course, the forwarding device may also be selected in other ways, which are not listed here.
The above message processing method is described in detail below with reference to specific embodiments.
As shown in fig. 3, it is assumed that a deterministic flow message needs to be transmitted between a host a and a host B, and it is also assumed that a deterministic flow message sent by the host a will reach the host B through forwarding devices R1, R2, R3, R7, R8, and R9. The interaction process between the SDN controller and the relevant forwarding device in fig. 3 is known in the art, and will not be described in detail here.
Taking the example that the forwarding device R1 receives the original data packet of the deterministic flow sent by the host a, it is assumed that the time when the forwarding device R1 receives the original data packet is 0000000000000100, the preset offset time is 0000000000000020, the preset sending period duration is 10us, and the total value of the preset sending periods is 90.
After receiving the original data message, the forwarding device R1 determines a sending period of the original data message and a scheduling queue corresponding to the sending period. The specific determination is prior art and will not be described in detail herein. Assuming that the determined transmission period is the 2 nd transmission period and the determined scheduling queue is Q5, the forwarding device R1 further determines whether the number of messages (assumed to be 95) in the scheduling queue is not less than the set number threshold (assumed to be 90) set for the scheduling queue, and since the forwarding device R1 determines that the number of messages in the scheduling queue is not less than the set number threshold set for the scheduling queue, the forwarding device R1 uses the above formula to recalculate the transmission period of the original data message, that is, the 3 rd transmission period.
The forwarding device R1 further selects a dispatch queue having a minimum difference between the queue number and the queue number of the dispatch queue and a free rate of not less than 60% from among the dispatch queues having a queue number greater than the queue number of the dispatch queue.
Assuming that the selected scheduling queue is Q6, in this case, the forwarding device R1 encapsulates the original data packet into a SRv6 packet, and caches the encapsulated SRv6 packet in Q6, and forwards the packet when the 3 rd transmission period is reached.
As can be seen from the above technical solutions, in the embodiment of the present application, for any forwarding device in a deterministic network, after receiving a packet, the sending period of the packet and the corresponding scheduling queue thereof are determined first; then judging whether the number of the messages in the dispatching queues is not less than a set number threshold value set for the dispatching queues, and if yes, re-calculating the sending period of the messages according to the time when the messages are received, the preset offset time, the preset sending period duration and the total number of the preset sending periods, selecting dispatching queues meeting preset conditions from the dispatching queues with the queue numbers greater than the queue numbers of the dispatching queues, and determining the selected dispatching queues as dispatching queues corresponding to the re-calculated sending periods; finally, when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached; when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when the recalculated sending period is reached; when the message is SRv message carrying original data message and is the tail node, the message is unpacked into the original data message and then is buffered in the selected dispatching queue to be forwarded when the recalculated sending period is reached.
In the message processing flow, the forwarding device can flexibly adjust the sending period of the message and the corresponding scheduling queue based on the message buffer condition in the scheduling queue corresponding to the sending period of the message, so that the message forwarding rate is improved to a certain extent.
Based on the same inventive concept, the application also provides a message processing device, which is applied to any forwarding equipment in a deterministic network, and the structural schematic diagram of the device is shown in fig. 4, and specifically includes:
a determining module 41, configured to determine, when a packet is received, a sending period of the packet and a scheduling queue corresponding to the sending period;
a calculating module 42, configured to recalculate a transmission period of the packet according to a total number of a time when the packet is received, a preset offset time, a preset transmission period duration, and a preset transmission period when it is determined that the number of packets in the scheduling queue is not less than a set number threshold set for the scheduling queue;
the first processing module 43 is configured to select a scheduling queue that meets a preset condition from scheduling queues having a queue number greater than that of the scheduling queue, and determine the selected scheduling queue as a scheduling queue corresponding to the recalculated transmission period, where the number of messages in the selected scheduling queue is smaller than that of the scheduling queue; and
when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached;
when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when reaching a recalculated sending period;
and when the message is a SRv message carrying an original data message and is a tail node, the message is unpacked into the original data message and then is cached in a selected dispatching queue to be forwarded when a recalculated sending period is reached.
Preferably, the apparatus further comprises:
a second processing module (not shown in fig. 4), configured to, when it is determined that the number of messages in the scheduling queue is smaller than a set number threshold set for the scheduling queue, encapsulate the messages into SRv6 messages if the messages are original data messages, and buffer the SRv messages into the scheduling queue for forwarding when the determined sending period is reached;
if the message is a SRv message carrying an original data message and is a transit node, the message is cached in the scheduling queue and is forwarded when the determined sending period is reached;
if the message is SRv message carrying the original data message and is a tail node, the message is unpacked into the original data message and then is buffered in the scheduling queue to be forwarded when the determined sending period is reached.
Preferably, the calculating module 42 is specifically configured to recalculate the sending cycle of the message by:
the sending period of the message is obtained through recalculation according to the following formula:
equation one: a= [ (b+c)/D ] E, wherein,
a is the recalculated sending period of the message;
b is the time when the forwarding equipment receives the message;
c is a preset offset time;
d is a preset sending period duration;
e is the total number of preset sending periods.
Preferably, the first processing module 43 is specifically configured to select a scheduling queue that meets a preset condition by:
and selecting a scheduling queue with the minimum difference between the queue number and the queue number of the scheduling queue and the idle rate not smaller than a set threshold value from the scheduling queues with the queue number larger than the queue number of the scheduling queue.
As can be seen from the above technical solutions, in the embodiment of the present application, for any forwarding device in a deterministic network, after receiving a packet, the sending period of the packet and the corresponding scheduling queue thereof are determined first; then judging whether the number of the messages in the dispatching queues is not less than a set number threshold value set for the dispatching queues, and if yes, re-calculating the sending period of the messages according to the time when the messages are received, the preset offset time, the preset sending period duration and the total number of the preset sending periods, selecting dispatching queues meeting preset conditions from the dispatching queues with the queue numbers greater than the queue numbers of the dispatching queues, and determining the selected dispatching queues as dispatching queues corresponding to the re-calculated sending periods; finally, when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached; when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when the recalculated sending period is reached; when the message is SRv message carrying original data message and is the tail node, the message is unpacked into the original data message and then is buffered in the selected dispatching queue to be forwarded when the recalculated sending period is reached.
In the message processing flow, the forwarding device can flexibly adjust the sending period of the message and the corresponding scheduling queue based on the message buffer condition in the scheduling queue corresponding to the sending period of the message, so that the message forwarding rate is improved to a certain extent.
An embodiment of the present application further provides an electronic device, as shown in fig. 5, including a processor 51 and a machine-readable storage medium 52, the machine-readable storage medium 52 storing machine-executable instructions executable by the processor 51, the processor 51 being caused by the machine-executable instructions to: the method for processing the message comprises the steps of.
The machine-readable storage medium may include random access Memory (Random Access Memory, RAM) or Non-Volatile Memory (NVM), such as at least one magnetic disk Memory. In the alternative, the machine-readable storage medium may also be at least one memory device located remotely from the foregoing processor.
The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
In yet another embodiment of the present application, a computer readable storage medium is provided, in which a computer program is stored, the computer program implementing the steps of the above-mentioned message processing method when being executed by a processor.
The foregoing description of the preferred embodiments of the application is not intended to be limiting, but rather to enable any modification, equivalent replacement, improvement or the like to be made within the spirit and principles of the application.
Claims (10)
1. A method of message processing, the method being applied to any forwarding device in a deterministic network, the method comprising:
when a message is received, determining a sending period of the message and a corresponding scheduling queue thereof;
when judging that the number of the messages in the scheduling queue is not smaller than the set number threshold value set for the scheduling queue, recalculating the sending period of the messages according to the time when the messages are received, the preset offset time, the preset sending period duration and the total number of the preset sending periods;
selecting a scheduling queue meeting a preset condition from scheduling queues with queue numbers larger than the queue numbers of the scheduling queues, and determining the selected scheduling queue as a scheduling queue corresponding to a recalculated transmission period, wherein the number of messages in the selected scheduling queue is smaller than that of the messages in the scheduling queue;
when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached;
when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when reaching a recalculated sending period;
and when the message is a SRv message carrying an original data message and is a tail node, the message is unpacked into the original data message and then is cached in a selected dispatching queue to be forwarded when a recalculated sending period is reached.
2. The method according to claim 1, wherein the method further comprises:
when judging that the number of messages in the dispatching queue is smaller than a set number threshold value set for the dispatching queue, if the messages are original data messages, packaging the messages into SRv6 messages, and caching the SRv messages in the dispatching queue to be forwarded when the confirmed sending period is waited;
if the message is a SRv message carrying an original data message and is a transit node, the message is cached in the scheduling queue and is forwarded when the determined sending period is reached;
if the message is SRv message carrying the original data message and is a tail node, the message is unpacked into the original data message and then is buffered in the scheduling queue to be forwarded when the determined sending period is reached.
3. The method of claim 1, wherein the transmission period of the message is recalculated by:
the sending period of the message is obtained through recalculation according to the following formula:
equation one: a= [ (b+c)/D ] E, wherein,
a is the recalculated sending period of the message;
b is the time when the forwarding equipment receives the message;
c is a preset offset time;
d is a preset sending period duration;
e is the total number of preset sending periods.
4. The method according to claim 1, wherein selecting a scheduling queue satisfying a preset condition from among scheduling queues having a queue number larger than a queue number of the scheduling queue, specifically comprises:
and selecting a scheduling queue with the minimum difference between the queue number and the queue number of the scheduling queue and the idle rate not smaller than a set threshold value from the scheduling queues with the queue number larger than the queue number of the scheduling queue.
5. A message processing apparatus for use with any forwarding device in a deterministic network, the apparatus comprising:
the determining module is used for determining the sending period of the message and the corresponding scheduling queue when the message is received;
the calculation module is used for recalculating the sending period of the message according to the time when the message is received, the preset offset time, the preset sending period duration and the total value of the preset sending period when the number of the messages in the dispatching queue is not less than the set number threshold value set for the dispatching queue;
the first processing module is used for selecting a scheduling queue meeting a preset condition from scheduling queues with queue numbers larger than the queue numbers of the scheduling queues, and determining the selected scheduling queue as a scheduling queue corresponding to the recalculated transmission period, wherein the number of messages in the selected scheduling queue is smaller than that of the messages in the scheduling queue; and
when the message is an original data message, the message is packaged into a SRv message, and the SRv message is buffered in a selected scheduling queue and is forwarded when a recalculated sending period is reached;
when the message is SRv message carrying original data message and is a transit node, the message is cached in a selected scheduling queue and is forwarded when reaching a recalculated sending period;
and when the message is a SRv message carrying an original data message and is a tail node, the message is unpacked into the original data message and then is cached in a selected dispatching queue to be forwarded when a recalculated sending period is reached.
6. The apparatus of claim 5, wherein the apparatus further comprises:
the second processing module is used for packaging the message into a SRv message and caching the SRv message into the scheduling queue to be forwarded when the determined sending period is reached when the number of the messages in the scheduling queue is judged to be smaller than the set number threshold value set for the scheduling queue, if the message is an original data message;
if the message is a SRv message carrying an original data message and is a transit node, the message is cached in the scheduling queue and is forwarded when the determined sending period is reached;
if the message is SRv message carrying the original data message and is a tail node, the message is unpacked into the original data message and then is buffered in the scheduling queue to be forwarded when the determined sending period is reached.
7. The apparatus according to claim 5, wherein the calculating module is configured to recalculate the transmission cycle of the message by:
the sending period of the message is obtained through recalculation according to the following formula:
equation one: a= [ (b+c)/D ] E, wherein,
a is the recalculated sending period of the message;
b is the time when the forwarding equipment receives the message;
c is a preset offset time;
d is a preset sending period duration;
e is the total number of preset sending periods.
8. The apparatus according to claim 5, wherein the first processing module is configured to select the scheduling queue that satisfies the preset condition by:
and selecting a scheduling queue with the minimum difference between the queue number and the queue number of the scheduling queue and the idle rate not smaller than a set threshold value from the scheduling queues with the queue number larger than the queue number of the scheduling queue.
9. An electronic device comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to: method steps of any of claims 1-4 are achieved.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored therein a computer program which, when executed by a processor, implements the method steps of any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210313837.6A CN114726805B (en) | 2022-03-28 | 2022-03-28 | Message processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210313837.6A CN114726805B (en) | 2022-03-28 | 2022-03-28 | Message processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114726805A CN114726805A (en) | 2022-07-08 |
| CN114726805B true CN114726805B (en) | 2023-11-03 |
Family
ID=82240258
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210313837.6A Active CN114726805B (en) | 2022-03-28 | 2022-03-28 | Message processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114726805B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5832492A (en) * | 1995-09-05 | 1998-11-03 | Compaq Computer Corporation | Method of scheduling interrupts to the linked lists of transfer descriptors scheduled at intervals on a serial bus |
| CN112585914A (en) * | 2020-11-27 | 2021-03-30 | 新华三技术有限公司 | Message forwarding method and device and electronic equipment |
| CN112787953A (en) * | 2020-06-03 | 2021-05-11 | 中兴通讯股份有限公司 | Deterministic traffic flow transmission method and device, electronic equipment and storage medium |
| CN113382442A (en) * | 2020-03-09 | 2021-09-10 | 中国移动通信有限公司研究院 | Message transmission method, device, network node and storage medium |
-
2022
- 2022-03-28 CN CN202210313837.6A patent/CN114726805B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5832492A (en) * | 1995-09-05 | 1998-11-03 | Compaq Computer Corporation | Method of scheduling interrupts to the linked lists of transfer descriptors scheduled at intervals on a serial bus |
| CN113382442A (en) * | 2020-03-09 | 2021-09-10 | 中国移动通信有限公司研究院 | Message transmission method, device, network node and storage medium |
| CN112787953A (en) * | 2020-06-03 | 2021-05-11 | 中兴通讯股份有限公司 | Deterministic traffic flow transmission method and device, electronic equipment and storage medium |
| CN112585914A (en) * | 2020-11-27 | 2021-03-30 | 新华三技术有限公司 | Message forwarding method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114726805A (en) | 2022-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8831025B2 (en) | Parallel processing using multi-core processor | |
| US9185047B2 (en) | Hierarchical profiled scheduling and shaping | |
| CN107528789B (en) | Message scheduling method and device | |
| US10374959B2 (en) | Method for transmitting data in a packet-oriented communications network and correspondingly configured user terminal in said communications network | |
| WO2022109986A1 (en) | Message forwarding method and apparatus, and electronic device | |
| JP4523596B2 (en) | Encapsulating packets into frames for networks | |
| US11425057B2 (en) | Packet processing | |
| US20170339259A1 (en) | Method and apparatus for processing packets in a network device | |
| US8514700B2 (en) | MLPPP occupancy based round robin | |
| CN112104562A (en) | Congestion control method and device, communication network and computer storage medium | |
| US20130044755A1 (en) | Scalable Packet Scheduling Policy for Vast Number of Sessions | |
| WO2014075488A1 (en) | Queue management method and apparatus | |
| CN114726805B (en) | Message processing method and device | |
| WO2022174444A1 (en) | Data stream transmission method and apparatus, and network device | |
| US20190014052A1 (en) | Automatically Cycling Among Packet Traffic Flows Subjecting Them to Varying Drop Probabilities in a Packet Network | |
| US7746775B2 (en) | Instant service method for deficit-round-robin (DRR) data packet scheduling | |
| JP2004128989A (en) | Mobile communication system, mobile communication method, base station, and mobile station | |
| WO2012106902A1 (en) | Queue management method, apparatus and system | |
| CN113518082B (en) | Message processing method, electronic equipment and storage medium | |
| US20110299394A1 (en) | Translating Between An Ethernet Protocol And A Converged Enhanced Ethernet Protocol | |
| US20150154133A1 (en) | Apparatus for processing packets and system for using the same | |
| CN117411833A (en) | Congestion control method, device and system | |
| CN116436863A (en) | Message scheduling method, network device, storage medium and computer program product | |
| CN116264567A (en) | Message scheduling method, network equipment and computer readable storage medium | |
| US7797465B2 (en) | Apparatus and methods to reduce frame interrupts in packet-based communication |
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 |