Policy determination method and apparatus, communication device and readable storage medium

Abstract

The present disclosure relates to the technical field of communications and provides a policy determination method and apparatus, a communication device and a readable storage medium. The policy determination method in embodiments of the present disclosure comprises: a downstream network node receiving a plurality of first messages sent by a plurality of upstream network nodes, wherein each first message comprises queue information of a corresponding upstream network node; on the basis of the queue information of the plurality of upstream network nodes and queue information of the downstream network node, determining a message sending policy from the plurality of upstream network nodes to the downstream network node; and sending a second message to the plurality of upstream network nodes respectively, wherein the second message comprises an identifier used for indicating the message sending policy.

Description

Strategy determination method, device, communication device and readable storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to Chinese patent application No. 202311264263.9 filed in China on September 27, 2023, the entire contents of which are incorporated herein by reference. Technical Field

[0003] The present disclosure belongs to the field of communication technology, and particularly relates to a policy determination method, apparatus, communication equipment, and readable storage medium. Background Art

[0004] In related technologies, deterministic networks use a series of resource reservation, queue scheduling, and other technologies to ensure the deterministic transmission of data packets. The circular queue scheduling method typically selects 2-3 queues for cyclical sending and receiving, allowing only one queue to send during each time period while the remaining queues are in the receiving state. However, according to the current circular queue scheduling method, when messages in a deterministic network pass through multiple devices and messages from multiple upstream network nodes enter the same downstream network node, that is, when multiple message paths converge, this may cause random correspondence between upstream and downstream queues, making it impossible to guarantee the deterministic transmission of messages.

[0005] Summary of the Invention

[0006] The purpose of the embodiments of the present disclosure is to provide a policy determination method, apparatus, communication device and readable storage medium to solve the problem that when messages from multiple upstream network nodes enter the same downstream network node, the deterministic transmission of messages cannot be guaranteed.

[0007] In order to solve the above technical problems, the present disclosure is implemented as follows:

[0008] In a first aspect, a policy determination method is provided, comprising:

[0009] The downstream network node receives a plurality of first messages sent by a plurality of upstream network nodes, where the first messages include queue information of the corresponding upstream network nodes;

[0010] The downstream network node determines, based on the queue information of the multiple upstream network nodes and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node;

[0011] The downstream network node sends a second message to the multiple upstream network nodes respectively, where the second message includes an identifier for indicating the message sending policy.

[0012] In a second aspect, a policy determination method is provided, comprising:

[0013] The control network node obtains queue information of each upstream network node among the plurality of upstream network nodes;

[0014] The control network node obtains queue information of downstream network nodes of the multiple upstream network nodes;

[0015] The control network node determines a message sending strategy from the multiple upstream network nodes to the downstream network node according to the queue information of each upstream network node and the queue information of the downstream network node.

[0016] According to a third aspect, a policy determination device is provided, comprising:

[0017] a receiving module, configured to receive a plurality of first messages sent by a plurality of upstream network nodes, wherein the first messages include queue information of corresponding upstream network nodes;

[0018] a first determining module, configured to determine a message sending strategy from the multiple upstream network nodes to the downstream network node based on the queue information of the multiple upstream network nodes and the queue information of the downstream network node;

[0019] The sending module is used to send a second message to the multiple upstream network nodes respectively, where the second message includes an identifier for indicating the message sending policy.

[0020] In a fourth aspect, a policy determination device is provided, including:

[0021] A first acquisition module is configured to acquire queue information of each upstream network node among a plurality of upstream network nodes;

[0022] A second acquisition module, configured to acquire queue information of downstream network nodes of the plurality of upstream network nodes;

[0023] The second determining module is configured to determine a message sending strategy from the multiple upstream network nodes to the downstream network node according to the queue information of each upstream network node and the queue information of the downstream network node.

[0024] In a fifth aspect, a communication device is provided, comprising a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the method described in the first aspect or the steps of the method described in the second aspect.

[0025] In a sixth aspect, a readable storage medium is provided, on which a program or instruction is stored. When the program or instruction is executed by a processor, the steps of the method described in the first aspect or the steps of the method described in the second aspect are implemented.

[0026] In an embodiment of the present disclosure, after a downstream network node receives multiple first messages sent by multiple upstream network nodes, wherein the first messages include queue information of the corresponding upstream network nodes, the downstream network node can determine a message sending strategy from the multiple upstream network nodes to the downstream network node based on the queue information of each upstream network node and the queue information of the downstream network node, and send a second message to each of the multiple upstream network nodes, wherein the second message includes an identifier for indicating the message sending strategy. Thus, the downstream network node can be enhanced in capability, so that the downstream network node can identify upstream and downstream queue capabilities through interaction with the multiple upstream network nodes, determine a message sending strategy from the multiple upstream network nodes to the downstream network node, and configure it to the upstream network node, thereby ensuring deterministic transmission of messages during multi-path convergence. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] FIG1 is a schematic diagram of a round-robin queue scheduling according to an embodiment of the present disclosure;

[0028] FIG2 is a schematic diagram of a resource reservation process in an embodiment of the present disclosure;

