CN116668359A

CN116668359A - Intelligent non-inductive switching method, system and storage medium for network paths

Info

Publication number: CN116668359A
Application number: CN202310943211.8A
Authority: CN
Inventors: 闻永发; 姚兆祥
Original assignee: Hangzhou Wangding Technology Co ltd
Current assignee: Hangzhou Wangding Technology Co ltd
Priority date: 2023-07-31
Filing date: 2023-07-31
Publication date: 2023-08-29
Anticipated expiration: 2043-07-31
Also published as: CN116668359B

Abstract

The invention relates to the technical field of network communication, in particular to a network path intelligent non-inductive switching method, a system and a storage medium, wherein routers in a network periodically exchange heartbeat packets; the routers in the network respectively establish a load sensing table; routers in the network each establish a path table; routers in the network respectively calculate the heartbeat delay of each router table item according to the heartbeat packet; when the IP message reaches each hop router along the forwarding path, the router obtains the estimated time consumption of the current forwarding path; if the estimated time consumption exceeds the preset threshold, the router re-searches the forwarding path with the least estimated time consumption to replace the current forwarding path, otherwise, if the estimated time consumption does not exceed the preset threshold, the router does not operate; and sending the IP message to a next hop router. The beneficial technical effects of the invention include: and obtaining the router load condition on the forwarding path through the load sensing table and the path table, and intelligently switching the path to realize the lowest possible communication delay.

Description

Intelligent non-inductive switching method, system and storage medium for network paths

Technical Field

The invention relates to the technical field of network communication, in particular to a network path intelligent non-inductive switching method, a system and a storage medium.

Background

Routing refers to the process of determining the network scope of an end-to-end path as a packet goes from a source to a destination. Which operates at the third layer of the OSI reference model, the packet forwarding device of the network layer. When a data packet is received by a route, the destination network address in the packet is checked to determine if the destination address of the packet exists in the current routing table. If the destination address of the packet is found to be the same as the network address connected to a certain interface of the router, immediately forwarding the data to the corresponding interface; if the target address of the packet is found not to be the own direct network segment, the router checks the own routing table, searches the interface corresponding to the target network of the packet, and forwards the interface from the corresponding interface; if the network address recorded in the routing table is not matched with the destination address of the packet, forwarding to a default interface according to the router configuration, and returning ICMP information with unreachable destination address to the user under the condition that the default interface is not configured.

Routing work involves two basic actions: the best path is determined and information is transmitted over the network. The transmission of information through a network, also known as switching, is relatively simple, while the selection path is complex, which is determined by a routing algorithm. The routing algorithm initializes and maintains a routing table containing path information that varies depending on the routing algorithm used. The routing algorithm updates the routing table based on a number of information. And the router sends the IP message packet of the destination IP section to the router corresponding to the 'next hop' address according to the destination/next hop address. When the router receives an IP message, it will check the target IP address and try to inquire the address of the 'next hop' route corresponding to the address in the route table, and then send the IP message to the router corresponding to the 'next hop'. Routers communicate with each other and maintain their routing tables by exchanging routing information. By analyzing route update information from other routers, the routers each establish a network topology map for finding forwarding paths. However, the current routing algorithm lacks a technical scheme for avoiding the congested route by estimating time consumption, thereby dynamically switching the forwarding path.

Disclosure of Invention

The invention aims to solve the technical problems that: the prior routing algorithm can not effectively evaluate the time-consuming technical problem of the forwarding path. The intelligent non-inductive switching method, the intelligent non-inductive switching system and the storage medium for the network paths are provided, and the optimal paths can be intelligently switched based on time-consuming evaluation of forwarding paths.

In order to solve the technical problems, the invention adopts the following technical scheme: a network path intelligent non-inductive switching method comprises the following steps:

periodically exchanging heartbeat packets among routers in a network, wherein the heartbeat packets record the IP address and the load rate parameter of each hop of the router when the heartbeat packets are transmitted in the network;

the router in the network respectively establishes a load sensing table, and the load sensing table records IP addresses and load rate parameters of other routers received by the router;

each router in the network establishes a path table, and at least one forwarding path of a target IP section is obtained according to the router of each hop when the heartbeat packet is transmitted in the network and stored in the path table;

routers in the network respectively calculate the heartbeat delay of each routing table item according to the heartbeat packet, and record the heartbeat delay in the routing table item;

When an IP message reaches each hop router along a forwarding path, the router reads the heartbeat delay of a routing table item corresponding to the forwarding path and the load rate parameter of each hop router on a subsequent forwarding path, and obtains the current estimated time consumption of the forwarding path according to the heartbeat delay and the load rate parameter;

if the estimated time consumption exceeds a preset threshold, the router re-searches the forwarding path with the least estimated time consumption to replace the current forwarding path, otherwise, if the estimated time consumption does not exceed the preset threshold, the router does not operate;

and obtaining the IP address of the next-hop router, and sending the IP message to the next-hop router until the IP message reaches a target IP address.

Preferably, the method for periodically exchanging heartbeat packets comprises the following steps:

a router in a network periodically generates a heartbeat packet of the router, wherein the heartbeat packet comprises an IP address, a direct connection IP section, a load factor parameter, a heartbeat time stamp, a forwarding time stamp and a forwarding path, and the forwarding path is null when generated;

the router which generates the heartbeat packet sends the heartbeat packet to a directly connected router, and the router which receives the heartbeat packet forwards the heartbeat packet to the directly connected router and avoids returning the heartbeat packet;

And the router for forwarding the heartbeat packet adds the IP address of the router and the forwarding time stamp into the forwarding path of the heartbeat packet when forwarding.

Preferably, the method for establishing the path table comprises the following steps:

traversing the routing table of the router, and trying to find a target IP section matched with the direct connection IP section of the heartbeat packet record;

