Announcement method for deterministic link attribute, and electronic device and storage medium

Abstract

Provided in the embodiments of the present application are an announcement method for a deterministic link attribute, and an electronic device and a storage medium. A determination method for a deterministic link attribute comprises: determining a link attribute notification message according to report information of a neighboring node, wherein the link attribute notification message at least comprises a period-slot mapping relationship; and flooding the link attribute notification message to the neighboring node. The embodiments of the present application solve an attribute announcement problem in a deterministic link, so that the collection and reporting of attributes such as a period-slot mapping relationship can be realized, thereby improving the network communication quality.

Description

Method for notifying deterministic link attributes, electronic device, and storage medium Technical Field

[0001] The present application relates to network communication technology, and in particular to a method for notifying deterministic link attributes, an electronic device, and a storage medium. Background Art

[0002] To meet the industry's demand for bounded latency and low jitter, the Time Sensitive Networking (TSN) working group proposed Cyclic Queuing and Forwarding (CQF) technology. This technology requires time synchronization for all devices in a TSN. High-precision time synchronization across the entire network is costly in practical applications. Building on CQF, deterministic networking has proposed Large-Scale Deterministic Internet Protocol (IP) Networks (LDN) and Cycle Specified Queuing and Forwarding (CSQF). These technologies do not require network-wide time synchronization, only frequency synchronization. The CSQF solution, based on segment routing (SR), uses a segment routing identifier (SID) to indicate the specified period during which a packet needs to be sent. A SID list indicates the sequence of periods along which a deterministic service packet needs to be forwarded. As explained in the Deterministic Networking (DetNet) Working Group architecture document, explicit path and resource allocation technologies are required to achieve deterministic forwarding with bounded latency and low jitter. However, since time synchronization is not required in wide-area deterministic networks, scheduling cycles between network devices are misaligned. How to make accurate resource reservations in this scenario, while ensuring deterministic latency and jitter requirements while maximizing network bandwidth utilization, is a problem that needs to be considered and addressed in control plane resource reservation. Currently, resource reservation solutions for wide-area deterministic networks include over-reservation, which is simple to implement but has low network bandwidth utilization, and precise orchestration and reservation. Both involve research and improvement of algorithms to find the optimal path solution while improving bandwidth utilization.

[0003] Currently, deterministic and precise orchestration requires a mapping relationship between cycles and time slots on deterministic node links. For example, the periodic time slot on the upstream device's outbound interface corresponds to the periodic time slot on the downstream device's inbound interface. However, currently, whether it is distributed devices or centralized controllers, there is a lack of methods to collect and report the mapping relationship between cycles and time slots within deterministic links.

[0004] Summary of the Invention

[0005] The embodiments of the present application provide a method, electronic device, and storage medium for notifying deterministic link attributes, which aim to solve the problem of notifying attributes within a deterministic link, enable the collection and reporting of attributes such as period and time slot mapping relationships, and improve network communication quality.

[0006] An embodiment of the present application provides a method for notifying deterministic link attributes, wherein the method includes:

[0007] Determine a link attribute notification message according to the reporting information of the adjacent node, wherein the link attribute notification message at least includes a period-time slot mapping relationship;

[0008] Flooding the link attribute notification message to the adjacent nodes.

[0009] An embodiment of the present application further provides an electronic device, wherein the electronic device includes:

[0010] one or more processors;

[0011] a memory for storing one or more programs;

[0012] When the one or more programs are executed by the one or more processors, the one or more processors implement the method for announcing deterministic link attributes as described in any one of the embodiments of the present application.

[0013] An embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores one or more programs, and the one or more programs are executed by one or more processors to implement the method for announcing deterministic link attributes as described in any one of the embodiments of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] FIG1 is a flowchart of a method for notifying deterministic link attributes provided by an embodiment of the present application;

[0015] FIG2 is a schematic diagram of the structure of a link attribute notification message provided in an embodiment of the present application;

[0016] FIG3 is a schematic diagram of the structure of a link attribute notification message provided in an embodiment of the present application;

[0017] FIG4 is a schematic diagram of the structure of a link attribute notification message provided in an embodiment of the present application;

[0018] FIG5 is a schematic diagram of the structure of a link attribute notification message provided in an embodiment of the present application;

[0019] FIG6 is a schematic diagram of the structure of a link attribute notification message provided in an embodiment of the present application;

[0020] 7 is a schematic diagram of the structure of a link attribute notification message provided in an embodiment of the present application;

[0021] FIG8 is a flowchart of another method for notifying deterministic link attributes provided by an embodiment of the present application;

[0022] FIG9 is an example diagram of a method for notifying deterministic link attributes provided in an embodiment of the present application;

[0023] FIG10 is an example diagram of a method for notifying deterministic link attributes provided in an embodiment of the present application;

[0024] FIG11 is an example diagram of a method for notifying deterministic link attributes provided in an embodiment of the present application;

[0025] FIG12 is an example diagram of a method for notifying deterministic link attributes provided in an embodiment of the present application;

[0026] 13 is a schematic structural diagram of a device for notifying a deterministic link attribute according to an embodiment of the present application;

[0027] FIG14 is a schematic structural diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0028] It should be understood that the specific implementations described herein are only used to explain the present application and are not used to limit the present application.

[0029] In the subsequent description, suffixes such as "module", "component" or "unit" used to represent elements are only used to facilitate the description of this application and have no specific meaning. Therefore, "module", "component" or "unit" can be used interchangeably.

[0030] Figure 1 is a flow chart of a method for notifying deterministic link attributes provided by an embodiment of the present application. This embodiment of the present application is applicable to the case of notifying a deterministic link period and time slot mapping relationship. This method can be executed by a device for notifying deterministic link attributes, which can be implemented by software and / or hardware. As shown in Figure 1, the method provided by an embodiment of the present application specifically includes the following steps:

[0031] Step S110: Determine a link attribute notification message according to the reporting information of the neighboring node, wherein the link attribute notification message at least includes a period-time slot mapping relationship.

[0032] The adjacent node may be a node adjacent to the current node within a deterministic link. The reported information may be information notified by the adjacent node to the current node regarding the communication status of its deterministic link. The reported information may include time slots during which the adjacent node can transmit data. The link attribute notification message may be a message notifying a period-time slot mapping relationship. The period-time slot mapping relationship may include a correspondence between information transmission periods and information transmission time slots within a link or node.

[0033] In an embodiment of the present application, this node can receive reporting information transmitted by adjacent nodes, determine the periodic time slot mapping relationship through the reporting information, and encapsulate the periodic time slot mapping relationship into a link attribute notification message, which can be implemented based on a preset communication protocol.

[0034] Step S120: Flood the link attribute notification message to adjacent nodes.

[0035] Specifically, the node may flood the generated link attribute notification message to adjacent nodes to implement notification of the periodic time slot mapping relationship.

[0036] In an embodiment of the present application, a link attribute notification message carrying a period-time slot mapping relationship is determined through reporting information from adjacent nodes, and the link attribute notification message is flooded to adjacent nodes to realize notification of a period mapping relationship within a deterministic link. This can realize the collection and reporting of attributes such as period and time slot mapping relationship, thereby improving the quality of network communication.

[0037] Furthermore, based on the above application embodiment, the link attribute notification message is implemented through at least one of the following protocols: ISIS protocol, OSPF protocol, Border Gateway Protocol-Link State (BGP-LS) protocol.

[0038] In an embodiment of the present application, the link attribute notification message can be generated by this node through one or more protocol encapsulation period time slot mapping relationships among the Intermediate System-to-Intermediate System routing (ISIS) protocol, the Open Shortest Path First (OSPF) protocol, and the BGP-LS protocol.

[0039] In some application embodiments, the periodic time slot mapping relationship includes at least one of the following: a node-level periodic time slot mapping relationship and a link-level periodic time slot mapping relationship.

[0040] In an embodiment of the present application, the attribute information notified by the local node to the adjacent nodes may include a node-level periodic time slot mapping relationship and a link-level periodic time slot mapping relationship.