[0029] FIG3 is a flow chart of a strategy determination method provided by an embodiment of the present disclosure;

[0030] FIG4A is a schematic diagram of message forwarding under Strategy 1 in the implementation of the present disclosure;

[0031] FIG4B is a schematic diagram of message forwarding under Strategy 2 in the implementation of the present disclosure;

[0032] FIG4C is a schematic diagram of message forwarding under Strategy 3 in the implementation of the present disclosure;

[0033] FIG5 is a schematic diagram of the RSVP-TE protocol format in an embodiment of the present disclosure;

[0034] 6A and 6B are schematic diagrams of resource reservation messages in an embodiment of the present disclosure;

[0035] FIG7 is a flowchart of another strategy determination method provided by an embodiment of the present disclosure;

[0036] FIG8 is a schematic diagram of a message transmission process in an embodiment of the present disclosure;

[0037] FIG9 is a schematic structural diagram of a strategy determination device provided by an embodiment of the present disclosure;

[0038] FIG10 is a schematic structural diagram of another strategy determination device provided by an embodiment of the present disclosure;

[0039] FIG11 is a schematic structural diagram of a communication device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0040] The following will clearly and completely describe the technical solutions in the embodiments of the present disclosure in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of them. All other embodiments obtained by ordinary technicians in this field based on the embodiments of the present disclosure without making any creative efforts shall fall within the scope of protection of the present disclosure.

[0041] The terms "first", "second", etc. in the specification and claims of the present disclosure are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable under appropriate circumstances, so that the embodiments of the present disclosure can be implemented in an order other than those illustrated or described herein, and the objects distinguished by "first", "second", etc. are generally of the same type, and the number of objects is not limited. For example, the first object can be one or more. In addition, "and / or" in the specification and claims represents at least one of the connected objects, and the character " / " generally indicates that the objects related to each other are in an "or" relationship.

[0042] In the embodiment of the present disclosure, for circular queue scheduling, 2-3 queues can be selected for cyclical sending and receiving. Only one queue is allowed to send in each time period, and the remaining queues are in the state of receiving messages. As shown in Figure 1, taking the same network node as an example, assuming that among the three queues, queue 1 is the sending queue, queue 2 is the queue to be sent (i.e., the waiting queue), and queue 3 is the waiting queue, and the order of the queue cycle is: 1--3--2--1, then: 1) After queue 1 is sent, it becomes queue 3 and starts receiving messages; 2) queue 2 switches to queue 1 and starts sending messages; 3) queue 3 switches to queue 2 and continues to receive messages.

[0043] The characteristics of the round-robin scheduling shown in Figure 1 include at least the following:

[0044] (1) The delay of a circular queue is equal to the queue switching period T*number of hops;

[0045] (2) All messages in the same queue of the upstream network node will be sent to the same queue of the downstream network node. This can be simply regarded as "batch processing";

[0046] (3) The first message sent by the upstream network node’s sending queue will be sent to the last queue of the downstream network node to ensure that all messages can be received;

[0047] (4) During the implementation process, it is necessary to first run a set of test flows through all network nodes to obtain the corresponding relationship between upstream and downstream queues;

[0048] (5) Any queue in queue 2 has already experienced the time it spent in queue 3, that is, it has received a certain amount of messages sent from the upstream, but has not yet completed the reception.

[0049] Resource reservation is considered a key technical configuration solution for deterministic networks. To address the bandwidth competition problem caused by the simultaneous arrival of real-time data streams and ordinary data streams at network nodes, it can implement end-to-end bandwidth reservation management from the source network node to the destination network node, thereby ensuring the Quality of Service (QoS) and latency requirements of real-time data streams.

[0050] As shown in Figure 2, the resource reservation process includes:

[0051] (a) The sender (e.g., client) initiates a resource reservation request (e.g., a PATH message). After determining the path, the sender sends the resource reservation request along the path through the switch to the receiver (e.g., client). The request carries the network requirements (e.g., latency).

[0052] (b) The receiving end (e.g., client) calculates the bandwidth and other resources that the network needs to reserve based on the request of the sending end, and returns it along the original path (e.g., RESV message), notifying each device one by one to reserve resources.

[0053] Optionally, the message in the embodiment of the present disclosure may also be referred to as traffic.

[0054] Optionally, scenarios to which the embodiments of the present disclosure are applicable include but are not limited to deterministic networks, such as time-sensitive networks (TSN), deterministic networks (DetNet), and the like.

[0055] The policy determination method, apparatus, communication device, and readable storage medium provided by the embodiments of the present disclosure are described in detail below with reference to the accompanying drawings through specific embodiments and their application scenarios.

[0056] Please refer to Figure 3, which is a flow chart of a policy determination method provided by an embodiment of the present disclosure. The method is applied to a downstream network node, which can be called an aggregation network node. As shown in Figure 3, the method includes the following steps:

[0057] Step 31: A downstream network node receives multiple first messages sent by multiple upstream network nodes, where the first messages include queue information of corresponding upstream network nodes.

[0058] Step 32: The downstream network node determines a message sending strategy from the multiple upstream network nodes to the downstream network node based on the queue information of the multiple upstream network nodes and the queue information of the downstream network node;

[0059] Step 33: The downstream network node sends a second message to the multiple upstream network nodes respectively, where the second message includes an identifier for indicating a message sending policy.

[0060] In the embodiment of the present disclosure, the first message and the second message may be resource reservation messages, for example, the first message is a PATH message and the second message is a RESV message. Each of the plurality of upstream network nodes may send a first message to the downstream network node to inform the downstream network node of the queue information of the corresponding upstream network node.

[0061] Optionally, the first message and the second message may be extended through a Resource Reservation Protocol (RSVP) to provide required additional resources while ensuring resources such as bandwidth.

[0062] Optionally, the queue information may include the number of queues.

[0063] Therefore, with the help of the solution in the present disclosure, the capabilities of downstream network nodes can be enhanced, so that the downstream network nodes can identify the upstream and downstream queue capabilities through interaction with multiple upstream network nodes, determine the message sending strategy from multiple upstream network nodes to the downstream network nodes and configure it to the upstream network nodes, thereby realizing circular queue forwarding of the aggregation network node and ensuring the deterministic transmission of messages during multi-path convergence.

[0064] In the disclosed embodiment, different message sending strategies may be formed according to the capabilities of the upstream and downstream queues, as described below.

[0065] Strategy 1:

[0066] This strategy 1 corresponds to the optimal situation, where a single queue of a downstream network node can receive all the messages in the queues of multiple upstream network nodes at once.

[0067] Optionally, step 32 includes: when it is determined, based on queue information of multiple upstream network nodes and queue information of downstream network nodes, that the messages in the queues of the multiple upstream network nodes can be received at one time by a single queue of the downstream network node, the downstream network node determines that the message sending strategy from the multiple upstream network nodes to the downstream network node includes: sending the messages in the corresponding queues of the multiple upstream network nodes to a queue of the downstream network node out of order. In other words, the corresponding queues of the multiple upstream network nodes are merged into one queue, and the sending order does not need to be considered. In this way, the upstream network node does not need to send the messages in the current queue in order, and the messages in the queue of the upstream network node will not be sent to the multiple queues of the downstream network node, thereby avoiding resource waste. It should be noted that in the embodiment of the present application, the network node can be simply referred to as a node.

[0068] For example, referring to Figure 4A, if the upstream node A1 includes queue 1 and queue 2, the upstream node A2 includes queue 1 and queue 2, and the downstream node B includes queue 1, queue 2, and queue 3, then the corresponding relationship between the message forwarding of the upstream nodes A1 and A2 and the downstream node B can be: (A1,1)--(B,3), (A2,1)--(B,3); (A1,2)--(B,2), (A2,2)--(B,2).

[0069] For the above correspondence, since the queue 3 of the downstream node B can receive the messages in the queue 1 of the upstream node A1 and the queue 1 of the upstream node A2 at one time / completely, the messages in the queue 1 of the upstream node A1 and the queue 1 of the upstream node A2 can be sent to the queue 3 of the downstream node B in an unordered manner; since the queue 2 of the downstream node B can receive the messages in the queue 2 of the upstream node A1 and the queue 2 of the upstream node A2 at one time / completely, the messages in the queue 2 of the upstream node A1 and the queue 2 of the upstream node A2 can be sent to the queue 2 of the downstream node B in an unordered manner.

[0070] Strategy 2:

[0071] This strategy 2 corresponds to the situation where a single queue of a downstream network node cannot receive all the messages in the queues of multiple upstream network nodes at once.

[0072] Optionally, the above-mentioned step 32 includes: when it is determined based on the queue information of multiple upstream network nodes and the queue information of downstream network nodes that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, the downstream network node determines that the message sending strategy from the multiple upstream network nodes to the downstream network node includes: sequentially sending or disorderly sending the messages in the corresponding queues of the multiple upstream network nodes.

[0073] Optionally, when the message sending strategy includes sequentially sending messages in corresponding queues of the multiple upstream network nodes, the message sending strategy further includes: the initial message and the end message in the queue of each upstream network node among the multiple upstream network nodes respectively carry an initial identifier and an end identifier, wherein the initial identifier is used to identify the start of sending the message in the corresponding queue, and the end identifier is used to identify the end of sending the message in the corresponding queue. In this way, the initial identifier and the end identifier can be used to identify the initial message and the end message in the corresponding queue, thereby ensuring sequential sending of the messages.

[0074] For example, as shown in Figure 4B, the upstream node A1 includes queue 1 and queue 2, the upstream node A2 includes queue 1 and queue 2, and the downstream node B includes queue 1, queue 2 and queue 3. In addition, the messages in queue 1 (which can be expressed as: (A1,1)) of the upstream node A2 are sent to queue 3 (which can be expressed as: (B,3)) and queue 2 (which can be expressed as: (B,2)) of the downstream node B, but the messages of the upstream nodes A1 and A2 are received by queue 3 and queue 2 of the downstream node B, and no more messages enter queue 1 of the downstream node B.

[0075] For this scenario, the corresponding strategy is: the upstream node can send the messages in the current queue in either sequential or unsequential order. In this case, the messages in the upstream node's queue may be in multiple queues at the downstream node. For example, a message in queue 1 of upstream node A2 is sent to queues 3 and 2 of downstream node B.

[0076] 1) For sequential transmission, (A1,1) can be sent first, and then (A2,1) can be sent. The corresponding total transmission order is as follows: (A1,1)--(B,3)--(C1,1) (A2,1)--(B,3)--(C2,1) (A2,1)--(B,2)--(C2,1) (A1,2)--(B,2)--(C1,2) (A2,2)--(B,2)--(C2,2)

[0077] In this case, the initial message and the end message in (A1,1) and (A2,1) need to carry not only the Internet Protocol (IP) address, cycle ID and other information, but also the initial ID and the end ID respectively to ensure the order of message transmission.

[0078] 2) For out-of-order delivery, (A1,1) and (A2,1) can be delivered out of order.

[0079] Strategy 3:

[0080] This strategy 3 corresponds to the situation where a single queue of the downstream network node cannot receive all the messages in the queues of multiple upstream network nodes at once, and the total amount of messages in the sending queues of multiple upstream network nodes exceeds the carrying capacity of the corresponding queues of the downstream network node.

[0081] Optionally, step 32 includes: when it is determined, based on queue information of multiple upstream network nodes and queue information of downstream network nodes, that the messages in the queues of the multiple upstream network nodes cannot be received all at once by a single queue of the downstream network node, and the total number of messages in the send queues of the multiple upstream network nodes exceeds the carrying capacity of the corresponding queue of the downstream network node, the downstream network node determines, as a message sending strategy from the multiple upstream network nodes to the downstream network node, that the message in the corresponding queues of the multiple upstream network nodes is sequentially sent. In this way, deterministic message transmission can be ensured, and delay accumulation can be avoided.

[0082] Optionally, the message sending strategy further includes: the initial message and the final message in the queue of each of the multiple upstream network nodes carry an initial identifier and an final identifier, respectively. In this way, the initial identifier and the final identifier can be used to identify the initial message and the final message in the corresponding queue, thereby ensuring sequential message sending.

[0083] For example, referring to Figure 4C, the upstream node A1 includes queue 1 and queue 2, the upstream node A2 includes queue 1 and queue 2, the downstream node B includes queue 1, queue 2 and queue 3, and the total number of messages in queue 1 and queue 2 of the upstream node A1 and queue 1 and queue 2 of the upstream node A2 exceeds the carrying capacity of queue 2 and queue 3 of the downstream node B.

[0084] For this scenario, the corresponding strategy is: the upstream node sends the messages in the current queue sequentially. For example, after sending (A1,1), (A2,1) is sent. The initial and final messages in (A1,1) and (A2,1) must carry information such as the IP address and cycle ID, as well as the initial and final identifiers, respectively, to ensure sequential delivery of the messages.

[0085] At this time, the messages in the queue of the upstream node may exist in multiple queues of the downstream node, for example, the messages in queue 2 of the upstream node A2 are sent to queue 2 and queue 1 of the downstream node B.

[0086] As can be seen from the three strategies above, as forwarding becomes more complex, the order in which messages are sent between multiple network nodes requires pre-negotiation. Before deterministic message forwarding, resources must be reserved, typically using the RSVP protocol. The specific resource reservation process is shown in Figure 2.

[0087] Optionally, new reservation objects and rules can be defined by extending RSVP objects. For example, the RSVP-TE protocol format can be as shown in Figure 5. The protocol header includes at least:

[0088] -VER, 4 bytes, indicates the version number; for example, 1 indicates the current version;

[0089] -FLAGS, 4 bytes, default value;

[0090] -MESSAGE TYPE, including Path, Resv establishment and removal types;

[0091] -RSVP CHECKSUM, indicating checksum;

[0092] -SEND TTL, indicating whether the device supports RSVP;

[0093] -RESERVED, a reserved field;

[0094] -RSVP LENGTH, indicating the message length.

[0095] The solution disclosed herein can extend the Object object and make it variable in length, so that the resource reservation message (such as the first message and the second message described above) can carry queue information or an identifier for indicating the message sending policy. In this case, a new CLASS NUM can be redefined to be equal to 30, where CLASS NUM represents the class name.

[0096] For example, a first message, such as a PATH message, sent from a client carries "queue number" information. This information, combined with bandwidth, is used to inform downstream network nodes of their own queue status, allowing them to determine whether to "deliver in sequence." As shown in Figure 6A, the structure of a PATH message can include L, protocol type, message length, IP address, bandwidth, and queue number; specifically, [L = 0, IPv4, 64bit, 10.0.0.1, bandwidth 1, 2] or [L = 0, IPv4, 64bit, 10.0.0.2, bandwidth 2, 3].

[0097] For the second message, such as the RESV message, returned from the server, after determining whether "sequential transmission" is required, if so, the upstream network node is informed that the messages at the beginning and end of the queue need to carry identifiers. For example, the initial message carries the initial identifier s, and the end message carries the end identifier e. As shown in Figure 6B, the structure of the RESV message can carry L, protocol type, message length, IP address, bandwidth, and indication information of whether to carry the initial / end identifier; specifically, [L = 0, IPv4, 64, 10.0.0.1, bandwidth 1, 0], or [L = 0, IPv4, 64, 10.0.0.2, bandwidth 2, 1], where the indication information '0' indicates that the initial / end identifier is not carried, and the indication information '1' indicates that the initial / end identifier is carried.

[0098] Optionally, the policy determination method in the embodiment of the present disclosure may further include:

[0099] The downstream network node receives a first initial message in a queue of a first upstream network node, where the first upstream network node is one of the multiple upstream network nodes;

[0100] When the first initial message does not carry the initial identifier, the downstream network node receives the messages sent by the multiple upstream network nodes out of order and uses the sending queue to queue and forward them; or, when the first initial message carries the initial identifier, the downstream network node uses the sending queue to send the messages received from the multiple upstream network nodes in an orderly manner.

[0101] In this way, it is possible to determine whether the messages in the queue of the upstream network node are received in order with the help of the initial identifier.

[0102] In the embodiment of the present disclosure, in addition to the downstream network node / aggregation network node determining the message sending strategy from multiple upstream network nodes to the downstream network node, the control network node (such as a controller) can also determine the message sending strategy from multiple upstream network nodes to the downstream network node, as explained below.

[0103] Please refer to Figure 7, which is a flow chart of a policy determination method provided by an embodiment of the present disclosure. The method is applied to control network nodes, such as controllers. As shown in Figure 7, the method includes the following steps:

[0104] Step 71: The control network node obtains queue information of each upstream network node among multiple upstream network nodes;

[0105] Step 72: The control network node obtains queue information of downstream network nodes of the multiple upstream network nodes;

[0106] Step 73: The control network node determines a message sending strategy from the multiple upstream network nodes to the downstream network nodes according to the queue information of each upstream network node and the queue information of the downstream network node.

[0107] Optionally, the queue information may include the number of queues.

[0108] Optionally, after determining the message sending strategy from multiple upstream network nodes to downstream network nodes, the message sending strategy can be sent to each upstream network node and downstream network node respectively, so that each upstream network node and downstream network node sends and receives messages based on the message sending strategy.

[0109] Therefore, with the help of the solution in this disclosure, the capabilities of the control network nodes can be enhanced, so that the control network nodes can determine the message sending strategy from multiple upstream network nodes to downstream network nodes by identifying the upstream and downstream queue capabilities, thereby ensuring the deterministic transmission of messages when multiple paths converge.

[0110] In the disclosed embodiment, different message sending strategies may be formed according to the capabilities of the upstream and downstream queues, as described below.

[0111] Strategy 1:

[0112] This strategy 1 corresponds to the optimal situation, where a single queue of a downstream network node can receive all the messages in the queues of multiple upstream network nodes at once.

[0113] Optionally, step 73 includes: when it is determined, based on the queue information of each upstream network node and the queue information of the downstream network node, that the messages in the queues of multiple upstream network nodes can be received at once by a single queue of the downstream network node, the control network node determines a message transmission strategy from the multiple upstream network nodes to the downstream network node, including: sending the messages in the corresponding queues of the multiple upstream network nodes to a single queue of the downstream network node out of order. In other words, the corresponding queues of the multiple upstream network nodes are merged into a single queue, without considering the order of transmission. In this way, the upstream network node does not need to send the messages in the current queue in order, and the messages in the queue of the upstream network node will not be sent to the multiple queues of the downstream network node, thereby avoiding resource waste.

[0114] The specific example under this strategy 1 can be found in FIG4A , and the specific description can be found in the above embodiment, which will not be repeated here.

[0115] Strategy 2:

[0116] This strategy 2 corresponds to the situation where a single queue of a downstream network node cannot receive all the messages in the queues of multiple upstream network nodes at once.

[0117] Optionally, the above-mentioned step 73 includes: when it is determined based on the queue information of each upstream network node and the queue information of the downstream network node that the messages in the queues of multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, the control network node determines that the message sending strategy from the multiple upstream network nodes to the downstream network node includes: sequentially sending or disorderly sending the messages in the corresponding queues of the multiple upstream network nodes.

[0118] Optionally, when the message sending strategy includes sequentially sending messages in corresponding queues of the multiple upstream network nodes, the message sending strategy further includes: the initial message and the end message in the queue of each upstream network node among the multiple upstream network nodes respectively carry an initial identifier and an end identifier, wherein the initial identifier is used to identify the start of sending the message in the corresponding queue, and the end identifier is used to identify the end of sending the message in the corresponding queue. In this way, the initial identifier and the end identifier can be used to identify the initial message and the end message in the corresponding queue, thereby ensuring sequential sending of the messages.

[0119] The specific example under this strategy 2 can be found in FIG4B , and the specific description can be found in the above embodiment, which will not be repeated here.

[0120] Strategy 3:

[0121] This strategy 3 corresponds to the situation where a single queue of the downstream network node cannot receive all the messages in the queues of multiple upstream network nodes at once, and the total amount of messages in the sending queues of multiple upstream network nodes exceeds the carrying capacity of the corresponding queues of the downstream network node.

