Method, apparatus and electronic device for implementing deterministic signaling, and storage medium

Abstract

The application provides a realization method and device of deterministic signaling, electronic equipment and storage medium, after network initialization, the attribute of a signaling packet can be determined by analyzing the signaling packet, the signaling packet type of the signaling packet is determined according to the attribute, the signaling packet is divided into real-time signaling packets and ordinary signaling packets, after classification and sorting, a real-time signaling packet set and an ordinary signaling packet set are obtained, then different scheduling methods are adopted for the real-time signaling packet set and the ordinary signaling packet set with different requirements, so that the signaling blocking rate and end-to-end delay are reduced, and the problems such as uncertainty of signaling transmission in a data communication network are solved.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a method, apparatus, electronic device and storage medium for implementing deterministic signaling. Background Technology

[0002] In data communication networks, a "best-effort" forwarding method is typically used, which often lacks determinism. When a signaling packet arrives at the sending port and is ready to be transmitted, the sending end forwards it according to a first-in, first-out (FIFO) principle. However, when multiple signaling packets need to be transmitted simultaneously at a given sending port, these packets must queue, and the queuing time is determined by factors such as queue length and transmission speed. With sufficient bandwidth, this best-effort mechanism can adapt to most situations. However, if network traffic is too high, congestion or packet loss can occur, making queuing times unpredictable and thus compromising determinism. Summary of the Invention

[0003] In view of this, the purpose of this application is to propose a method, apparatus, electronic device and storage medium for implementing deterministic signaling to solve the problem of uncertainty in signaling transmission in data communication networks.

[0004] To achieve the above objectives, a first aspect of this application provides a method for implementing deterministic signaling, comprising:

[0005] Synchronize the network clock and initialize network information to obtain a time-consistent network topology and multiple signaling packets to be scheduled;

[0006] The attributes of the signaling packets are determined by analyzing the signaling packets, and the signaling packet type is determined based on the attributes; wherein, the signaling packet type includes real-time signaling packets and ordinary signaling packets;

[0007] In response to the signaling packet being the real-time signaling packet, the remaining duration for transmitting the real-time signaling packet in the network topology is determined according to the attribute, and the real-time signaling packets are classified and sorted according to the remaining duration to obtain the set of real-time signaling packets;

[0008] In response to the signaling packet being a regular signaling packet, the total delay for transmitting the regular signaling packet in the network topology is determined based on the attribute, and the signaling packets are sorted according to the total delay to obtain the set of regular signaling packets;

[0009] Based on the set type of the signaling packet set, the signaling packet scheduling result is determined according to the attributes of the signaling packet; wherein, the signaling packet set includes the ordinary signaling packet set and the real-time signaling packet set;

[0010] The signaling packets are scheduled according to the signaling packet scheduling result in the network topology.

[0011] A second aspect of this application provides an apparatus for implementing deterministic signaling, characterized in that it comprises:

[0012] The network initialization module is configured to: synchronize the network clock and initialize network information to obtain a time-consistent network topology and multiple signaling packets to be scheduled;

[0013] The signaling packet classification module is configured to: determine the attributes of the signaling packet by analyzing the signaling packet, and determine the signaling packet type of the signaling packet based on the attributes; wherein, the signaling packet type includes real-time signaling packets and ordinary signaling packets;

[0014] In response to the signaling packet being the real-time signaling packet, the remaining duration for transmitting the real-time signaling packet in the network topology is determined according to the attribute, and the real-time signaling packets are classified and sorted according to the remaining duration to obtain the set of real-time signaling packets;

[0015] In response to the signaling packet being a regular signaling packet, the total delay for transmitting the regular signaling packet in the network topology is determined based on the attribute, and the signaling packets are sorted according to the total delay to obtain the set of regular signaling packets;

[0016] The signaling packet scheduling module is configured to: determine the signaling packet scheduling result based on the set type of the signaling packet set and the attributes of the signaling packet; wherein, the signaling packet set includes the ordinary signaling packet set and the real-time signaling packet set;

[0017] The signaling packets are scheduled according to the signaling packet scheduling result in the network topology.

[0018] A third aspect of this application provides an electronic device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, implements the method provided in the first aspect of this application.

[0019] A fourth aspect of this application provides a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method provided in the first aspect of this application.

[0020] As can be seen from the above, the deterministic signaling implementation method, apparatus, electronic device, and storage medium provided in this application can determine the attributes of signaling packets by analyzing them after network initialization, and determine the signaling packet type based on the attributes. The signaling packets are divided into real-time signaling packets and ordinary signaling packets. After classification and sorting, a set of real-time signaling packets and a set of ordinary signaling packets are obtained. Then, different scheduling methods are adopted for the real-time signaling packet sets and ordinary signaling packet sets with different requirements, thereby reducing the signaling blocking rate and end-to-end latency, which is beneficial to solving the uncertainty of signaling transmission in data communication networks. Attached Figure Description

[0021] To more clearly illustrate the technical solutions in this application or related technologies, the drawings used in the description of the embodiments or related technologies will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0022] Figure 1 This is a schematic diagram of the optical path establishment process in an embodiment of this application;

[0023] Figure 2 This is a schematic diagram illustrating the interaction process between the DCN and the data forwarding network in an embodiment of this application.

[0024] Figure 3 This is a schematic diagram illustrating the composition of signaling delay in an embodiment of this application;

[0025] Figure 4 This is a schematic diagram illustrating packet scheduling based on a gating list, as described in an embodiment of this application.

[0026] Figure 5 This is a comparison chart of latency and jitter for conventional signaling and deterministic signaling in embodiments of this application;

[0027] Figure 6 This is a flowchart of the deterministic signaling implementation method according to an embodiment of this application;

[0028] Figure 7 This is a schematic diagram of the network topology in an embodiment of this application;

[0029] Figure 8 A flowchart for determining the remaining time in an embodiment of this application;

[0030] Figure 9 This is a flowchart illustrating how a real-time signaling packet set is obtained in an embodiment of this application.

[0031] Figure 10 This is a schematic diagram of the signaling packet scheduling results in a deterministic recovery scenario of an optical transport network according to an embodiment of this application;

[0032] Figure 11 This is a schematic diagram of the signaling packet scheduling results in a data center backup scenario according to an embodiment of this application;

[0033] Figure 12 This is a schematic diagram of the structure of the apparatus for implementing deterministic signaling according to an embodiment of this application;

[0034] Figure 13 This is a schematic diagram of the structure of the electronic device according to an embodiment of this application;

[0035] Figure 14 This is a flowchart illustrating another deterministic signaling implementation method according to an embodiment of this application;

[0036] Figure 15 This is a flowchart illustrating the service-aware signaling packet classification method according to an embodiment of this application;

[0037] Figure 16 This is a flowchart of a time-aware signaling packet scheduling method according to an embodiment of this application. Detailed Implementation

[0038] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with specific embodiments and the accompanying drawings.

[0039] It should be noted that, unless otherwise defined, the technical or scientific terms used in the embodiments of this application should have the ordinary meaning understood by one of ordinary skill in the art to which this application pertains. The terms "first," "second," and similar terms used in the embodiments of this application do not indicate any order, quantity, or importance, but are merely used to distinguish different components. Terms such as "comprising" or "including" mean that the element or object preceding the word encompasses the elements or objects listed after the word and their equivalents, without excluding other elements or objects. Terms such as "connected" or "linked" are not limited to physical or mechanical connections, but can include electrical connections, whether direct or indirect. Terms such as "upper," "lower," "left," and "right" are only used to indicate relative positional relationships; when the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0040] It is important to understand in this article that any number of elements in the accompanying figures is for illustrative purposes and not for limitation, and that any naming is for distinction only and has no limiting meaning.

[0041] Based on the above background description, the following situations also exist in the related technologies:

[0042] Determinism refers to completing an action at a specific point in time, or completing an action before a specific point in time. In an optical network, an optical path needs to be established before service transmission, and it needs to be dismantled after service transmission. Since the processes of establishing and dismantling optical paths are similar, this article only considers the scenario of optical path establishment. The optical path establishment process is as follows: Figure 1 As shown, the delay in optical path establishment mainly includes signaling delay and single-site configuration delay. Signaling in data communication networks is based on packet switching mechanisms. Traditional networks provide a best-effort service, which inherently makes deterministic signaling impossible (deterministic signaling means that signaling can be issued at a certain point in time or before a certain point in time, according to the signaling requirements). Single-site configuration delay depends on equipment performance; factors such as equipment type and usage time also make single-site configuration non-deterministic. Therefore, the uncertainty of optical path establishment delay leads to uncertainty in optical network connections.

