A navigation path calculation method based on network protocol simulation

Abstract

The application discloses a navigation path calculation method based on network protocol simulation, which comprises the following steps: a control node reads road and IPv6 address corresponding information of a data storage node, and issues an initial network model and an initial configuration to a protocol simulation node; the protocol simulation node builds a network model according to the issued information; an input and output node modifies control node parameters through input information; the input and output node outputs a source position and a destination position of a path to be queried to the control node; the control node reads road and IPv6 address corresponding information of the data storage node, converts the information into IPv6 addresses, reversely looks up IPv6 address information corresponding to the destination position at the node of the source position, obtains whole IPv6 node information, looks up corresponding information of the data storage node, outputs road planning, and sends the input and output node. The application simulates road conditions based on an IPv6 network routing protocol, constructs a road model, calculates a simulation path through the routing protocol, and outputs an actual navigation path according to the simulation path.

Description

Technical Field

[0001] This invention relates to the field of navigation, and in particular to a navigation path calculation method based on network protocol simulation. Background Technology

[0002] With the development of computer technology and artificial intelligence, autonomous vehicles have broad application prospects in transportation, military, logistics and warehousing, and daily life. Path planning is a key part of autonomous driving technology. Based on environmental data from the perception system, the vehicle needs to plan a safe, reliable, and shortest collision-free path from the starting position to the target position in complex road environments based on certain performance indicators.

[0003] With the development of artificial intelligence systems, shortest path algorithms have become a research hotspot in computer science and geographic information science. The effective combination of classical graph theory algorithms and continuously evolving computer data structure algorithms has led to the emergence of new shortest path algorithms. Depending on different network characteristics, application requirements, and specific hardware and software environments, various shortest path algorithms have their own characteristics in terms of space complexity, time complexity, ease of implementation, and application scope. Shortest path algorithms based on geographic information systems are involved in many fields, and different algorithms exist for different environments.

[0004] However, regardless of how the algorithm changes, a large amount of calculation based on terrain, road conditions, etc. is unavoidable, and different algorithms do not have universality.

[0005] The modeling of roads and the algorithm for path calculation are important parts of navigation path calculation. The development of IPv6 technology has made it feasible to encode roads using IPv6. Therefore, the structure of roads can also be modeled using IPv6-based networks. Summary of the Invention

[0006] To address the problems existing in the prior art, this invention provides a navigation path calculation method based on network protocol simulation. The method uses IPv6 network routing protocols to simulate road conditions, constructs a road model, calculates the simulated path through the routing protocol, and outputs the actual navigation path based on the simulated path.

[0007] To achieve the above objectives, the present invention adopts the following technical solution:

[0008] In one embodiment of the present invention, a navigation path calculation method based on network protocol simulation is proposed, the method comprising:

[0009] S01, The control node reads the road and IPv6 address correspondence information of the data storage node;

[0010] S02. The control node generates the network structure and initial IPv6 protocol configuration based on road information and IPv6 information, including IGP protocol and its cost, BGP route sending and receiving information, and distributes it to the protocol simulation node.

[0011] Furthermore, the protocol simulation node simulates road information as an IPv6 network.

[0012] Further, S02 includes:

[0013] S021. Each main road is simulated as an autonomous system region and assigned a 4-byte AS number, i.e., the autonomous system number.

[0014] S022. Each road intersection is simulated as a network device node, serving as an ASBR, or Autonomous System Border Router.

[0015] S023. The IGP protocol, i.e., the Interior Gateway Protocol, is used within the autonomous system.

[0016] S024. Simulate the incoming and outgoing directions of each road separately, set the cost in the direction of traffic flow as needed, and set the cost in the opposite direction to the maximum.

[0017] S025. The road U-turn point is simulated as a network node. The network nodes simulated in the incoming and outgoing directions are connected by links to simulate the U-turn. The forward cost is set as needed, and the reverse cost is set to infinity.

[0018] Furthermore, in S025, the simulated network node can turn around on both sides, with two links set up respectively;

[0019] S026. Cross-routing is simulated as a link connection, and the IPv6 routing guidance path is sent via the BGP protocol.