[0122] Optionally, the above-mentioned step 73 includes: when it is determined based on the queue information of each upstream network node and the queue information of the downstream network node that the messages in the queues of multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, and the total amount of messages in the sending queues of the multiple upstream network nodes exceeds the carrying capacity of the corresponding queue of the downstream network node, the control network node determines that the message sending strategy from the multiple upstream network nodes to the downstream network node includes: sequentially sending the messages in the corresponding queues of the multiple upstream network nodes.

[0123] Optionally, the message sending strategy further includes: the initial message and the final message in the queue of each of the multiple upstream network nodes carry an initial identifier and an final identifier, respectively. In this way, the initial identifier and the final identifier can be used to identify the initial message and the final message in the corresponding queue, thereby ensuring sequential message sending.

[0124] The embodiment of the present disclosure is described in detail below with reference to FIG8 .

[0125] As shown in FIG8 , the message transmission process in the embodiment of the present disclosure may include:

[0126] S1: The client (such as client 1 and client 2) sends a service request, which contains the service type and requirements for network latency, jitter, etc.

[0127] S2: The controller allocates message forwarding paths based on service requirements. For example, as shown in Figure 8, four message forwarding paths can be allocated: network node A1 - network node B - network node C1 ... server 1; network node A1 - network node B - network node C2 ... server 1; network node A2 - network node B - network node C2 ... server 2; network node A2 - network node B - network node C2 ... server 2.

[0128] S3: Each network node on the path executes the resource reservation process. The resource reservation message needs to carry the corresponding queue number N;

[0129] S4: Based on the resource reservation information and the number of queues N, the aggregation network node B determines whether the upstream network node needs to tag the start and end of the queue. It also determines whether to carry the initial and end identifiers when the resource reservation RESV message is returned. If not, the process proceeds to S6; if so, the process proceeds to S5.

[0130] S5: Network node A1 / A2 adds a cycle ID to the messages in its queue, adds an initial identifier s to the initial message of the queue, and adds an end identifier e to the end message of the queue;

[0131] S6: The client sends a service message, and the corresponding network node (such as network node A1 / A2) assigns the corresponding cycle ID and other parameters, and forwards it in a circular queue:

[0132] (a) If the initial message in the queue does not have the s flag, there is no need to restrict the reception of messages by other upstream network nodes. They can be received out of order in the buffer area and queued and forwarded using the send queue.

[0133] (b) If the initial message in the queue has an s flag, it is necessary to restrict the message reception of other upstream network nodes, or use a buffer area to temporarily store the messages so that the sending queue can send the messages received from different upstream network nodes in an orderly manner.

[0134] It should be noted that the policy determination method provided in the embodiments of the present disclosure can be executed by a policy determination device or a control module in the policy determination device for executing the policy determination method. The policy determination device provided in the embodiments of the present disclosure is described by taking the policy determination device executing the policy determination method as an example.

[0135] Please refer to FIG. 9 , which is a schematic diagram of the structure of a policy determination device provided in an embodiment of the present disclosure. The device is applied to a downstream network node / aggregation network node. As shown in FIG. 9 , the policy determination device 90 includes:

[0136] A receiving module 91 is configured to receive a plurality of first messages sent by a plurality of upstream network nodes, wherein the first messages include queue information of corresponding upstream network nodes;

[0137] A first determining module 92 is configured to determine a message sending strategy from the multiple upstream network nodes to the downstream network nodes based on the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes of the multiple upstream network nodes;

[0138] The sending module 93 is configured to send a second message to each of the plurality of upstream network nodes, wherein the second message includes an identifier indicating the message sending policy.

[0139] Optionally, the first determination module 92 is specifically used to: when it is determined, based on the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes, that the messages in the queues of the multiple upstream network nodes can be received at one time by a single queue of the downstream network node, determine that the message sending strategy includes sending the messages of the corresponding queues of the multiple upstream network nodes to a queue of the downstream network node in an unordered manner.

[0140] Optionally, the first determination module 92 is specifically used to: when it is determined, based on the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes, that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, determine that the message sending strategy includes sequential sending or disorderly sending of the messages in the corresponding queues of the multiple upstream network nodes.

[0141] Optionally, the first determination module 92 is specifically used to: when it is determined based on the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, and the total amount of messages in the sending queues of the multiple upstream network nodes exceeds the carrying capacity of the corresponding queues of the downstream network nodes, determine that the message sending strategy includes sequentially sending the messages in the corresponding queues of the multiple upstream network nodes.

[0142] Optionally, when the message sending strategy includes sequentially sending messages in the corresponding queues of the multiple upstream network nodes, the message sending strategy also includes: the initial message and the end message in the queue of each upstream network node in the multiple upstream network nodes carry an initial identifier and an end identifier respectively.

[0143] Optionally, the receiving module 91 is further configured to: receive a first initial message in a queue of a first upstream network node, where the first upstream network node is one of the multiple upstream network nodes;

