Self-adaptive link construction method and system for service QoS (Quality of Service) demand based on OSPF (Open Shortest Path First)

Abstract

The invention discloses an adaptive link construction method and system based on an OSPF (Open Shortest Path First) and oriented to a QoS (Quality of Service) demand, and the method comprises the following steps: announcing an LSA (Link State Advertisement) message by expanding the link state of the OSPF, and integrating QoS parameter information of a link into the LSA message; an SPF algorithm is used for dynamically adjusting the weight coefficient of a calculation formula through multiple times of calculation according to different limitations and priority requirements of a service on bandwidth, time delay and channels, and finally an optimal path meeting the QoS requirement of a user is obtained; the method comprises the following steps: compressing quintuple information of a service into a chain identifier by using a mechanism based on a link identifier, periodically packaging the chain identifier into a maintenance message, sending the maintenance message to each node on a path so as to monitor a link state, and quickly reestablishing a link when the link fails; the special link data flow is identified through the protocol type field of the Ethernet frame header, so that the analysis overhead of the three-layer message is avoided. According to the method, expansion is only carried out on the basis of the OSPF protocol, the existing network does not need to be transformed on a large scale, and the method has good practicability and deployability.

Description

Technical Field

[0001] The present invention relates to the technical field of data communication and transmission, and more particularly to an OSPF-based adaptive link construction method and system oriented to service QoS requirements. Background Art

[0002] In today's era, the rapid development of network technology has greatly promoted the convenience of social life and the improvement of work efficiency. Among them, the Open Shortest Path First (OSPF) protocol, as the cornerstone of network routing selection, has played a key role in various complex network environments.

[0003] However, faced with higher requirements for network performance in emerging application areas such as remote control and unmanned equipment management, especially stringent standards for latency, bandwidth, and packet loss rate, the traditional OSPF protocol has exposed limitations in meeting the quality of service (QoS) of specific services.

[0004] In terms of the business data carried, the real-time remote control operation of unmanned equipment requires extremely low network latency to ensure timely response, while high-definition video backhaul has a huge demand for bandwidth, which is often beyond the capacity of the traditional OSPF protocol.

[0005] In this scenario, it is not only necessary to achieve basic network connectivity, but also to select low-latency or high-bandwidth links for specific services to ensure the transmission of instructions or video data, thereby improving the immediacy and data transmission efficiency of the entire system. Therefore, in response to this challenge, it is necessary to design a link construction solution that can be customized and extended while maintaining the original advantages of the OSPF protocol, so as to effectively meet the requirements of special business scenarios for network link performance. Summary of the invention

[0006] In view of this, the present invention provides an adaptive link construction method and system based on OSPF for business QoS requirements. The method aims to solve the high performance requirements of the traditional OSPF protocol for indicators such as delay, bandwidth and packet loss rate in specific business scenarios; it allows dynamic construction of links that meet specific QoS requirements, including parameters such as delay, bandwidth, packet loss rate, etc., and is suitable for application scenarios that require high-quality network services.

[0007] In order to achieve the above object, the present invention adopts the following technical solution:

[0008] The embodiment of the present invention provides an adaptive link construction method based on OSPF oriented to service QoS requirements, comprising the following steps:

[0009] Link state extension step: integrating the QoS parameter information of the link into the LSA message by extending the link state advertisement LSA message of OSPF; the QoS parameters include: delay, bandwidth, channel and packet loss rate;

[0010] Link construction steps: Use the SPF algorithm to dynamically adjust the weight coefficient of the calculation formula through multiple calculations based on the different bandwidth, delay and channel restrictions and priority requirements of the services, and finally obtain the optimal path that meets the user's QoS requirements;

[0011] Link notification and maintenance steps: Use a link identifier-based mechanism to compress the five-tuple information of the service into a link identifier, and periodically package it into a maintenance message and send it to each node on the path to monitor the link status and quickly re-establish the link when the link fails;