if the route table has a destination IP section matched with the heartbeat packet, copying the matched route table item to the route table as a route item, and adding a direct connection IP section, a heartbeat time stamp, a forwarding time stamp and a forwarding path recorded by the heartbeat packet to the route item;

if the destination IP section matched with the heartbeat packet does not exist in the routing table, ending the method.

Preferably, the method for calculating the heartbeat delay of the routing table item comprises the following steps:

querying the path table to try to obtain a path item matched with the IP section of the current routing table item;

if a path item matched with the IP section of the current routing table item exists, calculating a difference value between a forwarding time stamp of the last hop of the heartbeat packet in a forwarding path and the heartbeat time stamp, and taking the difference value as the heartbeat delay of the path item;

if no path item matched with the IP section of the current routing table item exists, counting the number of forwarding routers contained in the forwarding path, and setting the heartbeat delay as the product of the number of forwarding routers and a preset constant.

Preferably, the load factor parameter includes a load factor of a router, and the method for obtaining estimated time consumption of the forwarding path includes the following steps:

reading the path table and the load sensing table, obtaining the load rate of each router on the forwarding path, and calculating the average value of the load rates of the routers on the forwarding path;

inquiring the routing table to obtain the heartbeat delay of the corresponding routing table item;

if the average value of the load rates is larger than a preset threshold value, setting a pre-estimated coefficient to be a preset value larger than 1, otherwise, setting the pre-estimated coefficient to be equal to 1;

taking the product of the estimated coefficient and the heartbeat delay as estimated time consumption of a forwarding path.

Preferably, the method for establishing the load sensing table comprises the following steps:

reading the IP address and the load rate parameter of the received heartbeat packet;

if the IP address does not exist in the load sensing table, establishing an entry by taking the IP address as an index, and storing the load rate parameter and the corresponding IP address in an associated manner to be used as a load sensing entry;

if the IP address exists in the load sensing table, the load rate parameter in the load sensing table is updated by using the load rate parameter of the received heartbeat packet.

Preferably, the IP message comprises a DSCP priority mark and a cost function, the cost function is a function of cost versus IP message waiting time, the IP message waiting time is obtained by respectively timing on each forwarding router, the load factor parameters comprise load factor, priority distribution index and cost distribution index,

the priority distribution index comprises the priority distribution proportion of all the queued IP messages when the heartbeat packet is generated;

the method for generating the value degree distribution index comprises the following steps:

setting time intervals [0, T1] and T1 as preset constant values by taking the time for generating the heartbeat packet as 0 time, and setting a plurality of sampling points at equal intervals in the time intervals [0, T1] and recording as ti;

calculating the waiting time of each IP message in a time interval [0, T1], and recording as [ Tk1, tk2], wherein Tk1 is the waiting time of the kth IP message at the moment 0, and Tk2 is the waiting time of the kth IP message at the moment T1;

the value of the value function of all the queued IP messages in the respective waiting time interval [ Tk1, tk2 ];

obtaining the value of each IP message at a sampling point ti, summing the value of each IP message at the sampling point ti, and recording the sum of the value of each IP message at the sampling point ti as the total value of each IP message at the sampling point ti;

And obtaining the distribution proportion of the total value on the sampling points as a value distribution index.

Preferably, according to the heartbeat delay and the load factor parameter, obtaining the current estimated time consumption of the forwarding path;

the method for obtaining the estimated time consumption of the forwarding path comprises the following steps:

obtaining the load rate, the priority distribution index and the value distribution index of each router on the forwarding path;

setting a first coefficient, a second coefficient and a third coefficient, wherein initial values of the first coefficient, the second coefficient and the third coefficient are all 1;

calculating the average value of the load rate of the router on the forwarding path, if the average value of the load rate is larger than a preset threshold value, setting the first coefficient to be a preset value larger than 1, otherwise, not adjusting the value of the first coefficient;

the priority distribution indexes of all routers on a forwarding path are read, a priority average distribution ratio on the forwarding path is obtained according to the priority distribution indexes of all routers on the forwarding path, if the priority of the IP message is in the first N1% in the priority average distribution ratio, the value of a second coefficient is not adjusted, otherwise, if the priority of the IP message is not in the first N1% in the priority average distribution ratio, the second coefficient is set to be a preset value larger than 1;

And reading the value distribution indexes of all routers on the forwarding path, obtaining a value average distribution ratio of the forwarding path according to the value distribution indexes of all routers on the forwarding path, if the value maximum value of the IP message is in the front N2% in the value average distribution ratio, not adjusting the value of the third coefficient, otherwise, if the value maximum value of the IP message is not in the front N2% in the value average distribution ratio, setting the third coefficient to be a preset value larger than 1.

An embedded system running on the router in a network, the embedded system comprising a memory, a processor, and an embedded program stored in the memory and executable on the processor, the embedded program implementing a network path intelligent non-inductive switching method as described above when executed by the processor.

A computer readable storage medium storing an embedded program which when executed by a processor implements a network path intelligent non-inductive switching method as described above.

The beneficial technical effects of the invention include: the load condition of the router on the forwarding path is obtained through the load sensing table and the path table, and the router is intelligently switched on the selectable path, so that communication delay is as low as possible; the improved heartbeat package can realize the exchange of load rate parameters at the same time when the heartbeat package is exchanged between routers; the cost of the transmission delay of the IP message is represented by the cost function, so that more intelligent QoS service is realized.

Other features and advantages of the present invention will be disclosed in the following detailed description of the invention and the accompanying drawings.

Drawings

The invention is further described with reference to the accompanying drawings:

fig. 1 is a schematic diagram of a network path structure according to an embodiment of the present invention.

Fig. 2 is a flow chart of a network path intelligent non-inductive switching method according to an embodiment of the invention.

Fig. 3 is a flowchart of a method for periodically exchanging heartbeat packets according to an embodiment of the present invention.

Fig. 4 is a flowchart of a method for creating a path table according to an embodiment of the present invention.