[0144] The sending module 93 is also used to: when the first initial message does not carry the initial identifier, receive the messages sent by the multiple upstream network nodes out of order, and use the sending queue to queue and forward them; or, when the first initial message carries the initial identifier, use the sending queue to send the messages received from the multiple upstream network nodes in an orderly manner.

[0145] Optionally, the queue information includes the number of queues.

[0146] The strategy determination device 90 of the embodiment of the present disclosure can implement each process of the method embodiment shown in Figure 3 above and achieve the same technical effect. To avoid repetition, it will not be described here.

[0147] Please refer to FIG10 , which is a schematic diagram of the structure of a policy determination device provided by an embodiment of the present disclosure. The device is applied to control a network node. As shown in FIG10 , the policy determination device 100 includes:

[0148] A first acquisition module 101 is configured to acquire queue information of each upstream network node among a plurality of upstream network nodes;

[0149] A second acquisition module 102 is configured to acquire queue information of downstream network nodes of the plurality of upstream network nodes;

[0150] The second determining module 103 is configured to determine a message sending strategy from the multiple upstream network nodes to the downstream network node according to the queue information of each upstream network node and the queue information of the downstream network node.

[0151] Optionally, the second determination module 103 is specifically used to: when it is determined based on the queue information of each upstream network node and the queue information of the downstream network node that the messages in the queues of the multiple upstream network nodes can be received at one time by a single queue of the downstream network node, determine that the message sending strategy includes sending the messages of the corresponding queues of the multiple upstream network nodes to a queue of the downstream network node in an unordered manner.

[0152] Optionally, the second determination module 103 is specifically used to: when it is determined, based on the queue information of each upstream network node and the queue information of the downstream network node, that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, determine that the message sending strategy includes sequential sending or disorderly sending of the messages in the corresponding queues of the multiple upstream network nodes.

[0153] Optionally, the second determination module 103 is specifically used to: when it is determined based on the queue information of each upstream network node and the queue information of the downstream network node that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, and the total amount of messages in the sending queues of the multiple upstream network nodes exceeds the carrying capacity of the corresponding queues of the downstream network node, determine that the message sending strategy includes sequentially sending the messages in the corresponding queues of the multiple upstream network nodes.

[0154] Optionally, when the message sending strategy includes sequentially sending messages in the corresponding queues of the multiple upstream network nodes, the message sending strategy also includes: the initial message and the end message in the queue of each upstream network node in the multiple upstream network nodes carry an initial identifier and an end identifier respectively.

[0155] Optionally, the queue information includes the number of queues.

[0156] The strategy determination device 100 of the embodiment of the present disclosure can implement each process of the method embodiment shown in Figure 7 above and achieve the same technical effect. To avoid repetition, it will not be described here.

[0157] Optionally, as shown in FIG11 , an embodiment of the present disclosure further provides a communication device 110, comprising a processor 111, a memory 112, and a program or instruction stored in the memory 112 and executable on the processor 111. For example, when the communication device 110 is a downstream network node, the program or instruction, when executed by the processor 111, implements the various processes of the embodiment of the policy determination method shown in FIG3 above, and can achieve the same technical effect. When the communication device 110 is a control network node, the program or instruction, when executed by the processor 111, implements the various processes of the embodiment of the policy determination method shown in FIG7 above, and can achieve the same technical effect. To avoid repetition, these are not described here.

[0158] The embodiment of the present disclosure also provides a readable storage medium on which a program or instruction is stored. When the program or instruction is executed by a processor, the various processes of the above-mentioned strategy determination method embodiment can be implemented and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

[0159] Computer-readable media include both permanent and non-permanent, removable and non-removable media, and can be implemented by any method or technology for information storage. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable ROM (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape, disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. According to the definition in this article, computer-readable media does not include transitory media such as modulated data signals and carrier waves.

[0160] It should be noted that, in this document, the terms "comprises," "includes," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, article, or apparatus comprising a series of elements includes not only those elements but also other elements not explicitly listed, or elements inherent to such process, method, article, or apparatus. In the absence of further limitations, an element defined by the phrase "comprising a ..." does not exclude the presence of other identical elements in the process, method, article, or apparatus comprising the element.

[0161] The serial numbers of the above-mentioned embodiments of the present disclosure are for description only and do not represent the advantages or disadvantages of the embodiments.

[0162] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus the necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present disclosure is essentially or the part that contributes to the existing technology can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, disk, CD), including a number of instructions for enabling a service classification device (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in each embodiment of the present disclosure.

[0163] The above is only a preferred embodiment of the present disclosure. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present disclosure. These improvements and modifications should also be regarded as within the scope of protection of the present disclosure.

Claims

1. A strategy determination method, comprising: The downstream network node receives a plurality of first messages sent by a plurality of upstream network nodes, wherein the first messages include queue information of the corresponding upstream network nodes; The downstream network node determines, according to the queue information of the multiple upstream network nodes and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node; The downstream network node sends a second message to the multiple upstream network nodes respectively, and the second message includes an identifier for indicating the message sending strategy.

2. The method according to claim 1, wherein: The determining, according to the queue information of the multiple upstream network nodes and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node comprises: When it is determined, based on the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes, that the messages in the queues of the multiple upstream network nodes can be received at one time by a single queue of the downstream network node, the downstream network node determines that the message sending strategy includes sending the messages in the corresponding queues of the multiple upstream network nodes to a queue of the downstream network node in an unordered manner.

3. The method according to claim 1, wherein: The determining, according to the queue information of the multiple upstream network nodes and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node comprises: When it is determined based on the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, the downstream network node determines that the message sending strategy includes sequentially sending or unordered sending of the messages in the corresponding queues of the multiple upstream network nodes.

4. The method according to claim 1, wherein: The determining, according to the queue information of the multiple upstream network nodes and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node comprises: When it is determined based on the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, and the total amount of messages in the sending queues of the multiple upstream network nodes exceeds the carrying capacity of the corresponding queues of the downstream network nodes, the downstream network node determines that the message sending strategy includes sequentially sending the messages in the corresponding queues of the multiple upstream network nodes.

5. The method according to claim 3 or 4, wherein: When the message sending strategy includes sequentially sending messages in corresponding queues of the multiple upstream network nodes, the message sending strategy also includes: the initial message and the end message in the queue of each upstream network node in the multiple upstream network nodes carry an initial identifier and an end identifier respectively.

6. The method according to claim 5, further comprising: The downstream network node receives a first initial message in a queue of a first upstream network node, where the first upstream network node is one of the multiple upstream network nodes; When the first initial message does not carry an initial identifier, the downstream network node receives the messages sent by the multiple upstream network nodes out of order and uses a sending queue to queue and forward them; or, when the first initial message carries an initial identifier, the downstream network node uses a sending queue to send the messages received from the multiple upstream network nodes in an orderly manner.

7. The method according to any one of claims 1 to 4, wherein: The queue information includes the number of queues.

8. A strategy determination method, comprising: The control network node obtains queue information of each upstream network node among the plurality of upstream network nodes; The control network node acquires queue information of downstream network nodes of the plurality of upstream network nodes; The control network node determines a message sending strategy from the multiple upstream network nodes to the downstream network node according to the queue information of each upstream network node and the queue information of the downstream network node.

9. The method according to claim 8, wherein: The determining, according to the queue information of each upstream network node and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node comprises: When it is determined, based on the queue information of each upstream network node and the queue information of the downstream network node, that the messages in the queues of the multiple upstream network nodes can be received at one time by a single queue of the downstream network node, the control network node determines that the message sending strategy includes sending the messages in the corresponding queues of the multiple upstream network nodes to a queue of the downstream network node in an unordered manner.

10. The method according to claim 8, wherein: The determining, according to the queue information of each upstream network node and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node comprises: When it is determined based on the queue information of each upstream network node and the queue information of the downstream network node that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, the control network node determines that the message sending strategy includes sequentially sending or unordered sending of the messages in the corresponding queues of the multiple upstream network nodes.

11. The method according to claim 8, wherein: The determining, according to the queue information of each upstream network node and the queue information of the downstream network node, a message sending strategy from the multiple upstream network nodes to the downstream network node comprises: When it is determined based on the queue information of each upstream network node and the queue information of the downstream network node that the messages in the queues of the multiple upstream network nodes cannot be received at one time by a single queue of the downstream network node, and the total amount of messages in the sending queues of the multiple upstream network nodes exceeds the carrying capacity of the corresponding queues of the downstream network nodes, the control network node determines that the message sending strategy includes sequentially sending the messages in the corresponding queues of the multiple upstream network nodes.

12. The method according to claim 10 or 11, wherein: When the message sending strategy includes sequentially sending messages in corresponding queues of the multiple upstream network nodes, the message sending strategy also includes: the initial message and the end message in the queue of each upstream network node in the multiple upstream network nodes carry an initial identifier and an end identifier respectively.

13. The method according to any one of claims 8 to 11, wherein: The queue information includes the number of queues.

14. A strategy determination device, comprising: A receiving module, configured to receive a plurality of first messages sent by a plurality of upstream network nodes, wherein the first messages include queue information of corresponding upstream network nodes; A first determining module, configured to determine a message sending strategy from the multiple upstream network nodes to the downstream network nodes according to the queue information of the multiple upstream network nodes and the queue information of the downstream network nodes of the multiple upstream network nodes; The sending module is used to send a second message to the multiple upstream network nodes respectively, and the second message includes an identifier for indicating the message sending strategy.

15. A strategy determination device, comprising: A first acquisition module, configured to acquire queue information of each upstream network node among a plurality of upstream network nodes; A second acquisition module, configured to acquire queue information of downstream network nodes of the plurality of upstream network nodes; The second determining module is used to determine a message sending strategy from the multiple upstream network nodes to the downstream network node according to the queue information of each upstream network node and the queue information of the downstream network node.

16. A communication device, comprising a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the policy determination method as described in any one of claims 1 to 7, or implements the steps of the policy determination method as described in any one of claims 8 to 13.

17. A readable storage medium storing a program or instruction, wherein the program or instruction, when executed by a processor, implements the steps of the policy determination method according to any one of claims 1 to 7, or implements the steps of the policy determination method according to any one of claims 8 to 13.

Images