Message sending method, target node and electronic equipment
By reserved an outgoing time slot for the service with an offset of less than the number of scheduling cycle slots on the target node, and converting it into a scheduling cycle slot after receiving the forwarded message, the queue backlog caused by the orchestration cycle length is solved. Problem, improving the efficiency of message forwarding.
Patent Information
- Application Number
- CN202310534244.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-11
- Publication Date
- 2024-11-12
AI Technical Summary
When the orchestration period length is greater than the scheduling period length, the target node generates a large number of queues or cache requirements, resulting in network congestion and affecting the packet forwarding efficiency.
The target node reserves a first target outbound time slot for the target service during the orchestration period. The number of offsets of the time slot relative to the time slot in the transmission in progress is less than the number of first time slots in the scheduling period, and is received. After forwarding the message, based on the preset conversion strategy, the first target outbound time slot is converted into the second target outbound time slot in the scheduling cycle, and stored in the queue to be sent for the second target outbound time slot.
It significantly reduces the cache demand of the target node, reduces the possibility of network congestion, and improves the forwarding efficiency of packets.
Smart Images

Figure CN118944836A_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present application relate to the field of data communication technology, and in particular to a message sending method, a target node, and an electronic device. Background Art
[0002] The standard RFC8655 released by IETF describes the architecture of deterministic networks and defines the QoS (Quality of Service) target of deterministic forwarding. In order to achieve the QoS target of deterministic forwarding, the transmission path of the service flow in the network can be pre-selected to ensure the stability of the route and prevent it from changing with the real-time changes of the network topology.
[0003] In general, the deterministic path pre-selected for the service flow is a strictly explicit path calculated by a centralized controller, and resources are reserved at the nodes along the path to meet the SLA (Service Level Agreement) requirements of the deterministic service. Taking two adjacent nodes in the service transmission path as an example, the outbound time slot of the egress port of the upstream node is mapped to the sending time slot of the egress port of the downstream node. Based on this mapping relationship, the outbound time slot resources can be reserved for the service flow at the egress port of the downstream node, and the forwarding message will be sent in the outbound time slot of the egress port of each node in the deterministic path in turn.
[0004] However, since the orchestration cycle is business-oriented, the length of the orchestration cycle is usually very long. If the node implements the same length of scheduling cycle on the forwarding plane, a large number of queues or cache requirements will be generated, even far exceeding the node's carrying capacity. At this time, network congestion is likely to occur, seriously affecting the forwarding efficiency of the message. Summary of the invention
[0005] The embodiments of the present application provide a message sending method, a target node and an electronic device to at least solve the problem in the prior art that, when the length of the scheduling cycle is greater than the length of the scheduling cycle, the target node generates a large number of queues or cache requirements, which easily causes network congestion and affects the forwarding efficiency of the message.
[0006] In order to solve the above technical problems, this application is implemented as follows:
[0007] In a first aspect, an embodiment of the present application provides a method for sending a message, including:
[0008] The target node reserves a first target outgoing time slot for the target service within the scheduling period, wherein the number of time slot offsets of the first target outgoing time slot relative to the sending-in-progress time slot of the target node is less than the number of first time slots included in the scheduling period, and the target node is any node on the target path of the target service flow;
[0009] After receiving the forwarding message of the target service flow, the target node converts the first target outgoing time slot into a second target outgoing time slot in the scheduling period based on a preset conversion strategy;
[0010] The target node stores the forwarded message in a to-be-sent queue corresponding to the second target outgoing time slot for sending.
[0011] In a possible implementation, after receiving the forwarding message of the target service flow, the target node converts the first target outgoing time slot into the second target outgoing time slot in the scheduling period based on a preset conversion strategy, including:
[0012] When receiving the forwarding message of the target service flow, the target node obtains the first target outgoing time slot corresponding to the forwarding message; based on a preset conversion strategy, the first target outgoing time slot is converted into a second target outgoing time slot in the scheduling period.
[0013] In a possible implementation manner, the acquiring the first target outgoing time slot corresponding to the forwarded message includes:
[0014] Based on the time slot number carried by the forwarding message, a first target outgoing time slot reserved by the target node for the target service flow within the orchestration period is determined, and the time slot number corresponds to the first target outgoing time slot.
[0015] In a possible implementation manner, the acquiring the first target outgoing time slot corresponding to the forwarded message includes:
[0016] Determining an outgoing time slot corresponding to the forwarded message based on a pre-stored message forwarding table entry;
[0017] The outbound time slot is determined as a first target outbound time slot reserved by the target node for the target service flow within a scheduling cycle.
[0018] In a possible implementation, the preset conversion strategy includes:
[0019] When the number of second time slots included in the scheduling period is an integer multiple of the number of first time slots included in the scheduling period, the first target outbound time slot performs a modulo operation on the first number of time slots to obtain the second target outbound time slot.
[0020] In a possible implementation manner, the target node reserves a first target outgoing time slot for the target service within the scheduling period, including:
[0021] Acquire time slot resource information of the target node in a scheduling period, and the number of first time slots included in the scheduling period of the target node;
[0022] Based on the predetermined resident delay budget value corresponding to the target node and the time slot resource information, reserve a target time slot for the target service, and determine a resident delay evaluation value corresponding to the target node;
[0023] When the difference between the resident delay budget value and the resident delay evaluation value is less than a preset threshold, and the number of time slot offsets of the target time slot relative to the sending time slot of the target node is less than the first number of time slots, the target time slot is determined as the first target outbound time slot reserved by the target node for the target service within the scheduling cycle; wherein the sending time slot is used to indicate a time slot in a sending state on the egress port of the target node.
[0024] In a possible implementation manner, the acquiring the time slot resource information of the target node in the scheduling period and the number of first time slots included in the scheduling period of the target node includes:
[0025] The target node is notified of time slot resource information within the scheduling period and length information of the scheduling period through an extended network protocol; the length information is used to indicate the number of first time slots included in the scheduling period or the length of the scheduling period.
[0026] In a second aspect, an embodiment of the present application provides a target node, where the target node is any node on a target path of a target service flow, including:
[0027] A time slot reservation module, configured to reserve a first target outbound time slot for a target service within a scheduling period, wherein the number of time slot offsets of the first target outbound time slot relative to the sending-in-progress time slot is less than the number of first time slots included in the scheduling period;
[0028] A time slot conversion module, configured to convert the first target outgoing time slot into a second target outgoing time slot in the scheduling period based on a preset conversion strategy after receiving a forwarding message of the target service flow;
[0029] The message storage module is used to store the forwarded message in the waiting-to-send queue corresponding to the second target outgoing time slot for sending.
[0030] In a third aspect, an embodiment of the present application provides an electronic device, comprising a processor and a memory, wherein the memory stores at least one computer program, and the at least one computer program is loaded and executed by the processor to implement the above-mentioned message sending method.
[0031] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, in which at least one computer program is stored, and the computer program is loaded and executed by a processor to implement the above-mentioned message sending method.
[0032] The message sending method provided in the embodiment of the present application, the target node reserves a first target outgoing time slot for the target service within the scheduling cycle, wherein the number of time slot offsets of the first target outgoing time slot relative to the sending time slot of the target node is less than the first number of time slots included in the scheduling cycle, and the target node is any node on the target path of the target service flow; after receiving the forwarding message of the target service flow, the target node converts the first target outgoing time slot into the second target outgoing time slot in the scheduling cycle based on a preset conversion strategy; the target node stores the forwarding message in a to-be-sent queue corresponding to the second target outgoing time slot for sending.
[0033] It can be seen that since the target node considers the number of time slots in the scheduling cycle during the time slot reservation process, and converts the reserved outgoing time slot after receiving the forwarding message and stores it in the queue of the scheduling cycle for sending, even if the service burst interval is very large and the length of the scheduling cycle is much longer than the length of the scheduling cycle, the queues maintained on the target node are still very small, which can significantly reduce the cache requirements of the target node, reduce the possibility of network congestion, and improve the forwarding efficiency of the message.
[0034] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0035] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0036] Figure 1 A schematic diagram showing a flow chart of a message sending method provided in an embodiment of the present application is shown;
[0037] Figure 2 A schematic diagram of a network structure provided by an embodiment of the present application is shown;
[0038] Figure 3 A schematic diagram showing the conversion between the time slots in the scheduling cycle and the time slots in the scheduling cycle provided in an embodiment of the present application is shown;
[0039] Figure 4 A schematic diagram of the structure of an extended network protocol provided in an embodiment of the present application is shown;
[0040] Figure 5A schematic diagram showing the offset relationship between the burst volume (or sub-burst volume) of a service provided by an embodiment of the present application and the scheduling period;
[0041] Figure 6 A schematic diagram showing the time slot mapping relationship between two adjacent upstream and downstream nodes provided in an embodiment of the present application is shown;
[0042] Figure 7 A schematic diagram of the structure of a target node provided in an embodiment of the present application is shown;
[0043] Figure 8 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application is shown. DETAILED DESCRIPTION
[0044] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.
[0045] In the personal draft published by IETF, it is mentioned that at the ingress node of the network, it is necessary to reserve corresponding outgoing time slot resources on the egress port for the service flow with the corresponding arrival time; at the intermediate node in the network, it is necessary to reserve corresponding outgoing time slot resources on the egress port for the service flow with the corresponding inbound time slot. Taking two adjacent nodes in the service transmission path as an example, the outgoing time slot of the egress port of the upstream node is mapped to the sending time slot of the egress port of the downstream node. Based on this mapping relationship, the outgoing time slot resources can be reserved for the service flow on the egress port of the downstream node, and the forwarding message will be sent in the outgoing time slot of the egress port of each node in the deterministic path in turn.
[0046] In order to facilitate understanding of the embodiments of the present application, the relevant terms are explained as follows:
[0047] Timeslot: The smallest unit of time division multiplexing. A reasonable value should be designed, such as 10us, so that at least one complete message can be sent.
[0048] Incoming Timeslot: For an intermediate node in a specific path, the timeslot contained in the message it receives from the upstream node (i.e., the outgoing timeslot of the upstream node) is its incoming timeslot.
[0049] Outgoing Timeslot: For an intermediate node in a specific path, when it continues to send a message to a downstream node, it chooses to send the message in a specified timeslot based on resource reservation or certain rules. This timeslot is the outgoing timeslot.
[0050] Ongoing Sending Timeslot: For the head node in the path, it continues to send the message received from the client side to the downstream node. When the message arrives at the egress port, the time slot in which the egress port is currently in the sending state is the ongoing sending timeslot; for the intermediate node in the path, it continues to send the message received from the upstream node to the downstream node. When the end of the inbound timeslot to which the message belongs arrives at the egress port, the time slot in which the egress port is currently in the sending state is the ongoing sending timeslot. Note that the ongoing sending timeslot is not an outbound timeslot.
[0051] Scheduling Period: The cyclic period of the time division multiplexing scheduling mechanism implemented by the network nodes, including a fixed number of time slots. For example, a scheduling period contains 100 time slots.
[0052] Service Burst Interval: The traffic specification of a deterministic service flow generally follows a certain burst volume within a cyclic burst interval (i.e., service burst interval). For example, if a service flow generates 1000 bits of traffic every 1ms, then its corresponding service burst interval is 1ms.
[0053] Orchestration Period: The orchestration period adopted by the control plane according to the needs of all deterministic services, allocating time slot resources to services within the orchestration period, that is, which time slots in the orchestration period the service occupies and how many bits in the time slot. The orchestration period is usually an integer multiple of the scheduling period, or equal to the scheduling period.
[0054] Since the orchestration cycle is service-oriented, that is, the control plane determines the orchestration cycle based on the service burst intervals of all deterministic services and the discrete burst volume within each service burst interval, the service burst intervals of some deterministic services are very large. Therefore, the length of the determined orchestration cycle is much longer than the length of the scheduling cycle. If the node implements the same length of scheduling cycle on the forwarding plane, a large number of queues or cache requirements will be generated, even far exceeding the carrying capacity of the node. At this time, network congestion is likely to occur, seriously affecting the forwarding efficiency of the message.
[0055] Based on this, an embodiment of the present application provides a message sending method to save the queue or cache requirements of the target node, reduce the possibility of network congestion, and improve the forwarding efficiency of the message. Figure 1 A flow chart of a message sending method provided in an embodiment of the present application is shown. As shown in the figure, the message sending method 100 may specifically include the following steps:
[0056] S101: The target node reserves a first target outgoing time slot for the target service within the scheduling period, wherein the number of time slot offsets of the first target outgoing time slot relative to the sending time slot of the target node is less than the number of first time slots included in the scheduling period, and the target node is any node on the target path of the target service flow;
[0057] S102: After receiving the forwarding message of the target service flow, the target node converts the first target outgoing time slot into a second target outgoing time slot in the scheduling period based on a preset conversion strategy;
[0058] S103: The target node stores the forwarded message in a to-be-sent queue corresponding to the second target outgoing time slot for sending.
[0059] Through the above steps, the target node first reserves a first target outbound time slot for the target service within the scheduling cycle, and the number of time slot offsets of the first target outbound time slot relative to the target node's sending time slot is less than the number of first time slots included in the scheduling cycle. That is, in the process of reserving the outbound time slot, in addition to considering the number of time slot offsets of the target node's outbound time slot relative to the sending time slot, and satisfying that the residence delay evaluation value determined according to the number of time slot offsets meets the residence delay budget value corresponding to the target node, the target node further considers the number of time slots in the scheduling cycle, and the number of time slot offsets is less than the number of time slots in the scheduling cycle.
[0060] Furthermore, after receiving the forwarding message of the target business flow, the target node converts the first target outgoing time slot into the second target outgoing time slot in the scheduling cycle based on the preset conversion strategy; the forwarding message is stored in the waiting queue corresponding to the second target outgoing time slot for sending. In this way, even if the service burst interval is very large, making the length of the scheduling cycle much longer than the length of the scheduling cycle, the queues maintained on the target node are still very small, thereby reducing the cache requirements of the target node and improving the forwarding efficiency of the message.
[0061] In a possible implementation, in S102, after receiving the forwarding message of the target service flow, the target node converts the first target outgoing time slot into a second target outgoing time slot in the scheduling period based on a preset conversion strategy, including:
[0062] When receiving the forwarding message of the target service flow, the target node obtains the first target outgoing time slot corresponding to the forwarding message; based on a preset conversion strategy, the first target outgoing time slot is converted into a second target outgoing time slot in the scheduling period.
[0063] This is explained with reference to specific examples. Figure 2 A schematic diagram of a network structure provided by an embodiment of the present application is shown. As shown in the figure, the network includes 6 nodes: node S, node A, node C, node E, node D and node B. The links between two nodes are all bidirectional links. In the control plane, the end-to-end target path can be calculated for the target service flow by a centralized controller or the head node of the path.
[0064] Specifically, the target path of the target service flow can be determined in the following manner:
[0065] Obtain the delay requirement of the target business flow and the time slot resource information of each egress port of each node; determine at least one candidate path corresponding to the target business flow based on the time slot resource information of each egress port of each node; reserve time slot resources for the target business flow at the egress port of the candidate node in each candidate path, and determine the total residence delay evaluation value of the target business flow on the candidate path; then, select a candidate path that meets the first condition as the target path of the target business flow, the first condition including that the egress ports of all candidate nodes constituting the selected candidate path successfully reserve time slot resources for the target business flow, and the sum of the total residence delay evaluation value of the selected candidate path and the accumulated link propagation delay meets the delay requirement.
[0066] After the target path is calculated successfully and takes effect, if the target path is path_SD, the forwarding message of the target service flow is forwarded along the target path path_SD via SACED. For any node on the target path of the target service flow, when receiving the forwarding message of the target service flow, the first target outgoing time slot corresponding to the forwarding message is obtained, and the first target outgoing time slot is reserved in advance for the target service flow; based on the preset conversion strategy, the first target outgoing time slot is converted to the second target outgoing time slot in the scheduling period.
[0067] The first target outgoing time slot corresponding to the forwarded message can be obtained in the following two ways:
[0068] The first implementation method: based on the time slot number carried by the forwarding message, determine the first target outgoing time slot reserved by the target node for the target service flow within the scheduling period, and the time slot number corresponds to the first target outgoing time slot.
[0069] The second implementation method: based on the pre-stored message forwarding table entry, determine the outgoing time slot corresponding to the forwarded message; determine the outgoing time slot as the first target outgoing time slot reserved by the target node for the target service flow within the scheduling cycle.
[0070] The scheduling period implemented by the target node in the forwarding plane is not completely equivalent to the scheduling period of the control plane. Since the scheduling period is business-oriented, the length of the scheduling period is often much longer than the length of the scheduling period. Therefore, a corresponding conversion strategy is used to convert the first target outgoing time slot into the second target outgoing time slot in the scheduling period, store the message in the queue or cache corresponding to the second target outgoing time slot, and finally send the message in the second target outgoing time slot. In one possible implementation, the preset conversion strategy includes: when the number of second time slots included in the scheduling period is an integer multiple of the number of first time slots included in the scheduling period, the first target outgoing time slot performs a modulo operation on the first number of time slots to obtain the second target outgoing time slot. That is, when the number of second time slots included in the scheduling period is an integer multiple of the number of first time slots included in the scheduling period, the time slot conversion is performed by the following formula:
[0071] Second target outbound time slot = first target outbound time slot % M;
[0072] Among them, % is the modulo operation, and M is the number of time slots included in the scheduling cycle.
[0073] This is explained with reference to specific examples. Figure 3 The schematic diagram of the conversion between the time slots in the scheduling cycle and the time slots in the scheduling cycle provided by the embodiment of the present application is shown. As shown in the figure, the number of time slots N included in the scheduling cycle of the outbound port of node R1 (which connects to node R2) is an integer multiple of the number of time slots M included in the scheduling cycle, that is, the scheduling cycle contains multiple rounds of scheduling cycles, and the scheduling cycle from time slot 0 to time slot M-1 is the first round of scheduling cycle, from time slot M to time slot 2M-1 is the second round of scheduling cycle, and so on, from time slot NM to time slot N-1 is the N / Mth round of scheduling cycle. Each time slot in the scheduling cycle corresponds to an associated queue (or buffer) for storing messages to be sent in the corresponding time slot. In this way, even if the service burst interval is very large and the length of the scheduling cycle is much longer than the length of the scheduling cycle, the queues maintained on the target node are still very small, thereby reducing the cache requirements of the target node and improving the forwarding efficiency of the message.
[0074] The following is a description of the process in which the control plane determines a target path that meets a specific delay requirement for a target service flow and reserves a target time slot on an egress port along the target path:
[0075] As mentioned above, within the control plane, the centralized controller or the head node of the path calculates the end-to-end target path for the target service flow, and time slot resources are successfully reserved for the target service flow at the egress ports of all target nodes of the target path, and the sum of the total residence delay evaluation value of the selected candidate path and the accumulated link propagation delay meets the delay requirement.
[0076] by Figure 2 Take the network structure in as an example, assuming that the end-to-end delay required by the target service flow is 200us. The centralized controller or head node S first determines a candidate path path_SD, passing through the node SACED. The accumulated link propagation delay of the current candidate path is: 20us+10us+10us+10us=50us. The difference between the delay requirement of the target service flow and the accumulated link propagation delay is determined as the total residence delay budget value of each candidate node in the candidate path: 200us-50us=150us. Assuming that the mean budget method is used, each candidate node will share a residence delay budget value of 150 / 5=30us.
[0077] Along the candidate path path_SD from the head node S to the tail node D, reserve time slot resources for the target service flow at the egress port of each candidate node in turn. For each candidate node, reserve the target time slot for the target service flow according to the time slot resource information of the egress port of the candidate node and the resident delay budget value of the candidate node determined by the above steps, and determine the resident delay evaluation value corresponding to the candidate node. Then, when time slot resources are successfully reserved for the target service flow at the egress ports of all candidate nodes in the candidate path path_SD, and the sum of the total resident delay evaluation value of the selected candidate path and the accumulated link propagation delay meets the delay requirement of the target service flow, the candidate path path_SD is determined as the target path of the target service flow, and all candidate nodes contained in the target path are determined as target nodes. At this time, the path path_SD is calculated successfully and takes effect.
[0078] In a possible implementation manner, the target node reserves a first target outgoing time slot for the target service within the scheduling period, including:
[0079] Step 1011: Acquire the time slot resource information of the target node in the scheduling period, and the number of first time slots included in the scheduling period of the target node;
[0080] Step 1012: Based on the predetermined resident delay budget value corresponding to the target node and the time slot resource information, reserve a target time slot for the target service, and determine a resident delay evaluation value corresponding to the target node;
[0081] Step 1013: When the difference between the resident delay budget value and the resident delay evaluation value is less than a preset threshold, and the number of time slot offsets of the target time slot relative to the sending time slot of the target node is less than the first number of time slots, the target time slot is determined as the first target outbound time slot reserved by the target node for the target service within the scheduling cycle; wherein the sending time slot is used to indicate a time slot in a sending state on the egress port of the target node.
[0082] Through the above steps, since the scheduling cycle of the target node is much larger than the scheduling cycle, when the target node reserves the target time slot for the target service flow, in addition to satisfying that the difference between the residence delay budget value and the residence delay evaluation value is less than the preset threshold, the target node also needs to satisfy that the number of time slot offsets of the target time slot relative to the target node's sending ongoing time slot is less than the first time slot number.
[0083] The target nodes may mutually notify each other of the time slot resource information of the outbound port and the first number of time slots included in the scheduling cycle, that is, in step 1011, the time slot resource information of the target node in the scheduling cycle and the first number of time slots included in the scheduling cycle of the target node are obtained, including:
[0084] The target node is notified of time slot resource information within the scheduling period and length information of the scheduling period through an extended network protocol; the length information is used to indicate the number of first time slots included in the scheduling period or the length of the scheduling period.
[0085] In a specific implementation, the IGP protocol can be extended, OSPF or other similar protocols can be extended, and the BGP-LS protocol or other similar protocols can be extended to support the notification of the delay resource information of the outbound port. The ISIS protocol suite (refer to RFC5305, RFC5311, RFC5316, RFC5120) has defined TLVs 22 / 23 / 141 / 222 / 223 for notifying adjacency relationships. The embodiment of the present application adds a Sub-TLV to these TLVs, denoted as Timeslot SchedulingCapability Sub-TLV, which is used to carry the timeslot resource information of the outbound port and the number of the first timeslots contained in the scheduling cycle. Figure 4 A schematic diagram of the structure of an extended network protocol provided in an embodiment of the present application is shown. As shown in the figure, the extended network protocol includes the following fields:
[0086] Type: occupies 1 byte, and its value is to be assigned by IANA (Internet Assigned Numbers Authority) to indicate that this TLV is Timeslot Scheduling Capability Sub-TLV.
[0087] Length: 1 byte, indicating the content length of this TLV (excluding the Type and Length fields themselves).
[0088] Timeslot Count of OP: occupies 2 bytes and indicates the number of time slots (N) contained in the orchestration period. These time slots are numbered in sequence from 0 to N-1.
[0089] Timeslot Count of SP: occupies 2 bytes and indicates the number of time slots (M) contained in the scheduling period. These time slots are numbered from 0 to M-1.
[0090] Timeslot Interval: occupies 2 bytes and indicates the length of each timeslot in microseconds (us).
[0091] It should be noted that in other extension modes, the time slot length may be expressed in milliseconds (ms) or nanoseconds (ns), or the length of the scheduling cycle or the scheduling cycle may be expressed in time units.
[0092] By parsing the extended network protocol, the time slot resource information of the target node in the scheduling period and the number of first time slots included in the scheduling period of the target node are obtained.
[0093] Then, based on the predetermined residence delay budget value corresponding to the target node and the time slot resource information, a target time slot is reserved for the target service, and a residence delay evaluation value corresponding to the target node is determined. Figure 5The schematic diagram of the offset relationship between the burst (or sub-burst) of the service provided by the embodiment of the present application and the scheduling period is shown. As shown in the figure, when the target node is the head node, the head node H reserves the target time slot for each target burst contained in the target service flow in the scheduling period when receiving the target service flow. Here, the target service flow is a periodic flow, and its service burst interval is equal to the length of the scheduling period of the head node after expansion, so that the head node receives the same target service flow in each scheduling period. In the figure, it is assumed that the target service flow distributes n target bursts in each scheduling period, which are recorded as burst_1, burst_2, ..., burst_n. When a specific burst arrives at the inlet port of the head node H and passes through a node forwarding delay d_f, and then arrives at the egress port (link-a), there is a fixed offset relationship with the scheduling period of the egress port. For example, when the burst burst_i arrives at the egress port, the sending time slot of the egress port is y, and the remaining time from the end of time slot y is remaining_y.
[0094] Then, when the difference between the residence delay budget value and the residence delay evaluation value is less than the preset threshold, and the number of time slot offsets of the target time slot relative to the target node's sending in-progress time slot is less than the first number of time slots, the outbound time slot reserved by the head node H for burst_i is offset by O (≥1) time slots after its corresponding sending in-progress time slot y, that is, the first target outbound time slot is numbered (y+O)%N, where N is the number of the first time slots included in the scheduling cycle, and % is the modulo operator.
[0095] Figure 6 The schematic diagram of the time slot mapping relationship between two adjacent upstream and downstream nodes provided by the embodiment of the present application is shown. As shown in the figure, when the target node is the intermediate node I, when the intermediate node I of the path receives the target service flow sent by the upstream node U, the target time slot is reserved for each burst contained in the target service flow in the scheduling cycle. Similarly, the service burst interval is equal to the length of the scheduling cycle of the intermediate node I after expansion, so that the intermediate node I receives the same target service flow in each scheduling cycle. In the figure, assuming that the upstream node U sends a burst burst_i in its outgoing time slot x, the mapping relationship between the outgoing time slot x of the outgoing port link-a of the upstream node U and the sending ongoing time slot y of the outgoing port link-b of the intermediate node I can be obtained. This mapping relationship refers to the end of the outgoing time slot x of the upstream node U reaching the inbound port of the intermediate node I, and after a node forwarding delay d_f, and then reaching the outgoing port (link-b), the sending ongoing time slot of the outgoing port is y, and the remaining time from the end of the time slot y is remaining_xy.
[0096] Then, when the difference between the dwell time delay budget value and the dwell time delay evaluation value is less than a preset threshold, and the number of slot offsets of the target time slot relative to the ongoing transmission time slot of the target node is less than the number of the first time slots, the outgoing time slot reserved by the intermediate node I for burst_i is offset by O (≥1) time slots after its corresponding ongoing transmission time slot y, that is, the number of the first target outgoing time slot is (y + O) % N, where N is the number of time slots included in the scheduling period, and % is the modulo operator.
[0097] According to the above slot resource reservation process, when the target burst volume corresponding to the first target outgoing time slot (z) arrives at the outgoing port of node R1, the first ongoing transmission time slot (y) in the scheduling period of the outgoing port must be offset by O before the first target outgoing time slot, and O < M. This means that the target burst volume does not arrive at this node randomly, but strictly follows the time so that it will definitely fall into the first ongoing transmission time slot (y) when it arrives at the outgoing port.
[0098] Next, it is demonstrated that the target burst volume arriving at the outgoing port at the first ongoing transmission time slot (y) can be safely inserted into the corresponding queue in the scheduling period, and the queue will not overflow. The demonstration process is as follows:
[0099] Suppose there is a virtual queue for each time slot in the scheduling period, and the length of the virtual queue is the initial bit volume corresponding to that time slot. For example, the virtual queue corresponding to the first target outgoing time slot (z) is queue-z. Then, the packets that can be inserted into queue-z can only come from the following burst volumes:
[0100] The burst volume arriving at the outgoing port at the ongoing transmission time slot y = (z - M + 1 + N) % N, that is, this type of burst volume reserves the first target outgoing time slot (z) according to O = M - 1;
[0101] Or the burst volume arriving at the outgoing port at the ongoing transmission time slot y = (z - M + 2 + N) % N, that is, this type of burst volume reserves the first target outgoing time slot (z) according to O = M - 2;
[0102] And so on;
[0103] Or the burst volume arriving at the outgoing port at the ongoing transmission time slot y = (z - 1 + N) % N, that is, this type of burst volume reserves the first target outgoing time slot (z) according to O = 1.
[0104] The total reservation of all these burst volumes does not exceed the initial bit volume of the first target outgoing time slot (z).
[0105] Then, when the in-progress transmission time slot becomes z, queue-z will be transmitted and emptied completely. After that, starting from time slot z + 1 in the scheduling period until the last time slot N - 1, no packets will be inserted into queue-z. Obviously, such a virtual queue design wastes resources greatly. In fact, queue-z can be reused by the subsequent first target outbound time slot (z + M) % N. That is:
[0106] For the burst volume arriving at the egress port at the in-progress transmission time slot y = (z + 1) % N, such burst volume can reserve the first target outbound time slot (z + M) % N according to O = M - 1;
[0107] Or for the burst volume arriving at the egress port at the in-progress transmission time slot y = (z + 2) % N, such burst volume reserves the first target outbound time slot (z + M) % N according to O = M - 2;
[0108] And so on;
[0109] Or for the burst volume arriving at the egress port at the in-progress transmission time slot y = (z + M - 1) % N, that is, such burst volume reserves the first target outbound time slot (z + M) % N according to O = 1.
[0110] The total reservation of all these burst volumes does not exceed the initial bit volume of the first target outbound time slot (z + M).
[0111] It is not difficult to know that queue-z can be used by any target outbound time slot (z + k * M) % N, where k is a non-negative integer. By observing (z + k * M) % N, it can be seen that the smallest z satisfies 0 ≤ z < M. That is, actually only M queues are needed to store packets throughout the scheduling period, and these M queues are the queues corresponding to the M time slots in the scheduling period. That is to say, the smallest z (satisfying 0 ≤ z < M) is the number of the time slot in the scheduling period, and the target outbound time slot (z + k * M) % N is the number of the time slot in the scheduling period. The result of taking the modulo of the latter by M is the former, and then the queue corresponding to the former can be accessed. In short, the reason why a queue can store packets of multiple target outbound time slots without overflowing is that, as analyzed above, the packets stored in this queue before M time slots have been transmitted.
[0112] From the above demonstration process, it can be seen that by adopting the method provided in the embodiment of the present application, when the length of the scheduling period is much greater than the length of the scheduling period, the number of queues maintained on the target node is still very small, so that the cache requirement of the target node can be significantly reduced, the possibility of network congestion can be reduced, and the packet forwarding efficiency can be improved.
[0113] Figure 7 The structural schematic diagram of the target node provided by the embodiment of the present application is shown. As shown in the figure, the target node 700 includes:
[0114] A time slot reservation module 710 is used to reserve a first target outbound time slot for a target service within a scheduling period, wherein the number of time slot offsets of the first target outbound time slot relative to the sending in progress time slot is less than the number of first time slots included in the scheduling period;
[0115] The time slot conversion module 720 is used to convert the first target outgoing time slot into the second target outgoing time slot in the scheduling period based on a preset conversion strategy after receiving the forwarding message of the target service flow;
[0116] The message storage module 730 is used to store the forwarded message in the waiting-to-send queue corresponding to the second target outgoing time slot for sending.
[0117] In a possible implementation, the time slot conversion module 720 includes:
[0118] A time slot acquisition unit, when receiving a forwarding message of the target service flow, acquires a first target outgoing time slot corresponding to the forwarding message;
[0119] A time slot conversion unit is used to convert the first target outgoing time slot into a second target outgoing time slot in the scheduling period based on a preset conversion strategy.
[0120] In a possible implementation manner, when the time slot acquisition unit is used to acquire the first target outgoing time slot corresponding to the forwarded message, it is specifically used to:
[0121] Based on the time slot number carried by the forwarding message, a first target outbound time slot reserved by the target node for the target service flow within the orchestration period is determined, and the time slot number corresponds to the first target outbound time slot.
[0122] In a possible implementation, when the time slot acquisition unit is used to obtain the first target outgoing time slot corresponding to the forwarded message, it is specifically used to: determine the outgoing time slot corresponding to the forwarded message based on a pre-stored message forwarding table entry; and determine the outgoing time slot as the first target outgoing time slot reserved by the target node for the target service flow within the scheduling cycle.
[0123] The preset conversion strategy includes:
[0124] When the number of second time slots included in the scheduling period is an integer multiple of the number of first time slots included in the scheduling period, the first target outbound time slot performs a modulo operation on the first number of time slots to obtain the second target outbound time slot.
[0125] In a possible implementation manner, the time slot reservation module 710 includes:
[0126] An information acquisition unit, configured to acquire time slot resource information of the target node in a scheduling period and the number of first time slots included in the scheduling period of the target node;
[0127] A determination unit, configured to reserve a target time slot for the target service and determine a residence delay evaluation value corresponding to the target node based on a predetermined residence delay budget value corresponding to the target node and the time slot resource information;
[0128] A reservation unit, configured to determine the target time slot as the first target outbound time slot reserved by the target node for the target service within a scheduling cycle, when the difference between the residence delay budget value and the residence delay evaluation value is less than a preset threshold value and the number of time slot offsets of the target time slot relative to the sending-in-progress time slot of the target node is less than the first number of time slots; wherein the sending-in-progress time slot is used to indicate a time slot in a sending state on an egress port of the target node.
[0129] In a possible implementation manner, when the information acquisition unit is used to acquire the time slot resource information of the target node in the scheduling period and the number of first time slots included in the scheduling period of the target node, it is specifically used to:
[0130] The target node is notified of time slot resource information within the scheduling period and length information of the scheduling period through an extended network protocol; the length information is used to indicate the number of first time slots included in the scheduling period or the length of the scheduling period.
[0131] Figure 8 A schematic diagram of the hardware structure of an electronic device that implements the embodiments of the present application is shown. Referring to the figure, at the hardware level, the electronic device includes a processor, and optionally, an internal bus, a network interface, and a memory. Among them, the memory may include a memory, such as a high-speed random access memory (Random-Access Memory, RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk storage, etc. Of course, the computer device may also include hardware required for other services.
[0132] The processor, the network interface and the memory may be interconnected through an internal bus, which may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one bidirectional arrow is used in the figure, but it does not mean that there is only one bus or one type of bus.
[0133] The memory stores the program. Specifically, the program may include a program code, and the program code includes a computer operation instruction. The memory may include a memory and a non-volatile memory, and provides instructions and data to the processor.
[0134] The processor reads the corresponding computer program from the non-volatile memory into the memory and then runs it, forming a device for locating the target user at the logical level. The processor executes the program stored in the memory and specifically performs: Figure 1 The method disclosed in the illustrated embodiment realizes the functions and beneficial effects of each method described in the foregoing method embodiments, which will not be described in detail here.
[0135] The above application Figure 1The method disclosed in the illustrated embodiment may be implemented in a processor or by a processor. The processor may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in the processor or an instruction in the form of software. The above processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components. The methods, steps and logic block diagrams disclosed in the embodiments of the present application may be implemented or executed. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied as being executed by a hardware decoding processor, or may be executed by a combination of hardware and software modules in a decoding processor. The software module can be located in a storage medium mature in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
[0136] The computer device can also execute the methods described in the foregoing method embodiments, and realize the functions and beneficial effects of the methods described in the foregoing method embodiments, which will not be repeated here.
[0137] Of course, in addition to software implementation methods, the electronic device of the present application does not exclude other implementation methods, such as logic devices or a combination of software and hardware, etc. That is to say, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.
[0138] The embodiment of the present application also provides a computer-readable storage medium, wherein the computer-readable medium stores one or more programs, and when the one or more programs are executed by an electronic device including multiple application programs, the electronic device executes Figure 1 The method disclosed in the illustrated embodiment realizes the functions and beneficial effects of each method described in the foregoing method embodiments, which will not be described in detail here.
[0139] The computer-readable storage medium includes a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.
[0140] Furthermore, an embodiment of the present application also provides a computer program product, the computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions, and when the program instructions are executed by a computer, the following process is implemented: Figure 1 The method disclosed in the illustrated embodiment realizes the functions and beneficial effects of each method described in the foregoing method embodiments, which will not be described in detail here.
[0141] In short, the above is only a preferred embodiment of the present application and does not limit the protection scope of the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.
[0142] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
[0143] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. 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 read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0144] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0145] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.
Claims
1. A message sending method, It is characterized in that include: The target node reserves a first target outgoing time slot for the target service within the scheduling period, wherein the number of time slot offsets of the first target outgoing time slot relative to the sending-in-progress time slot of the target node is less than the number of first time slots included in the scheduling period, and the target node is any node on the target path of the target service flow; After receiving the forwarding message of the target service flow, the target node converts the first target outgoing time slot into a second target outgoing time slot in the scheduling period based on a preset conversion strategy; The target node stores the forwarded message in a to-be-sent queue corresponding to the second target outgoing time slot for sending.
2. The method according to claim 1, It is characterized in that After receiving the forwarding message of the target service flow, the target node converts the first target outgoing time slot into the second target outgoing time slot in the scheduling period based on a preset conversion strategy, including: When receiving the forwarding message of the target service flow, the target node obtains the first target outgoing time slot corresponding to the forwarding message; based on a preset conversion strategy, the first target outgoing time slot is converted into a second target outgoing time slot in the scheduling period.
3. The method according to claim 2, It is characterized in that The obtaining of the first target outgoing time slot corresponding to the forwarded message includes: Based on the time slot number carried by the forwarding message, a first target outbound time slot reserved by the target node for the target service flow within the orchestration period is determined, and the time slot number corresponds to the first target outbound time slot.
4. The method according to claim 2, It is characterized in that The obtaining of the first target outgoing time slot corresponding to the forwarded message includes: Determining an outgoing time slot corresponding to the forwarded message based on a pre-stored message forwarding table entry; The outbound time slot is determined as a first target outbound time slot reserved by the target node for the target service flow within a scheduling cycle.
5. The method according to claim 1, It is characterized in that The preset conversion strategy includes: When the number of second time slots included in the scheduling period is an integer multiple of the number of first time slots included in the scheduling period, the first target outbound time slot performs a modulo operation on the first number of time slots to obtain the second target outbound time slot.
6. The method according to claim 1, It is characterized in that The target node reserves a first target outgoing time slot for the target service within the scheduling period, including: Acquire time slot resource information of the target node in a scheduling period, and the number of first time slots included in the scheduling period of the target node; Based on the predetermined resident delay budget value corresponding to the target node and the time slot resource information, reserve a target time slot for the target service, and determine a resident delay evaluation value corresponding to the target node; When the difference between the resident delay budget value and the resident delay evaluation value is less than a preset threshold, and the number of time slot offsets of the target time slot relative to the sending time slot of the target node is less than the first number of time slots, the target time slot is determined as the first target outbound time slot reserved by the target node for the target service within the scheduling cycle; wherein the sending time slot is used to indicate a time slot in a sending state on the egress port of the target node.
7. The method according to claim 6, It is characterized in that The acquiring the time slot resource information of the target node in the scheduling period and the number of first time slots included in the scheduling period of the target node includes: The target node is notified of time slot resource information within the scheduling period and length information of the scheduling period through an extended network protocol; the length information is used to indicate the number of first time slots included in the scheduling period or the length of the scheduling period.
8. A target node, the target node being any node on a target path of a target service flow, It is characterized in that include: A time slot reservation module, configured to reserve a first target outbound time slot for a target service within a scheduling period, wherein the number of time slot offsets of the first target outbound time slot relative to the sending-in-progress time slot is less than the number of first time slots included in the scheduling period; A time slot conversion module, configured to convert the first target outgoing time slot into a second target outgoing time slot in the scheduling period based on a preset conversion strategy after receiving a forwarding message of the target service flow; The message storage module is used to store the forwarded message in the waiting-to-send queue corresponding to the second target outgoing time slot for sending.
9. An electronic device, It is characterized in that The electronic device comprises a processor and a memory, wherein the memory stores a program or instruction that can be run on the processor, and when the program or instruction is executed by the processor, the steps of the method according to any one of claims 1 to 7 are implemented.
10. A readable storage medium, It is characterized in that The readable storage medium stores a program or instruction, and when the program or instruction is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.
Citation Information
Cited By
Message sending method, target node, and electronic device
EP4712393A1
