Deterministic link attribute notification method, electronic equipment and storage medium

Abstract

Provided in an embodiment of the present application are a method for announcing a deterministic link attribute, an electronic device and a storage medium, the method for determining a deterministic link attribute comprising: determining a link attribute notification message according to report information of an adjacent node, the link attribute notification message comprising at least a periodic time slot mapping relationship; and flooding to the adjacent node according to the link attribute notification message. According to the embodiment of the invention, the problem of announcement of attributes in a deterministic link is solved, collection and reporting of attributes such as a period and a time slot mapping relation can be realized, and the network communication quality can be improved.

Description

Technical Field

[0001] The present invention 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] In order to meet the needs of bounded latency and low jitter for services, the Time Sensitive Networking (TSN) working group proposed the Cyclic Queuing and Forwarding (CQF) technology, which requires all devices in the time-sensitive network to achieve time synchronization; high-precision time synchronization for the entire network is costly in actual application scenarios. Based on CQF, deterministic networks proposed large-scale deterministic IP network technology (LDN) and cycle specified queuing and forwarding (CSQF) technology, which do not require time synchronization for the entire network, but only frequency synchronization. The CSQF solution based on segment routing (SR) uses the segment routing identifier SID (SR Identifier, SID) to indicate in which specified period the message needs to be sent out, and the SID list indicates the period sequence that the deterministic service message needs to be forwarded along the way. As explained in the architecture document of the Deterministic Network DetNet Working Group, explicit path and resource allocation technology are needed to support deterministic forwarding with bounded latency and low jitter. However, since time synchronization is not required in wide-area deterministic networks, the scheduling cycles between network devices are not aligned. How to make accurate resource reservations in this scenario to ensure deterministic latency and jitter requirements while maximizing network bandwidth utilization is a problem that needs to be considered and solved in control plane resource reservation. Currently, there are two resource reservation solutions for wide-area deterministic networks: one is to achieve it through over-reservation, which is simple to implement but has low network bandwidth utilization; the other is to make precise orchestration and reservations, which mainly involve the research and improvement of algorithms to seek the optimal path solution while improving bandwidth utilization.

[0003] Currently, deterministic and precise orchestration requires the mapping relationship between periods and time slots on deterministic node links. For example, the periodic time slot on the upstream device's output interface corresponds to the periodic time slot on the downstream device's input interface. However, currently, whether it is distributed equipment or centralized controllers, there is a lack of methods for collecting and reporting the mapping relationship between periods and time slots within deterministic links. Summary of the invention

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

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

[0006] 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;

[0007] The link attribute notification message is flooded to the adjacent node.

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

[0009] one or more processors;

[0010] A memory for storing one or more programs;

[0011] 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.

[0012] An embodiment of the present application also 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

[0013] Figure 1 It is a flowchart of a method for notifying deterministic link attributes provided by an embodiment of the present application;

[0014] Figure 2 It is a structural diagram of a link attribute notification message provided in an embodiment of the present application;

[0015] Figure 3 It is a structural diagram of a link attribute notification message provided in an embodiment of the present application;

[0016] Figure 4 It is a structural diagram of a link attribute notification message provided in an embodiment of the present application;

[0017] Figure 5 It is a structural diagram of a link attribute notification message provided in an embodiment of the present application;

[0018] Figure 6It is a structural diagram of a link attribute notification message provided in an embodiment of the present application;

[0019] Figure 7 It is a structural diagram of a link attribute notification message provided in an embodiment of the present application;

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

[0021] Fig. 9 This is an example diagram of a method for notifying deterministic link attributes provided by an embodiment of the present application;

[0022] Fig.10 This is an example diagram of a method for notifying deterministic link attributes provided by an embodiment of the present application;

[0023] Fig.11 This is an example diagram of a method for notifying deterministic link attributes provided by an embodiment of the present application;

[0024] Fig.12 This is an example diagram of a method for notifying deterministic link attributes provided by an embodiment of the present application;

[0025] Fig.13 It is a structural diagram of a device for notifying a deterministic link attribute provided in an embodiment of the present application;

[0026] Fig.14 It is a structural schematic diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0027] It should be understood that the specific implementation described herein is only used to explain the present invention, and is not used to limit the present invention.

[0028] In the subsequent description, suffixes such as "module", "component" or "unit" used to represent elements are only used to facilitate the explanation of the present invention and have no specific meanings themselves. Therefore, "module", "component" or "unit" may be used interchangeably.

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

[0030] Step 110: 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.

[0031] Among them, the adjacent node may be a node in a deterministic link that is in an adjacent state with the current node, the reported information may be information that the adjacent node notifies the current node of its deterministic link communication state, and the reported information may include a time slot in which the adjacent node can transmit data. The link attribute notification message may be a message that notifies a periodic time slot mapping relationship, and the periodic time slot mapping relationship may include a corresponding relationship between a period of information transmission in a link or node and a time slot for information transmission.