Fig. 5 is a flowchart of a heartbeat delay method for calculating a routing table entry according to an embodiment of the present invention.

Fig. 6 is a flowchart of a method for obtaining estimated time consumption of a forwarding path according to an embodiment of the present invention.

Fig. 7 is a flowchart of a method for creating a load sensing table according to an embodiment of the present invention.

Fig. 8 is a flowchart illustrating a method for generating a value distribution index according to an embodiment of the present invention.

Fig. 9 is a flowchart of another method for obtaining estimated time consumption of a forwarding path according to an embodiment of the present invention.

Fig. 10 is a schematic diagram of an embedded system according to an embodiment of the invention.

Wherein: 101. l2 router, 102, L1-2 router, 103, L1 router, 104, client, 300, embedded system, 301, memory, 302, embedded program, 303, processor.

Detailed Description

The technical solutions of the embodiments of the present invention will be explained and illustrated below with reference to the drawings of the embodiments of the present invention, but the following embodiments are only preferred embodiments of the present invention, and not all embodiments. Based on the examples in the implementation manner, other examples obtained by a person skilled in the art without making creative efforts fall within the protection scope of the present invention.

In the following description, directional or positional relationships such as the terms "inner", "outer", "upper", "lower", "left", "right", etc., are presented for convenience in describing the embodiments and simplifying the description, and do not indicate or imply that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore should not be construed as limiting the invention.

Before introducing the technical scheme of the embodiment, the related technology and scene related in the application of the embodiment are introduced.

The embodiment is applied to path optimization of a complex high-load computer network. In a common network, the links from one client 104 to another client 104 are typically single, and in a few cases there are two links. Such a network does not require the use of the techniques described in this embodiment. The complex network in this embodiment means that one ue 104 arrives at another ue 104 in the network, and there are at least two transmission paths. In the existing network layering, each layer is provided with a plurality of routers, and the routers are connected with each other and at least one router of the previous layer. Thus, the complex network referred to in this embodiment is still the same as the normal network in terms of logical structure. The best way is a computer network constructed in accordance with the OSI model.

The OSI model divides computer network architecture into the following seven layers: physical layer: converting the data into an electronic signal that can be transmitted over a physical medium; data link layer: determining a mode of accessing the network medium; framing data and processing flow control at this layer, specifying topology and providing hardware addressing at this layer; network layer: the usage rights data router is over a large network; transmission layer: providing a reliable terminal-to-terminal connection; session layer: allowing a user to establish a connection using a simple and easy-to-remember name; representation layer: negotiating a data exchange format; application layer: an interface between the user's application and the network.

The technical scheme of the embodiment is applied to a data link layer, wherein the data link layer is a communication network formed by a plurality of routers which are mutually connected. The OSI model divides a network into zones, the zone types including backbone zones and general zones. To achieve the division of areas, routers operating in a network are classified into the following types: the Level1 router is a router in a common area and is not connected to another area; the LeveL1-2 router 102 is a router that connects different general or backbone areas; the LeveL2 router 101 is a backbone router that is not connected to other areas. As shown in fig. 1, a schematic diagram of a topology of a computer network established using the OSI model is provided. The Level1 router is connected with the user end 104, and receives the traffic sent by the user end 104, i.e. the IP message. The Level1 router connects to multiple clients 104, and Level1 routers in the same general area can be connected to each other, but not to routers in other areas. Each common area is at least provided with a plurality of LeveL1-2 routers 102, the LeveL1-2 routers 102 are connected with a plurality of LeveL1 routers 103, and the LeveL1 routers 103 connected with the LeveL1-2 routers 102 can be located in one area or in a plurality of areas. The LeveL1-2 router 102 is connected to the LeveL2 router 101, and the LeveL2 router 101 is connected only to the LeveL1-2 router 102 or other LeveL2 routers 101 for establishing backbone areas. Notably, leveL1 router 103, leveL1-2 router 102, and LeveL2 router 101 refer only to logical divisions in the network topology and are not differences in router hardware architecture. The LeveL1 router 103, leveL1-2 router 102, and LeveL2 router 101 may be identical in hardware configuration, except for performing different functions in the OSI model. Of course, for better performance of functions in the OSI model, leveL1 router 103, leveL1-2 router 102, and LeveL2 router 101 may be optimized for pertinence in hardware.

In the present embodiment, the LeveL1 router 103 includes a router 3A, a router 3B, a router 3C, a router 3D, a router 3E, and a router 3F. LeveL1-2 router 102 includes router 2A, router 2B, router 2C, router 2D, router 2E, router 2F, router 2G, and router 2h, and LeveL2 router 101 includes router 1A and router 1B. The clients 104 include a client 4A, a client 4B, a client 4C, a client 4D, and a client 4E. In this embodiment, the LeveL1 router 103 is directly connected to the client 104. The LeveL1 router 103 may be implemented using either a router or a switch having an intelligent function. The implementation that the present embodiment recommends to use is implemented using a fourth tier switch. The fourth layer of exchanger can complete end-to-end exchange and can determine or limit exchange flow according to the application characteristics of the port host. Briefly, the fourth layer of switch is a switching process based on the transport layer IP packet, and is a new type of switch based on the user application switching requirement of the TCP/IP protocol application layer. The fourth layer switch supports all protocols below the TCP/UDP fourth layer and can identify the IP packet header length of at least 80 bytes. The application type of the IP message can be distinguished according to the TCP/UDP port number, thereby realizing access control and service quality assurance of an application layer.

The IEEE802.1P field of the IP message is used to prioritize the IP message itself differently than the second layer switch is used to prioritize the IP message itself differently than the itos field is used to prioritize the IP message itself. The fourth layer exchanger exchanges data based on the IP message, and the fourth layer exchanger can analyze the application type of the IP message according to the TCP/UDP port number and prioritize the IP message. Namely, the fourth-layer switch not only completely has all switching functions and performances of the third-layer switch, but also supports intelligent functions of network traffic and service quality control which the third-layer switch cannot have.