[0043] For services with real-time requirements, establishing optical paths too early leads to wasted optical path resources, while establishing them too late leads to service congestion. As optical networks expand and the number of services increases, deterministic optical network connections are needed to meet the needs of different services and ensure the rational use of network resources. Single-site configuration latency can be considered a constant under certain conditions, so the uncertainty of optical network connections mainly stems from the uncertainty of signaling. Therefore, the implementation of deterministic signaling is extremely important. Deterministic signaling refers to the technology that, through control of signaling packet forwarding behavior, can achieve predictable and plannable control of latency and jitter within a defined range. The goal of deterministic signaling is to enable the co-transmission of deterministic signaling and ordinary signaling in data communication networks, requiring devices in the data communication network to have precise control over their schedules to achieve the low latency and low jitter required by deterministic signaling.

[0044] In related technologies, optical path establishment delay mainly includes signaling delay and single-site configuration delay. Single-site configuration delay primarily includes the interaction delay between signaling and equipment, as well as the configuration delay of optical cross-connect equipment. The interaction delay between signaling and equipment depends on the information processing capability of the equipment, while the configuration delay of optical cross-connect equipment depends on the performance of the optical cross-connect equipment. Therefore, single-site configuration delay can be considered a constant under certain conditions. Thus, the uncertainty of optical network connections mainly stems from the uncertainty of signaling. Signaling is transmitted in the data communication network, and the interaction process between the data communication network and the data forwarding network is as follows: Figure 2 As shown, LP1 represents optical path configuration information, including bandwidth, port, etc. Data communication networks typically use the "Best Effort" forwarding mode. Signaling latency mainly consists of four parts: processing latency, queuing latency, transmission latency, and propagation latency, as shown... Figure 3As shown. Processing latency is mainly related to the size of the signaling packet and the processing capacity of the device. Since the latency is very short, it can be ignored. Queuing latency is related to the number of packets waiting to be forwarded on the same outgoing link. Assuming the device's sending rate is constant, the sending latency is related to the packet size, and the propagation latency is related to the link length. When the packet size and link are determined, the sending latency and propagation latency can also be regarded as constant values. Therefore, the uncertainty of signaling mainly comes from the uncertainty of queuing latency.

[0045] Signaling scheduling typically employs a gating list-based packet scheduling method. Under the condition of network-wide clock synchronization, the gating list periodically controls the opening and closing of the exit gates of each queue. For example... Figure 4 As shown, in each node's queue, 1 indicates the transmission gate is open, and 0 indicates the transmission gate is closed. Packets in the queue can only be transmitted when the transmission gate is open. According to... Figure 4 As shown in the gating list, at time t1, both queues q1 of node 2 and node 3 are 1, meaning that the transmission gates of queues q1 of nodes 2 and 3 are open. Packets in queue q1 of node 2 can enter node 3, and packets in queue q1 of node 3 can leave node 3. Then, the packets are transmitted according to the numbers in the list at different times, thus realizing packet scheduling based on the gating list.

[0046] However, the "best-effort" forwarding method often lacks determinism. When a signaling packet arrives at the sending port and is ready to be sent, the sending end forwards it according to the first-in, first-out principle. However, when multiple signaling packets need to be sent simultaneously at a certain sending port, these data must queue up, and the queuing time is determined by several factors such as queue length and sending speed. With sufficient bandwidth, this best-effort mechanism can adapt to most situations. However, if the network traffic is too high, congestion or packet loss may occur, making the queuing time unpredictable and thus compromising determinism.

[0047] The deterministic signaling implementation method provided in this application, after network initialization, can determine the attributes of signaling packets by analyzing them, and determine the signaling packet type based on the attributes. The signaling packets are divided into real-time signaling packets and ordinary signaling packets. After classification and sorting, sets of real-time signaling packets and sets of ordinary signaling packets are obtained. Then, different scheduling methods are adopted for the real-time signaling packet sets and ordinary signaling packet sets with different requirements, thereby reducing the signaling blocking rate and end-to-end latency, which is beneficial for solving problems such as the uncertainty of signaling transmission in data communication networks. The latency and jitter diagrams of traditional signaling and deterministic signaling are shown below. Figure 5 As shown in the accompanying drawings and detailed embodiments, the following description will now be provided.

[0048] In some embodiments, such as Figure 6As shown, a method for implementing deterministic signaling includes:

[0049] Step 601: Synchronize the network clock and initialize network information to obtain a time-consistent network topology and multiple signaling packets to be scheduled.

[0050] In practice, network initialization is required. First, because deterministic signaling is based on a time base, accurate synchronization of the entire network clock is a necessary condition. Network clock synchronization ensures a high degree of consistency in network scheduling. Then, network information needs to be initialized, including network topology initialization and initialization of the signaling to be scheduled, ensuring that the signaling packet size of the signaling to be scheduled is an integer multiple of the maximum transmission unit.

[0051] Step 602: Determine the attributes of the signaling packets by analyzing them, and determine the signaling packet type based on the attributes; wherein, the signaling packet type includes real-time signaling packets and ordinary signaling packets.

[0052] In practice, the attributes of signaling packets are analyzed, including packet type, source node, destination node, path, deadline, and number of packets. This reveals the packet type for each packet. Based on whether a transmission deadline exists, signaling packets can be categorized into real-time signaling packets and ordinary signaling packets. Furthermore, real-time signaling packets can be further divided into hard real-time signaling packets and soft real-time signaling packets based on different transmission requirements. Hard real-time signaling packets are transmitted by a specified deadline; soft real-time signaling packets are transmitted before a specified deadline, and failure to do so will result in transmission failure; ordinary signaling packets have no deadline.

[0053] Step 603: In response to the signaling packet being a real-time signaling packet, determine the remaining duration for transmitting the real-time signaling packet in the network topology based on its attributes, and classify and sort the real-time signaling packets according to the remaining duration to obtain a set of real-time signaling packets.

[0054] In practice, real-time signaling packets need to be transmitted before the deadline, while ordinary signaling packets do not have a deadline. Therefore, the classification and sorting of real-time signaling packets and ordinary signaling packets are different. For real-time signaling packets with deadlines, the remaining transmission time needs to be calculated based on the packet's attributes. The remaining time represents the time left to transmit the real-time signaling packet. The smaller the remaining time, the shorter the remaining time for transmission, indicating a greater difficulty in scheduling the packet and a higher priority for scheduling. Therefore, packets should be sorted in ascending order of remaining time to ensure that packets with shorter remaining time are scheduled first, reducing their scheduling difficulty. However, there may be cases where the remaining time is the same. In this case, packets can be sorted in descending order based on the path length in the packet attributes. A longer path indicates more nodes traversed, increasing the difficulty of scheduling. Therefore, packets with higher scheduling difficulty are prioritized and scheduled first.

[0055] Step 604: In response to the signaling packet being a regular signaling packet, determine the total delay for transmitting the regular signaling packet in the network topology based on the attributes, and sort the signaling packets according to the total delay to obtain a set of regular signaling packets.

[0056] In practical implementation, for ordinary signaling packets without a deadline, the time required to transmit the packet is the total end-to-end delay from the source node to the destination node. This total delay represents the time required for transmission along the path of the ordinary signaling packet. The larger the total delay, the longer it takes to transmit the packet, and the more difficult it is to schedule. Therefore, ordinary signaling packets are sorted from largest to smallest total delay to ensure that packets with larger total delays are scheduled first, thus reducing scheduling difficulty. If ordinary signaling packets with the same total delay exist, they can be sorted in descending order based on the path length in the signaling packet attributes. A longer path indicates more nodes traversed, increasing the difficulty of successful scheduling. Therefore, ordinary signaling packets with higher scheduling difficulty are prioritized and scheduled first.

[0057] Step 605: Based on the set type of the signaling packet set, determine the signaling packet scheduling result according to the attributes of the signaling packets; wherein, the signaling packet set includes the ordinary signaling packet set and the real-time signaling packet set.