[0032] In an embodiment of the present application, this node can receive reporting information transmitted by adjacent nodes, can 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.

[0033] Step 120: Flood the link attribute notification message to adjacent nodes.

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

[0035] 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. The collection and reporting of attributes such as period and time slot mapping relationship can be realized, thereby improving the quality of network communication.

[0036] Further, 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, BGP-LS protocol.

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

[0038] 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.

[0039] 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.

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

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

[0042] 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 represent the time slot used for inbound in the link cycle and the time slot used for outbound in the link cycle, respectively.

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

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

[0045] 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.

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

[0047] 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.

[0048] In an exemplary implementation, taking the implementation of the link attribute notification message through the ISIS protocol as an example, a 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 TLVs. The link attribute notification message can be used to flood the upstream and downstream cycles of the link and the time slot mapping relationship. The format of the link attribute notification message is as follows: Figure 2, where the TYPE flag is 1 byte, and the value of this flag can be TBD; the Length flag is 1 byte, 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 cycle on this link, and 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 can be understood that the cycles used by the upstream and downstream nodes of 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 cycle on this link.

[0049] In an exemplary implementation, taking the implementation of the link attribute notification message 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 of the link attribute notification message is as follows: Figure 3 , where Type is a byte with a value of TBD; Length is a byte with a value currently fixed at 3; Cycle is a byte, indicating the cycle value used on this node; Local_slot is a byte, indicating the inbound scheduling time slot within the local_cycle cycle on this node; Remote_slot is a byte, indicating the inbound scheduling time slot within the remote_cycle cycle on this link.

[0050] 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 can be added to the OSPF protocol message, which can be applicable to OSPFV2 and OSPFV3. The link attribute notification message can be used to flood the upstream and downstream cycles and time slot mapping relationship of the link. The format of the link attribute notification message is as follows: 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 cycle on this link, and 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 can be understood that the cycles used by the upstream and downstream nodes of 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 cycle on this link.

