CN1391381A

CN1391381A - Routing method for signaling No.7 network management system

Info

Publication number: CN1391381A
Application number: CN01118757A
Authority: CN
Inventors: 陈洪飞; 李庆旭
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2001-06-11
Filing date: 2001-06-11
Publication date: 2003-01-15
Anticipated expiration: 2021-06-11
Also published as: CN1135801C

Abstract

A routing method for signaling No.7 network management system is disclosed. The tree is used as the storage structure of network topology. The deep optimizing based on chart is used for search. The search algorithm is composed of initializing and recursion parts. For initializing algorithm, the all paths from start node to termination node can be searched in topologic tree. For the recursion algorithm, the all paths from any node to termination node are searched in deep-optimizing ergogic topologic tree. Its advantages are simple method and high search speed.

Description

The method for searching route of Signaling System Number 7 network management system

The present invention relates to a kind of method for searching route of network system, exactly, relate to a kind of method for searching route of Signaling System Number 7 network management system.

Equipment in the Signaling System Number 7 net (being designated hereinafter simply as signaling network) according to its function in net, can be divided into two kinds: Signaling Transfer Point and signalling point (SP).Usually, consider reliability of information transmission, all should be provided with two paths at least between any two equipment in the net.For the ruuning situation of awareness network, the attendant often need check the path situation between any two equipment.Therefore, a basic function of webmastering software be exactly search and display network in whole paths between any two equipment, for attendant's analyzing and processing.

Referring to Fig. 1, the signaling network of China is to adopt tertiary structure: the first order is HSTP High Signaling Transport Point (HSTP), the second level is Low Level Signaling Transfer Point LSTP (LSTP), the third level is signalling point (SP), and signalling point is made up of various exchanges and Special Service Center (service control point, network management center etc.).Fig. 1 has showed the hierarchical organization of this signaling network.Wherein first order HSTP is responsible for transfer second level LSTP of its institute's tandem and the signaling message of third level SP.Second level LSTP be responsible for the transferring signaling message of third level SP of its institute's tandem.Third level SP signalling point is then for transmitting the source point or the destination of various signaling messages.

At present, the signaling network of China adopts following connected mode: (1) first order HSTP High Signaling Transport Point HSTP adopts two parallel A, B plane net, wherein each HSTP High Signaling Transport Point HSTP in A, the B plane is netted connection mutually, then is connected to each other between paired two HSTP High Signaling Transport Point HSTP between A plane and the B plane.(2) each Low Level Signaling Transfer Point LSTP LSTP is fixedly attached to two paired in A, B plane HSTP High Signaling Transport Point HSTP.(3) signalling point SP is to adopt fixing or free connected mode as the case may be to Low Level Signaling Transfer Point LSTP LSTP, each signalling point SP is connected to two Signalling Transfer Point STP (LSTP or HSTP) at least, if when being connected to two HSTP High Signaling Transport Point HSTP, then must be fixedly attached to two paired in two planes of A, B HSTP High Signaling Transport Point HSTP respectively.

In order to search the whole paths between any two nodes in the signaling network, the present normally used following two kinds of ways that have: store whole network topology (1) as a figure, uses classical graph search algorithm (depth-first, breadth-first etc.) to search then.(2) whole network topology is stored (if the node of a lower floor has with the node on a plurality of upper stratas and is connected as one tree, then this lower floor's node is just stored repeatedly, under each associated with it upper strata node, all store once), use the searching algorithm (first preface, postorder or middle preface) of classical tree to search then.Above-mentioned these two kinds of lookup methods respectively have its pluses and minuses, and are as shown in table 1:

Lookup method	Advantage	Shortcoming
Lookup method	Advantage	Shortcoming	(1) method of storing as figure	Realize simple.Because the signaling network topology is exactly figure in essence.	Though the signaling network topology is figure in essence, and its level is arranged.Employing figure stores and can not embody its level well.
(2) method of storing as tree	Search speed is fast.	Because the node of a lower floor wants repeated storage repeatedly, so algorithm is complicated, and the waste internal memory.	(1) method of storing as figure

The method for searching route that the purpose of this invention is to provide a kind of Signaling System Number 7 network management system, this lookup method is characteristics of considering the signaling network topological structure, and in conjunction with traditional figure and the searching algorithm of tree, and a kind of novelty that proposes, search the whole route method between any two nodes in the signaling network fast, efficiently.

The object of the present invention is achieved like this: a kind of Signaling System Number 7 network management system method for searching route, and it is characterized in that: this method includes the following step:

(1) whole network topology is adopted tree structure as its storage organization: to be provided with a node information array, to be used for storing the self information of these whole all nodes of network; Annexation between each node is stored with a topological tree, and each node in this topological tree all has a pointer, in the described node information array of this pointed with the corresponding node information number of this node;

(2) search based on the depth-first search of figure, this is searched algorithm and is made up of startup and recurrence two parts:

(1) wherein the algorithm of searching of actuating section is whole paths of searching in topological tree tree from start node vex1 to termination node vex2, inlet: topological tree tree, start node vex1, termination node vex2; Include following algorithm steps: beginning, initialization path formation q, start node vex1 is gone into formation q, is the algorithm of parameter call recurrence part with topological tree tree, start node vex1, termination node vex2, formation q, promptly calls DFSPath (tree, vex1, vex2, q), with start node vex1 dequeue q, destroy formation q, finish;

(2) wherein recurrence part search algorithm DFSPath (tree, vex1, vex2, q) be according to depth-first traversal topological tree tree, to search arbitrary node vex1` from this tree tree to the whole paths that stop node vex2, when entering this function, this arbitrary node vex1` is in formation q; Include following algorithm steps: beginning, if this arbitrary node vex1` and the same node information number that stops node vex2 sensing node information array, then a path from this arbitrary node vex1` to termination node vex2 has been found in expression, and export the path that this finds, finish this recursive lookup; Otherwise, each neighborhood of nodes w for this arbitrary node vex1`, if this node w is not in formation, then earlier node w is gone into formation, be the said process of parameter call recurrence part with topological tree tree, node w, termination node vex2, formation q again, with node w dequeue, finish to search at last.

All nodes in the described network include: signalling point SP, Low Level Signaling Transfer Point LSTP LSTP and HSTP High Signaling Transport Point HSTP.

Wherein the self information of node information number includes: title, signaling point code, link group number, and the required various information of webmaster.

If one of them lower floor's node has with a plurality of upper stratas node and is connected, then this lower floor's node has a plurality of pointers in topological tree.

The major technique characteristics of the method for searching route of network management system of the present invention are to store with the method for tree, and search for the method for figure; Be that storage organization is to adopt tree structure, searching algorithm is then searched for based on the depth-first of figure.The node storage organization of method for searching route of the present invention is topological consistent with signaling network, both embodied the level that signaling network has, the method of not miscalculating again terse and efficient, it combines employed figure of present traditional method for searching route and the advantage of setting two kinds of storage organizations, implementation method is simple, search speed is fast, has also avoided both shortcomings separately, is a kind of method for searching route that has much the Signaling System Number 7 network management system of popularizing application prospect.

Introduce algorithm steps, characteristics and the effect of lookup method of the present invention in detail below in conjunction with accompanying drawing:

Fig. 1 is the hierarchical organization schematic diagram of present Chinese Signaling System Number 7 net.

Fig. 2 is the topological storage organization schematic diagram in the lookup method of Signaling System Number 7 network management system of the present invention.

Fig. 3 is the actuating section flow chart of searching algorithm in the lookup method of Signaling System Number 7 network management system of the present invention.

Fig. 4 is the recurrence part flow chart of searching algorithm in the lookup method of Signaling System Number 7 network management system of the present invention.

The present invention is a kind of Signaling System Number 7 network management system method for searching route, and it mainly includes the following step:

The first step is to adopt tree structure as its storage organization whole network topology: referring to Fig. 2, be provided with a node information array 1, the self information that is used for these all nodes of whole network of storage (including: signalling point SP, Low Level Signaling Transfer Point LSTP LSTP and HSTP High Signaling Transport Point HSTP), this self information includes title, signaling point code, the link group number of this node, and other required various information of webmaster.Annexation between each node is to store with a topological tree, and each node in this topological tree all is provided with a pointer (the with dashed lines arrow is represented it among Fig. 2), the node information number corresponding with this node in this pointed node information array.If one of them lower floor's node has with a plurality of upper stratas node and is connected, then this lower floor's node has a plurality of pointers to occur in topological tree.

Second step was based on the depth-first search of figure and searches, and this is searched algorithm and is made up of startup and recurrence two parts; Wherein the algorithm of searching of actuating section is whole paths of searching in topological tree tree from start node vex1 to termination node vex2, inlet: topological tree tree, start node vex1, termination node vex2; Include following algorithm steps (referring to Fig. 3): beginning, initialization path formation q, start node vex1 is gone into formation q, is the algorithm of parameter call recurrence part with topological tree tree, start node vex1, termination node vex2, formation q, promptly calls DFSPath (tree, vex1, vex2, q), with start node vex1 dequeue q, destroy formation q, finish;

Flow chart referring to the recurrence part algorithm DFSPath in the lookup method of the present invention shown in Figure 4.Wherein recurrence part searches algorithm DFSPath (tree, w, vex2, q) be according to depth-first traversal topological tree tree, to search arbitrary node vex1` from this tree tree to the whole paths that stop node vex2, when entering this function, this arbitrary node vex1` is in formation q; Include following algorithm steps (referring to Fig. 4): beginning, at first judge this arbitrary node vex1` and stop the same node information number whether node vex2 points to the node information array, if, then a path from this arbitrary node vex1` to termination node vex2 has been found in expression, just export the path that this finds, be the content among the print queue q, finish this recursive lookup; Otherwise, each neighborhood of nodes w for this arbitrary node vex1`, if this node w is not in formation, then earlier node w is gone into formation, be the said process of parameter call recurrence part with topological tree tree, node w, termination node vex2, formation q again, with node w dequeue, finish to search at last.

The method for searching route of Signaling System Number 7 network management system of the present invention the network management system of Signaling System Number 7 net in implement test, respond well, realized goal of the invention.

Claims

1, a kind of method for searching route of Signaling System Number 7 network management system is characterized in that: this method includes the following step:

2, the method for searching route of Signaling System Number 7 network management system as claimed in claim 1 is characterized in that: all nodes in the described network include: signalling point SP, Low Level Signaling Transfer Point LSTP LSTP and HSTP High Signaling Transport Point HSTP.

3, the method for searching route of Signaling System Number 7 network management system as claimed in claim 1 is characterized in that: wherein the self information of node information number includes: title, signaling point code, link group number, and the required various information of webmaster.。

4, the method for searching route of Signaling System Number 7 network management system as claimed in claim 1 is characterized in that: if one of them lower floor's node has with a plurality of upper stratas node and is connected, then this lower floor's node has a plurality of pointers in topological tree.