[0012] Link data forwarding steps: The dedicated link data stream is identified through the protocol type field of the Ethernet frame header to achieve fast data forwarding and link bandwidth reservation.

[0013] Furthermore, the link state extension step includes:

[0014] (1) The parameter flooding module is used to add the link QoS parameter information to the LSA flooding, ensuring that the local network has obtained complete network link information before the user issues a link establishment command;

[0015] (2) A parameter encoding module is used to encode and compress link status information to save network resources.

[0016] Furthermore, the link building step includes:

[0017] (1) Preprocessing step: Based on the user's mandatory service requirements, links that do not meet the requirements are removed from the calculation;

[0018] (2) Cost formula generation step: Generate a cost calculation formula based on the user's priority requirements and weight coefficients;

[0019] (3) Topology update step: Update the network topology according to the collected LSA information, and perform path calculation based on the new topology;

[0020] (4) Path selection step: The calculated path is verified. If it does not meet the user's QoS requirements, the weight parameters are updated and the path is recalculated until a link that meets the user's requirements is obtained.

[0021] Furthermore, the link notification and maintenance step includes:

[0022] (1) Maintenance message generation step: compress the service quintuple into an 8-byte link identifier, periodically generate and send a maintenance message containing the link identifier, reserved bandwidth, link path, and survival time information;

[0023] (2) Link monitoring step: After receiving the maintenance message, the node on the link parses the message and determines the link status. If it does not meet the requirements, it returns the result to the initial node and rebuilds the link when the link fails.

[0024] Furthermore, the link data forwarding step includes:

[0025] (1) Protocol type mapping step: Map the link identifier to two bytes and put it into the protocol type field of the Ethernet frame header. The first byte is fixed to 0xbf to distinguish the dedicated link data flow;

[0026] (2) Forwarding control step: After receiving the maintenance message, the link node merges the link information into the routing table for forwarding. The local channel device reserves a fixed bandwidth according to the bandwidth reservation command, and the service message is quickly forwarded according to the protocol type field.

[0027] The embodiment of the present invention further provides an adaptive link construction system based on OSPF and oriented to service QoS requirements, comprising:

[0028] Link state extension module: used to integrate the QoS parameter information of the link into the LSA message by extending the link state advertisement LSA message of OSPF; the QoS parameters include: delay, bandwidth, channel and packet loss rate;

[0029] Link construction module: It uses the SPF algorithm to dynamically adjust the weight coefficient of the calculation formula through multiple calculations according to the different restrictions and priority requirements of the services on bandwidth, delay and channels, and finally obtain the optimal path that meets the user's QoS requirements;

[0030] Link notification and maintenance module: It uses a link identifier-based mechanism to compress the five-tuple information of the service into a link identifier, and periodically packages it into a maintenance message and sends it to each node on the path to monitor the link status and quickly re-establish the link when the link fails.

[0031] Link data forwarding module: used to identify the dedicated link data flow through the protocol type field of the Ethernet frame header, to achieve fast data forwarding and link bandwidth reservation.

[0032] Furthermore, the link state extension module includes:

[0033] (1) Parameter flooding module, which is used to add link QoS parameter information to the LSA flooding to ensure that the local network has obtained complete network link information before the user issues a link establishment command;

[0034] (2) Parameter encoding module, used to encode and compress link status information to save network resources.

[0035] Furthermore, the link building module includes:

[0036] (1) Preprocessing module: used to remove links that do not meet the requirements from the calculation according to the user's mandatory service requirements;

[0037] (2) Cost formula generation module: used to generate a cost calculation formula based on the user's priority requirements and combined with the weight coefficient;

[0038] (3) Topology update module: used to update the network topology according to the collected LSA information and perform path calculation based on the new topology;

[0039] (4) Path selection module: used to verify the calculated path. If it does not meet the user's QoS requirements, the weight parameters are updated and the path is recalculated until a link that meets the user's requirements is obtained.