[0058] In practice, real-time signaling packets and ordinary signaling packets are sorted to obtain sets of real-time signaling packets and ordinary signaling packets. The set of real-time signaling packets includes sets of hard real-time signaling packets and sets of soft real-time signaling packets. Then, different scheduling methods are adopted for sets of real-time signaling packets and ordinary signaling packets with different requirements. According to the deadline, hard real-time signaling packets are scheduled first, followed by soft real-time signaling packets, and finally ordinary signaling packets. The signaling packet scheduling results reduce the signaling blocking rate and end-to-end latency, which helps to solve problems such as the uncertainty of signaling transmission in data communication networks.

[0059] Step 606: Schedule signaling packets in the network topology according to the signaling packet scheduling results.

[0060] In practice, signaling packets are scheduled according to the scheduling order in the signaling packet scheduling results, thereby reducing the signaling blocking rate and end-to-end latency, which helps to solve problems such as the uncertainty of signaling transmission in data communication networks.

[0061] In summary, the deterministic signaling implementation method provided in this application can determine the attributes of signaling packets by analyzing them after network initialization, and determine the signaling packet type based on the attributes. The signaling packets are divided into real-time signaling packets and ordinary signaling packets. After classification and sorting, a set of real-time signaling packets and a set of ordinary signaling packets are obtained. Then, different scheduling methods are adopted for the real-time signaling packet sets and ordinary signaling packet sets with different requirements, thereby reducing the signaling blocking rate and end-to-end latency, which is beneficial to solving the uncertainty of signaling transmission in data communication networks.

[0062] It should be noted that the deterministic signaling implementation method provided in this application embodiment is applicable to various application scenarios, including deterministic recovery scenarios in optical transport networks, data center backup scenarios, deterministic actions of devices in the industrial internet, deterministic pipeline establishment and teardown for latency-sensitive services such as cloud gaming, and dynamic bandwidth adjustment. The following details the deterministic recovery scenario in optical transport networks and the data center backup scenario. In the deterministic recovery scenario in optical transport networks, failure of optical network nodes or links can lead to high concurrency of multiple services. Different services have different priorities; some require optical path establishment to be completed before the deadline, while others have lower priority and only require establishment. For different service requirements, deterministic establishment of optical paths must be guaranteed. In the data center backup scenario, to ensure resource backup completion and reasonable resource utilization, backup between two data centers is usually performed during off-peak hours, and the start and end times of backup are usually determined. Establishing an optical path too early will affect the normal transmission of other services, while establishing it too late will lead to resource waste. Therefore, hard real-time signaling is needed to ensure timely establishment of optical paths. The network topology used is as follows: Figure 7The diagram shows a network topology consisting of six nodes.

[0063] In some embodiments, attributes include the source node, destination node, path, deadline, and number of packets for the signaling packet; in response to the signaling packet being a real-time signaling packet, the remaining duration for transmitting the real-time signaling packet in the network topology is determined based on the attributes, such as... Figure 8 As shown, it includes:

[0064] Step 801: In response to the signaling packet being a real-time signaling packet, obtain the propagation delay and transmission delay of the real-time signaling packet.

[0065] In practice, for real-time signaling packets with a deadline, the propagation delay and transmission delay of the real-time signaling packet need to be obtained for the first time when calculating the remaining duration. Both the propagation delay and transmission delay are constant values. There is a transmission action and a propagation action on each hop link of the real-time signaling packet transmission path, so the propagation delay and transmission delay need to be calculated once each time. For example, if the real-time signaling packet is sent from node 1 to node 3, the propagation delay and transmission delay are calculated once. If the real-time signaling packet is sent from node 1 to node 4, the propagation delay and transmission delay are calculated twice.

[0066] Step 802: Determine the link hop count based on the path of the real-time signaling packets.

[0067] In practice, after determining the values ​​of propagation delay and transmission delay, it is necessary to determine the number of link hops required to transmit the real-time signaling packet from the source node to the destination node. Then, based on the number of link hops and the values ​​of propagation delay and transmission delay, the end-to-end delay from the source node to the destination node can be calculated. For example, if the real-time signaling packet is sent from node 1 to node 6, it needs to go through the path from node 1 to node 3, from node 3 to node 4, and from node 4 to node 6, with a link hop count of 3.

[0068] Step 803: Determine the end-to-end delay of the real-time signaling packet from the source node to the destination node based on the sum of the propagation delay and transmission delay of the real-time signaling packet, the number of link hops, and the number of packets.

[0069] In practice, the end-to-end delay of the real-time signaling packet from the source node to the destination node is calculated based on the end-to-end delay t1 = number of packets * number of link hops * (propagation delay + transmission delay).

[0070] Step 804: Determine the remaining time based on the end-to-end delay and the deadline.

[0071] In practice, the remaining time of the real-time signaling packet is calculated based on the difference between the end-to-end delay and the deadline T, i.e., t2 = T - t1. It should be noted that after obtaining the remaining time, it is necessary to determine whether the remaining time is positive or negative. If t2 < 0, it means that even if the real-time signaling packet is placed in the first transmission position, the delay requirement cannot be met. Therefore, the real-time signaling packet with a remaining time less than zero is blocked and does not participate in the subsequent classification and sorting process.

[0072] As an optional embodiment, taking the deterministic recovery scenario of an optical transport network as an example, after the signaling packet arrives, by analyzing the attributes of the signaling packet, including signaling type, source node, destination node, path, deadline, and number of packets, the arriving signaling packets shown in Table 1-1 are obtained:

[0073] Table 1-1 Arrival Signaling Packets for Deterministic Recovery Scenario in Optical Transport Networks

[0074] Serial Number Signaling packets Source node Dormitory node Number of packages path Signaling packet type Deadline 1 SR1 1 5 2 1-3-4-5 Ordinary communication - 2 SR2 2 4 1 2-3-4 Soft real-time signaling 3t 3 SR3 3 5 1 3-4-5 Ordinary communication - 4 SR4 5 6 2 5-4-6 Soft real-time signaling 6t 5 SR5 1 2 2 1-3-2 Soft real-time signaling 3t 6 SR6 2 5 1 2-3-4-5 Soft real-time signaling 7t 7 SR7 3 4 2 3-4 Soft real-time signaling 4t 8 SR8 5 6 3 5-4-6 Ordinary communication -

[0075] From the signaling packet types in Table 1-1, we know that SR1, SR3, and SR8 are ordinary signaling packets, while SR2, SR4, SR5, SR6, and SR7 are soft real-time signaling packets. Then, we calculate the end-to-end delay t1 of the soft real-time signaling packet using the formula: Number of packets * Number of link hops * (Propagation delay + Transmission delay). Assuming that the length of each link hop is the same, and the transmission delay is related to the number of packets, for ease of calculation, we can set (Propagation delay + Transmission delay) = Maximum Transmission Unit t. Taking the soft real-time signaling packet SR2 as an example, its number of packets is 1, and its number of link hops is 2. Therefore, the end-to-end delay t1 of the soft real-time signaling packet SR2 is 1 * 2 * t = 2t. Thus, the end-to-end delays t1 of the soft real-time signaling packets SR2, SR4, SR5, SR6, and SR7 are 2t, 4t, 4t, 3t, and 2t, respectively. Then, according to Table 1-1, the deadlines T for soft real-time signaling packets SR2, SR4, SR5, SR6, and SR7 are 3t, 6t, 3t, 7t, and 4t, respectively. The remaining duration t2 is calculated using the formula t2 = T - t1. The remaining durations t2 obtained by calculating the difference between the end-to-end delay and the deadline for soft real-time signaling packets SR2, SR4, SR5, SR6, and SR7 are t, 2t, -t, 4t, and 2t, respectively. It can be seen that the remaining duration t2 for soft real-time signaling packet SR5 is -t < 0, indicating that even if soft real-time signaling packet SR5 is placed in the first transmission position, the delay requirement cannot be met. Therefore, soft real-time signaling packet SR5 is blocked and does not participate in subsequent sequencing.

[0076] As an optional implementation, taking the data center backup scenario as an example, after the signaling packet arrives, by analyzing the attributes of the signaling packet, including signaling type, source node, destination node, path, deadline, and number of packets, the arriving signaling packets shown in Table 2-1 are obtained:

[0077] Table 2-1 Incoming signaling packets for data center backup scenarios