[0051] In another exemplary embodiment, taking the implementation of link attribute notification message through OSPF protocol as an example, a node-cycle-mapping sub-tlv can be added in the OSPF protocol message, which can be carried in OSPF RouterInformation (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 of the link attribute notification message is as follows: Figure 5 , where Type is a byte with a value of TBD; Length is a byte with a value currently fixed at 3; Cycle is a byte, indicating the cycle value used on this node; Local_slot is a byte, indicating the inbound scheduling time slot within the local_cycle cycle on this node; Remote_slot is a byte, indicating the inbound scheduling time slot within the remote_cycle cycle on this link.

[0052] In another exemplary implementation, taking the link attribute notification message implemented by the BGP-LS protocol as an example, a cycle-slot-mapping sub-tlv can be added to the BGP-LS protocol message to report the cycle time slot mapping relationship on the link to the SDN controller, see Figure 6, 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 cycle on this link, and 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 can be understood that the cycles used by the upstream and downstream nodes of 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 cycle on this link.

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

[0054] Figure 8 is a flowchart of another method for notifying deterministic link attributes provided by an embodiment of the present application. The embodiment of the present application is a specific implementation based on the above-mentioned embodiment of the application. Figure 8 The method provided in the embodiment of the present application specifically includes the following steps:

[0055] Step 210: 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.

[0056] Step 220: Flood the link attribute notification message to adjacent nodes.

[0057] Step 230: 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.

[0058] 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.

[0059] In an embodiment of the present application, an adjacent node can determine a second link attribute notification message based on 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 a periodic time slot mapping relationship corresponding to the adjacent node.

[0060] Step 240: 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.

[0061] 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.

[0062] In an embodiment of the present application, after obtaining the periodic time slot mapping relationship between the adjacent nodes and the current node, when transmitting information, 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.

[0063] In an exemplary implementation, the ISIS protocol is used to collect link cycle time slot mapping relationships as an example, see Fig. 9 ,The notification method of deterministic link attributes includes the following processes:

[0064] (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 is sent from time slot 2 of period 10 on link 1-2. After the influence of link propagation delay, it will be received by time slot 4 of period 10 on downstream device R2.

[0065] (2) The ISIS protocol is enabled on link 1-2 on device R1. At this time, the ISIS protocol receives the periodic time slot mapping relationship sent by the forwarding plane, that is, the five-tuple (link 1-2, 10, 2, 10, 4). At this time, flooding is performed through the ISIS link attribute sub-tlv;

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

[0067] (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;

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

[0069] In another exemplary embodiment, taking the OSPF protocol to collect link cycle time slot mapping relationship as an example, see Fig.10 , the method for announcing deterministic link attributes includes the following process:

[0070] (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 is sent from time slot 1 of period 10 on link 1-2. After the influence of link propagation delay, it will be received by time slot 3 of period 10 on downstream device R2.

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

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

[0073] (4) At this point, the periodic time slot mapping relationship on link1-2 and link2-3 is obtained on devices R1-R2-R3;

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

[0075] In another exemplary embodiment, the BGP-LS protocol is used to collect link cycle time slot mapping relationships as an example, see Fig.11 , the method for announcing deterministic link attributes includes the following process:

[0076] (1) The steps of mapping the OSPF flooding cycle time slot relationship are the same as steps (1) to (4) in Example 2;

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

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

[0079] (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), (lin2-3, 10,5,10,7);

[0080] (5) The controller sends the path information to the head node R1 through netconfig or PCE channel for service selection.

[0081] In an exemplary implementation, taking the OSPF protocol collection node period time slot mapping relationship as an example, see Fig.12 , the method for announcing deterministic link attributes includes the following process:

[0082] (1) The head node R1 learns the periodic time slot mapping relationship on the node by forwarding the message. That is, the message enters the time slot 1 of the node period 10, is processed by the internal chip, and is sent out in the time slot 3 of the node period 10.

[0083] (2) OSPF is enabled on R1. OSPF receives the node periodic time slot mapping from the forwarding plane and then floods the node using the OSPF node attribute tlv.

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

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

[0086] (5) The process of forming the periodic mapping relationship of Link1-2 and Link2-3 and the process of announcing the link periodic time slot mapping relationship;

[0087] (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)}.

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

[0089] The message determination module 301 is used 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.

[0090] The message notification module 302 is used to flood the link attribute notification message to the adjacent node.

[0091] 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. The collection and reporting of attributes such as the period and time slot mapping relationship can be realized, thereby improving the quality of network communication.

[0092] 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, BGP-LS protocol.

[0093] 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 and a link-level periodic time slot mapping relationship.

[0094] In some application embodiments, the link-level periodic 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.

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

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

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

[0098] In some other application embodiments, the device also includes: a path determination module, which is used to determine the information transmission path corresponding to the target node according to the link attribute notification message and the periodic time slot mapping relationship of the second link attribute notification message.

[0099] Fig.14 1 is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. The electronic device 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 may be one or more. Fig. 9 A processor 10 is taken as an example; the processor 10, the memory 11, the input device 12 and the output device 13 in the electronic device can be connected by a bus or other means. Fig.14 The example of connecting through bus is taken in the following.

[0100] 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 notification device of the deterministic link attributes in the embodiment of the present application (message determination module 301 and message notification module 302). The processor 10 executes various functional applications and data processing of the electronic device by running the software programs, instructions and modules stored in the memory 11, that is, implements the above-mentioned notification method of the deterministic link attributes.

[0101] 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 an application required for at least one function; the data storage area may store data created according to 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 arranged 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.

[0102] 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.

[0103] The embodiment of the present application further provides a storage medium including computer executable instructions, wherein the computer executable instructions are used to execute a method for announcing deterministic link attributes when executed by a computer processor, the method comprising:

[0104] 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;

[0105] The link attribute notification message is flooded to the adjacent node.

[0106] Through the above description of the implementation method, the technicians in the relevant field can clearly understand that the present invention can be implemented by means of software and necessary general hardware, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as a computer 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 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.

[0107] 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.

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

[0109] In 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 physical components or all 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 a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As known to those of ordinary skill in the art, the term computer storage medium 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, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies 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.

[0110] The above content describes the preferred embodiments of the present invention with reference to the accompanying drawings, but does not limit the scope of the present invention. Any modification, equivalent substitution and improvement made by those skilled in the art without departing from the scope and essence of the present invention shall be within the scope of the present invention.

Claims

1. A method for notifying deterministic link attributes, characterized in that: The method comprises: 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; Flood the link attribute notification message to the adjacent node.

2. The method according to claim 1, characterized in that: The link attribute notification message is implemented through at least one of the following protocols: ISIS protocol, OSPF protocol, BGP-LS protocol.

3. The method according to claim 1, characterized in that: 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, characterized in that: 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, characterized in that: 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, characterized in that: The link attribute notification message also includes a message type and a message length.

7. The method according to claim 1, characterized in that: Also includes: A second link attribute notification message flooded by the adjacent node is received, wherein the second link attribute notification message at least includes a period-time slot mapping relationship.

8. The method according to claim 7, characterized in that: Also includes: 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, characterized in that: The electronic device comprises: one or more processors; A memory for storing one or more programs; 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 claims 1 to 8.

10. A computer-readable storage medium, characterized in that: 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 claims 1-8.

Images