[0040] Furthermore, the link notification and maintenance module includes:

[0041] (1) Maintenance message generation module: compresses the service quintuple into an 8-byte link identifier, periodically generates and sends maintenance messages, which contain the link identifier, reserved bandwidth, link path, and survival time information;

[0042] (2) Link monitoring module: After receiving the maintenance message, the node on the link parses the message and determines the link status. If the requirements are not met, the result is returned to the initial node and the link is rebuilt when the link fails.

[0043] Furthermore, the link data forwarding module includes:

[0044] (1) Protocol type mapping module: maps the link identifier into two bytes and puts it into the protocol type field of the Ethernet frame header. The first byte is fixed to 0xbf to distinguish the dedicated link data flow;

[0045] (2) Forwarding control module: After receiving the maintenance message, the link node merges the link information into the routing table for forwarding. The local channel device reserves a fixed bandwidth according to the bandwidth reservation command, and the service message is quickly forwarded according to the protocol type field.

[0046] It can be seen from the above technical solutions that compared with the prior art, the present invention has the following technical advantages:

[0047] 1) By enhancing the functions of the OSPF protocol, a dynamic link construction and maintenance mechanism is implemented, which can dynamically build and optimize data transmission paths according to real-time network status and business needs, and quickly forward specific services.

[0048] 2) The present invention integrates the QoS parameters of the link through an improved Link State Advertisement (LSA), and enables all nodes to obtain the link information of the entire network in advance through parameter flooding.

[0049] 3) According to the mandatory and preferred demands of users, a dynamic Cost algorithm based on QoS requirements is proposed. This algorithm can adjust the weights according to bandwidth, delay and channel parameters to select the best path that meets business needs.

[0050] 4) The present invention designs a notification and maintenance mechanism for the link, which realizes real-time monitoring and dynamic adjustment of the link through bandwidth inquiry messages and maintenance messages. If the link fails due to response failure or other reasons, the system will automatically recalculate and update the link information.

[0051] 5) In terms of data forwarding, by adding a special protocol type field to the Ethernet frame header, efficient management and forwarding of dedicated link data streams are achieved, thereby reducing the need for three-layer message parsing and improving data transmission efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying creative work.

[0053] Figure 1 This is a link building flow chart of the adaptive link building method provided by the present invention.

[0054] Figure 2 This is a notification maintenance sequence diagram of the adaptive link establishment method provided by the present invention.

[0055] Figure 3 A maintenance and forwarding flow chart of the adaptive link construction method provided by the present invention. DETAILED DESCRIPTION

[0056] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0057] The embodiment of the present invention discloses an adaptive link construction method based on OSPF for service QoS requirements, which can at least solve some of the above problems. The proposed dynamic Cost algorithm can meet the user's demand for QoS, and can be repeatedly corrected and maintained according to the change of link information to ensure the rapid forwarding of specific user data within the link.

[0058] The method of the present invention is described in four steps, namely: a link state extension step, a link construction step, a link notification and maintenance step, and a link data forwarding step.

[0059] The first step is the link state extension step.

[0060] In order to calculate the subsequent links, it is necessary to obtain the delay, bandwidth, packet loss rate, channel parameters and other information of each link vector. The present invention integrates the QoS parameters of the link such as delay, bandwidth, packet loss rate and other information by extending the link state advertisement (LSA) of OSPF. In addition, a parameter flooding module is adopted so that all nodes in the network have obtained the link information of the entire network through LSA flooding before the link establishment request is issued. The parameter encoding module realizes the compressed transmission of data, effectively saves the number of bytes of link information, and optimizes the use of network resources.

[0061] The second step is link building step:

[0062] The SPF algorithm (also known as the Dijkstra algorithm) is used to dynamically adjust the weight coefficient of the calculation formula through multiple calculations according to the different restrictions and priority requirements of the business on bandwidth, delay and channel, and finally obtain the optimal path that meets the user's QoS requirements; this algorithm can dynamically adjust the weight coefficient of the calculation formula according to the user's different priority requirements for bandwidth, delay, channel, etc., and obtain the optimal path that meets user requirements.