[0078] Serial Number Signaling packets Source node Dormitory node Number of packages path Signaling packet type Deadline 1 SR1 1 5 1 1-3-4-5 Hard real-time signaling 4t 2 SR2 2 4 2 2-3-4 Ordinary communication - 3 SR3 3 6 2 3-4-6 Hard real-time signaling 7t 4 SR4 5 6 1 5-4-6 Hard real-time signaling 6t 5 SR5 2 6 1 2-3-4-6 Ordinary communication -

[0079] From the signaling packet types in Table 2-1, we know that SR2 and SR5 are ordinary signaling packets, while SR1, SR3, and SR4 are hard real-time signaling packets. Then, we calculate the end-to-end delay t1 of the hard real-time signaling packet using the formula: Number of packets * Number of link hops * (Propagation delay + Transmission delay). Assuming that the length of each link hop is the same, and the transmission delay is related to the number of packets, we can set (Propagation delay + Transmission delay) = t for ease of calculation. Taking the hard real-time signaling packet SR1 as an example, its number of packets is 1, and its number of link hops is 3. Therefore, the end-to-end delay t1 of the hard real-time signaling packet SR1 is 1 * 3 * t = 3t. Thus, the end-to-end delays t1 of the hard real-time signaling packets SR1, SR3, and SR4 are 3t, 4t, and 2t, respectively. Then, according to Table 2-1, the deadlines T for hard real-time signaling packets SR1, SR3, and SR4 are 4t, 7t, and 6t, respectively. Then, the remaining duration t2 is calculated according to the formula t2 = T - t1. The remaining durations t2 obtained by calculating the difference between the end-to-end delay and the deadline for hard real-time signaling packets SR1, SR3, and SR4 are t, 3t, and 2t, respectively.

[0080] In some embodiments, such as Figure 9 As shown, the real-time signaling packets are classified and sorted according to their remaining duration to obtain a set of real-time signaling packets, including:

[0081] Step 901: Sort the real-time signaling packets in ascending order according to the remaining duration to obtain the initial real-time sorted set, and determine whether there are real-time signaling packets with the same remaining duration in the initial real-time sorted set.

[0082] In practice, the remaining duration represents the time remaining for transmitting the real-time signaling packet. A shorter remaining duration indicates less time is available for transmission, making successful scheduling of the packet more difficult and thus requiring priority. Therefore, packets are sorted in ascending order of remaining duration to ensure that packets with shorter remaining durations are prioritized, reducing scheduling difficulty. However, cases with the same remaining duration exist, so it's necessary to further check if any real-time signaling packets with the same remaining duration exist in the initial sorted set.

[0083] Step 902: In response to the existence of real-time signaling packets with the same remaining duration, in the real-time initial sorting set, the real-time signaling packets with the same remaining duration are sorted in descending order according to the link hop count to obtain the real-time signaling packet set.

[0084] In practice, if there are real-time signaling packets with the same remaining duration in the initial real-time sorting set, they can be sorted in descending order according to the path length in the signaling packet attribute. This is because the longer the path, the more nodes it passes through, and the greater the difficulty of successful scheduling. Therefore, real-time signaling packets with greater difficulty in successful scheduling are sorted first and scheduled with priority.

[0085] Step 903: In response to the absence of real-time signaling packets with the same remaining duration, the initial real-time sorting set is used as the real-time signaling packet set.

[0086] In practice, if there are no real-time signaling packets with the same remaining duration in the initial real-time sorting set, there is no need to continue sorting; the initial real-time sorting set can be directly used as the set of real-time signaling packets.

[0087] As an optional embodiment, taking the deterministic recovery scenario of an optical transport network as an example, after sorting by remaining time in ascending order and path length in descending order, the soft real-time signaling packet set is obtained as shown in Table 1-2:

[0088] Table 1-2 Set of Soft Real-Time Signaling Packets

[0089] Serial Number Signaling request Source node Dormitory node Number of packages path Signaling type Deadline 1 SR2 2 4 1 2-3-4 Soft real-time signaling 3t 2 SR7 3 4 4 3-4 Soft real-time signaling 6t 3 SR4 5 6 2 5-4-6 Soft real-time signaling 6t 4 SR6 2 5 1 2-3-4-5 Soft real-time signaling 7t

[0090] As an optional implementation, taking the data center backup scenario as an example, after sorting by remaining time in ascending order and path length in descending order, the set of hard real-time signaling packets is obtained as shown in Table 2-2:

[0091] Table 2-2 Set of Hard Real-Time Signaling Packets

[0092] Serial Number Signaling request Source node Dormitory node Number of packages path Signaling type Deadline 1 SR1 1 5 1 1-3-4-5 Hard real-time signaling 4t 2 SR3 3 6 2 3-4-6 Hard real-time signaling 7t 3 SR4 5 6 1 5-4-6 Hard real-time signaling 6t

[0093] In some embodiments, step 604 includes:

[0094] Step 6041: In response to the signaling packet being a regular signaling packet, obtain the propagation delay and transmission delay of the regular signaling packet;

[0095] Step 6042: Determine the link hop count based on the path of ordinary communication packets;

[0096] Step 6043: Determine the total delay of a regular communication packet from the source node to the destination node based on the sum of the propagation delay and transmission delay of the regular communication packet, the number of link hops, and the number of packets;

[0097] Step 6044: Sort the real-time signaling packets in descending order according to the total delay to obtain the ordinary initial sorted set, and determine whether there are ordinary signaling packets with the same total delay in the initial sorted set;

[0098] Step 6045: In response to the existence of ordinary communication packets with the same total delay, in the ordinary initial sorting set, the ordinary communication packets with the same total delay are sorted in descending order according to the link hop count to obtain the ordinary communication packet set;

[0099] Step 6046: In response to the absence of real-time signaling packets with the same total delay, the ordinary initial sorting set is used as the ordinary signaling packet set.

[0100] In practical implementation, for ordinary signaling packets without a deadline, the time required to transmit the packet is the total end-to-end delay between the source and destination nodes. This total delay represents the time required for transmission along the path of the ordinary signaling packet. The larger the total delay, the longer it takes to transmit the packet, and the more difficult it is to schedule. The total delay for each ordinary signaling packet is calculated using the formula: Total Delay t3 = Number of Packets * Number of Link Hops * (Propagation Delay + Transmission Delay). Then, the ordinary signaling packets are sorted from largest to smallest total delay to ensure that packets with larger total delays are scheduled first, reducing their scheduling difficulty. If ordinary signaling packets with the same total delay exist, they can be sorted in descending order based on the path length in the signaling packet attributes. A longer path indicates more nodes traversed, increasing the difficulty of successful scheduling. Therefore, packets with higher scheduling difficulty are prioritized for scheduling.

[0101] As an optional embodiment, taking the deterministic recovery scenario of the optical transport network as an example, the total delay t3 of ordinary communication packets is calculated according to the formula: number of packets * number of link hops * (propagation delay + transmission delay). Therefore, the total delays t3 of ordinary communication packets SR1, SR3, and SR8 are 6t, 2t, and 6t, respectively. t3 is sorted in descending order from largest to smallest. If t3 is the same, it is sorted in descending order according to the path length of ordinary communication packets SR1, SR3, and SR8, as shown in Table 1-3, resulting in the set of ordinary communication packets for the deterministic recovery scenario of the transport network.

[0102] Table 1-3 Set of ordinary communication commands for deterministic recovery scenarios in transmission networks

[0103] Serial Number Signaling request Source node Dormitory node Number of packages path Signaling type Deadline 1 SR1 1 5 2 1-3-4-5 Ordinary communication - 2 SR8 5 6 3 5-4-6 Ordinary communication - 3 SR3 3 5 1 3-4-5 Ordinary communication -

[0104] As an optional embodiment, taking the inter-data center backup scenario as an example, the total latency t3 of ordinary communication packets is calculated according to the formula: number of packets * number of link hops * (propagation delay + transmission delay). Therefore, the total latencies t3 of ordinary communication packets SR2 and SR5 are 3t and 4t, respectively. t3 is sorted in descending order from largest to smallest. If t3 is the same, it is sorted in descending order according to the path length of ordinary communication packets SR1, SR3, and SR8, as shown in Table 1-3, resulting in the set of ordinary communication packets for the inter-data center backup scenario.

[0105] Table 1-3 Set of ordinary communication commands for deterministic recovery scenarios in transmission networks

[0106] Serial Number Signaling request Source node Dormitory node Number of packages path Signaling type Deadline 1 SR5 2 6 1 2-3-4-6 Ordinary communication - 2 SR2 2 4 2 2-3-4 Ordinary communication -

[0107] In some embodiments, the real-time signaling packet set includes a hard real-time signaling packet set and a soft real-time signaling packet set; step 605 includes:

[0108] Step 6051: Determine the link for each hop of the path based on the source node and the destination node.

[0109] In specific implementation, according to such Figure 7 As can be seen from the network topology shown, each hop of the path between the source node and the destination node includes 6 links: [1,3], [2,3], [3,4], [4,5], and [4,6]. Since each hop of the link can carry out bidirectional transmission, for example, [4,5] and [5,4] are on the same link.

[0110] Step 6052: Perform time slicing on the link according to the maximum transmission unit to obtain the feasible region;

[0111] In practice, since the signaling packet size is an integer multiple of the maximum transmission unit t, time slicing is performed on each link according to the maximum transmission unit, and all time slices of the 6 links constitute the feasible region.

[0112] Step 6053: Perform hard real-time signaling packet scheduling in the feasible domain according to the arrangement order of hard real-time signaling packets in the hard real-time signaling packet set.

[0113] In practice, since these are hard real-time signaling packets, signaling must be issued by the specified deadline. Therefore, hard real-time signaling packets need to be set at the time slice of the deadline of the destination node on each hop link. Based on the order of the hard real-time signaling packets in the set, they are sequentially placed on the rightmost side of the feasible region. This ensures sufficient time slices are available for unscheduled soft real-time signaling and ordinary signaling, thereby reducing scheduling congestion and end-to-end total latency. If a suitable time slice can be selected for the entire path of each hard real-time signaling packet, the signaling is scheduled successfully. If a link in the path cannot select a suitable time slice, the signaling fails to be scheduled. The hard real-time signaling set scheduling is complete when all hard real-time signaling packets in the set have been scheduled.

[0114] Step 6054: In response to the completion of hard real-time signaling packet scheduling in the hard real-time signaling packet set, a first available feasible region is obtained, and soft real-time signaling packets are scheduled in the first available feasible region according to the arrangement order of soft real-time signaling packets in the soft real-time signaling packet set.

[0115] In practice, once the hard real-time signaling set scheduling is complete, a portion of the time slices in the feasible domain is occupied by hard real-time signaling packets, leaving the remaining portion as the first empty feasible domain. If no hard real-time signaling packets exist, the entire feasible domain is directly used as the first empty feasible domain. Since it's a soft real-time signaling packet, signaling must be issued before the specified deadline. Therefore, hard real-time signaling packets can be set at the time slice before the deadline of the destination node on each hop link, prioritizing the leftmost position of the signaling packet in the first empty feasible domain. Based on the order of the soft real-time signaling packets in the set, the soft real-time signaling packets are sequentially placed on the leftmost side of the feasible domain. This ensures sufficient time slices are available for unscheduled ordinary signals, reducing scheduling congestion and end-to-end latency. If a suitable time slice can be selected for the entire path of each soft real-time signaling packet, the signaling scheduling is successful. If a link in the path cannot select a suitable time slice, the signaling scheduling fails. The soft real-time signaling set scheduling is complete when all soft real-time signaling packets in the set are scheduled.

[0116] Step 6055: In response to the completion of soft real-time signaling packet scheduling in the soft real-time signaling packet set, a second available feasible region is obtained, and ordinary signaling packets are scheduled in the second available feasible region according to the order of ordinary signaling packets in the ordinary signaling packet set.

[0117] In practice, once the soft real-time signaling set scheduling is complete, a portion of the time slices in the first available feasible domain is occupied by soft real-time signaling packets. The remaining portion of the first available feasible domain can be used as the second available feasible domain. If no soft real-time signaling packets exist, the entire first available feasible domain is used directly as the first available feasible domain. Since these are ordinary signaling packets, there is no deadline. Ordinary signaling packets are scheduled in the second available feasible domain according to their order in the ordinary signaling packet set. If a suitable time slice can be selected for the entire path of each ordinary signaling packet, the signaling scheduling is successful. If a link in the path cannot select a suitable time slice, the signaling scheduling fails. Once all ordinary signaling packets in the ordinary signaling packet set have been scheduled, the ordinary signaling packet set scheduling is complete.

[0118] Step 6056: In response to the completion of the scheduling of ordinary communication packets in the ordinary communication packet set, the signaling packet scheduling result is obtained.

[0119] In practice, once the ordinary signaling set scheduling is completed, a signaling packet scheduling result is obtained that can simultaneously mobilize all non-blocking hard real-time signaling packets, soft real-time signaling packets, and ordinary signaling packets. It should be noted that hard real-time signaling packets need to be transmitted by the specified deadline; missing the deadline or transmitting early will result in transmission failure. Soft real-time signaling packets need to be transmitted before the specified deadline; missing the deadline will also result in transmission failure. Ordinary signaling packets do not have a deadline, so they are scheduled within the available time slices of both hard and soft real-time signaling packets in the feasible domain. Therefore, the scheduling priority decreases from hard real-time signaling packets, soft real-time signaling packets, to ordinary signaling packets. To ensure that hard real-time signaling packets can be transmitted by the specified deadline, the first scheduling position is selected as the time slice before the deadline; any other position will cause hard real-time signaling packets to be blocked. To ensure that soft real-time signaling packets can be transmitted before the specified deadline, the second scheduling position is selected as the time slice before the deadline. The rightmost time slice in the time slice can be selected for scheduling because the rightmost slice can be prioritized for transmission, improving the transmission success rate of soft real-time signaling packets and leaving sufficient time slices for the scheduling of ordinary signaling packets to reduce the blocking rate of signaling packets.

[0120] In some embodiments, step 6053 includes:

[0121] Step 60531: Select the target hard real-time signaling packet according to the order of hard real-time signaling packets in the hard real-time signaling packet set.

[0122] In a specific implementation, for example, if the hard real-time signaling packets are selected in the order of SR1, SR3, and SR4, then the first target hard real-time signaling packet is SR1.

[0123] Step 60532: Determine the first scheduling position of the target hard real-time signaling packet in the feasible domain corresponding to each hop link based on the path of the target hard real-time signaling packet.

[0124] In specific implementation, for example, the first hop link of the target hard real-time signaling packet SR1 path is [1,3], and the rightmost position before the deadline in the first hop link [1,3] after time slicing is taken as the first scheduling position.

[0125] Step 60533: Determine the number of the first slices of the available time slices in the feasible domain based on the first scheduling location and the deadline of the target hard real-time signaling packet.

[0126] In practice, the number of unoccupied time slices at the first scheduling position to the left of the deadline of the target hard real-time signaling packet is the number of the first slice.

[0127] Step 60534: In response to the existence of an unoccupied time slice at the first scheduling position, the target hard real-time signaling packet is successfully scheduled.

[0128] In practice, not all hard real-time signaling packets in the target hard real-time signaling packet set can select a suitable time slice. Taking the data center backup scenario as an example, the last link of hard real-time signaling packets SR3 and SR4 is [4,6]. However, hard real-time signaling packet SR3 is ranked before hard real-time signaling packet SR4, so hard real-time signaling packet SR3 takes priority in selecting a time slice. Hard real-time signaling packet SR3 has 2 data packets, which will occupy 2 time slices. At this time, the rightmost unoccupied time slice of hard real-time signaling packet SR3 with a deadline of 7t is 5t, but the deadline of hard real-time signaling packet SR4 is 6t. Therefore, the first scheduling position of hard real-time signaling packet SR4 is occupied, and it cannot complete the transmission and is blocked.

[0129] In some embodiments, step 6054 includes:

[0130] Step 60541: Select the target soft real-time signaling packet according to the order of soft real-time signaling packets in the soft real-time signaling packet set.

[0131] In a specific implementation, for example, if the soft real-time signaling packets are selected in the order of SR2, SR7, SR4, and SR6, then the first target soft real-time signaling packet is SR2.

[0132] Step 60542: Determine the second scheduling position of the target soft real-time signaling packet in the first available feasible domain corresponding to each hop link based on the path of the target soft real-time signaling packet.

[0133] In specific implementation, for example, the first hop link of the target soft real-time signaling packet SR2 path is [2,3]. The leftmost position before the deadline in the first hop link [2,3] after time slicing is taken as the second scheduling position. In the second link, when determining the second scheduling position, it is necessary to remove the time slice in the same column occupied by the first hop link and take the leftmost position before the deadline as the second scheduling position of the second hop link.

[0134] Step 60543: Determine the number of second slices of available time slices in the first available feasible domain based on the second scheduling location and the deadline of the target soft real-time signaling packet.

[0135] In practice, the number of unoccupied time slices to the left of the deadline of the target soft real-time signaling packet and to the right of the second scheduling position is the number of second slices.

[0136] Step 60544: In response to the fact that the number of second slices in each hop link is greater than or equal to the number of packets in the target soft real-time signaling packet, the target soft real-time signaling packet scheduling is successful.

[0137] In practice, if the number of second slices in each hop link is greater than the number of packets in the target soft real-time signaling packet, the target soft real-time signaling packet is successfully scheduled; if there is a link with a number of second slices less than the number of packets in the target soft real-time signaling packet, the target soft real-time signaling packet is not scheduled and is blocked.

[0138] As an optional embodiment, taking the deterministic recovery scenario of an optical transport network as an example, such as... Figure 10 As shown, the first target soft real-time signaling packet is SR2, the first hop link is [2,3], and the number of packets is 1. Therefore, it occupies a time slice at the leftmost position before the deadline 7t, that is, the first column position of link [2,3] (the second scheduling position of the first hop link, the column corresponding to 0 to t in link [2,3]). The second hop link is [3,4]. Since it takes time t for the transmission of one packet of the target soft real-time signaling packet SR2, the time slice of the first column cannot be used as the occupancy selection for the second hop link [3,4]. Therefore, the second column (the column corresponding to t to 2t) time slice is selected as the leftmost time slice that the second hop link [3,4] can occupy. That is, at this time, the second position of the second hop link [3,4] is used as the second scheduling position of the second hop link. Then, one packet of the target soft real-time signaling packet SR2 occupies the second time slice of link [3,4]. Using the same method, time slices for soft real-time signaling packets SR7, SR4, and SR6 are selected and occupied within the feasible region. Then, ordinary signaling packets are inserted into the remaining second available feasible region in the order of the ordinary signaling packet set. It can be seen that transmitting all unblocked signaling packets requires 10t of time. It can also be seen that both the first-hop link [2,3] and the second-hop link [3,4] of SR6 can select available time slices before the deadline 7t. However, the second-hop link [3,4] has already occupied the time slice one position before the deadline 7t, causing the second scheduling position of the third-hop link [3,4] to be after the deadline 7t. That is, the number of second slices is 0, but the number of packets is 1, so the transmission of the entire path cannot be completed before the deadline, thus SR6 is blocked. Finally, calculations show that only SR5 and SR6 are blocked out of the eight soft real-time signaling packets, with a total blocking rate of 25%. During the scheduling process, only SR6 is blocked, with a blocking rate of 12.5%.

[0139] As an optional implementation, taking an inter-data center backup scenario as an example, such as Figure 11As shown, the second target hard real-time signaling packet is SR3, the first hop link is [3,4], and the number of packets is 2. Therefore, it occupies the two adjacent time slices at the rightmost position before the deadline of 7t, that is, the first time slice position (the first scheduling position of the first hop link) before the deadline of 7t for link [3,4]. The second hop link is [4,6]. Since it takes 2t for the two packets of the target hard real-time signaling packet SR3 to be transmitted, the time slices in the sixth and seventh columns cannot be used as the occupancy selection for the second hop link [4,6]. Therefore, the time slice in the fifth column is selected as the rightmost time slice that the second hop link [4,6] can occupy. That is, at this time, the fourth and fifth column positions of the second hop link [4,6] are used as the first scheduling position of the second hop link. Then, the target hard real-time signaling packet SR3 occupies the fourth and fifth column time slices of the second hop link [4,6]. Using the same method, time slices for hard real-time signaling packets SR1 and SR4 are selected and occupied within the feasible region. Then, ordinary signaling packets are inserted into the remaining feasible region according to the order in the ordinary signaling packet set. It can be seen that it takes 7t to complete the transmission of all unblocked signaling packets. It can also be seen that the second-hop link [4,6] of SR4 is the same as that of SR3, but SR3 preferentially selects two time slices, causing the first scheduling position of the second-hop link [4,6] of SR4 to be located two cells before the deadline of 6t, that is, the transmission will be completed between 4t and 5t, and the transmission of the entire path cannot be completed by the deadline of 6t, so SR4 is blocked. Finally, the calculation shows that only SR4 is blocked among the five hard real-time signaling packets, with a total blocking rate of 20%. Only SR4 is blocked during the scheduling process, and the blocking rate of the scheduling process is 20%.

[0140] It should be noted that the method in this embodiment can be executed by a single device, such as a computer or server. The method can also be applied in a distributed scenario, where multiple devices cooperate to complete the task. In such a distributed scenario, one of these devices may execute only one or more steps of the method in this embodiment, and the multiple devices will interact with each other to complete the method described.

[0141] It should be noted that the above description describes some embodiments of this application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in a different order than that shown in the above embodiments and still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require a specific or sequential order to achieve the desired result. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0142] Based on the same inventive concept, corresponding to any of the above embodiments, this application also provides a deterministic signaling implementation apparatus.

[0143] refer to Figure 12 The apparatus for implementing the deterministic signaling includes:

[0144] The network initialization module 10 is configured to: synchronize the network clock and initialize network information to obtain a time-consistent network topology and multiple signaling packets to be scheduled;

[0145] The signaling packet classification module 20 is configured to: determine the attributes of the signaling packets by analyzing them, and determine the signaling packet type based on the attributes; wherein, the signaling packet type includes real-time signaling packets and ordinary signaling packets;

[0146] In response to a signaling packet being a real-time signaling packet, the remaining duration for transmitting the real-time signaling packet in the network topology is determined based on its attributes, and the real-time signaling packets are classified and sorted according to the remaining duration to obtain a set of real-time signaling packets;

[0147] In response to the signaling packet being a regular signaling packet, the total delay for transmitting the regular signaling packet in the network topology is determined based on its attributes, and the signaling packets are sorted according to the total delay to obtain a set of regular signaling packets;

[0148] The signaling packet scheduling module 30 is configured to: determine the signaling packet scheduling result based on the set type of the signaling packet set and the attributes of the signaling packets; wherein, the signaling packet set includes a set of ordinary signaling packets and a set of real-time signaling packets;

[0149] Signaling packets are scheduled based on the signaling packet scheduling results in the network topology.

[0150] For ease of description, the above devices are described in terms of function, divided into various modules. Of course, in implementing this application, the functions of each module can be implemented in one or more software and / or hardware.

[0151] The apparatus of the above embodiments is used to implement the corresponding deterministic signaling implementation method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0152] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the deterministic signaling implementation method described in any of the above embodiments.

[0153] Figure 13This embodiment illustrates a more specific hardware structure of an electronic device, which may include a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, memory 1020, input / output interface 1030, and communication interface 1040 are interconnected internally via the bus 1050.

[0154] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0155] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage device, dynamic storage device, etc. The memory 1020 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented by software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0156] The input / output interface 1030 is used to connect input / output modules to realize information input and output. Input / output modules can be configured as components within the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Input devices may include keyboards, mice, touchscreens, microphones, various sensors, etc., while output devices may include displays, speakers, vibrators, indicator lights, etc.

[0157] The communication interface 1040 is used to connect a communication module (not shown in the figure) to enable communication between this device and other devices. The communication module can communicate via wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0158] Bus 1050 includes a pathway for transmitting information between various components of the device, such as processor 1010, memory 1020, input / output interface 1030, and communication interface 1040.

[0159] It should be noted that although the above-described device only shows the processor 1010, memory 1020, input / output interface 1030, communication interface 1040, and bus 1050, in specific implementations, the device may also include other components necessary for normal operation. Furthermore, those skilled in the art will understand that the above-described device may only include the components necessary for implementing the embodiments of this specification, and not necessarily all the components shown in the figures.

[0160] The electronic devices described above are used to implement the corresponding deterministic signaling implementation methods in any of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0161] Based on the same inventive concept, corresponding to the methods of any of the above embodiments, this application also provides a non-transitory computer-readable storage medium that stores computer instructions for causing the computer to execute the deterministic signaling implementation method as described in any of the above embodiments.

[0162] The computer-readable medium of this embodiment includes permanent and non-permanent, removable and non-removable media, and information storage can be implemented by any method or technology. 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 technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transfer medium that can be used to store information accessible by a computing device.

[0163] The computer instructions stored in the storage medium of the above embodiments are used to cause the computer to execute the deterministic signaling implementation method as described in any of the above embodiments, and have the beneficial effects of the corresponding method embodiments, which will not be repeated here.

[0164] It should be noted that, as Figures 14 to 16 As shown, the embodiments of this application can also be further described in the following ways:

[0165] like Figure 14 As shown, the methods for implementing deterministic signaling include:

[0166] Step 1: Network initialization - full network clock synchronization (1.1), initialize network information (1.2).

[0167] 1.1 First, network-wide clock synchronization must be performed, as deterministic signaling is based on a time base. Therefore, precise clock synchronization is a necessary condition. To ensure high consistency in scheduling across the entire network, clock synchronization within the network is required.

[0168] 1.2 Next, network information initialization is performed, including initializing the network topology and signaling to be scheduled. It is assumed that the signaling packet size is an integer multiple of the maximum transmission unit.

[0169] Step 2: Service-aware signaling packet classification method - signaling packet analysis (2.1), signaling packet sorting based on remaining time (2.2).

[0170] 2.1 Analyze the attributes of the signaling packets, including the signaling packet type, source node, destination node, path, deadline, and number of signaling packets.

[0171] 2.2 Calculate the remaining time of the signaling packet based on its attributes, and sort the signaling packets according to the remaining time and route length.

[0172] Step 3: Time-aware signaling packet scheduling method - real-time signaling packet scheduling based on deadline (3.1), scheduling for ordinary signaling packets (3.2).

[0173] 3.1 Real-time signaling packets are divided into hard real-time signaling packets and soft real-time signaling packets. Based on the deadline of the signaling packets, hard real-time signaling packets are scheduled first, followed by soft real-time signaling packets.

[0174] 3.2 Ordinary signaling packets are scheduled after real-time signaling packet scheduling is completed.

[0175] like Figure 15 As shown in Figure 1.1, the service-aware signaling packet classification method includes:

[0176] Based on the type of signaling packets, signaling packets are divided into three sets: hard real-time signaling, soft real-time signaling, and ordinary signaling. For real-time signaling, the remaining time of the signaling packets is calculated based on the path, deadline, and number of packets, and then sorted by remaining time in ascending order. If the remaining time is the same, they are sorted by path length in descending order. For ordinary signaling, the end-to-end delay of the signaling packets is calculated based on the path and number of packets, and then sorted by end-to-end delay in descending order. If the end-to-end delay is the same, they are sorted by path length in descending order.

[0177] like Figure 15 As shown, the signaling packet classification module can be divided into three modules.

[0178] Module I: Hard Real-Time Signaling Packet Classification Module, configured to perform the following steps:

[0179] Step I.1: Analyze the deadline T, path, and number of packets for hard real-time signaling packets.

[0180] Step I.2: Calculate the end-to-end delay t1 of the hard real-time signaling packet = number of packets * number of link hops * (propagation delay + transmission delay).

[0181] Step I.3: Calculate the difference between the end-to-end delay and the deadline, i.e., the remaining time of the hard real-time signaling packet t2 = T - t1.

[0182] Step I.4: If t2<0, it means that even if the packet is placed in the first transmission position, the delay requirement cannot be met, so the hard real-time signaling packet is blocked.

[0183] Step I.5: Sort the hard real-time signaling packets in ascending order of t2; if they are the same, sort them in descending order of path length to obtain the hard real-time signaling packet set S1. The smaller t2 is, the less time remains, and the greater the difficulty of successful scheduling; the longer the path is, the more nodes it passes through, and the greater the difficulty of successful scheduling. Therefore, the signaling packets with the greater difficulty of successful scheduling are sorted first and scheduled with priority.

[0184] Module II: Soft Real-Time Signaling Packet Classification Module, configured to perform the following steps:

[0185] Steps II.1-II.5 are similar to steps I.1-I.5, and will not be repeated here.

[0186] Module III: Ordinary Communication Packet Classification Module, configured to perform the following steps:

[0187] Step III.1: Analyze the source node, destination node, path, and number of packets of the signaling packets.

[0188] Step III.2: Calculate the total delay t3 of ordinary communication packets = number of packets * number of link hops * (propagation delay + transmission delay).

[0189] Step III.3: Sort the ordinary signaling packets according to t3 from largest to smallest; if they are the same, sort them according to path length from longest to shortest to obtain the ordinary signaling set S3. The larger t3 is, the longer the path, indicating more nodes passed through and more resources required for scheduling. To reduce the total latency of all signaling, prioritize signaling packets with higher resource requirements for scheduling.

[0190] like Figure 16 As shown, signaling packet scheduling can be divided into three steps.

[0191] Step I: Hard real-time signaling packet scheduling, specifically including the following steps:

[0192] Step I.1: Schedule the hard real-time signaling packets in set S1 in the order of the hard real-time signaling packet set S1.

[0193] Step I.2: Divide the queue into time slices based on the transmission delay of a single maximum transmission unit. Schedule the time slices from the destination node to the source node according to the path of each signaling.

[0194] Step I.3: Since it is hard real-time signaling, the signaling must be issued at the specified deadline. Therefore, a hard real-time signaling packet is set at the time slice of the deadline of the destination node.

[0195] Step I.4: Determine the feasible domain of the signaling packet sequentially from the destination node to the source node, and set the signaling packet to the rightmost side of the feasible domain. This allows sufficient time slices to be allocated to unscheduled soft real-time signaling and ordinary signaling, thereby reducing the scheduling blocking rate and the total end-to-end latency.

[0196] Step I.5: If a suitable time slice can be selected for the entire path, proceed to Step I.6; if a link in the path cannot select a suitable time slice, proceed to Step I.7.

[0197] Step I.6: The signaling was successfully scheduled.

[0198] Step I.7: This signaling scheduling failed.

[0199] Step I.8: Hard real-time signaling set S1 scheduling completed.

[0200] Step II: Soft real-time signaling packet scheduling, specifically including the following steps:

[0201] Step II.1: Schedule the soft real-time signaling packets in set S2 in the order of soft real-time signaling packet set S2.

[0202] Step II.2: Divide the queue into time slices based on the transmission delay of a single maximum transmission unit. Schedule the time slices from the destination node to the source node according to the path of each signaling.

[0203] Step II.3: Since it is soft real-time signaling, the signaling only needs to be issued before the deadline. Therefore, the feasible field can be set from the time slice starting from the deadline of the destination node, and the signaling packet can be set on the far left of the feasible field.

[0204] Step II.4: Determine the feasible domain of the signaling packet sequentially from the destination node to the source node, and set the signaling packet to the leftmost side of the feasible domain. This allows sufficient time slices for unscheduled ordinary signaling, thereby reducing the total end-to-end latency.

[0205] Step II.5: If a suitable time slice can be selected for the entire path, proceed to Step II.6; if a link in the path cannot select a suitable time slice, proceed to Step II.7.

[0206] Step II.6: The signaling was successfully scheduled.

[0207] Step II.7: This signaling dispatch failed.

[0208] Step II.8: The soft real-time signaling set S2 scheduling is completed.

[0209] Step III: Ordinary communication packet scheduling, specifically including the following steps:

[0210] Step III.1: Schedule the signaling packets in set S3 in the order of the ordinary signaling packet set S3.

[0211] Step III.2: Divide the queue into time slices based on the transmission delay of a single maximum transmission unit. Schedule the time slices from the source node to the destination node according to the path of each signaling.

[0212] Step III.3: Since it is ordinary signaling without a deadline, the signaling packets can be scheduled directly in the spare time slice.

[0213] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of this application (including the claims) is limited to these examples; within the framework of this application, the technical features of the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in the details for the sake of brevity.