[0041] Furthermore, based on the above-mentioned application embodiment, the link-level periodic time slot mapping relationship includes at least:

[0042] Link outbound cycle value, link inbound cycle value, outbound scheduling time slot within the link cycle, inbound scheduling time slot within the link cycle.

[0043] Specifically, the link outbound cycle value may represent the outbound cycle used on the current link, and the link inbound cycle value may represent the inbound cycle used on the current link. In some application embodiments, the link outbound cycle value and the link inbound cycle value may be the same. The inbound scheduling time slot within the link cycle and the outbound scheduling time slot within the link cycle may respectively represent the time slot used for inbound use within the link cycle and the time slot used for outbound use within the link cycle.

[0044] Furthermore, based on the above application embodiment, the node-level periodic time slot mapping relationship includes at least:

[0045] Node period value, outbound scheduling time slot within the node period, inbound scheduling time slot within the node period.

[0046] Specifically, the node cycle value may represent the cycle used on the node, and the inbound scheduling time slot within the node cycle and the outbound scheduling time slot within the node cycle may respectively represent the inbound time slot used within the node cycle and the outbound time slot used within the node cycle.

[0047] In some application embodiments, the link attribute notification message also includes a message type and a message length.

[0048] Specifically, the link attribute notification message can be identified by the message type to announce the period-time slot mapping relationship, and the message length can indicate the length of the link attribute notification message. Link attribute messages based on different protocols can have different lengths.

[0049] In an exemplary embodiment, taking the implementation of the link attribute notification message through the ISIS protocol as an example, a link cycle slot mapping sub-type length value (link-cycle-slot-mapping sub-tlv) can be added to the ISIS protocol message, which can be specifically carried in the ISIS 22, 23, 141, 222, and 223 type length values ​​(Type Length Value, TLV). The link attribute notification message can be used to flood the upstream and downstream link cycles and time slot mapping relationships. The format of the link attribute notification message is shown in Figure 2. The TYPE flag is 1 byte and can take the value TBD. The Length flag is 1 byte and can be fixed to 4. The Local_cycle flag is 1 byte and indicates the outbound cycle value used on this link. The Local_slot flag is 1 byte and indicates the outbound scheduling time slot within the local_cycle period on this link. The outbound scheduling time slot is also called the outbound queue scheduling window. The Remote_cycle flag is 1 byte and indicates the inbound cycle value used on this link. The inbound cycle value is recommended to be equal to the outbound cycle value. It is understandable that the cycles used by upstream and downstream nodes on this link can be different, for example, a larger cycle is mapped to a smaller cycle. The Remote_slot flag is 1 byte and indicates the inbound scheduling time slot within the remote_cycle period on this link.

[0050] In an exemplary embodiment, taking the implementation of link attribute notification messages through the ISIS protocol as an example, a new node-cycle-mapping sub-tlv is added, which can be carried in the IS-IS Router Capability TLV. The link attribute notification message is used to flood the entry and exit cycle time slot mapping relationship on the node. The format example of the link attribute notification message is shown in Figure 3, where the Type identifier is 1 byte, and the value is TBD; the Length identifier is 1 byte, and the value is currently fixed at 3; the cycle identifier is 1 byte, indicating the cycle value used on this node; the Local_slot identifier is 1 byte, indicating the outbound scheduling time slot within the local_cycle period on this node; the Remote_slot identifier is 1 byte, indicating the inbound scheduling time slot within the remote_cycle period on this link.

[0051] In another exemplary embodiment, taking the link attribute notification message implemented by the OSPF protocol as an example, an OSPF cycle slot mapping sub-TLV (OSPF cycle-slot-mapping sub-tlv) can be added to the OSPF protocol message, which can be applied to the OSPF version (OSPFVersion 2, OSPFV2) and OSPFV3, this link attribute notification message can be used to flood the upstream and downstream cycle and time slot mapping relationship of the link. The format example of the link attribute notification message is shown in Figure 4, where the TYPE flag is 2 bytes and the value of this flag can be TBD; the Length flag is 2 bytes and the value of this flag can be fixed to 4; the Local_cycle flag is 1 byte, indicating the outbound cycle value used on this link; the Local_slot flag is 1 byte, indicating the outbound scheduling time slot within the local_cycle period on this link. The outbound scheduling time slot is also called the outbound queue scheduling window; the Remote_cycle flag is 1 byte, indicating the inbound cycle value used on this link. The inbound cycle value is recommended to be equal to the outbound cycle value. It is understandable that the cycles used by the upstream and downstream nodes of this link can also be inconsistent, such as mapping a large cycle to a small cycle; the Remote_slot flag is 1 byte, indicating the inbound scheduling time slot within the remote_cycle period on this link.

