Mutual exclusion group service routing calculation method and device in optical transmission network planning

A technology of optical transmission network and calculation method, applied in the field of service routing calculation of mutually exclusive groups in optical transmission network planning, can solve problems such as non-intersection, and achieve the effect of obvious theoretical and physical significance

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

AI Technical Summary

Problems solved by technology

[0006] The technical problem to be solved by the present invention is that some special services in the network require that their paths cannot intersect with the paths of another group of services. Suc

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
  • Mutual exclusion group service routing calculation method and device in optical transmission network planning
  • Mutual exclusion group service routing calculation method and device in optical transmission network planning
  • Mutual exclusion group service routing calculation method and device in optical transmission network planning

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0046] Embodiment 1 of the present invention provides a method for calculating service routes of mutually exclusive groups in optical transmission network planning, such as figure 1 shown, including:

[0047] In step 201, find out the respective top k of all businesses i The shortest path is used to group at least two services of mutually exclusive routes to be analyzed.

[0048] Find the top k of all businesses as described i The shortest path (corresponding to different services, the corresponding number of shortest paths can take the same value or different values, which is usually selected according to the complexity of the actual network scene), specifically through the k-shortest path algorithm (K-Shortest Pathes, Abbreviated as: KSP) algorithm to find the top k of all businesses i the shortest path. The k-shortest path algorithm includes Yen's algorithm; Lawler's algorithm; Hoffman's algorithm; Katoh's algorithm and so on.

[0049] Among them, when the complexity o...

Embodiment 2

[0071] The embodiment of the present invention is based on the specific application performance of the technical solution proposed in Embodiment 1 in OTN network planning and optimization. The definition of related parameter symbols in the embodiment of the present invention will be more in line with the definition method in OTN network planning, so as to develop the technical solution of the present invention. For example, the network uses G=(V,E), where V=(v 1 ,v 2 ,...,v n ) represents a node in the network; E=(e 1 ,e 2 ,...,e m ) represent sub-links between related nodes in the network. Business C=(c 1 ,c 2 ,...,c p ) is a group of connection requests in the network; the business in C is grouped, and the symbol G=(g 1 , g 2 ,..., g o )To represent. Mutually exclusive constraints on groups, such as two i-th groups and j-th groups are mutually exclusive, g i and g j The groups are mutually exclusive, that is, the paths of the services in the two groups are disj...

Embodiment 3

[0080] The embodiment of the present invention further provides a brief routing map, such as Figure 4 As shown, the technical solution proposed in Embodiment 1 of the present invention is described from a more intuitive technical perspective.

[0081] The topology is 8 nodes V=(Node1,Node2,…,Node8), and there are 9 sub-links E=(e 12 ,e 13 ,e 25 ,e 34 ,e 36 ,e 48 ,e 56 ,e 67 ,e 78 ), two businesses (c 1 ,c 2 ), business (c 1 ,c 2 ) are connection requests from nodes Node1->Node7; for business (c 1 ,c 2 ) for grouping: g 1 =(c 1 ), g 2 =(c 2 ). The goal is to find out the disjoint paths of two mutually exclusive groups and their resource allocation.

[0082] Such as Figure 5 As shown, the specific steps are as follows:

[0083] In step 401, the mutually exclusive group g is calculated according to the KSP algorithm 1 =(c 1 )’s top k=3 paths (here, for the convenience of description, the same top k paths are used for each business):

[0084] Node1->Node3...

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 relates to the technical field of route planning algorithms, and provides a mutual exclusion group service route calculation method and device in optical transmission network planning. The method comprises the following steps: finding out front ki shortest paths of all services, and grouping at least two services of mutually exclusive routing to be analyzed; generating at least two two-dimensional matrixes corresponding to the group according to the routing information of the first ki shortest paths of the service; obtaining a transposed matrix of the second two-dimensional matrix, and carrying out multiplication operation on the first two-dimensional matrix and the transposed matrix of the corresponding second two-dimensional matrix; and finding out disjoint paths between the first group and the second group through a result matrix according to the result matrix obtained by the multiplication operation. According to the method, the problem of path and resource allocation of mutually exclusive group services in the optical transmission network is solved, disjoint paths in all the first ki shortest paths can be solved, and the theoretical and physical significance is relatively obvious.

Description

【Technical field】 [0001] The invention relates to the technical field of route planning algorithms, in particular to a method and device for calculating mutually exclusive group service routes in optical transmission network planning. 【Background technique】 [0002] In the planning and optimization of the Optical Transmission Network (OTN), the process of opening a service is as follows: specify a fiber channel for the service through routing calculations, and specify the wavelength in the fiber by allocating resources, so as to establish a service for the service. An end-to-end optical channel. [0003] An optical channel spans multiple segments of optical fiber and passes through multiple sites, and multiple wavelengths can pass through each segment of optical fiber. An interruption of a fiber span or a node failure will cause a large amount of data loss in the network. These lost data are difficult to recover and will cause huge and irreparable losses to users. Therefor...

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/00
CPCH04Q11/0005H04Q11/0062H04Q2011/0086Y02D30/70
Inventor 何峰樊逸群柯磊李玉马坤
Owner FENGHUO COMM SCI & TECH CO LTD
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