[0020] S03. The protocol simulation node generates a network model based on the network structure and initial configuration issued by the control node, and calls the initial configuration. The initial configuration includes device IPv6 addresses, link and port IPv6 addresses, IGP protocol and initial overhead, BGP protocol and initial route advertising and acceptance.

[0021] S04. Input and output nodes adjust the network structure, IGP protocol costs, BGP protocol route advertising and acceptance, and send the information to the control node through input information.

[0022] Furthermore, the control node is responsible for receiving instructions from the input / output nodes, issuing initialization configurations for the simulated network nodes in the simulated network, and modifying the configurations of the simulated nodes.

[0023] S05. The control node sends this information to the protocol simulation node, which then modifies the network model based on the information.

[0024] S06. When an input / output node needs to query a path, it submits a query request to the control node.

[0025] S07. The control node converts the source and destination locations into IPv6 addresses for the source and destination nodes through the data storage node.

[0026] Furthermore, the data storage node stores the IPv6 address and the corresponding road name and number in the specific map, the distance from the road's starting point, and GPS positioning information.

[0027] S08. The control node queries the route to the destination IPv6 address on the network node to which the source IPv6 address belongs, and continues to query the route to the destination IPv6 address on the next hop node found, thus obtaining the IPv6 addresses of all network nodes that lead to the destination IPv6 address.

[0028] S09. The control node obtains the actual path nodes corresponding to the network node IPv6 addresses that are passed through to reach the destination IPv6 address by querying the data storage node.

[0029] Further, S09 includes:

[0030] S091. Set the number of best and second-best routes advertised by the BGP protocol to provide multiple path options.

[0031] If each BGP publishes multiple routes, the source end can obtain multiple paths to output to the input and output nodes.

[0032] If the source node and the destination node are on the same path, the path to the destination address can be obtained through the IGP protocol.

[0033] S092. By default, the fewer roads a path planning process traverses, the higher its priority.

[0034] S093. When manual intervention is required, the number of ASs is not compared at the control node. The total cost of the path is calculated using the MED (Multi-Exit Authentication) value of the BGP protocol to determine the priority.

[0035] Furthermore, the MED value of the BGP protocol is: the MED (Multiple Exit Authentication) value when the BGP protocol publishes IPv6 routes, which is the cost from the device to the network device publishing the route plus the MED value of the published route;

[0036] Furthermore, the total cost of the calculated path is: the MED value of the destination IPv6 route queried on the source node device plus the cost of the first hop device equals the total cost of the entire link. This value is the total cost of the path planning. The smaller the total cost, the higher the priority of the path.

[0037] S010, the control node returns the actual path node to the input / output node, thus obtaining the path planning information.

[0038] Furthermore, the input / output node receives input from the user, sends instructions to the control node, reads the network node IPv6 information output by the control node, searches for data storage node data, and outputs the actual road path information.

[0039] In one embodiment of the present invention, a computer device is also proposed, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the aforementioned navigation path calculation method based on network protocol simulation.

[0040] In one embodiment of the present invention, a computer-readable storage medium is also provided, which stores a computer program that performs a navigation path calculation method based on network protocol simulation.

[0041] Beneficial effects:

[0042] This invention provides a navigation path calculation method based on network protocol simulation that combines IPv6 technology with road model construction. It uses the common IPv6 network protocol for path querying and planning. It has better universality in road model construction and does not require complex algorithm support for path calculation. Instead, it is based on the common IPv6 network routing protocol, making path calculation simpler. Attached Figure Description

[0043] Figure 1 This is a schematic diagram of a U-turn lane in the road modeling process using IPv6 in this invention;

[0044] Figure 2 This is a schematic diagram of the network simulation of U-turn lanes in the road model construction using IPv6 in this invention;

[0045] Figure 3 This is a schematic diagram of the flow direction at intersections in the road modeling process using IPv6 in this invention;

[0046] Figure 4 This is a schematic diagram of the intersection flow network simulation in the road model construction using IPv6 in this invention;

[0047] Figure 5 This is a schematic diagram of the navigation path calculation method based on network protocol simulation of the present invention;

[0048] Figure 6 This is a schematic diagram of a computer device structure according to an embodiment of the present invention. Detailed Implementation