[0052] In another exemplary embodiment, taking the implementation of link attribute notification messages through the OSPF protocol as an example, a node-cycle-mapping sub-tlv can be added to the OSPF protocol message, and can be carried in the OSPF Router Information Link-State Advertisement (RI LSA). The link attribute notification message is used to flood the entry and exit cycle time slot mapping relationship on the node. The format example of the link attribute notification message is shown in Figure 5, where the Type identifier is 1 byte, and the value is TBD; the Length identifier is 1 byte, and the value of this identifier is currently fixed at 3; the cycle identifier is 1 byte, indicating the cycle value used on this node; the Local_slot identifier is 1 byte, indicating the outbound scheduling time slot within the local_cycle cycle on this node; the Remote_slot identifier is 1 byte, indicating the inbound scheduling time slot within the remote_cycle cycle on this link.

[0053] In another exemplary embodiment, taking the BGP-LS protocol as an example to implement the link attribute notification message, a cycle-slot-mapping sub-tlv can be added to the BGP-LS protocol message to send a link attribute notification message to the software defined network (SDN). The SDN (Software Defined Network) controller reports the periodic time slot mapping relationship on the link, as shown in Figure 6. The TYPE flag is 2 bytes and can be TBD. The Length flag is 2 bytes and can be fixed to 4. The Local_cycle flag is 1 byte, indicating the outbound cycle value used on this link. The Local_slot flag is 1 byte, indicating the outbound scheduling time slot within the local_cycle period on this link. The outbound scheduling time slot is also called the outbound queue scheduling window. The Remote_cycle flag is 1 byte, indicating the inbound cycle value used on this link. The inbound cycle value is recommended to be equal to the outbound cycle value. It is understandable that the cycles used by upstream and downstream nodes on this link may also be inconsistent, such as mapping a large cycle to a small cycle. The Remote_slot flag is 1 byte, indicating the inbound scheduling time slot within the remote_cycle period on this link.

[0054] In another exemplary embodiment, taking the implementation of link attribute notification messages through the BGP-LS protocol as an example, a node-cycle-mapping sub-tlv can be added to the BGP-LS protocol message to report the cycle time slot mapping relationship on the node to the SDN controller, see Figure 7, where the Type identifier is 1 byte, the value is TBD; the Length identifier is 1 byte, the value of which is currently fixed at 3; the cycle identifier is 1 byte, indicating the cycle value used on this node; the Local_slot identifier is 1 byte, indicating the outbound scheduling time slot within the local_cycle period on this node; the Remote_slot identifier is 1 byte, indicating the inbound scheduling time slot within the remote_cycle period on this link.

[0055] FIG8 is a flowchart of another method for notifying deterministic link attributes provided in an embodiment of the present application. The present embodiment is a refinement of the above-mentioned embodiment. Referring to FIG8 , the method provided in the embodiment of the present application specifically includes the following steps:

[0056] Step S210: Determine a link attribute notification message according to the reporting information of the neighboring node, wherein the link attribute notification message at least includes a period-time slot mapping relationship.

[0057] Step S220: Flood the link attribute notification message to adjacent nodes.

[0058] Step S230: Receive a second link attribute notification message flooded by an adjacent node, wherein the second link attribute notification message at least includes a period-time slot mapping relationship.

[0059] Among them, the second link attribute notification message can be a link attribute notification message that the adjacent node notifies the current node. The link attribute notification message can include the link from the adjacent node to the current node and the periodic time slot mapping relationship corresponding to the node. The second link attribute notification message can be generated by the adjacent node.

