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

A Calculation Method for k-Short Paths

A calculation method and short-path technology, applied in the field of communication, can solve the problems of unsatisfied conditions and time-consuming, and achieve the effect of fast convergence.

Active Publication Date: 2021-01-15
FENGHUO COMM SCI & TECH CO LTD
View PDF11 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, under this constraint condition, the shortest path method can be used to calculate the first K-1 shortest paths to obtain a path that satisfies the condition, resulting in time-consuming to obtain all K shortest paths that satisfy the constraint condition, and when the value of K is too small , will also result in not getting a path that satisfies the condition

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
  • A Calculation Method for k-Short Paths
  • A Calculation Method for k-Short Paths
  • A Calculation Method for k-Short Paths

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0035] The present invention provides a kind of calculating method of K short path, it comprises the following steps:

[0036] Obtain the path from the source node to each neighbor node separately and add to the extended path set.

[0037] According to the order of the path weights in the extended path set from high to low, each time a path is taken out and expanded according to the breadth of the network topology, the expanded non-K short path is added to the extended path set and continued to expand, and the expanded K The shortest path is added to the shortest path set and the output is sorted.

[0038] Constraint conditions may be necessary nodes, necessary links, forbidden nodes, forbidden paths, etc., without limitation. The constraint condition that the K short path should satisfy is at least one, and there may be multiple co...

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 calculation method for a K short path, and relates to the technical field of communication. Obtain the path from the source node to each neighbor node and add it to the extended path set; according to the order of the weight of the path in the extended path set from high to low, each time a path is taken out and expanded according to the breadth of the network topology, the extended path The obtained non-K short paths are added to the extended path set and then continued to expand, and the extended K short paths are added to the shortest path set and sorted for output. The invention can ensure that all K short paths meeting the conditions are found, and at the same time, the convergence speed of the path calculation according to the weight of the path is relatively fast, so that the calculation result can be quickly obtained.

Description

technical field [0001] The present invention relates to the field of communication technology, in particular to a calculation method for K short paths. Background technique [0002] The shortest path problem (Shortest Path Problem) is one of the most basic problems in network optimization problems. The basic description of the problem is: in a given network, find a shortest (distance, delay, cost) path between the source node and the sink node. The K-Shortest Path Problem (K-Shortest Path Problem) is based on the shortest path problem, that is, to find the first K shortest paths between the source node and the sink point from a given network. These two problems widely exist in many scenarios such as travel route planning, logistics transportation planning, urban rail transit planning, communication network planning, and satellite network data transmission. At present, the shortest path planning algorithms include Dijkstra algorithm, Floyd algorithm, A-Star algorithm, Bellm...

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 Patents(China)
IPC IPC(8): H04L12/721
CPCH04L45/123H04L45/124
Inventor 何峰曹伟
Owner FENGHUO COMM SCI & TECH CO LTD
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com