Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Network path finding method, optimal path selecting method and system thereof

An optimal path and network path technology, applied in transmission systems, digital transmission systems, data exchange networks, etc., can solve problems such as inaccurate calculation of optimal paths and inability to calculate optimal paths in real time

Inactive Publication Date: 2010-09-08
林定伟
View PDF3 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method can calculate the optimal path between two points, but in practical applications, the amount on the arc is constantly changing with time or the environment, so the optimal path between two points cannot be calculated in real time
For example, for the road traffic network system, it is necessary to face the dynamic and constantly changing traffic jam information, so if the shortest path between two points is searched according to the pre-established topology file, the two points in the road traffic network system cannot be accurately calculated the optimal path between

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Network path finding method, optimal path selecting method and system thereof
  • Network path finding method, optimal path selecting method and system thereof
  • Network path finding method, optimal path selecting method and system thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0047] The network optimal path selection method of the present invention, such as figure 1 , including the steps:

[0048] S101. Pre-establish a topology file consisting of logical network nodes, arcs, and quantities on the arcs, wherein the arcs are connections between two logical network nodes, and the quantities on the arcs are weights assigned to the arcs; the arcs can be Directed or undirected connection between two logical network nodes; when creating a topology file, it can be established in the form of a database or a map model. When establishing, first determine the position coordinates of the logical network nodes, and then determine the logical network The connection between the nodes, and then assign weights to the arcs respectively. The topology file can be a 2D model or a 3D model, such as Figure 7 In the specific embodiment of , the topology file established in this figure includes logical network nodes A, B, C, D and E, and the arcs AB, BE, AD, DE, AC, and C...

Embodiment 2

[0069] The difference between this embodiment and Embodiment 1 is that this embodiment is used to calculate the shortest path between multiple logical network nodes. In this embodiment, the network optimal path selection method of the present invention, such as figure 2 , including the steps:

[0070] S201. Pre-establish a topology file consisting of logical network nodes, arcs, and quantities on the arcs, wherein the arcs are connections between two logical network nodes, and the quantities on the arcs are weights assigned to the arcs; the arcs can be two A directional or non-directional connection between logical network nodes; when creating a topology file, it can be established in the form of a database or a map model. When establishing, first determine the position coordinates of the logical network nodes, and then determine the logical network nodes , and then assign weights to the arcs respectively;

[0071] S202. Collect the actual data information of the topology fi...

Embodiment 3

[0087] The difference between this embodiment and Embodiment 1 is that in this embodiment, the actual data information of the topology file under the same investigation quantity is collected at predetermined time intervals. In this embodiment, the network optimal path selection method of the present invention, such as image 3 , which includes:

[0088] S301. Pre-establish a topology file consisting of logical network nodes, arcs, and quantities on the arcs, wherein the arcs are connections between two logical network nodes, and the quantities on the arcs are weights assigned to the arcs; the arcs can be Directed or undirected connection between two logical network nodes; when creating a topology file, it can be established in the form of a database or a map model. When establishing, first determine the position coordinates of the logical network nodes, and then determine the logical network The connection between the nodes, and then assign weights to the arcs respectively. T...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a network path finding method, an optimal path selecting method and a system thereof. The method comprises the steps: pre-establishing a topology file consisting of logic network nodes, an arc and magnitudes on the arc, wherein the arc is the connecting line between the two logic network nodes and the magnitudes on the arc are weights given to the arc; collecting actual data information of the topology file with different studying magnitudes and respectively updating the topology file; figuring out the shortest path between a first logic network node as the start and a second logic network node as the end by a path finding method of the shortest path between two nodes according to the topology file after each updating; and selecting the corresponding shortest path as the optimal path according to different studying magnitudes. The method can collect actual data information of the topology file with different studying magnitudes and respectively updates the topology file, figure out the shortest path according to the topology file after each updating, and precisely work out the optimal path between the start and the end or the logic nodes.

Description

technical field [0001] The invention relates to a network path search method, a network optimal path selection method and a system thereof. Background technique [0002] In the prior art, in the field of intelligent control technology, the method of calculating the optimal path between one logical network node and another logical network node is: firstly establish a topology file consisting of logical network nodes, arcs and quantities on the arcs, where , the arc is the connection between two logical network nodes, and the quantity on the arc is the weight assigned to the arc; then, according to the topology file, the shortest path between two logical network nodes is calculated using the shortest path path-finding algorithm path; use the calculated shortest path as the optimal path. This method can calculate the optimal path between two points, but in practical application, the quantity on the arc is constantly changing with time or environment, so the optimal path betwee...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L12/56H04L45/74
Inventor 林定伟
Owner 林定伟
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products