Method for searching shortest route based on quotient space overlay model

A covering model and shortest path technology, applied in traffic control systems, instruments, digital transmission systems of road vehicles, etc.

Inactive Publication Date: 2008-12-24
ANHUI UNIVERSITY
View PDF0 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The object of the invention is to propose a shortest path search method based on the quotient space c

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
  • Method for searching shortest route based on quotient space overlay model
  • Method for searching shortest route based on quotient space overlay model
  • Method for searching shortest route based on quotient space overlay model

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0053] Embodiment 1: build the quotient space coverage model of the Internet (Internet) and search for the shortest path between any two routers

[0054] In the Internet (Internet) network, the network G(X, E) is established on the router level, the nodes are routers, and the edges are physical connections (such as optical fibers) between routers. Also at the autonomous system level, nodes are domains and edges are the physical links connecting domains.

[0055] Now select a router-level network on the Internet in a certain area, and label each router in a certain order. The connection status of each router is represented by an unauthorized edge connection. No connection is 0, and connection is 1. Establish a quotient space coverage model. For an undirected and unweighted network G(X, E), there are 5 nodes recorded as X{1, 2, 3, 4, 5}, and its edge set E: node 1 and node 2 There are edges between node 1 and node 3, node 2 and node 3, node 2 and node 4, node 3 and node 4, node...

Embodiment 2

[0079] Example 2: Construct the quotient space coverage model of the transportation network and search for the shortest path between any two stations

[0080] For the urban transportation network, the nodes are bus stops and the edges are urban roads. In the railway transportation network, the nodes are railway stations and the edges are railways. Similarly, in the aviation network, the airport is used as a node, and the edges are flights.

[0081] Now select an aviation network, and label each airport in a certain order. The connection status of each airport is represented by an unrighted edge. 1 if there is a connection. Establish a quotient space coverage model. For an undirected and unweighted network G(X, E), there are 7 nodes recorded as X{1, 2, 3, 4, 5, 6, 7}, and its edge set E: node There is an edge between 1 and node 2, node 2 and node 3, node 3 and node 4, node 4 and node 5, node 5 and node 6, node 6 and node 7, node 1 and node 7, and other nodes are not connecte...

Embodiment 3

[0096] Example 3: Construct the quotient space coverage model of the power network and search for the shortest path between any two substations

[0097] In the power network, the nodes are substations, and the edges are transmission lines, and a network G(X, E) is established.

[0098] Now select a certain power network, and label each substation in a certain order. The connection status of each substation is represented by a connection with no right. If there is no transmission line between substations, it means no connection, and 0; if there is a transmission line between substations, it means yes. Connected to 1. Application method of the present invention simulated 10 by computer emulation 3The network of the computer network system within the node, the undirected and unweighted network is generated according to the random network model, the small world network model and the scale-free network model respectively, and the quotient space coverage model is constructed by usi...

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 minimal path searching method based on a quotient space overlying model, which comprises the following steps: constructing a quotient space overlying model composed of all maximal complete-subgraphs of all levels of quotient space overlay networks in a hierarchical quotient space overlay network chain and node information thereof in an initial network, acquiring the hierarchical numbers of a starting point and a terminal point for searing in corresponding positions in maximal complete-subgraphs of all levels of quotient space overlay networks, comparing the hierarchical numbers thereof, searching paths from a quotient space with a finer granularity, and searching from quotient space overlay networks with gradually finer granularity until from a quotient space overlay network with the finest granularity to obtain the minimal path between two nodes, so as to solve the minimal path rapid searching problem in an undirected and unweighted network and can obtain multiple minimal paths in the network at the same time. The method can obtain the minimal paths between two nodes by comprehensive utilization of network resources, so as to solve the problems of the minimal transfer times of a passenger in traffic networks, efficient utilization of energy in electric networks, rapid fault path detection, etc.

Description

technical field [0001] The invention belongs to the technical field of network topology, and in particular relates to a search method for the shortest path of an undirected and unweighted network, in particular to a path search method based on a quotient space coverage model. Background technique [0002] For solving the shortest path problem of network topology, the typical algorithms are Dijkstra algorithm and Floyd algorithm. The effect of the shortest path between is better, but these two methods are heuristic search algorithms for the shortest path search problem, and the search process does not have a given search target and direction. [0003] In Internet (Internet) network technology, the selection of network routers is currently still using the Dijkstra algorithm to select the shortest path; in traffic networks, especially digital traffic maps, in order to enable users to find between any starting point and destination The shortest line, the most important thing in...

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/56G08G1/00H04L12/721
Inventor 何富贵张燕平张铃赵姝
Owner ANHUI UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap