Path searching method

Abstract

The method includes following steps: 1) each net element is made traverse in turn, the one way temporal path is generated from all cross connection; 2) each temporal path is made verify check; 3) the temporal path passing the verify check will generate real path.

Description

field of invention [0001] The invention relates to a method for searching a network path, in particular to a method for searching a network path in SDH (Synchronous Digital Hierarchy). Background technique [0002] In the NMS (Network Management System) function of SDH (Synchronous Digital Hierarchy), one of the most basic functions is to organize the cross-connection of a single station reported by the EMS (Network Element Manager) into an end-to-end network according to the connection relationship of optical fibers. end path. Generally speaking, there are many network elements managed by the NMS, and with the development of technology, the cross-connection capacity of a single network element is getting larger and larger, and the networking forms are becoming more and more flexible, such as chain, ring, mesh( mesh) network. The forms of protection are also becoming increasingly complex. Under this development trend, there is an urgent need for a high-efficiency path sea...

AI Technical Summary

Problems solved by technology

[0012] The above process does not consider various protections, but only lists the search process of a simple one-way path. If SDH paths are considered in terms of layered and protection diversity, such as subnetwork connection protection (SNCP), multiplex section protection (MSP) , DNI (dual-node interconnection) protection, etc., as well as open-loop paths, broadcast paths, and the search process must also target VC4 and E1 / E3 / E4 (E1 / E3 / E4 indicates the interface rate, such as E1 is 2Mbit / s, E3 is 34Mbit / s, E4 is 140Mbit / s,) search in several times, and at the same time establish a complex work protection relationship, which will make the search process of the path quite complicated, some even cannot be handled, and the efficiency is difficult to guarantee

The disadvantage of the prior art is that the number of traversal cross-connections is large, the efficiency is low, and the processing logic in the process of traversing the cross-connections is complex; hierarchical search is inefficient (first search VC4, E4, and then search E1, E3)

And it is easier to support single-source and single-sink paths, but due to multi-source, multi-sink, broadcast paths, and open-loop paths, bifurcation points will appear during the search process, but the search can only move forward in one direction, so it is difficult to support; In addition, it is difficult to deal with paths under complex protection forms

Images