On the other hand, the LeveL1 router 103 may be connected to a gateway of a user instead of directly connected to the client 104, the gateway is connected to a plurality of clients 104, and the gateway may be implemented by a switch. The gateway at this time can employ a first layer switch, a second layer switch, or a third layer switch. The gateway submits only the IP message of the client 104 to the LeveL1 router 103, and forwards the IP message sent by the LeveL1 router 103 to the corresponding client 104.

The router and the fourth-layer switch can analyze the application type of the IP message according to the TCP/UDP port number and prioritize the IP message. In this embodiment, the intelligent switching of the network path not only considers the load rate of the router or the switch in the path, but also considers the priority of the IP packets queued on the router and the switch in the path. Because of the router or switch, the load rate is lower, although the number of IP messages currently queued is smaller. However, if the IP packets with high priority occupy a relatively large amount, the IP packets with low priority still need to wait a long time when they are transmitted to these routers or switches. Therefore, the network path optimization considering the priority situation is more scientific. The embodiment aims to reduce the transmission time of the IP message on the network, and belongs to the QoS field.

The present embodiment also relates to MQC technology, and QoS, vlan and MQC are described in relation thereto. vlan (virtual LAN) virtual local area network is a logical group of users connected on physical devices that are not limited by physical location. In a typical switching network, when a host sends a broadcast frame or unknown unicast frame, the data frame is flooded and even passed throughout the broadcast domain. The larger the broadcast domain, the more serious the network security problem and the garbage flow problem are generated. For this purpose vlan technology is used. The virtual local area network vlan may isolate the broadcast domain. The specific implementation method comprises the following steps: there are many ports on the switch, each port is connected with a different host, different ports are allocated to different vlan, different virtual local area networks are distinguished by using vlan ID, and direct communication between different vlan is not possible. A port with vlan ID 10, for example, can send a message to a port with vlan ID 10 of another switch, but cannot send a message to a port with vlan ID 20. Logical traffic partitioning can be achieved by vlan IDs.

The guarantee of QoS is important for capacity limited networks, especially for streaming multimedia applications, such as Vo messages and message TV, since these applications often require a fixed transmission rate and are also relatively delay sensitive. When the network is congested, all data flows are likely to be discarded; in order to meet the requirements of users for different service qualities of different applications, it is required that the network can allocate and schedule resources according to the requirements of users, and provide different service qualities for different data flows: the data messages with strong real-time performance and importance are processed preferentially; for the common data message with weak real-time performance, lower processing priority is provided, and even the common data message is discarded when the network is congested. When the flow difference processing is realized, the MQC technology is needed.

MQC (Modular QoS), modular QoS command line interface. MQC is a configuration method that accomplishes the configuration of QoS traffic by configuring flow classification, flow behavior, flow policy, and applying flow policy. Configuring the MQC comprises the steps of: configuration flow classification, configuration flow behavior, configuration flow policy, and application flow policy. Specifically, the flow classification is configured: flow classification is used to define a set of flow matching rules for classifying IP messages. A stream class is created using the traffic classifier classifier-name command and entered into the stream class view where matching rules are defined by the ifmatch beginning command. For example, the following code realizes matching of traffic with vlan ID of 10.

<HUAWEI>system-view

HUAWEI traffic classifier c// creates a flow class c1 and enters a flow class view

[ HUAWEI-customer-c 1] if-match VLAN-ID 10// in flow classification, specify an IP message with a matching VLAN ID of 10

[ HUAWEI-classifier-c1] quick// return to System View

Flow behavior is configured and popularity is used to define actions to be taken on certain types of messages, such as IP message filtering, redirection, traffic policing, traffic statistics, etc. Stream behavior is created using traffic behavior behavior-name commands and entered into a stream behavior view, with actions defined by deny, permit, redirect, car, remark, etc. commands under the popular view. For example, the following code implements popularity of traffic statistics.

HUAWEI traffic behavior b// create stream behavior b1 and enter stream behavior View

[ HUAWEI-behavir-b 1] statistical enable// in popularity, specify performing traffic statistics actions

[ HUAWEI-behavior-b1] quist// return to System View

And configuring a flow strategy, and binding the appointed flow classification and the appointed flow behavior in the flow strategy to realize that the action defined in the corresponding flow behavior is executed on the classified IP message. Applying a flow policy: the flow policy is applied to the global, interface or VLAN. After applying the flow policy, the device will perform actions in the flow behavior on IP messages that pass through the global, interface or VLAN and match the flow classification rules. One flow policy can be applied globally, per interface, or per direction per VLAN. When the traffic-policy command is executed under the interface view, the system view or the VLAN view to apply the policy, policy control needs to be implemented on an ingress direction message (i.e. a message received by the device) or an egress direction message (i.e. a message sent by the device) through the parameter inbound or outbound designation. The DSCP priority simultaneously constrains the router to discard the IP packet, and when the DSCP priority is higher than a preset threshold, the IP packet is not allowed to be discarded, but when the DSCP priority is lower than or equal to the preset threshold, such IP packet may be discarded by the router or the switch when the router is crowded. The higher DSCP priority is matched by the higher flow with higher packet loss and delay requirements for video signals, voice calls and the like. And matching the flows with low requirements on packet loss and delay, such as file transmission, with low DSCP priority. When the network is crowded, the transmission of the flow of the video signal and the voice call is preferably ensured, the network use experience satisfaction degree of the user is improved, and the QoS is ensured.

The IP message suitable for the embodiment realizes the IP message of DSCP priority mark for adding the relevant mark in the IP message head. By means of the newly added identification information in the IP message header and the improved heartbeat packet, intelligent switching of network paths is realized.

Referring to fig. 2, the intelligent non-inductive switching method for network paths provided in this embodiment includes the following steps:

step A01) periodically exchanging heartbeat packets among routers in the network, wherein the heartbeat packets record the IP address and the load factor parameter of the router of each hop when being transmitted in the network;

step A02), each router in the network establishes a load sensing table, and the load sensing table records IP addresses and load rate parameters of other routers received by the router;

step A03), each router in the network establishes a path table, and at least one forwarding path of a target IP section is obtained according to each router of each hop when a heartbeat packet is transmitted in the network and stored in the path table;

step A04), each router in the network calculates the heartbeat delay of each routing table according to the heartbeat packet, and records the heartbeat delay in the routing table;

step A05), when the IP message reaches each hop router along the forwarding path, the router reads the heartbeat delay of a routing table item corresponding to the forwarding path and the load rate parameter of each hop router on the subsequent forwarding path, and obtains the current estimated time consumption of the forwarding path according to the heartbeat delay and the load rate parameter;

Step A06) if the estimated time consumption exceeds the preset threshold, the router re-searches the forwarding path with the least estimated time consumption to replace the current forwarding path, otherwise, if the estimated time consumption does not exceed the preset threshold, the router does not operate;

step A07) obtaining the IP address of the next-hop router, and sending the IP message to the next-hop router until the IP message reaches the target IP address.

The router establishes a routing table, the routing table records a plurality of routing table entries, and the routing table stores the contents of the mark information of the subnet, the number of routers on the network, the name of the next router and the like. The destination field of each routing table entry contains a destination network prefix. Second, each entry has an additional field, and a Subnet Mask (Subnet Mask) for specifying the number of network prefix bits. When the next hop field represents a router, the value of the next hop field uses the IP address of the router. Such as routing table entries: destination address 92.154.20.34, subnet mask 255.255.128.0, priority 3, cost 4, output port 2, next hop 103.26.30.95. Routing table entry: 105.26.104.30-105.26.231.52 destination address, 255.255.64.0 subnet mask, 2 priority, 3 cost, 4 output port, 103.26.30.95 next hop. The two routing table entries respectively indicate that when the destination address is 92.154.20.34 or the destination address falls into the IP section 105.26.104.30-105.26.231.52, the IP packet can be sent to the next hop router with the IP address 103.26.30.95. Forwarding is continued by the next hop router. Cost 3 indicates that a total of 3 routers, including the next hop router, are required to forward to reach the destination address. But the IP address of the router of the last two hops cannot be known from the routing table alone. If the load rate is too high or the fault exists in the two latter routers, the forwarding paths cannot be replaced in time. Can only be discovered and processed by the next hop router.

In the prior art, the forwarding paths of the same target IP segment are typically fixed. The routers intermittently exchange information so that the routers know each other's address and the IP segments that can be reached. When one router does not always exchange information, the other router determines that the router is malfunctioning, and thus removes the routing table entry related to the router from the routing table. If a certain target IP segment and other routing table items can reach after deleting the routing table items, the IP message of the target IP segment can generate a path switching result. But such path switching is a passive switching based on the consideration that it is still as far as possible to reach and as few hops of the router as possible. The embodiment establishes a load sensing table and a path table in the router on the basis of improving the heartbeat packet. The specific network path is recorded by means of the path table, and the router IP address of each hop on the network path is included. Compared with the prior art that the routing table entry only records the IP address of the next hop router in the network path, the method described in the embodiment records the network path in more detail.

In this embodiment, after the IP address of each hop router of the network path is recorded in the path table, the load factor parameters of as many routers as possible in each network are recorded by the load sensing table. And comprehensively judging whether the path needs to be switched or not according to the hop count of the network path and the current load factor parameter of the router in the path. Whether the path needs to be switched is judged by combining the heartbeat delay of the whole path and the load rate parameter of each router on the path, and the estimated time consumption of obtaining the forwarding path is calculated together. When the estimated time consumption of the forwarding paths exceeds a threshold value, automatically searching the forwarding path with the least estimated time consumption in all reachable network paths.

Referring to fig. 3, the method for periodically exchanging heartbeat packets includes the following steps:

step B01), a router in the network periodically generates a heartbeat packet of the router, wherein the heartbeat packet comprises an IP address, a direct connection IP section, a load rate parameter, a heartbeat time stamp and a forwarding path, and the forwarding path is null when generated;

step B02) the router which generates the heartbeat packet sends the heartbeat packet to the directly connected router, and the router which receives the heartbeat packet forwards the heartbeat packet to the directly connected router and avoids returning the heartbeat packet;

step B03), the router for forwarding the heartbeat packet adds the IP address of the router and the forwarding time stamp into the forwarding path of the heartbeat packet during forwarding.

The heartbeat packet provided in this embodiment includes information required for establishing the load sensing table and the path table.

For example:

IP address: 20.151.32.59;

direct connection IP section: 20.151.0.0-20.151.203.255, 20.172.102.0-20.171.102.204;

load factor parameters: 70% of the total weight of the steel sheet;

heartbeat timestamp: 1689659321106;

forwarding path: 60.253.104.37.sub.16889659321211-92.0.45.139.sub.16889659321457-158.23.67.1.sub.1689321509.

When a router generating a heartbeat packet sends the heartbeat packet to other routers, the other routers will add their own IP addresses to the forwarding path. When the heartbeat packet passes through the forwarding of the routers, the subsequent routers can obtain the forwarding paths of the direct connection IP sections contained in the heartbeat packet by means of the forwarding paths of the heartbeat packet, so that a path table is established. For example, when the forwarding path is 60.253.104.37-92.0.45.139-158.23.67.1, any router that receives the heartbeat packet may pass through the forwarding path: 60.253.104.37-92.0.45.139-158.23.67.1-20.151.32.59, send IP messages to IP segment: 20.151.0.0 to 20.151.203.255 and IP segment: 20.172.102.0 to 20.171.102.204.

Referring to fig. 4, the method for establishing the path table includes the following steps:

step C01), traversing a routing table of the router, and trying to find a target IP section matched with the direct connection IP section recorded by the heartbeat packet;

step C02), if the destination IP section matched with the heartbeat packet exists in the routing table, copying the matched routing table item to the path table as a path item, and adding the direct connection IP section, the heartbeat time stamp, the forwarding time stamp and the forwarding path recorded by the heartbeat packet to the path item;

step C03), if the destination IP segment matched with the heartbeat packet does not exist in the routing table, ending the method.

For example, the routing table includes routing table entries: destination address 20.151.102.31, subnet mask 255.255.128.0, priority 3, cost 4, output port 2, next hop 60.253.104.37. The routing table entry can be copied down, and then the direct connection IP segment, the heartbeat time stamp, the forwarding time stamp and the forwarding path recorded by the heartbeat packet are added as path entries in the path table. The method comprises the following steps: path item: the method comprises the following steps of a destination address of 20.151.102.31, a subnet mask of 255.255.128.0, a priority of 3, a cost of 4, an output port of 2, a next hop of 60.253.104.37, a direct connection IP section of 20.151.0.0-20.151.203.255, 20.172.102.0-20.171.102.204, a heartbeat time stamp of 1689659321106, a forwarding time stamp and a forwarding path of 60.253.104.37|16889659321509-92.0.45.139|1616169659321457-158.23.67.1|16169659321211.

The embodiment provides a specific method for calculating the heartbeat delay, referring to fig. 5, the method for calculating the heartbeat delay of the routing table item includes the following steps:

step D01) inquiring a path table to try to obtain a path item matched with the IP section of the current route table item;

step D02), if a path item matched with the IP section of the current routing table item exists, calculating a difference value between a forwarding time stamp of the last hop of the heartbeat packet in the forwarding path and the heartbeat time stamp, and taking the difference value as the heartbeat delay of the path item;

step D03), if no path item matched with the IP section of the current routing table item exists, counting the number of forwarding routers contained in the forwarding path, and setting heartbeat delay as the product of the number of forwarding routers and a preset constant.

The current destination IP segment is: 20.172.102.126, then there is a conforming path item. Namely: the method comprises the following steps of a destination address of 20.151.102.31, a subnet mask of 255.255.128.0, a priority of 3, a cost of 4, an output port of 2, a next hop of 60.253.104.37, a direct connection IP section of 20.151.0.0-20.151.203.255, 20.172.102.0-20.171.102.204, a heartbeat time stamp of 1689659321106, a forwarding time stamp and a forwarding path of 60.253.104.37|16889659321509-92.0.45.139|169659321457-158.23.67.1|169659321211, and a heartbeat delay of a path item of 1689659321509-1689659321106 =403 ms.

The current destination IP is as follows: 107.11.21.206, no conforming path item exists. Assuming that the cost of the routing table entry corresponding to the destination IP is 3, that is, 3 times of router forwarding is required, 3×120ms=360 ms is taken as the heartbeat delay of the IP packet, where 120 is a value of a preset constant in this embodiment.

Referring to fig. 6, the load factor parameter includes a load factor of a router, and the method for obtaining estimated time consumption of a forwarding path includes the following steps:

e01) reading a path table and a load sensing table, obtaining the load rate of each router on a forwarding path, and calculating the average value of the load rates of the routers on the forwarding path;

step E02), inquiring a routing table to obtain heartbeat delay of a corresponding routing table item;

e03) if the average value of the load rates is larger than a preset threshold value, setting the estimated coefficient to be a preset value larger than 1, otherwise, setting the estimated coefficient to be equal to 1;

step E04) taking the product of the estimated coefficient and the heartbeat delay as estimated time consumption of the forwarding path.

When the path item corresponding to the routing table item is recorded as follows: heartbeat time stamp 1689659321106, forwarding time stamp and forwarding path 60.253.104.37|16889659321509-92.0.45.139|16889659321457-158.23.67.1|16889659321211. The heartbeat delay of the routing table entry is 403ms. If the average load rate of 3 routers on the forwarding path is 85%, the average load rate exceeds a preset threshold value of 75%. The heartbeat delay 403ms is multiplied by a preset estimated coefficient 1.2, so as to obtain the estimated time consumption of the forwarding path as 403×1.2=483.6 ms.

Referring to fig. 7, the method for establishing the load sensing table includes the following steps:

step F01), reading the IP address and the load rate parameter of the received heartbeat packet;

step F02) if the IP address does not exist in the load sensing table, establishing an entry by taking the IP address as an index, and storing the load rate parameter and the corresponding IP address in an associated manner to be used as a load sensing entry;

step F03) if the IP address exists in the load sensing table, updating the load rate parameter in the load sensing table by using the load rate parameter of the received heartbeat packet.

If there is no corresponding entry in the load sense table in the heartbeat packet with IP address 20.151.32.59 as described above, an entry is created with 20.151.32.59 as an index, and 70% of the load factor parameter is stored in association with the corresponding IP address 20.151.32.59, and the load factor parameter representing the router with IP address 20.151.32.59 is 70%. If so, the corresponding load factor parameter is modified to 70%.

The IP message comprises a DSCP priority mark and a cost function, wherein the cost function is a function of cost versus IP message waiting time, the IP message waiting time is obtained by respectively timing on each forwarding router, the load factor parameters comprise load factor, priority distribution index and cost distribution index, and the priority distribution index comprises priority distribution proportion of all queued IP messages when heartbeat packets are generated. When the router forwards the IP message, the router forwards the IP message with high priority, and forwards the IP message with high value with the same priority.

Referring to fig. 8, the method for generating the value distribution index includes the following steps:

g01) setting a time interval [0, T1] with the time of generating the heartbeat packet as 0, setting a preset constant value as T1, and setting a plurality of sampling points at equal intervals in the time interval [0, T1] as ti;

