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

Quotient space overlay model for calculating network shortest path and building method thereof

A technology covering models and construction methods, applied in the direction of data exchange network, data exchange through path configuration, transmission system, etc.

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

AI Technical Summary

Problems solved by technology

[0007] The purpose of the present invention is to propose a quotient space coverage model of an undirected and unweighted network and its construction method to solve the shortest path fast search problem in the undirected and unweighted network, and to find the shortest path between any two nodes in the network

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
  • Quotient space overlay model for calculating network shortest path and building method thereof
  • Quotient space overlay model for calculating network shortest path and building method thereof
  • Quotient space overlay model for calculating network shortest path and building method thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0041] Embodiment 1: build the quotient space coverage model of Internet

[0042] In the 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.

[0043] 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 marked 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 3 and node 5, and there is no connection between other nodes.

[0044] The matrix cor...

Embodiment 2

[0063] Example 2: Constructing the quotient space coverage model of the transportation network

[0064] 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.

[0065] 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 connected .

[0066] The matrix corresponding to its initial ...

Embodiment 3

[0077] Example 3: Constructing the quotient space coverage model of the power network

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

[0079] 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 3 The 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 using the quotient space granularity classification method respe...

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 quotient space overlying model of an undirected and unweighted network and a construction method thereof. The method comprises the following steps: obtaining a maximal complete subgraph of a network by utilizing quotient space theory and compatibility relationship, gradually coarsening granularity to form a hierarchical quotient space overlay network chain, and obtaining a quotient space overlying model formed by all maximal complete subgraphs of all levels of quotient space overlay networks with granularity from fineness to coarseness and node information thereof in an initial network; intuitively finding the minimal path length between two nodes in the network according to the node information of the maximal complete subgraphs of all levels of quotient space overlay networks in the quotient space overlying model in the initial network; finding the positions of two nodes in the initial network in the quotient space overlay networks with different granularities according to the model; searching the link path between the two nodes starting from a quotient space overlay network with a coarse granularity; searching from the quotient space overlay networks with gradually finer granularity until from a quotient space overlay network with a finest granularity, so as to rapidly search the minimal path between any two nodes. The quotient space overlying model can also be constructed by using a computer.

Description

technical field [0001] The invention belongs to the technical field of network topology, and specifically relates to a quotient space coverage model of an undirected and unweighted network and a method for constructing a network topology quotient space coverage model by using quotient space granularity calculation classification and layering. solution of the path. 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 points 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 the Internet (Internet) network technology, the selection of network routers is still based on the Dijkstra algorithm to select the shortest path. In the traffic network, especially in the digital traffic map, in order to enable...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/28H04L12/56G06F17/50H04L12/733
Inventor 张铃张燕平何富贵赵姝
Owner ANHUI UNIVERSITY
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