[0214] Additionally, to simplify the description and discussion, and to avoid obscuring the embodiments of this application, the well-known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Furthermore, the apparatus may be shown in block diagram form to avoid obscuring the embodiments of this application, and this also takes into account the fact that the details of the implementation of these block diagram apparatuses are highly dependent on the platform on which the embodiments of this application will be implemented (i.e., these details should be fully understood by those skilled in the art). While specific details (e.g., circuits) have been set forth to describe exemplary embodiments of this application, it will be apparent to those skilled in the art that the embodiments of this application can be implemented without these specific details or with variations thereof. Therefore, these descriptions should be considered illustrative rather than restrictive.

[0215] Although this application has been described in conjunction with specific embodiments thereof, many substitutions, modifications, and variations of these embodiments will be apparent to those skilled in the art from the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may be used with the embodiments discussed.

[0216] The embodiments of this application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of this application.

Claims

1. A method for implementing deterministic signaling, characterized in that, include: Synchronize the network clock and initialize network information to obtain a time-consistent network topology and multiple signaling packets to be scheduled; The attributes of the signaling packets are determined by analyzing the signaling packets, and the signaling packet type is determined based on the attributes; wherein, the signaling packet type includes real-time signaling packets and ordinary signaling packets; In response to the signaling packet being the real-time signaling packet, the remaining duration for transmitting the real-time signaling packet in the network topology is determined according to the attribute, and the real-time signaling packets are classified and sorted according to the remaining duration to obtain the set of real-time signaling packets; In response to the signaling packet being a regular signaling packet, the total delay for transmitting the regular signaling packet in the network topology is determined based on the attribute, and the signaling packets are sorted according to the total delay to obtain the set of regular signaling packets; Based on the set type of the signaling packet set, the signaling packet scheduling result is determined according to the attributes of the signaling packet; wherein, the signaling packet set includes the ordinary signaling packet set and the real-time signaling packet set; The signaling packets are scheduled according to the signaling packet scheduling result in the network topology.

2. The method according to claim 1, characterized in that, The attributes include the signaling packet type, source node, destination node, path, deadline, and number of packets; in response to the signaling packet being a real-time signaling packet, determining the remaining duration for transmitting the real-time signaling packet in the network topology based on the attributes includes: In response to the signaling packet being the real-time signaling packet, the propagation delay and transmission delay of the real-time signaling packet are obtained; The link hop count is determined based on the path of the real-time signaling packets; The end-to-end delay of the real-time signaling packet from the source node to the destination node is determined based on the sum of the propagation delay and transmission delay of the real-time signaling packet, the number of link hops, and the number of packets. The remaining time is determined based on the end-to-end delay and the deadline.

3. The method according to claim 2, characterized in that, The step of classifying and sorting the real-time signaling packets according to the remaining duration to obtain the set of real-time signaling packets includes: The real-time signaling packets are sorted in ascending order according to the remaining duration to obtain the real-time initial sorting set, and it is determined whether there are real-time signaling packets with the same remaining duration in the real-time initial sorting set. In response to the existence of real-time signaling packets with the same remaining duration, the real-time signaling packets with the same remaining duration are sorted in descending order according to the link hop count in the real-time initial sorting set to obtain the real-time signaling packet set; In response to the absence of real-time signaling packets with the same remaining duration, the initial real-time sorting set is used as the real-time signaling packet set.

4. The method according to claim 2, characterized in that, In response to the signaling packet being a regular signaling packet, the system determines the total delay for transmitting the regular signaling packet in the network topology based on the attribute, and sorts the signaling packets according to the total delay to obtain the set of regular signaling packets, including: In response to the signaling packet being a regular signaling packet, the propagation delay and transmission delay of the regular signaling packet are obtained; The link hop count is determined based on the path of the ordinary communication packet; The total delay of the ordinary communication packet from the source node to the destination node is determined based on the sum of the propagation delay and the transmission delay of the ordinary communication packet, the number of link hops, and the number of packets. The real-time signaling packets are sorted in descending order according to the total delay to obtain a normal initial sorting set, and it is determined whether there are normal signaling packets with the same total delay in the initial sorting set. In response to the existence of ordinary communication packets with the same total delay, the ordinary communication packets with the same total delay are sorted in descending order according to the link hop count in the ordinary initial sorting set to obtain the ordinary communication packet set; In response to the absence of real-time signaling packets with the same total delay, the ordinary initial sorting set is used as the ordinary signaling packet set.

5. The method according to claim 2, characterized in that, The real-time signaling packet set includes a hard real-time signaling packet set and a soft real-time signaling packet set; The set type based on the signaling packet set, determining the signaling packet scheduling result according to the attributes of the signaling packets, includes: The link for each hop of the path is determined based on the source node and the destination node; The feasible region is obtained by performing time slicing on the link according to the maximum transmission unit; Hard real-time signaling packets are scheduled in the feasible domain according to the arrangement order of the hard real-time signaling packets in the set of hard real-time signaling packets; In response to the completion of scheduling of the hard real-time signaling packets in the set of hard real-time signaling packets, a first available feasible region is obtained, and soft real-time signaling packets are scheduled in the first available feasible region according to the arrangement order of the soft real-time signaling packets in the set of soft real-time signaling packets. In response to the completion of the scheduling of the soft real-time signaling packets in the soft real-time signaling packet set, a second available feasible domain is obtained, and ordinary signaling packets are scheduled in the second available feasible domain according to the arrangement order of the ordinary signaling packets in the ordinary signaling packet set. In response to the completion of the scheduling of ordinary signaling packets in the set of ordinary signaling packets, the signaling packet scheduling result is obtained.

6. The method according to claim 5, characterized in that, The step of scheduling hard real-time signaling packets in the feasible domain according to the order of the hard real-time signaling packets in the set of hard real-time signaling packets includes: Select the target hard real-time signaling packet according to the arrangement order of the hard real-time signaling packets in the set of hard real-time signaling packets; The first scheduling position of the target hard real-time signaling packet in the feasible domain corresponding to each hop link is determined based on the path of the target hard real-time signaling packet. The number of first slices of the available time slices in the feasible domain is determined based on the first scheduling position and the deadline of the target hard real-time signaling packet. In response to the existence of an unoccupied time slice at the first scheduling location, the target hard real-time signaling packet is successfully scheduled.

7. The method according to claim 5, characterized in that, The step of scheduling soft real-time signaling packets in the first available feasible domain according to the order of the soft real-time signaling packets in the set of soft real-time signaling packets includes: Select the target soft real-time signaling packet according to the arrangement order of the soft real-time signaling packets in the set of soft real-time signaling packets; The second scheduling position of the target soft real-time signaling packet in the first available feasible domain corresponding to each hop link is determined based on the path of the target soft real-time signaling packet. The number of second slices of the available time slice in the feasible domain is determined based on the second scheduling location and the deadline of the target soft real-time signaling packet. In response to the fact that the number of second slices in each hop of the link is greater than or equal to the number of packets in the target soft real-time signaling packet, the target soft real-time signaling packet is successfully scheduled.

8. An apparatus for implementing deterministic signaling, characterized in that, include: The network initialization module is configured to: synchronize the network clock and initialize network information to obtain a time-consistent network topology and multiple signaling packets to be scheduled; The signaling packet classification module is configured to: determine the attributes of the signaling packet by analyzing the signaling packet, and determine the signaling packet type of the signaling packet based on the attributes; wherein, the signaling packet type includes real-time signaling packets and ordinary signaling packets; In response to the signaling packet being the real-time signaling packet, the remaining duration for transmitting the real-time signaling packet in the network topology is determined according to the attribute, and the real-time signaling packets are classified and sorted according to the remaining duration to obtain the set of real-time signaling packets; In response to the signaling packet being a regular signaling packet, the total delay for transmitting the regular signaling packet in the network topology is determined based on the attribute, and the signaling packets are sorted according to the total delay to obtain the set of regular signaling packets; The signaling packet scheduling module is configured to: determine the signaling packet scheduling result based on the set type of the signaling packet set and the attributes of the signaling packet; wherein, the signaling packet set includes the ordinary signaling packet set and the real-time signaling packet set; The signaling packets are scheduled according to the signaling packet scheduling result in the network topology.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the program, implements the method as claimed in any one of claims 1 to 7.

10. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 7.

Images