step G02) calculating the waiting time of each IP message in the time interval [0, T1], and recording as [ Tk1, tk2], wherein Tk1 is the waiting time of the kth IP message at the moment 0, and Tk2 is the waiting time of the kth IP message at the moment T1;

step G03), the value of the value function of all the queued IP messages in each waiting time interval [ Tk1, tk2 ];

step G04) obtaining the value degree of each IP message at a sampling point ti, and summing the value degrees at the same sampling point ti to be recorded as the total value degree at the sampling point ti;

step G05) obtaining the distribution proportion of the total value on the sampling points as a value distribution index.

In this embodiment, the value of T1 is 2s, that is, 2000ms, the sampling point interval is set to 0.2s, and 10 sampling points are set in total, which are denoted by T1 to T10. When the IP message generates the heartbeat packet, the waiting time is 0.02s, and the waiting time length [ Tk1, tk2] is [0.22s,2.02s ].

The cost function of the IP message is: x e [0, 1), y=6, x e [1, 2), y=4 x+6, x > 2, y=3. The value of the IP packet at 10 sampling points t1 to t10 is y1=6, y2=6, y3=6, y4=6, y5=10.08, y6=10.88, y7=11.68, y8=12.48, y9=13.28, and y10=3, respectively.

The cost function of all IP messages queued on the router is the cost at the sampling point ti within the respective waiting duration interval [ Tk1, tk2 ]. Summing the value of all the queued IP messages at t1 sampling points, summing the value of all the queued IP messages at t2 sampling points, and so on to obtain the total value of each sampling point, and further obtain the total value distribution proportion of each sampling point, wherein the proportion is used as a value distribution index.

When the total value is more distributed from t8 to t10 and the distribution from t1 to t3 is relatively less, the value of the IP message in 0.6s from the current moment of the router is lower, but the value of the IP message queued gradually increases with the time. Therefore, when sending the IP packet to the router, it is preferable to send the IP packet with a higher value of the value function, because the value of the queued IP packet is overall higher when the IP packet arrives at the router.

Correspondingly, when the total value is more distributed from t1 to t3 and the distribution from t8 to t10 is relatively less, the value of the IP message in 0.6s from the current moment of the router is higher, but the value of the IP message remained in the queue gradually decreases as the IP message already queued is sent out. At this time, the IP packet with a lower cost function value may be sent to the router, because the cost function value of the queued IP packet will be overall lower when arriving.

Referring to fig. 1 again, the ue 104 a sends an IP packet to the ue 104 e, and the forwarding path is: 4A-3C-2A-1A-1B-2H-3F-4E. For ease of understanding, it is assumed that router 2H is always busy and the remaining routers are moderately loaded. The next hop of the path plan for the lowest estimated time taken by the router 3C computation will be 2A when the IP packet arrives at the router 3C. The same 1A will only forward IP messages to 1B. But when router 1B is reached, router 1B will be able to find forwarding paths 2F-3D-3F-4E and forwarding paths 2G-3E-3F-4E, compared to forwarding paths 2H-3F-4E, 2F-3D-3F-4E and forwarding paths 2G-3E-3F-4E, which are less time consuming than the predictions of forwarding paths 2H-3F-4E. Therefore, a forwarding path which is estimated to take shorter time is selected from the forwarding paths 2F-3D-3F-4E and the forwarding paths 2G-3E-3F-4E to forward the IP message. Although the number of final forwarding path hops increases, the congested router 2H is avoided.

On the other hand, the embodiment provides obtaining the estimated time consumption of the current forwarding path according to the heartbeat delay and the load factor parameters. Specifically, referring to fig. 9, the method for obtaining estimated time consumption of the forwarding path includes the following steps:

Step H01), obtaining the load rate, the priority distribution index and the value distribution index of each router on the forwarding path;

step H02), setting a first coefficient, a second coefficient and a third coefficient, wherein initial values of the first coefficient, the second coefficient and the third coefficient are all 1;

step H03), calculating the average value of the load rate of the router on the forwarding path, if the average value of the load rate is larger than a preset threshold value, setting the first coefficient to be a preset value larger than 1, otherwise, not adjusting the value of the first coefficient;

step H04) reading priority distribution indexes of all routers on a forwarding path, and obtaining a priority average distribution ratio on the forwarding path according to the priority distribution indexes of all routers on the forwarding path, wherein if the priority of the IP message is in the first N1% in the priority average distribution ratio, the value of the second coefficient is not adjusted, otherwise, if the priority of the IP message is not in the first N1% in the priority average distribution ratio, the second coefficient is set to be a preset value larger than 1;

step H05) reading the value distribution indexes of all routers on the forwarding path, obtaining a value average distribution ratio on the forwarding path according to the value distribution indexes of all routers on the forwarding path, if the value maximum value of the IP message is in the first N2% in the value average distribution ratio, not adjusting the value of the third coefficient, otherwise, if the value maximum value of the IP message is not in the first N2% in the value average distribution ratio, setting the third coefficient to be a preset value larger than 1.

In this embodiment, under the condition of combining the value degree distribution index, if the router 1B finds that the router 2H is busy, i.e. the load rate is higher, the value degree distribution index indicates that the overall value degree of the IP packet on the router 2H is lower. Although the load rates of the router 2F and the router 2G are not high, the value of the IP packets queued thereon is overall high. At this time, the liquid crystal display device, if the value of the cost function of the IP packet to be forwarded by router 1B is high, the forwarding path with the shortest estimated time consumption obtained by calculation will be 2H-3F-4E. Specifically, when the value maximum value of the IP packet is N2% before in the value average distribution ratio, the value of the third coefficient is not adjusted, otherwise, if the value maximum value of the IP packet is not N2% before in the value average distribution ratio, the third coefficient is set to be a preset value greater than 1. Thus, the estimated time consumption of the forwarding paths 2F-3D-3F-4E and 2G-3E-3F-4E is amplified by multiplying the third coefficient, but the forwarding paths 2H-3F-4E are not amplified, so that the router 1B still sends the IP packet to the router 2H. Likewise, the priority assignment index can be used in conjunction with priority to adjust the estimated time consumption of the forwarding path. The priority and the value degree are two dimensions considering the forwarding order of the IP message.

