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

K-shortest path computing method and device

A calculation method and a technology of a calculation device, which are applied in the field of K-optimal path calculation methods and devices, can solve problems such as duplicate links or duplicate nodes, and reduce the success rate of K-optimal path assembly, so as to speed up rapid judgment and avoid path assembly Failure, the effect of increasing the success rate

Inactive Publication Date: 2010-01-06
ZTE CORP
View PDF0 Cites 30 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Because in the existing technology, the necessary conditions are not sorted according to a certain principle, it is easy to cause the phenomenon of repeated links or repeated nodes, which reduces the success rate of K-optimal path assembly

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
  • K-shortest path computing method and device
  • K-shortest path computing method and device
  • K-shortest path computing method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the embodiments of the present invention will be further described in detail below in conjunction with the embodiments and the accompanying drawings. Here, the exemplary embodiments and descriptions of the present invention are used to explain the present invention, but not to limit the present invention.

[0042] see image 3 , is a flow chart of the calculation method of the K-optimal path in this embodiment, and the specific steps are as follows:

[0043] Step 301, generating a network-wide topology map of all TE (Traffic engineering, traffic engineering) links in the current optical network;

[0044] The network-wide topology of TE links is obtained from the path protocol (OSPF (Open Shortest Path First) or ISIS (Intermediate System to Intermediate System)) TE extended flooding information and stored in the TED (TE Database) database.

[0045] Step...

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 provides a K-shortest path computing method and a device, belonging to the field of path computing technology. The computing method comprises the following steps: working out the minimum spanning tree of the total-network topological graph of traffic engineering links in current optical network; sequencing compulsory links or compulsory nodes in an optical pass to be established on the minimum spanning tree obtained by computation; carrying out segment computation according to sequenced compulsory links and compulsory nodes, and assembling the paths obtained by segment computation into a K-shortest path. The failure probability of path assembly caused by the randomness of the compulsory links and the compulsory nodes can be avoided effectively through sequencing the compulsory links and the compulsory nodes on the minimum spanning tree obtained by computation; in addition, the invention can judge the path accessibility more quickly, effectively improves the success rate of path assembly, and facilitates improving the reliability of path computation.

Description

technical field [0001] The invention belongs to the technical field of path calculation, and in particular relates to a calculation method and device for a K-optimal path applied in an optical network. Background technique [0002] Path analysis is an important part of optical network analysis. Network analysis includes optimal path analysis, K optimal path analysis and optimal traversal path analysis. In WDM (Wavelength Division Multiplexing) optical network, path calculation and wavelength assignment are two sub-problems of RWA (routing and wavelength assignment, path and wavelength assignment). Usually, path calculation will provide K optimal paths for wavelength allocation, so as to improve the probability of successful wavelength allocation. [0003] At present, most K-optimal path algorithms are based on Dijkstra's algorithm. When the input condition of the K-optimal path algorithm is that it must pass through multiple links and nodes, the segmented calculation metho...

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): H04Q11/00H04B10/20
CPCH04L45/12H04L12/6418H04L12/4625H04L45/48
Inventor 赵巍
Owner ZTE CORP
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