[0049] The principles and spirit of the present invention will now be described with reference to several exemplary embodiments. It should be understood that these embodiments are provided merely to enable those skilled in the art to better understand and implement the present invention, and are not intended to limit the scope of the present invention in any way. Rather, these embodiments are provided to make this disclosure more thorough and complete, and to fully convey the scope of this disclosure to those skilled in the art.

[0050] Those skilled in the art will recognize that embodiments of the present invention can be implemented as a system, apparatus, device, method, or computer program product. Therefore, this disclosure can be specifically implemented in the following forms: entirely hardware, entirely software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0051] According to an embodiment of the present invention, a navigation path calculation method based on network protocol simulation is proposed. The method simulates road conditions based on the IPv6 network routing protocol, constructs a road model, obtains the simulated path through the routing protocol calculation, and outputs the actual navigation path based on the simulated path.

[0052] The principles and spirit of the present invention will be explained in detail below with reference to several representative embodiments.

[0053] This invention relates to a navigation path calculation method based on network protocol simulation, the method comprising:

[0054] Define the following device types:

[0055] The protocol simulation node simulates road information as an IPv6 network;

[0056] The control node is responsible for receiving instructions from the input / output nodes, issuing initialization configurations for the simulated network nodes in the simulated network, modifying the configurations of the simulated nodes, and modifying the IGP and BGP protocols.

[0057] Data storage nodes are responsible for storing IPv6 addresses and the corresponding road names and numbers, distances from the road start point, and GPS positioning information of roads in the specific map. Input / output nodes are responsible for user input, issuing instructions to the control node, reading the IPv6 information of the network nodes output by the control node, searching for data in the data storage nodes, and outputting the actual road path information.

[0058] The road model is constructed using IPv6 as follows:

[0059] Each main road is simulated as an autonomous system region and assigned a 4-byte AS number (Autonomous System Number);

[0060] Each road intersection is simulated as a network device node, serving as an ASBR (Autonomous System Border Router);

[0061] The IGP protocol (Interior Gateway Protocol) is used within the autonomous system;

[0062] Each road is simulated separately for the incoming and outgoing directions. The cost in the direction of traffic flow is set as needed, while the cost in the opposite direction is set to the maximum.

[0063] The road U-turn point is simulated as a network node. The incoming and outgoing network nodes are connected by links to simulate the U-turn. The forward cost is set as needed, and the reverse cost is set to infinity. If U-turns are possible on both sides, two links are set for each.

[0064] Cross-routing is simulated as a link connection, and IPv6 routing guidance paths are sent via the BGP protocol.

[0065] The steps for creating each role are as follows:

[0066] 1. The control node reads the road and IPv6 address correspondence information of the data storage node, and sends the initial network model and initial configuration to the protocol simulation node, such as network structure, data device IPv6 address, initial link cost, BGP route sending and receiving.

[0067] 2. The protocol simulation node builds a network model based on the information sent by the control node, performs initial configuration of network devices, IGP and BGP protocols, and sends and receives IPv6 routes.

[0068] 3. Input / output nodes modify the control node's IPv6 address, IGP link cost, and BGP route sending and receiving parameters using input information, and then distribute this information to the protocol simulation nodes via the control node. Input / output nodes output the source and destination locations of the queried path to the control node. The control node reads the road and IPv6 address mapping information from the data storage node, converts it to IPv6 addresses, and obtains the complete IPv6 node information by reverse-searching the destination IPv6 address information at the source node. Finally, by searching the corresponding information in the data storage node, it outputs a road plan and returns this road plan to the input / output nodes.

[0069] It should be noted that although the operation of the method of the present invention has been described in a specific order in the above embodiments and figures, this does not require or imply that the operations must be performed in that specific order, or that all the operations shown must be performed to achieve the desired result. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined into one step, and / or one step may be broken down into multiple steps.

[0070] To provide a clearer explanation of the above-described navigation path calculation method based on network protocol simulation, a specific embodiment will be used for illustration below. However, it is worth noting that this embodiment is only for better illustrating the present invention and does not constitute an improper limitation of the present invention.

[0071] like Figure 5 As shown, the method includes:

[0072] S01, The control node reads the road and IPv6 address correspondence information of the data storage node;

[0073] S02. The control node generates the network structure and initial IPv6 protocol configuration based on road information and IPv6 information, including IGP protocol and its cost, BGP route sending and receiving information, and distributes it to the protocol simulation node.

[0074] The protocol simulates nodes, simulating road information as an IPv6 network.

[0075] S02 includes:

[0076] S021. Each main road is simulated as an autonomous system region and assigned a 4-byte AS number, i.e., the autonomous system number.

[0077] S022. Each road intersection is simulated as a network device node, serving as an ASBR, or Autonomous System Border Router.

[0078] S023. The IGP protocol, i.e., the Interior Gateway Protocol, is used within the autonomous system.

[0079] S024. Simulate the incoming and outgoing directions of each road separately, set the cost in the direction of traffic flow as needed, and set the cost in the opposite direction to the maximum.

[0080] like Figure 1 , Figure 2 As shown, S025, the road U-turn point is simulated as a network node. The network nodes simulated in the incoming and outgoing directions are connected by links to simulate U-turns. The forward cost is set as needed, and the reverse cost is set to infinity.

[0081] In S025, the simulated network nodes can both turn around, with two links set up on each side;

[0082] like Figure 3 , Figure 4 As shown, S026 and cross-routes are simulated as link connections, and IPv6 routing guidance paths are sent via the BGP protocol.

[0083] S03. The protocol simulation node generates a network model based on the network structure and initial configuration issued by the control node, and calls the initial configuration. The initial configuration includes device IPv6 addresses, link and port IPv6 addresses, IGP protocol and initial overhead, BGP protocol and initial route advertising and acceptance.

[0084] S04. Input and output nodes adjust the network structure, IGP protocol costs, BGP protocol route advertising and acceptance, and send the information to the control node through input information.

[0085] The control node is responsible for receiving instructions from the input / output nodes, issuing initialization configurations for the simulated network nodes, and modifying the configurations of the simulated nodes.

[0086] S05. The control node sends this information to the protocol simulation node, which then modifies the network model based on the information.

[0087] S06. When an input / output node needs to query a path, it submits a query request to the control node.

[0088] S07. The control node converts the source and destination locations into IPv6 addresses for the source and destination nodes through the data storage node.

[0089] Data storage nodes store IPv6 addresses and the corresponding road names and numbers on specific maps, distances from the road's starting point, and GPS positioning information.

[0090] S08. The control node queries the route to the destination IPv6 address on the network node to which the source IPv6 address belongs, and continues to query the route to the destination IPv6 address on the next hop node found, thus obtaining the IPv6 addresses of all network nodes that lead to the destination IPv6 address.

[0091] S09. The control node obtains the actual path nodes corresponding to the network node IPv6 addresses that are passed through to reach the destination IPv6 address by querying the data storage node.

[0092] S09 includes:

[0093] S091. Set the number of best and second-best routes advertised by the BGP protocol to provide multiple path options.

[0094] If each BGP publishes multiple routes, the source end can obtain multiple paths to output to the input and output nodes.

[0095] If the source node and the destination node are on the same path, the path to the destination address can be obtained through the IGP protocol.

[0096] S092. By default, the fewer roads a path planning process traverses, the higher its priority.

[0097] S093. When manual intervention is required, the number of ASs is not compared at the control node. The total cost of the path is calculated using the MED (Multi-Exit Authentication) value of the BGP protocol to determine the priority.

[0098] The MED value of the BGP protocol is: the MED (Multiple Exit Authentication) value when the BGP protocol publishes IPv6 routes. It is the cost from the device to the network device publishing the route plus the MED value of the published route.

[0099] The total cost of the path is calculated as follows: the MED value of the destination IPv6 route queried on the source node device plus the cost of the first hop device equals the total cost of the entire link. This value is the total cost of the planned path. The smaller the total cost, the higher the priority of the path.

[0100] S010, the control node returns the actual path node to the input / output node, thus obtaining the path planning information.

[0101] The input / output node receives user input, sends instructions to the control node, reads the network node IPv6 information output by the control node, searches for data storage node data, and outputs the actual road path information.

[0102] In a road system consisting of two intersecting roads:

[0103] The control node constructs the network structure based on the road information and corresponding IPv6 information in the data storage node, and distributes it to the protocol simulation node. The protocol simulation node completes the network construction and loads the initial device configuration, including IGP overhead and BGP route sending and receiving. If, in the data storage node, the network devices corresponding to the intersections of two roads are A1 and A2, and B1 and B2, representing the incoming and outgoing directions of one road and the other road, respectively, then A1 corresponds to the IPv6 address xxxx:1:1::1000, A2 corresponds to the IPv6 address xxxx:1:2::1000, B1 corresponds to the IPv6 address xxxx:2:1::2000, and B2 corresponds to the IPv6 address xxxx:2:2::2000. If the source address belongs to node A1 and the destination address belongs to node B2, then B2 sends its local IPv6 address to A1 via BGP. A1 receives the IPv6 address and adds it to its routing table. The control node queries A1 for the destination IPv6 address. If the next hop for this destination IPv6 address is B2 (xxxx:2:2::2000), then the control node searches for the destination IPv6 address on B2. Confirming that the destination IPv6 is within the same region, the query is complete, and the output path is A1—B2—destination address. The control node then searches the data storage node for the actual road nodes corresponding to A1 and B2 and feeds this information back to the input and output nodes, thus obtaining the actual path plan.

[0104] Based on the aforementioned inventive concept, such as Figure 6 As shown, the present invention also proposes a computer device 200, including a memory 210, a processor 220, and a computer program 230 stored in the memory 210 and executable on the processor 220. When the processor 220 executes the computer program 230, it implements the aforementioned navigation path calculation method based on network protocol simulation.

[0105] Based on the aforementioned inventive concept, the present invention also proposes a computer-readable storage medium storing a computer program that executes the aforementioned navigation path calculation method based on network protocol simulation.

[0106] This invention provides a navigation path calculation method based on network protocol simulation that combines IPv6 technology with road model construction. It uses the common IPv6 network protocol for path querying and planning. It has better universality in road model construction and does not require complex algorithm support for path calculation. Instead, it is based on the common IPv6 network routing protocol, making path calculation simpler.

[0107] While the spirit and principles of the invention have been described with reference to several specific embodiments, it should be understood that the invention is not limited to the disclosed specific embodiments, and the division of aspects does not imply that features in these aspects cannot be combined for benefit; such division is merely for ease of description. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

[0108] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems-on-a-chip (SoCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0109] The program code used to implement the methods of this disclosure may be written in any combination of one or more programming languages. This program code may be provided to a processor or controller of a general-purpose computer, special-purpose computer, or other programmable data processing apparatus, such that when executed by the processor or controller, the program code causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The program code may be executed entirely on a machine, partially on a machine, as a standalone software package partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0110] In the context of this disclosure, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can be, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0111] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the computer. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including sound input, voice input, or tactile input).

[0112] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as a data server), or computing systems that include middleware components (e.g., an application server), or computing systems that include frontend components (e.g., a user computer with a graphical user interface or web browser through which a user can interact with embodiments of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., a communication network). Examples of communication networks include local area networks (LANs), wide area networks (WANs), and the Internet.

[0113] Computer systems can include clients and servers. Clients and servers are generally located far apart and typically interact via communication networks. Client-server relationships are created by computer programs running on the respective computers and having a client-server relationship with each other. Servers can be cloud servers, servers in distributed systems, or servers incorporating blockchain technology.

[0114] It should be understood that the various forms of processes shown above can be used to reorder, add, or delete steps. For example, the steps described in this disclosure can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution disclosed in this disclosure can be achieved, and this is not limited herein.

[0115] The specific embodiments described above do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure should be included within the scope of protection of this disclosure.

[0116] Regarding the limitation of the scope of protection of this invention, those skilled in the art should understand that various modifications or variations that can be made by those skilled in the art without creative effort based on the technical solution of this invention are still within the scope of protection of this invention.

Claims