In another aspect, referring to fig. 10, an embodiment of the present application provides an embedded system 300, where the embedded system 300 includes a memory 301, a processor 303, and an embedded program 302 stored in the memory 301 and capable of running on the processor 303, and the embedded program 302 implements a method as described above when executed by the processor 303.

The embedded system 300 may be a general purpose embedded system 300 or a special purpose embedded system 300. In a specific implementation. It will be appreciated by those skilled in the art that fig. 10 is merely an example of an embedded system 300 and is not meant to be limiting as the embedded system 300 may include more or fewer components than shown, or may combine certain components, or may include different components, such as may also include input-output devices, network access devices, etc.

The processor 303 may be a central processing unit (Central Processing Unit, CPU), the processor 303 may also be other general purpose processors 303, digital signal processors 303 (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), off-the-shelf programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. The general purpose processor 303 may be a microprocessor 303 or may be any conventional processor 303.

Memory 301 may be an internal storage unit of embedded system 300, such as RAM, in some embodiments. The memory 301 may also be an external storage device of the embedded system 300 in other embodiments, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card), etc. Further, the memory 301 may also include both internal storage units and external storage devices of the embedded system 300. The memory 301 is used to store an operating system, application programs, boot Loader (Boot Loader), data, and other programs. The memory 301 may also be used to temporarily store data that has been output or is to be output.

In another aspect, an embodiment of the present application provides a readable storage medium storing an embedded program 302, where the embedded program 302 implements a method as described above when executed by a processor 303.

The above is only a specific embodiment of the present application, but the scope of the present application is not limited thereto, and it should be understood by those skilled in the art that the present application includes but is not limited to the accompanying drawings and the description of the above specific embodiment. Any modifications which do not depart from the functional and structural principles of the present application are intended to be included within the scope of the appended claims.

While the invention has been described in terms of embodiments, it will be appreciated by those skilled in the art that the invention is not limited thereto but rather includes the drawings and the description of the embodiments above. Any modifications which do not depart from the functional and structural principles of the present invention are intended to be included within the scope of the appended claims.

Claims

1. A network path intelligent non-inductive switching method is characterized in that,

the method comprises the following steps:

periodically exchanging heartbeat packets among routers in the network, wherein the heartbeat packets record the IP address and the load rate parameter of each hop of router when the heartbeat packets are transmitted in the network;

each router in the network establishes a path table, and at least one forwarding path of a target IP section is obtained according to each router of each hop when a heartbeat packet is transmitted in the network and stored in the path table;

when an IP message reaches each hop router along a forwarding path, each hop router reads the heartbeat delay of a routing table item corresponding to the forwarding path and the load rate parameter of each hop router on a subsequent forwarding path, and obtains the current estimated time consumption of the forwarding path according to the heartbeat delay and the load rate parameter;

2. The intelligent non-inductive switching method of network paths according to claim 1, wherein,

the method for periodically exchanging heartbeat packets comprises the following steps:

the router which generates the heartbeat packet sends the heartbeat packet to the directly connected router, and the router which receives the heartbeat packet forwards the heartbeat packet to the directly connected router and avoids returning the heartbeat packet;

when forwarding, the router forwarding the heartbeat packet adds the IP address of the router and the forwarding time stamp into the forwarding path of the heartbeat packet.

3. The intelligent non-inductive switching method of network paths according to claim 2, wherein,

The method for establishing the path table comprises the following steps:

if the route table has a destination IP section matched with the heartbeat packet, copying the matched route table item to the route table as a route item, and adding the direct connection IP section, the heartbeat time stamp, the forwarding time stamp and the forwarding route recorded by the heartbeat packet to the route item;

if the destination IP section matched with the heartbeat packet does not exist in the routing table, the method is ended.

4. The intelligent non-inductive switching method of claim 3, wherein,

the method for calculating the heartbeat delay of the routing table item comprises the following steps:

if a path item matched with the IP section of the current routing table item exists, calculating a difference value between a forwarding time stamp of the last hop of the heartbeat packet in the forwarding path and the heartbeat time stamp, and taking the difference value as the heartbeat delay of the path item;

5. The intelligent non-inductive switching method of claim 4, wherein,

the load factor parameter comprises the load factor of a router, and the method for obtaining the estimated time consumption of the forwarding path comprises the following steps:

inquiring a routing table to obtain heartbeat delay of a corresponding routing table item;

6. A network path intelligent non-inductive switching method as claimed in any one of claims 2 to 5, wherein,

the method for establishing the load sensing table comprises the following steps:

And if the IP address exists in the load sensing table, updating the load rate parameter in the load sensing table by using the load rate parameter of the received heartbeat packet.

7. A network path intelligent non-inductive switching method as claimed in any one of claims 1 to 4, wherein,

the IP message comprises a DSCP priority mark and a cost function, the cost function is a function of cost to IP message waiting time, the IP message waiting time is obtained by respectively timing on each forwarding router, the load factor parameters comprise load factor, priority distribution index and cost distribution index,

8. The intelligent non-inductive switching method of claim 7, wherein,

obtaining the current estimated time consumption of the forwarding path according to the heartbeat delay and the load factor parameters;

9. An embedded system, wherein the embedded system is run on a router in a network, the embedded system comprising a memory, a processor, and an embedded program stored in the memory and executable on the processor, the embedded program when executed by the processor implementing a network path intelligent non-inductive switching method according to any of claims 1 to 8.

10. A computer-readable storage medium, wherein the computer-readable storage medium stores an embedded program, which when executed by a processor, implements a network path intelligent non-inductive switching method according to any one of claims 1 to 8.