[0063] The specific link construction process is as follows: Figure 1 When submitting a link building application, the user will clearly state the required delay, bandwidth, and packet loss rate. After the user issues a link building command, it is determined whether the command is reasonable and the destination address exists in the routing table, that is, the destination address is reachable. If the command is legal, the link building topology of the LSA is filtered.

[0064] The bandwidth and packet loss rate that meet the user's business needs must be met by each link. When building the link topology through LSA, all link vectors that do not meet the bandwidth and packet loss rate are removed and do not participate in subsequent link calculations. The maximum delay requirement is obtained by adding after calculating a complete path. After the path is obtained, the maximum delay needs to be verified.

[0065] The calculation scheme for each path cost needs to assign a weight to the delay, and when the calculated path does not meet the maximum delay requirement, the delay weight needs to be increased and the cost of each path needs to be recalculated. Analyze the user's link building needs, classify the user's tendency needs and design the topology calculation formula. If the user requires delay priority, the calculation formula for the designed topology is as follows:

[0066] Latency Priority:

[0067] Cost = D

[0068] If the user requires bandwidth priority, the bandwidth priority formula is:

[0069] Cost=D+(Constant_A / Bw)*w

[0070] If the user requires channel priority, the channel priority formula is:

[0071] Cost=D+(Constant_B*Ch)*w

[0072] Wherein, D represents delay, Ch represents channel, Bw represents bandwidth, w represents weight coefficient, the purpose of constant Constant_A and constant Constant_B is to normalize the bandwidth or channel data and delay, and the weight is used to adjust the weight proportion of delay. The present invention divides the weight coefficient into 5 levels, namely 1, 0.75, 0.5, 0.25, and 0. The calculation scheme of each path cost needs to assign weight to the delay, and when the calculated path does not meet the maximum delay requirement, the weight of the delay needs to be increased and the cost of each path needs to be recalculated.

[0073] After obtaining the cost calculation formula, the topology of the entire network is established based on the LSA information, and the shortest path is obtained through the SPF algorithm. Next, the feasibility of the path needs to be determined.

[0074] Specifically, the calculation of latency meets the requirements. Once the path calculated based on bandwidth or channel priority does not meet the latency requirements, the weight coefficient will be reduced by one level, and the topology will be updated and the SPF shortest path will be calculated again until a path that meets the latency requirements is obtained. When the weight coefficient reaches 0 and still no path that meets the latency is obtained, link establishment will fail.

[0075] If it is known that a link vector fails and the path point is unable to carry the business of the link, it is necessary to delete the vector from the topology, recalculate the SPF, and obtain a new path vector list.

[0076] Through the above calculation, the link vector list of the dedicated link can be obtained, where each vector includes the path point, egress port, and next hop information. The advantage of this method is that, on the basis of retaining the traditional OSPF routing, it provides customized link services for some applications with special requirements for QoS, can allocate network resources on demand, and improve the transmission quality of key applications.

[0077] The third step is link notification and maintenance steps:

[0078] After the path calculation is completed, it needs to be notified to each node for flow control and maintenance of the entire link. The present invention proposes a new path notification and maintenance mechanism. The notification maintenance sequence is as follows: Figure 2 This mechanism simplifies the label exchange process, reduces maintenance overhead, and shortens the time for rebuilding after a link is broken.

[0079] The control node packages the link identifier (simplified five-tuple), reserved bandwidth, and link path of the link into a bandwidth inquiry message and sends it to each node on the path. Based on the information, each node asks whether the channel of the node can carry the specified bandwidth and returns the result to the control node. If the control node receives an affirmative response from each node within a fixed time, it means that the link is successfully established and enters the link maintenance phase. If a node does not respond, or fails to respond, and the path point is unable to carry the business of the link, the path vector is deleted from the topology map and recalculated, and then it goes back and forth, such as Figure 1 shown.