1. A navigation path calculation method based on network protocol simulation, characterized in that, The method includes: S01, The control node reads the road and IPv6 address correspondence information of the data storage node; S02. The control node generates the network structure and initial IPv6 protocol configuration based on road information and IPv6 information, including IGP protocol and its cost, BGP route sending and receiving information, and distributes it to the protocol simulation node. The S02 includes: S021. Each main road is simulated as an autonomous system region and assigned a 4-byte AS number, i.e., the autonomous system number. S022. Each road intersection is simulated as a network device node, serving as an ASBR, or Autonomous System Border Router. S023. The IGP protocol, i.e., the Interior Gateway Protocol, is used within the autonomous system. S024. Simulate the incoming and outgoing directions of each road separately, set the cost in the direction of traffic flow as needed, and set the cost in the opposite direction to the maximum. S025. The road U-turn point is simulated as a network node. The network nodes simulated in the incoming and outgoing directions are connected by links to simulate the U-turn. The forward cost is set as needed, and the reverse cost is set to infinity. S026. Cross-routing is simulated as a link connection, and the IPv6 routing guidance path is sent via the BGP protocol; S03. The protocol simulation node generates a network model based on the network structure and initial configuration issued by the control node, and calls the initial configuration. S04. Input and output nodes adjust the network structure, IGP protocol overhead, BGP protocol route advertising and acceptance through input information, and send it to the control node. S05. The control node sends the received information to the protocol simulation node, and the protocol simulation node modifies the network model based on the information. S06. When an input / output node needs to query a path, it submits a query request to the control node. S07. The control node converts the source and destination locations into IPv6 addresses of the source and destination nodes through the data storage node. S08. The control node queries the route to the destination IPv6 address on the network node to which the source IPv6 address belongs, and continues to query the route to the destination IPv6 address on the next hop node found, so as to obtain the IPv6 addresses of all network nodes that reach the destination IPv6 address. S09. The control node obtains the actual path nodes corresponding to the network node IPv6 addresses that are passed through to reach the destination IPv6 address by querying the data storage node. S010, the control node returns the actual path node to the input / output node, thus obtaining the path planning information.

2. The navigation path calculation method based on network protocol simulation according to claim 1, characterized in that, The control node is responsible for receiving instructions from the input / output nodes, issuing initialization configurations for the simulated network nodes, and modifying the configurations of the simulated nodes.

3. The navigation path calculation method based on network protocol simulation according to claim 1, characterized in that, The protocol simulation node simulates road information as an IPv6 network.

4. The navigation path calculation method based on network protocol simulation according to claim 1, characterized in that, The data storage node stores IPv6 addresses and the corresponding road names and numbers in the specific map, the distance from the road's starting point, and GPS positioning information.

5. The navigation path calculation method based on network protocol simulation according to claim 1, characterized in that, The input / output node: receives input from the user, sends instructions to the control node, reads the network node IPv6 information output by the control node, searches for data storage node data, and outputs the actual road path information.

6. The navigation path calculation method based on network protocol simulation according to claim 3, characterized in that, In S025, the simulated network node can turn around on both sides, with two links set up respectively.

7. The navigation path calculation method based on network protocol simulation according to claim 1, characterized in that, The initial configuration in S03 includes the device IPv6 address, link and port IPv6 addresses, IGP protocol and initial overhead, BGP protocol and initial route advertising and reception.

8. The navigation path calculation method based on network protocol simulation according to claim 1, characterized in that, S09 includes: S091. Set the number of best and second-best routes advertised by the BGP protocol to provide multiple path options. S092. By default, the fewer roads a path planning process traverses, the higher its priority. S093. When manual intervention is required, the control node is configured not to compare the number of ASs, and the total path cost is calculated using the MED value of the BGP protocol to determine the priority.

9. The navigation path calculation method based on network protocol simulation according to claim 8, characterized in that, The MED value of the BGP protocol is the MED value when the BGP protocol publishes IPv6 routes.

10. The navigation path calculation method based on network protocol simulation according to claim 8, characterized in that, The total cost of the calculated path is: the MED value of the destination IPv6 route queried on the source node device plus the cost of the first hop device.

11. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the method according to any one of claims 1-10.

12. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that performs the method according to any one of claims 1-10.

Images