[0060] In an embodiment of the present application, the adjacent node can determine the second link attribute notification message based on the reporting information of the current node and / or other adjacent nodes of the adjacent node, and the current node can receive the second link attribute notification message transmitted by the adjacent node to obtain the periodic time slot mapping relationship corresponding to the adjacent node.

[0061] Step S240: Determine the information transmission path corresponding to the target node according to the link attribute notification message and the period-time slot mapping relationship of the second link attribute notification message.

[0062] The target node may be a node that the message needs to reach during the transmission process, the information transmission path may be a node path that the information is transmitted through, and the information transmission path may also include a mapping relationship of periodic time slots used for information transmission.

[0063] In an embodiment of the present application, after obtaining the periodic time slot mapping relationship between the adjacent nodes and the current node, when performing information transmission, the current node can construct an information transmission path based on the target node of the information transmission and the obtained periodic time slot mapping relationship, thereby improving the accuracy of information transmission within the deterministic link.

[0064] In an exemplary embodiment, taking the ISIS protocol to collect link cycle-time slot mapping relationships as an example, referring to FIG9 , the method for announcing deterministic link attributes includes the following process:

[0065] (1) The head node R1 and the intermediate node R2 learn the periodic time slot mapping relationship on link 1-2 by forwarding messages. That is, the message sent from time slot 2 of period 10 on link 1-2 will be received by the downstream device R2 in time slot 4 of period 10 after the link propagation delay.

[0066] (2) ISIS is enabled on link 1-2 on device R1. The ISIS protocol receives the periodic timeslot mapping (link 1-2, 10, 2, 10, 4) quintuple sent by the forwarding plane and floods the link using the ISIS link attribute sub-tlv.

[0067] (3) Device R2 repeats the action in (2);

[0068] (4) At this point, the periodic time slot mapping relationship on link 1-2 and link 2-3 is obtained on devices R1-R2-R3.

[0069] (5) The head node R1 performs the Constrained Shortest Path First (CSPF) route calculation and obtains the precise deterministic paths from R1 to R3, namely (link1-2, 10, 2, 10, 4) and (link2-3, 10, 6, 10, 2), through the deterministic periodic mapping orchestration algorithm.

[0070] In another exemplary embodiment, taking the OSPF protocol to collect link cycle-time slot mapping relationships as an example, referring to FIG10 , the method for announcing deterministic link attributes includes the following process:

[0071] (1) The head node R1 and the intermediate node R2 learn the periodic time slot mapping relationship on link 1-2 by forwarding messages. That is, the message sent from time slot 1 of period 10 on link 1-2 will be received by the downstream device R2 in time slot 3 of period 10 after the link propagation delay.

[0072] (2) OSPF is enabled on link 1-2 on device R1. OSPF receives the periodic time slot mapping from the forwarding plane, namely the quintuple (link 1-2, 10, 1, 10, 3). It then floods the link using the OSPF link attribute TLV.

[0073] (3) Device R2 repeats the action in (2);

[0074] (4) At this point, the periodic time slot mapping relationship on link 1-2 and link 2-3 is obtained on devices R1-R2-R3.

[0075] (5) The head node R1 performs CSPF path calculation and obtains the precise deterministic path from R1 to R3 through the deterministic periodic mapping orchestration algorithm, namely (link1-2, 10, 1, 10, 3) and (lin2-3, 10, 5, 10, 7).

[0076] In another exemplary embodiment, taking the BGP-LS protocol to collect link cycle-time slot mapping relationships as an example, referring to FIG11 , the method for announcing deterministic link attributes includes the following process:

[0077] (1) The steps of mapping the OSPF flooding period and time slot are the same as steps (1) to (4) in Example 2;

[0078] (2) R3 is the device that has established a BGP-LS adjacency with the controller. The link information between R1, R2, and R3 is reported through R3's BGP-LS neighbor.

[0079] (3) BGP-LS carries the periodic mapping relationship between link1-2 and link2-3;

[0080] (4) After receiving the BGP-LS message, the SDN controller performs deterministic service path calculation and cycle precise orchestration, and obtains the precise deterministic path from R1 to R3, namely (link1-2, 10, 1, 10, 3) and (link2-3, 10, 5, 10, 7);

[0081] (5) The controller sends the path information to the head node R1 through the Network Configuration Protocol (Netconfig) or the Path Computation Element (PCE) channel for service selection.

[0082] In an exemplary embodiment, taking the OSPF protocol collection node period time slot mapping relationship as an example, referring to FIG12 , the method for announcing deterministic link attributes includes the following process:

[0083] (1) The head node R1 learns the node's periodic time slot mapping by forwarding the message. That is, the message enters the first time slot of the node period 10, is processed by the internal chip, and is sent out in the third time slot of the node period 10.

[0084] (2) OSPF is enabled on R1. It receives the time-slot mapping for the node from the forwarding plane and then floods the node using the OSPF node attribute TLV.

[0085] (3) Devices R2 and R3 repeat the previous step;

[0086] (4) At this point, R1, R2, and R3 devices have obtained the periodic time slot mapping relationship on their own devices.

[0087] (5) The process of forming the periodic mapping relationship between Link 1 and Link 2 and Link 3 and the process of announcing the periodic time slot mapping relationship between the links;

[0088] (6) The head node R1 performs CSPF path calculation and obtains the precise deterministic path from R1 to R3 through the deterministic periodic mapping orchestration algorithm, namely {R1(10,3), link1-2(10,3,5,4), R2(10,4,6), link2-3(10,7,10,NULL)}.

[0089] Figure 13 is a schematic diagram of the structure of a device for announcing deterministic link attributes provided in an embodiment of the present application. This device can execute the method for announcing deterministic link attributes provided in any embodiment of the present application and has the corresponding functional modules and beneficial effects of the execution method. This device can be implemented by software and / or hardware. As shown in Figure 13, the device provided in an embodiment of the present application specifically includes:

[0090] The message determination module 301 is configured to determine a link attribute notification message according to the reporting information of the adjacent nodes, wherein the link attribute notification message at least includes a period-time slot mapping relationship.

[0091] The message notification module 302 is configured to flood the link attribute notification message to the adjacent nodes.

[0092] In an embodiment of the present application, a link attribute notification message carrying a period-time slot mapping relationship is determined by the reporting information of the adjacent nodes of the message determination module. The message notification module floods the link attribute notification message to the adjacent nodes to realize the notification of the period mapping relationship within the deterministic link, and can realize the collection and reporting of attributes such as period and time slot mapping relationship, thereby improving the quality of network communication.

[0093] In some application embodiments, the link attribute notification message in the device is implemented through at least one of the following protocols: ISIS protocol, OSPF protocol, and BGP-LS protocol.

[0094] In some other application embodiments, the periodic time slot mapping relationship in the device includes at least one of the following: a node-level periodic time slot mapping relationship, a link-level periodic time slot mapping relationship.

[0095] In some application embodiments, the link-level period-time slot mapping relationship in the device includes at least: a link outbound period value, a link inbound period value, an outbound scheduling time slot within the link period, and an inbound scheduling time slot within the link period.

[0096] In other application embodiments, the node-level period-time slot mapping relationship in the device includes at least: a node period value, an outbound scheduling time slot within the node period, and an inbound scheduling time slot within the node period.

[0097] In some other application embodiments, the link attribute notification message in the device also includes a message type and a message length.

[0098] In some other application embodiments, the apparatus further includes: a message receiving module configured to receive a second link attribute notification message flooded by the adjacent node, wherein the second link attribute notification message includes at least a periodic time slot mapping relationship.

[0099] In other application embodiments, the device further includes: a path determination module, configured to determine an information transmission path corresponding to a target node based on the link attribute notification message and the periodic time slot mapping relationship of the second link attribute notification message.

[0100] Figure 14 is a structural diagram of an electronic device provided in an embodiment of the present application, which includes a processor 10, a memory 11, an input device 12 and an output device 13; the number of processors 10 in the electronic device can be one or more, and Figure 9 takes one processor 10 as an example; the processor 10, memory 11, input device 12 and output device 13 in the electronic device can be connected via a bus or other means, and Figure 14 takes connection via a bus as an example.