[0080] Enter the link maintenance phase, such as Figure 3 As shown in the figure, the control node packages the link identifier, reserved bandwidth, link path, and survival time into a maintenance message and periodically sends it to the nodes on each path. After receiving it, the path node instructs the local channel to reserve bandwidth and establishes a forwarding table locally for subsequent forwarding, and returns a response to the control node. During the link maintenance process, if there is no response or the response fails, the routing vector is also marked as unavailable and the link is rebuilt.

[0081] The fourth step is link data forwarding step:

[0082] After the link is established and enters the maintenance phase, the link service can notify the calculated path for communication. According to the maintenance mechanism mentioned in the previous step, the channel side has established a special forwarding channel according to the bandwidth reservation command. In order to avoid the channel parsing the three-layer message, the present invention maps the link identifier, shortens the bytes and puts them into the protocol type of the Ethernet frame header, such as Figure 3As shown. The first byte of the protocol type is defined as 0xbf. Considering the demand, it is estimated that the number of dedicated chains for each node is generally no more than 100, so the second byte is set to 0 to 100, that is, the mapping range is 0xbf00 to 0xbf64. This value can be expanded as needed.

[0083] Since each routing node will search for a dedicated link, each point will map different link identifiers independently. Therefore, the protocol type only needs to be notified to the local channel side. When the data message arrives, when the next point receives a message starting with a protocol type of 0xbf, the protocol type is immediately replaced with 0x0800 (IPV4), and no special processing is required for the subsequent parsing of the message.

[0084] In this step, the protocol type field is used to distinguish the data forwarding scheme of the dedicated link data flow, avoiding the parsing overhead of the three-layer message.

[0085] The present invention can be expanded only on the basis of the OSPF protocol without large-scale transformation of the existing network, and has good practicability and deployability.

[0086] Based on the same inventive concept, the present invention also provides an adaptive link construction system based on OSPF and oriented to service QoS requirements, including:

[0087] Link state extension module: used to integrate the QoS parameter information of the link into the LSA message by extending the link state advertisement LSA message of OSPF; the QoS parameters include: delay, bandwidth, channel and packet loss rate;

[0088] Link construction module: It uses the SPF algorithm to dynamically adjust the weight coefficient of the calculation formula through multiple calculations according to the different restrictions and priority requirements of the services on bandwidth, delay and channels, and finally obtain the optimal path that meets the user's QoS requirements;

[0089] Link notification and maintenance module: It uses a link identifier-based mechanism to compress the five-tuple information of the service into a link identifier, and periodically packages it into a maintenance message and sends it to each node on the path to monitor the link status and quickly re-establish the link when the link fails.

[0090] Link data forwarding module: used to identify the dedicated link data flow through the protocol type field of the Ethernet frame header, to achieve fast data forwarding and link bandwidth reservation.

[0091] For example, in a specific network, the system of the present invention is used to build links for video conferencing services. By extending the LSA message, the real-time status information of each link is collected, and the link weight is dynamically adjusted according to the high bandwidth and latency requirements of the video conference, and finally a high-bandwidth, low-latency path is selected. This path is used in subsequent conference data transmission to ensure the smoothness of the conference.

[0092] For example, in a data center environment, the system of the present invention is used to select links for storage synchronization services. In this application, the packet loss rate and bandwidth stability of the link are key requirements. After multiple path calculations and verifications, a link that meets the requirements is finally selected and successfully applied to the data synchronization task.

[0093] The system of the present invention can dynamically adjust the path selection according to the business requirements. By using the extended SPF algorithm and link notification mechanism, the optimal link can be quickly calculated and maintained, reducing the business interruption caused by link failure. It can be compatible with the existing OSPF protocol and can be further expanded according to actual needs. It can effectively solve the problem that the existing technology cannot meet the high QoS requirements and has good application prospects.

[0094] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part.

[0095] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. An adaptive link construction method based on OSPF for service QoS requirements, characterized in that: The following steps are involved: Link state extension step: By extending the OSPF link state advertisement LSA message, the link QoS parameter information is integrated into the LSA message; The QoS parameters include: delay, bandwidth, channel and packet loss rate; Link construction steps: Use the SPF algorithm to dynamically adjust the weight coefficient of the calculation formula through multiple calculations based on the different bandwidth, delay and channel restrictions and priority requirements of the services, and finally obtain the optimal path that meets the user's QoS requirements; Link notification and maintenance steps: Use a link identifier-based mechanism to compress the five-tuple information of the service into a link identifier, and periodically package it into a maintenance message and send it to each node on the path to monitor the link status and quickly re-establish the link when the link fails; Link data forwarding steps: The dedicated link data stream is identified through the protocol type field of the Ethernet frame header to achieve fast data forwarding and link bandwidth reservation.

2. The method for establishing an adaptive link based on OSPF and facing service QoS requirements according to claim 1, characterized in that: The link state extension step comprises: (1) The parameter flooding module is used to add the link QoS parameter information to the LSA flooding, ensuring that the local network has obtained complete network link information before the user issues a link establishment command; (2) A parameter encoding module is used to encode and compress link status information to save network resources.

3. The method for establishing an adaptive link based on OSPF and facing service QoS requirements according to claim 1, characterized in that: The link building step comprises: (1) Preprocessing step: Based on the user's mandatory service requirements, links that do not meet the requirements are removed from the calculation; (2) Cost formula generation step: Generate a cost calculation formula based on the user's priority requirements and weight coefficients; (3) Topology update step: Update the network topology according to the collected LSA information, and perform path calculation based on the new topology; (4) Path selection step: The calculated path is verified. If it does not meet the user's QoS requirements, the weight parameters are updated and the path is recalculated until a link that meets the user's requirements is obtained.

4. The method for establishing an adaptive link based on OSPF and facing service QoS requirements according to claim 1, characterized in that: The link notification and maintenance steps include: (1) Maintenance message generation step: compress the service quintuple into an 8-byte link identifier, periodically generate and send a maintenance message containing the link identifier, reserved bandwidth, link path, and survival time information; (2) Link monitoring step: After receiving the maintenance message, the node on the link parses the message and determines the link status. If it does not meet the requirements, it returns the result to the initial node and rebuilds the link when the link fails.

5. The method for establishing an adaptive link based on OSPF and facing service QoS requirements according to claim 1, characterized in that: The link data forwarding step includes: (1) Protocol type mapping step: Map the link identifier to two bytes and put it into the protocol type field of the Ethernet frame header. The first byte is fixed to 0xbf to distinguish the dedicated link data flow; (2) Forwarding control step: After receiving the maintenance message, the link node merges the link information into the routing table for forwarding. The local channel device reserves a fixed bandwidth according to the bandwidth reservation command, and the service message is quickly forwarded according to the protocol type field.

6. An adaptive link construction system based on OSPF for service QoS requirements, characterized in that: include: Link state extension module: used to integrate the link QoS parameter information into the LSA message by extending the OSPF link state advertisement LSA message; The QoS parameters include: delay, bandwidth, channel and packet loss rate; Link construction module: It uses the SPF algorithm to dynamically adjust the weight coefficient of the calculation formula through multiple calculations according to the different restrictions and priority requirements of the services on bandwidth, delay and channels, and finally obtain the optimal path that meets the user's QoS requirements; Link notification and maintenance module: It uses a link identifier-based mechanism to compress the five-tuple information of the service into a link identifier, and periodically packages it into a maintenance message and sends it to each node on the path to monitor the link status and quickly re-establish the link when the link fails. Link data forwarding module: used to identify the dedicated link data flow through the protocol type field of the Ethernet frame header, to achieve fast data forwarding and link bandwidth reservation.

Images