[0101] The memory 11, as a computer-readable storage medium, can be used to store software programs, computer executable programs, and modules, such as the modules corresponding to the apparatus for notifying deterministic link attributes in the embodiments of the present application (message determination module 301 and message notification module 302). The processor 10 executes the software programs, instructions, and modules stored in the memory 11 to execute various functional applications and data processing of the electronic device, thereby implementing the above-mentioned method for notifying deterministic link attributes.

[0102] The memory 11 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and at least one application required for a function; the data storage area may store data created based on the use of the electronic device, etc. In addition, the memory 11 may include a high-speed random access memory and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 11 may further include a memory remotely located relative to the processor 10, and these remote memories may be connected to the electronic device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0103] The input device 12 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the electronic device. The output device 13 may include a display device such as a display screen.

[0104] An embodiment of the present application further provides a storage medium containing computer-executable instructions. When the computer-executable instructions are executed by a computer processor, the computer-executable instructions are used to perform a method for announcing deterministic link attributes. The method includes:

[0105] Determine a link attribute notification message according to the reporting information of the adjacent node, wherein the link attribute notification message at least includes a period-time slot mapping relationship;

[0106] Flooding the link attribute notification message to the adjacent nodes.

[0107] Through the above description of the implementation methods, those skilled in the art can clearly understand that the present application can be implemented with the help of software and necessary general-purpose hardware, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present application, or the part that contributes to the relevant technology, can be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as a computer's floppy disk, read-only memory (ROM), random access memory (RAM), flash memory (FLASH), hard disk or optical disk, etc., including a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute the methods described in each embodiment of the present application.

[0108] It is worth noting that in the embodiment of the above-mentioned device, the various units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application.

[0109] Those skilled in the art will appreciate that all or some of the steps, devices, and functional modules / units in the methods disclosed above may be implemented as software, firmware, hardware, or appropriate combinations thereof.

[0110] In a hardware implementation, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. The corresponding software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or temporary media). As is well known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM (Erasable Programmable Read Only Memory), flash memory or other memory technology, portable compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical disc storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those skilled in the art that communication media generally contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

Claims

1. A method for announcing deterministic link attributes, comprising: Determine a link attribute notification message according to the reporting information of the adjacent node, wherein the link attribute notification message at least includes a period time slot mapping relationship; The link attribute notification message is flooded to the adjacent nodes.

2. The method according to claim 1, wherein: The link attribute notification message is implemented through at least one of the following protocols: Intermediate System to Intermediate System Routing ISIS protocol, Open Shortest Path First OSPF protocol, Border Gateway Protocol-Link State BGP-LS protocol.

3. The method according to claim 1, wherein: The periodic time slot mapping relationship includes at least one of the following: Node-level periodic time slot mapping relationship and link-level periodic time slot mapping relationship.

4. The method according to claim 3, wherein: The link-level periodic time slot mapping relationship at least includes: Link outbound cycle value, link inbound cycle value, outbound scheduling time slot within the link cycle, inbound scheduling time slot within the link cycle.

5. The method according to claim 3, wherein: The node-level periodic time slot mapping relationship includes at least: Node period value, outbound scheduling time slot within the node period, inbound scheduling time slot within the node period.

6. The method according to claim 1, wherein: The link attribute notification message also includes a message type and a message length.

7. The method according to claim 1, further comprising: A second link attribute notification message flooded by the adjacent node is received, wherein the second link attribute notification message at least includes the periodic time slot mapping relationship.

8. The method according to claim 7, further comprising: An information transmission path corresponding to a target node is determined according to the link attribute notification message and the periodic time slot mapping relationship of the second link attribute notification message.

9. An electronic device, comprising: at least one processor; A memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method for announcing deterministic link attributes as described in any one of claims 1 to 8.

10. A computer-readable storage medium storing at least one program, wherein the at least one program is executed by at least one processor to implement the method for announcing deterministic link attributes according to any one of claims 1 to 8.

Images