CN108599970A - The recognition methods of Loop networks, device and system - Google Patents
The recognition methods of Loop networks, device and system Download PDFInfo
- Publication number
- CN108599970A CN108599970A CN201710156073.3A CN201710156073A CN108599970A CN 108599970 A CN108599970 A CN 108599970A CN 201710156073 A CN201710156073 A CN 201710156073A CN 108599970 A CN108599970 A CN 108599970A
- Authority
- CN
- China
- Prior art keywords
- network element
- transmission network
- adjacency matrix
- syntople
- directed graph
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of recognition methods of Loop networks, device and system.The recognition methods includes：According to the topological non-directed graph of specified transmission light path topology, generation includes the adjacency matrix of syntople between transmission network element in topological non-directed graph；By the adjacency matrix of topological non-directed graph, transmission network element of the quantity of syntople less than 2 is filtered out as the transmission network element rejected；Analyzing processing includes the adjacency matrix of the syntople between the transmission network element that do not reject, obtains the set for the transmission network element for most possibly forming looped network；According to the set of the most possible transmission network element for forming looped network, the looped network in topological non-directed graph is calculated using preset topological diagram traversal search algorithm.The looped network in service path topological diagram can be identified in the method provided according to embodiments of the present invention.
Description
Technical field
The present invention relates to the recognition methods of field of network management more particularly to Loop networks, device and system.
Background technology
With the appearance of development and the new network service of network technology, what the presentation of global network business rapidly increased becomes
Gesture.In terms of the development of communication, Fibre Optical Communication Technology is either in core net, the i.e. application of long range, large capacity backbone network
Aspect, or it is all very fast in Metropolitan Area Network (MAN), access net application aspect development.At the same time, to the protection of network interconnection business
More and more paid attention to.
Looped network protection is a kind of protected mode to network service provided under annular networking pattern, it is to participate in networking
The Protection path that network element provides operating path end to end is transmitted, in looped network protection, the transmission network element for participating in networking is located at envelope
On the circular path closed.After operating path breaks down, two adjacent transmission network elements of fault point can arrive service switching
Continue to transmit on Protection path.Currently, network management system can pass through SNCP (Subnetwork Connection
Protection, subnet connection protection) and MSP Ring (Multiplex Section Protection, multiplex section protective ring)
To provide looped network protection to the data service in transmission network.
Under ring network pattern, if the primary path in looped network breaks down, the transmission of service signal stream is changeable
To backup path.That is, if the unilateral disconnection of protection ring, service signal stream can switch to the another unilateral of protection ring,
Enter the unilateral operating status of looped network.Therefore, when a certain link on looped network disconnects, data on the network are not interfered with
Forwarding, to ensure that the quality and efficiency of business transmission.
Currently, the service path topological diagram that network management system is drawn often is presented entire topological diagram indifference, it is not right
The protection ring of looped network is individually identified, and when traffic failure occurs in the looped network in service path, network management system cannot be to occurring
The looped network of failure is identified, to carry out early warning in time when unilateral operating condition occurs in the looped network of service path.
Invention content
The embodiment of the present invention provides a kind of recognition methods of Loop networks, device and system, can identify that service path is opened up
Flutter the protection looped network in figure.
One side according to the ... of the embodiment of the present invention provides a kind of recognition methods of Loop networks, including：According to specified biography
The topological non-directed graph of road topology is lost, generation includes the adjacency matrix of syntople between transmission network element in topological non-directed graph；Pass through
The adjacency matrix of topological non-directed graph filters out transmission network element of the quantity of syntople less than 2 as the transmission network element rejected；Point
Analysis processing includes the adjacency matrix of the syntople between the transmission network element that do not reject, obtains the transmission network for most possibly forming looped network
The set of member；According to the set of the most possible transmission network element for forming looped network, preset topological diagram traversal search algorithm meter is utilized
Calculation obtains the looped network in topological non-directed graph.
Another aspect according to the ... of the embodiment of the present invention provides a kind of identification device of Loop networks, including：Adjacency matrix structure
Modeling block, is used for the topological non-directed graph according to specified transmission light path topology, and generation includes between transmitting network element in topological non-directed graph
The adjacency matrix of syntople；Pending adjacency matrix screening module is filtered out for the adjacency matrix by topological non-directed graph
Transmission network element of the quantity of syntople less than 2 is as the transmission network element rejected；Network element screening module is transmitted, analyzing processing is used for
Including the adjacency matrix for transmitting the syntople between network element that do not reject, the collection for the transmission network element for most possibly forming looped network is obtained
It closes；Looped network computing module is traversed for the set according to the most possible transmission network element for forming looped network using preset topological diagram
The looped network in topological non-directed graph is calculated in searching algorithm.
It is according to the ... of the embodiment of the present invention in another aspect, provide a kind of identifying system of Loop networks, including：Memory is used
In storage program；Processor, the program for being stored in run memory, to execute following steps：According to specified transmission light
The topological non-directed graph of road topology, generation include the adjacency matrix of syntople between transmission network element in topological non-directed graph；Pass through topology
The adjacency matrix of non-directed graph filters out transmission network element of the quantity of syntople less than 2 as the transmission network element rejected；At analysis
Reason includes the adjacency matrix of the syntople between the transmission network element that do not reject, obtains the transmission network element for most possibly forming looped network
Set；According to the set of the most possible transmission network element for forming looped network, calculated using preset topological diagram traversal search algorithm
To the looped network in topological non-directed graph；Display unit, for showing the looped network in the topological non-directed graph being calculated.
The recognition methods of the Loop networks provided according to embodiments of the present invention, device and system, between indicating to transmit network element
The adjacency matrix of syntople carries out analyzing processing, the looped network network element with syntople is filtered out, according in obtained looped network
Transmission network element be depicted as ring relationship.In follow-up business path, when looped network breaks down, it is accurate to be carried out to the operation of business single-point
Judge and system improving warning level creates technical conditions.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, will make below to required in the embodiment of the present invention
Attached drawing is briefly described, for those of ordinary skill in the art, without creative efforts, also
It can be obtain other attached drawings according to these attached drawings.
Fig. 1 is the flow chart for the recognition methods for showing Loop networks according to an embodiment of the invention；
Fig. 2 is the flow chart of the recognition methods for the Loop networks for showing that another embodiment of the present invention provides；
Fig. 3 be show it is according to an embodiment of the invention from transmission NE management system acquisition to transmission light path topology
Figure；
Fig. 4 is the structural schematic diagram of the identification device of Loop networks according to an embodiment of the invention；
Fig. 5 is the structural schematic diagram of the identification device of Loop networks according to another embodiment of the present invention；
Fig. 6 is to show that showing for the computing device of the recognition methods of the Loop networks of the embodiment of the present invention and device may be implemented
Meaning property hardware architecture diagram.
Specific implementation mode
The feature and exemplary embodiment of various aspects of the invention is described more fully below, in order to make the mesh of the present invention
, technical solution and advantage be more clearly understood, with reference to the accompanying drawings and embodiments, the present invention is further retouched in detail
It states.It should be understood that specific embodiment described herein is only configured to explain the present invention, it is not configured as limiting the present invention.
To those skilled in the art, the present invention can be real in the case of some details in not needing these details
It applies.Below to the description of embodiment just for the sake of by showing that the example of the present invention is better understood from the present invention to provide.
It should be noted that herein, the terms "include", "comprise" or its any other variant are intended to non-row
His property includes, so that the process, method, article or equipment including a series of elements includes not only those elements, and
And further include other elements that are not explicitly listed, or further include for this process, method, article or equipment institute it is intrinsic
Element.In the absence of more restrictions, the element limited by sentence " including ... ", it is not excluded that wanted including described
There is also other identical elements in the process, method, article or equipment of element.
In order to better understand the present invention, below in conjunction with the accompanying drawings, Loop networks according to the ... of the embodiment of the present invention are described in detail
Recognition methods, device and system, it should be noted that these embodiments are not for limiting the scope of the present disclosure.
Fig. 1 is the flow chart for the recognition methods for showing Loop networks according to the ... of the embodiment of the present invention.As shown in Figure 1, undirected
The recognition methods 100 of looped network includes the following steps：
Step S110, according to the topological non-directed graph of specified transmission light path topology, generation includes being transmitted in topological non-directed graph
The adjacency matrix of syntople between network element.
Step S120, by the adjacency matrix of topological non-directed graph, the quantity for filtering out syntople is less than 2 transmission network element
Transmission network element as rejecting.
Step S130, analyzing processing include the adjacency matrix of the syntople between the transmission network element that do not reject, are most had
It is likely to form the set of the transmission network element of looped network.
Step S140 is searched according to the set of the most possible transmission network element for forming looped network using preset topological diagram traversal
The looped network in topological non-directed graph is calculated in rope algorithm.
The recognition methods of Loop networks according to the ... of the embodiment of the present invention is built adjacent between transmitting network element by topological non-directed graph
The adjacency matrix of relationship, and adjacency matrix is analyzed and screened, the looped network network element with syntople is obtained, is drawn undirected
Ring topology relationship in looped network.
The transmission network element with annular connection relation is identified by way of building adjacency matrix, and then identifies that topology is undirected
Looped network in figure, algorithm is simple to operation, and carrying out timely early warning when breaking down for looped network in follow-up business path creates skill
Art condition.
Fig. 2 is the more detailed stream for the recognition methods for showing the Loop networks according to the disclosure some exemplary embodiments
Cheng Tu, Fig. 2 and Fig. 1 identical or equivalent step uses identical label.
In step S110, according to the topological non-directed graph of specified transmission light path topology, generation includes being passed in topological non-directed graph
The adjacency matrix of syntople between defeated network element.
Specifically, between the transmission network element in the topological non-directed graph that adjacency matrix is used to indicate to specify in the embodiment of the present invention
Syntople.
In this step, the line number of adjacency matrix and the columns of adjacency matrix are that network element is transmitted in topological non-directed graph
Number；In adjacency matrix, the corresponding element value of transmission network element with syntople could be provided as the first mark value, not have
The corresponding element value of transmission network element of syntople could be provided as the second mark value, and the first mark value and the second mark value can be with
It is user-defined numerical value or other characters, as long as the first mark value of setting and the second mark value of setting can be to transmission
Whether there is syntople to be recorded and be distinguished between network element.
As an example, in the adjacency matrix built according to embodiments of the present invention, the transmission network with syntople
The corresponding element value of member, i.e. the first mark value are set as numerical value 1, do not have the corresponding element value of transmission network element of syntople,
I.e. the second mark value is set as numerical value 0.
In order to make it easy to understand, Fig. 3 show it is according to an exemplary embodiment of the present invention from transmission NE management system acquisition
The transmission light path topological diagram arrived.As shown in figure 3, letter A, B, C, D, E, F, G, H, I indicate to pass in the transmission light path topological diagram
The transmission network element in road is lost, the straight line connection transmitted between network element indicates possessed undirected connection relation between transmission network member.
In figure 3, the character representation that the transmission element name of label near transmission network element is composed with number should
The port of network element is transmitted, such as the A1 near transmission network element A is marked to indicate to make when transmission network element A is connect with other transmission network elements
Port name.
In above-mentioned steps S110, by topological non-directed graph shown in Fig. 3, it can generate comprising being passed in the topology non-directed graph
The adjacency matrix of syntople between defeated network element.
Specifically, can by G=(V, E) as transmission network element between syntople topological non-directed graph figure.Wherein, V is
One-dimension array stores the transmission network element in topological non-directed graph, and E is two-dimensional array, and the syntople between storage transmission network element, this two
Dimension group, that is, adjacency matrix.
As an example, the serial number of transmission network element in adjacency matrix, matrix element a are indicated with i and jijElement value table
Show between transmission network element i and transmission network element j whether there is syntople.As a specific example, if transmission network element i with
Network element j adjoinings are transmitted, then aij=1, if transmission network element i is not abutted with transmission network element j, aij=0.
The adjacency matrix of syntople structure of the following table 1 in showing according to fig. 3 in topological non-directed graph between transmission network element.
The adjacency matrix example that table 1 is built according to topological non-directed graph
In table 1, transmission network element in topological non-directed graph in Fig. 3 is arranged in any order as row, network element will be transmitted
According to the inverted sequence arrangement of the sequence as row, the adjacency matrix of the topology non-directed graph is built.
With continued reference to Fig. 3, the number of transmission network element is 9 in Fig. 3, then the line number of the adjacency matrix built and the adjacency matrix
Columns be 9.And in the adjacency matrix, the element value corresponding to the transmission network element with syntople is arranged to 1,
Element value corresponding to transmission network element without syntople is arranged to 0.
In some embodiments, putting in order for network element of transmission can be in the row of adjacency matrix or the row of adjacency matrix
It arbitrarily puts in order, transmitting putting in order for network element in the row of adjacency matrix or the row of adjacency matrix will not be to the adjacency matrix
Syntople between the transmission network element of expression impacts.
Continue with reference in figure 3 topological non-directed graph and table 1 shown in adjacency matrix, detailed description to topology it is undirected
The method that Loop networks in figure are identified.
In step S120, by the adjacency matrix of topological non-directed graph, the quantity for filtering out syntople is less than 2 transmission network
Member is as the transmission network element rejected.
In some embodiments, step S120 can specifically include：
Step S121 counts the syntople that the corresponding transmission network element of row has in the adjacency matrix of topological non-directed graph
Quantity.
Step S122, the quantity transmission network element corresponding less than 2 row for the syntople that statistics is obtained is as rejecting
Transmit network element.
Specifically, in S121, the first mark value in the row by counting the adjacency matrix built according to embodiments of the present invention
Quantity determine in adjacency matrix the quantity of syntople that the corresponding transmission network element of row has.
Specifically, in S122, if the quantity of the first mark value is less than 2 in the row of the adjacency matrix of structure, the row is indicated
The quantity of syntople between corresponding transmission network element and other network elements is less than 2, then using the corresponding transmission network element of the row as picking
The transmission network element removed.
In some embodiments, can be capable as deleted row less than 2 by the quantity of the first mark value, and according to neighbour
The quantity for connecing the first mark value in matrix forms new adjacency matrix as follow-up to be analyzed not less than the element value in 2 row
Adjacency matrix.
In this embodiment, by the adjacency matrix of analysis structure, remove the transmission network element for being not belonging to looped network protection range,
The calculation amount subsequently analyzed adjacency matrix can be reduced, system effectiveness is improved.
As an example, table 2 shows that the quantity of the corresponding syntople of row in adjacency matrix shown in table 1 is united
The result of meter.
The corresponding syntople quantity statistics of row in 2 adjacency matrix of table
As shown in table 2, it is 1 to transmit syntople quantity possessed by network element I, transmission network element A and transmission network element B, by
It is not the transmission network element in looped network that this, which may determine that transmission network element I, transmission network element A and transmits network element B, therefore, transmits network element
I, it is the transmission network element rejected to transmit network element A and transmit network element B.
In step S130, analyzing processing includes the adjacency matrix of the syntople between the transmission network element that do not reject, is obtained most
It is likely to form the set of the transmission network element of looped network.
In some embodiments, step S130 can specifically include：
Step S131, using including do not reject transmission network element between syntople adjacency matrix as adjoining square to be analyzed
Battle array counts the quantity for the syntople that the corresponding transmission network element of row in adjacency matrix to be analyzed has.
Step S132, if the quantity for the syntople that the corresponding transmission network element of row has in adjacency matrix to be analyzed is small
In 2, the transmission network element in the adjacency matrix being analysed to corresponding to row of the quantity of syntople less than 2 is as the transmission rejected
Network element.
Step S133, the adjacency matrix being analysed to be updated to include do not reject transmission network element between syntople adjoining
Matrix, until the quantity for the syntople that the corresponding transmission network element of row has in adjacency matrix to be analyzed is all higher than equal to 2.
Step S134, obtain adjacency matrix to be analyzed the corresponding transmission network element of row, with adjacency matrix to be analyzed
The corresponding transmission network element of row has the transmission network element of syntople, obtains the set for the transmission network element for most possibly forming looped network.
S131~S134 through the above steps carries out analyzing processing, until neighbour to be analyzed to adjacency matrix to be analyzed
The quantity for connecing the syntople that the corresponding transmission network element of row in matrix has is all higher than equal to 2.
In above-mentioned steps S131, adjacency matrix to be analyzed is built according to the transmission network element that do not reject.
Specifically, the row where the transmission network element rejected in the adjacency matrix of structure is deleted first；Then, by rejecting
The first mark value in transmission network element column is revised as the second mark value, i.e., by the transmission network element of rejecting and other transmission network elements
Between the corresponding element value of syntople be set as the second mark value.
As an example, the following table 3, which is shown, builds according in table 2 according to the syntople between the transmission network element that do not reject
Adjacency matrix to be analyzed and adjacency matrix to be analyzed in row it is corresponding transmission network element syntople quantity statistics
As a result.
The adjacency matrix to be analyzed of table 3 and syntople quantity statistics
As shown in table 3, first, the row where the transmission network element of the rejecting in table 2 is deleted from the adjacency matrix of structure,
Row where network element I, transmission network element A will be transmitted and transmit network element B respectively is deleted；It secondly, respectively will transmission network element I, transmission
Between other transmission network elements there is the first mark value 1 of syntople to be set as the second mark in network element A and transmission network element B columns
Note value 0.The adjacency matrix of syntople between the as shown in table 3 transmission network element that do not reject is obtained, is passed as subsequent extracted looped network
The adjacency matrix to be analyzed of defeated network element.
In above-mentioned steps S132, to the corresponding syntople that has of transmission network element of row in adjacency matrix to be analyzed
Quantity is counted, and will abut against the transmission network element corresponding to row of the quantity less than 2 of relationship as the transmission network element rejected.
In order to make it easy to understand, with continued reference to table 3, according in table 3 between having transmitting network element in adjacency matrix to be analyzed
Syntople quantity statistical result, transmission network element C is the transmission network element rejected in adjacency matrix to be analyzed.
In step S133, the adjacency matrix that is analysed to is updated to include syntople between the transmission network element do not rejected
Adjacency matrix.
As an example, using transmission network element C as the transmission network element newly rejected, and the adjacency matrix update being analysed to
To transmit network element H according to what is do not rejected, transmitting network element G, transmission network element F, transmission network element E and transmitting the adjoining pass between network element D
It is the adjacency matrix of structure.
In order to make it easy to understand, the following table 4 is shown according to the update that syntople is built between the transmission network element that do not rejected in table 3
Adjacency matrix to be analyzed afterwards.
The newer adjacency matrix to be analyzed of table 4 and newer syntople quantity statistics
As shown in table 4, the row where the transmission network element C of rejecting is deleted first, then, by the transmission network element C of rejecting with
First mark value 1 of the syntople between other transmission network elements is updated to the second mark value 0, obtains newer shown in upper table 4
Adjacency matrix to be analyzed.
After adjacency matrix to be analyzed is updated, continue transmission network element tool corresponding to the row of adjacency matrix to be analyzed
The quantity of some syntoples is counted, it is determined whether the transmission network element of rejecting in need, until adjacency matrix to be analyzed
The corresponding quantity for transmitting the syntople that network element has of middle row is all higher than equal to 2.
As shown in table 4, after being updated to adjacency matrix to be analyzed, the corresponding syntople for transmitting network element and having of row
Quantity be all higher than 1, in adjacency matrix to be analyzed at this time, the transmission network element H that does not reject, transmission network element G, transmission network element F,
The transmission network element that transmission network element E and transmission network element D will be most likely to be in looped network.
In above-mentioned steps S134, the row in the adjacency matrix being analysed to is stored in the form of gathering, and most being had can
The set of the transmission network element of looped network can be formed, i.e.,：
H={ D, G }, G={ F, H }, F={ E, G }, E={ D, F }, D={ E, H }.
The set of the most possible transmission network element for forming looped network can be understood as：
Transmission network element H and transmission network element D, transmission network element G have syntople；Transmit network element G and transmission network element F, transmission network
First H has syntople；Transmission network element F and transmission network element E, transmission network element G have syntople；Transmission network element E and transmission network element D,
Transmission network element F has syntople；Transmission network element D and transmission network element E, transmission network element H have syntople.
It is traversed using preset topological diagram according to the set of the most possible transmission network element for forming looped network in step S140
The looped network in topological non-directed graph is calculated in searching algorithm.
In some embodiments, preset topological diagram traversal search algorithm can be Depth Priority Algorithm (Depth-
First-Search, abbreviation DFS), DFS algorithms are one kind of graph traversal searching algorithm, by DFS algorithms to topological non-directed graph
In most possibly form looped network the set of transmission network element scan for, obtain the Loop networks in topological non-directed graph.
In further embodiments, preset topological diagram traversal search algorithm can be selected according to practical situations
It selects, i.e., in the present invention, the restriction to preset topological diagram traversal search algorithm not being restricted property.
As an example, it obtains transmitting network element shown in above-mentioned table 4 according to the topological diagram traversal search algorithm of selection
Loop networks in the undirected topological diagram at place are (D, E, F, G, H, D).
With continued reference to Fig. 2, as shown in Fig. 2, as alternative embodiment, the recognition methods 200 of Loop networks can also include：
Plug-in unit is presented using specified topological diagram in step S150, and the looped network in topological non-directed graph is presented.
In the above-described embodiments, it can will identify that the transmission network element deposit specified data library in the looped network come.It is needing
When building ring-network topology figure, plug-in unit is presented by specified topological diagram and reads specified database middle ring network data, topology is presented
Looped network in non-directed graph.
In some embodiments, topological diagram is presented plug-in unit and can be selected according to application, and presently, there are various masters
After the topological diagram presentation plug-in unit of stream can be by read loop network data, looped network relationship topology figure is presented.Of the invention real
It applies in example, the restriction for selecting not being restricted property of plug-in unit is presented to topological diagram.
The recognition methods of Loop networks according to embodiments of the present invention, can know the looped network in topological non-directed graph
Not, accurate judgement benchmark is provided for the operation of follow-up business single-point, and improves the pre-alerting ability of system.
Below in conjunction with the accompanying drawings, the identification device of Loop networks according to the ... of the embodiment of the present invention is described in detail.
Fig. 4 is the structural schematic diagram for the identification device for showing Loop networks according to an embodiment of the invention.Such as Fig. 4 institutes
Show, the identification device 400 of Loop networks according to the ... of the embodiment of the present invention includes：
Adjacency matrix constructing module 410, for the topological non-directed graph according to specified transmission light path topology, it includes opening up to generate
The adjacency matrix of syntople between transmitting network element is flutterred in non-directed graph；
Pending adjacency matrix screening module 420 filters out syntople for the adjacency matrix by topological non-directed graph
Quantity less than 2 transmission network element as rejecting transmission network element；
Network element screening module 430 is transmitted, includes the neighbour of the syntople between the transmission network element that do not reject for analyzing processing
Matrix is connect, the set for the transmission network element for most possibly forming looped network is obtained；
Looped network computing module 440 is opened up for the set according to the most possible transmission network element for forming looped network using preset
Flutter the looped network that figure traversal search algorithm is calculated in topological non-directed graph.
The topological non-directed graph of transmission light path topology according to the ... of the embodiment of the present invention can identify given transmission light path topology
Topological non-directed graph in looped network information, improve the managerial ability of network management system.
In some embodiments, the line number of the adjacency matrix built in adjacency matrix constructing module 410 and adjacency matrix
Columns is the number that network element is transmitted in topological non-directed graph；In adjacency matrix, the transmission network element with syntople is corresponding
Element value is set as 1, and the corresponding element value of transmission network element without syntople is set as 0.
In some embodiments, pending adjacency matrix screening module 420 is specifically used for：The adjoining of the topological non-directed graph of statistics
The quantity for the syntople that the corresponding transmission network element of row has in matrix；The quantity for the syntople that statistics is obtained is less than 2
The corresponding transmission network element of row is as the transmission network element rejected.
In this embodiment, pending adjacency matrix screening module 420 is to the neighbour that is built in adjacency matrix constructing module 410
It connects matrix to be pre-processed, the network element that wherein syntople quantity is less than 2 is rejected, to Loop networks provided in an embodiment of the present invention
Recognition methods and device optimize, and calculating the looped network in adjacency matrix for subsequent analysis transmits network element saving calculating cost.
In some embodiments, transmission network element screening module 430 can specifically include：
Syntople quantity statistics unit 431, for will include do not reject transmission network element between syntople adjoining square
Battle array is used as adjacency matrix to be analyzed, counts that row in adjacency matrix to be analyzed is corresponding to transmit syntople that network element has
Quantity；
Network element culling unit 432 is transmitted, if having for the corresponding transmission network element of row in adjacency matrix to be analyzed
The quantity of syntople is less than 2, the transmission network in the adjacency matrix being analysed to corresponding to row of the quantity of syntople less than 2
Member is as the transmission network element rejected；
Adjacency matrix updating unit 433, the adjacency matrix for being analysed to are updated to include the transmission network element that do not reject
Between syntople adjacency matrix, until the number of syntople that the corresponding transmission network element of row has in adjacency matrix to be analyzed
Amount is all higher than equal to 2；
Looped network transmits network element acquiring unit 434, the corresponding transmission network element of row for obtaining adjacency matrix to be analyzed and
The corresponding transmission network element of row of adjacency matrix to be analyzed has the transmission network element of syntople, obtains most possibly forming looped network
Transmission network element set.
In this embodiment, gradually analyzing processing adjacency matrix to be analyzed, rejecting are not belonging to the biography of looped network protection range
Defeated network element obtains having syntople quantity to be all higher than transmission network element equal to 2 as the transmission network for being finally likely to form looped network
The set of member.
Fig. 5 is the structural schematic diagram for the identification device for showing Loop networks according to another embodiment of the present invention.Fig. 5 and figure
Identical or equivalent module use is identically numbered in 4, as shown in figure 5, the identification device 500 of Loop networks is substantially identical to nothing
To the identification device 400 of looped network, the difference is that, the identification device 500 of Loop networks can also include：
Module 450 is presented in looped network, and plug-in unit is presented using specified topological diagram, and the looped network in topological non-directed graph is presented.
In this embodiment, according to the set for the transmission network element for being finally likely to form looped network, plug-in unit is presented using topological diagram
Looped network in topological non-directed graph is presented.
The identification device of Loop networks according to the ... of the embodiment of the present invention can know the looped network in undirected topological diagram
Not, when traffic failure occurs in the looped network in service path, timely early warning can be carried out to the unilateral operation of looped network in business.
The other details of the identification device of Loop networks according to the ... of the embodiment of the present invention are described with above in association with Fig. 1 to Fig. 3
Loop networks according to the ... of the embodiment of the present invention recognition methods it is similar, details are not described herein.
Recognition methods and device in conjunction with Fig. 1 to Fig. 5 Loop networks according to the ... of the embodiment of the present invention described can be by can
Releasably or the computing device that is fixedly mounted on network management system server is realized.Fig. 6 is to show to realize according to this
The structure chart of the exemplary hardware architecture of the recognition methods of the Loop networks of inventive embodiments and the computing device of device.
As shown in fig. 6, computing device 600 includes input equipment 601, input interface 602, central processing unit 603, memory
604, output interface 605 and output equipment 606.Wherein, input interface 602, central processing unit 603, memory 604 and
Output interface 605 is connected with each other by bus 610, and input equipment 601 and output equipment 606 pass through 602 He of input interface respectively
Output interface 605 is connect with bus 610, and then is connect with the other assemblies of computing device 600.
Specifically, input equipment 601 receives the input letter from external (for example, topological diagram management module of network management system)
Breath, and input information is transmitted to by central processing unit 603 by input interface 602；Central processing unit 603 is based on memory 604
The computer executable instructions of middle storage handle to generate output information input information, temporarily or forever by output information
It stores long in the memory 604, output information is then transmitted to by output equipment 606 by output interface 605；Output equipment
Output information is output to the outside of computing device 600 for users to use by 606.
That is, computing device shown in fig. 6 can also be implemented as include：It is stored with computer executable instructions
Memory；And processor, the processor may be implemented when executing computer executable instructions that Fig. 1 to Fig. 5 to be combined to describe
The recognition methods of Loop networks and device.Here, processor can be communicated with network management system, to based on from network management system
Relevant information executes computer executable instructions, to realize recognition methods and the dress in conjunction with Fig. 1 to Fig. 5 Loop networks described
It sets.
In one embodiment, computing device 600 shown in fig. 6 may be implemented as the identifying system of Loop networks, should
The identifying system of Loop networks includes：Memory, for storing program；Processor, the program for being stored in run memory,
To execute following steps：According to the topological non-directed graph of specified transmission light path topology, generation includes transmission network in topological non-directed graph
The adjacency matrix of syntople between member；By the adjacency matrix of topological non-directed graph, the quantity for filtering out syntople is less than 2 biography
Defeated network element is as the transmission network element rejected；Analyzing processing includes the adjacency matrix of the syntople between the transmission network element that do not reject,
Obtain most possibly being formed the set of the transmission network element of looped network；According to the set of the most possible transmission network element for forming looped network, profit
The looped network in topological non-directed graph is calculated with preset topological diagram traversal search algorithm；Display unit is calculated for showing
To topological non-directed graph in looped network.
The identification of Loop networks through the embodiment of the present invention, can be to the ring in topological non-directed graph in service transmission path
Net is identified, and when traffic failure occurs in the looped network in service path, the looped network of unilateral operation can be identified in time, to ring
The unilateral operating condition of net carries out early warning.
It should be clear that the invention is not limited in specific configuration described above and shown in figure and processing.
For brevity, it is omitted here the detailed description to known method.In the above-described embodiments, several tools have been described and illustrated
The step of body, is as example.But procedure of the invention is not limited to described and illustrated specific steps, this field
Technical staff can be variously modified, modification and addition after the spirit for understanding the present invention, or suitable between changing the step
Sequence.
Functional block shown in structures described above block diagram can be implemented as hardware, software, firmware or their group
It closes.When realizing in hardware, it may, for example, be electronic circuit, application-specific integrated circuit (ASIC), firmware appropriate, insert
Part, function card etc..When being realized with software mode, element of the invention is used to execute program or the generation of required task
Code section.Either code segment can be stored in machine readable media program or the data-signal by being carried in carrier wave is passing
Defeated medium or communication links are sent." machine readable media " may include any medium for capableing of storage or transmission information.
The example of machine readable media includes electronic circuit, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), soft
Disk, CD-ROM, CD, hard disk, fiber medium, radio frequency (RF) link, etc..Code segment can be via such as internet, inline
The computer network of net etc. is downloaded.
It should also be noted that, the exemplary embodiment referred in the present invention, is retouched based on a series of step or device
State certain methods or system.But the present invention is not limited to the sequence of above-mentioned steps, that is to say, that can be according in embodiment
The sequence referred to executes step, may also be distinct from that the sequence in embodiment or several steps are performed simultaneously.
The above description is merely a specific embodiment, it is apparent to those skilled in the art that,
For convenience of description and succinctly, the system, module of foregoing description and the specific work process of unit can refer to preceding method
Corresponding process in embodiment, details are not described herein.It should be understood that scope of protection of the present invention is not limited thereto, it is any to be familiar with
Those skilled in the art in the technical scope disclosed by the present invention, can readily occur in various equivalent modifications or substitutions,
These modifications or substitutions should be covered by the protection scope of the present invention.
Claims (11)
1. a kind of recognition methods of Loop networks, which is characterized in that the recognition methods includes：
According to the topological non-directed graph of specified transmission light path topology, generation includes adjacent between transmission network element in the topological non-directed graph
The adjacency matrix of relationship；
By the adjacency matrix of the topological non-directed graph, the quantity for filtering out the syntople is less than 2 transmission network element conduct
The transmission network element of rejecting；
Analyzing processing includes the adjacency matrix of the syntople between the transmission network element that do not reject, obtains most possibly forming looped network
Transmit the set of network element；
According to the set of the most possible transmission network element for forming looped network, calculated using preset topological diagram traversal search algorithm
Obtain the looped network in the topological non-directed graph.
2. recognition methods according to claim 1, which is characterized in that
The columns of the line number of the adjacency matrix and the adjacency matrix is the number that network element is transmitted in the topological non-directed graph；
In the adjacency matrix, the corresponding element value of transmission network element with the syntople is set as 1, does not have described
The corresponding element value of transmission network element of syntople is set as 0.
3. recognition methods according to claim 1, which is characterized in that the adjoining square by the topological non-directed graph
Battle array filters out transmission network element of the quantity of the syntople less than 2 as the transmission network element rejected, including：
Count the quantity for the syntople that the corresponding transmission network element of row has in the adjacency matrix of the topological non-directed graph；
The quantity for the syntople that statistics is obtained transmission network element corresponding less than 2 row is as the transmission network element rejected.
4. recognition methods according to claim 1, which is characterized in that the analyzing processing includes the transmission network element that do not reject
Between syntople adjacency matrix, obtain most possibly formed looped network transmission network element set, including：
Using the adjacency matrix including syntople between the transmission network element that do not reject as adjacency matrix to be analyzed, institute is counted
State the quantity for the syntople that the corresponding transmission network element of row in adjacency matrix to be analyzed has；
If the quantity for the syntople that the corresponding transmission network element of row has in the adjacency matrix to be analyzed is less than 2,
The transmission network element corresponding to row using the quantity of syntople in the adjacency matrix to be analyzed less than 2 is as the rejecting
Transmit network element；
The adjacency matrix to be analyzed is updated to include syntople between the transmission network element that do not reject adjacency matrix,
It is equal to until the quantity for the syntople that the corresponding transmission network element of row has in the adjacency matrix to be analyzed is all higher than
2；
Obtain the adjacency matrix to be analyzed row it is corresponding transmission network element, with the adjacency matrix to be analyzed go it is corresponding
Transmission network element have the syntople transmission network element, obtain it is described it is most possible formed looped network transmission network element collection
It closes.
5. recognition methods according to claim 1, which is characterized in that the recognition methods further includes：
Plug-in unit is presented using specified topological diagram, the looped network in the topological non-directed graph is presented.
6. a kind of identification device of Loop networks, which is characterized in that the identification device includes：
Adjacency matrix constructing module, for the topological non-directed graph according to specified transmission light path topology, generation includes the topology
In non-directed graph transmit network element between syntople adjacency matrix；
Pending adjacency matrix screening module filters out the adjacent pass for the adjacency matrix by the topological non-directed graph
Transmission network element of the quantity of system less than 2 is as the transmission network element rejected；
Network element screening module is transmitted, includes the adjacency matrix of the syntople between the transmission network element that do not reject for analyzing processing,
Obtain most possibly being formed the set of the transmission network element of looped network；
Looped network computing module utilizes preset topology for the set according to the most possible transmission network element for forming looped network
The looped network in the topological non-directed graph is calculated in figure traversal search algorithm.
7. identification device according to claim 6, which is characterized in that
The columns of the line number of the adjacency matrix and the adjacency matrix is the number that network element is transmitted in the topological non-directed graph；
In the adjacency matrix, the corresponding element value of transmission network element with the syntople is set as 1, does not have described
The corresponding element value of transmission network element of syntople is set as 0.
8. identification device according to claim 6, which is characterized in that the pending adjacency matrix screening module is specifically used
In：
Count the quantity for the syntople that the corresponding transmission network element of row has in the adjacency matrix of the topological non-directed graph；It will
The quantity transmission network element corresponding less than 2 row of obtained syntople is counted as the transmission network element rejected.
9. identification device according to claim 6, which is characterized in that the transmission network element screening module includes：
Syntople quantity statistics unit, the adjacency matrix for that will include syntople between the transmission network element that do not reject are made
For adjacency matrix to be analyzed, the adjacent pass that the corresponding transmission network element of row in the adjacency matrix to be analyzed has is counted
The quantity of system；
Network element culling unit is transmitted, if had for the corresponding transmission network element of row in the adjacency matrix to be analyzed described
The quantity of syntople is less than 2, the biography corresponding to row by the quantity of syntople in the adjacency matrix to be analyzed less than 2
Transmission network element of the defeated network element as the rejecting；
Adjacency matrix updating unit, for the adjacency matrix to be analyzed to be updated to include the transmission network element that do not reject
Between syntople adjacency matrix, until the corresponding adjoining that has of transmission network element of row in the adjacency matrix to be analyzed
The quantity of relationship is all higher than equal to 2；
Looped network transmits network element acquiring unit, the corresponding transmission network element of row for obtaining the adjacency matrix to be analyzed and institute
The corresponding transmission network element of row for stating adjacency matrix to be analyzed has the transmission network element of the syntople, obtains that described most have can
The set of the transmission network element of looped network can be formed.
10. identification device according to claim 6, which is characterized in that further include：
Module is presented in looped network, and plug-in unit is presented using specified topological diagram, and the looped network in the topological non-directed graph is presented.
11. a kind of identifying system of Loop networks, which is characterized in that the identifying system includes：
Memory, for storing program；
Processor, for running the described program stored in the memory, to execute following steps：
According to the topological non-directed graph of specified transmission light path topology, generation includes adjacent between transmission network element in the topological non-directed graph
The adjacency matrix of relationship；
By the adjacency matrix of the topological non-directed graph, the quantity for filtering out the syntople is less than 2 transmission network element conduct
The transmission network element of rejecting；
Analyzing processing includes the adjacency matrix of the syntople between the transmission network element that do not reject, obtains most possibly forming looped network
Transmit the set of network element；
According to the set of the most possible transmission network element for forming looped network, calculated using preset topological diagram traversal search algorithm
Obtain the looped network in the topological non-directed graph；
Display unit, for showing the looped network in the topological non-directed graph being calculated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710156073.3A CN108599970A (en) | 2017-03-17 | 2017-03-17 | The recognition methods of Loop networks, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710156073.3A CN108599970A (en) | 2017-03-17 | 2017-03-17 | The recognition methods of Loop networks, device and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108599970A true CN108599970A (en) | 2018-09-28 |
Family
ID=63632920
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710156073.3A Pending CN108599970A (en) | 2017-03-17 | 2017-03-17 | The recognition methods of Loop networks, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108599970A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110797093A (en) * | 2019-11-20 | 2020-02-14 | 中国石油大学(北京) | Gas hydrate 512Cage identification method and system |
| CN110880358A (en) * | 2019-11-20 | 2020-03-13 | 中国石油大学(北京) | Gas hydrate 51262Cage identification method and system |
| CN111276193A (en) * | 2020-01-19 | 2020-06-12 | 中国石油大学(北京) | Gas hydrate 51264Cage identification method and system |
| CN111327504A (en) * | 2020-02-26 | 2020-06-23 | 深信服科技股份有限公司 | Virtual local area network loop detection method, device, equipment and readable storage medium |
| CN111447091A (en) * | 2020-03-25 | 2020-07-24 | 深信服科技股份有限公司 | Network loop detection method, device, equipment and storage medium |
| CN111901207A (en) * | 2020-09-11 | 2020-11-06 | 中国联合网络通信集团有限公司 | Method, device and system for detecting transmission network fault |
| CN113037520A (en) * | 2019-12-09 | 2021-06-25 | 深信服科技股份有限公司 | Loop detection method, device and equipment and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102137405A (en) * | 2010-06-01 | 2011-07-27 | 华为技术有限公司 | Method and device for constructing network topology |
| EP2568663A1 (en) * | 2011-09-12 | 2013-03-13 | Honeywell International Inc. | Apparatus and method for identifying optimal node placement to form redundant paths around critical nodes and critical links in a multi-hop network |
| CN104240150A (en) * | 2014-09-10 | 2014-12-24 | 中国能源建设集团广东省电力设计研究院 | Power distribution network reconstruction method and system |
| CN104754626A (en) * | 2013-12-26 | 2015-07-01 | 北京亿阳信通科技有限公司 | Transmission network physical node networking analysis method and device |
-
2017
- 2017-03-17 CN CN201710156073.3A patent/CN108599970A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102137405A (en) * | 2010-06-01 | 2011-07-27 | 华为技术有限公司 | Method and device for constructing network topology |
| EP2568663A1 (en) * | 2011-09-12 | 2013-03-13 | Honeywell International Inc. | Apparatus and method for identifying optimal node placement to form redundant paths around critical nodes and critical links in a multi-hop network |
| CN104754626A (en) * | 2013-12-26 | 2015-07-01 | 北京亿阳信通科技有限公司 | Transmission network physical node networking analysis method and device |
| CN104240150A (en) * | 2014-09-10 | 2014-12-24 | 中国能源建设集团广东省电力设计研究院 | Power distribution network reconstruction method and system |
Non-Patent Citations (4)
| Title |
|---|
| HISIDE: "【转】判断一个图是否有环 无向图 有向图", 《HTTPS://WWW.CNBLOGS.COM/HISIDE/ARCHIVE/2010/12/01/1893878.HTML?SPM=A2C6H.12873639.0.0.47527C4AL3WQVK》 * |
| INSISTGOGO: "判断无向图中环的个数以及每个环中的元素", 《HTTPS://BLOG.CSDN.NET/INSISTGOGO/ARTICLE/DETAILS/6941413》 * |
| STEPHAN14: "判断无向图中是否有回路", 《HTTPS://WWW.GEEK-SHARE.COM/DETAIL/2629634310.HTML》 * |
| SUNMENGGMAIL: "查找有向图中的环", 《HTTPS://BLOG.CSDN.NET/SUNMENGGMAIL/ARTICLE/DETAILS/7324646》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110797093A (en) * | 2019-11-20 | 2020-02-14 | 中国石油大学(北京) | Gas hydrate 512Cage identification method and system |
| CN110880358A (en) * | 2019-11-20 | 2020-03-13 | 中国石油大学(北京) | Gas hydrate 51262Cage identification method and system |
| CN113037520A (en) * | 2019-12-09 | 2021-06-25 | 深信服科技股份有限公司 | Loop detection method, device and equipment and readable storage medium |
| CN111276193A (en) * | 2020-01-19 | 2020-06-12 | 中国石油大学(北京) | Gas hydrate 51264Cage identification method and system |
| CN111276193B (en) * | 2020-01-19 | 2023-10-27 | 中国石油大学(北京) | Gas hydrate 5 12 6 4 Cage identification method and system |
| CN111327504A (en) * | 2020-02-26 | 2020-06-23 | 深信服科技股份有限公司 | Virtual local area network loop detection method, device, equipment and readable storage medium |
| CN111447091A (en) * | 2020-03-25 | 2020-07-24 | 深信服科技股份有限公司 | Network loop detection method, device, equipment and storage medium |
| CN111447091B (en) * | 2020-03-25 | 2023-09-08 | 深信服科技股份有限公司 | Network loop detection method, device, equipment and storage medium |
| CN111901207A (en) * | 2020-09-11 | 2020-11-06 | 中国联合网络通信集团有限公司 | Method, device and system for detecting transmission network fault |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108599970A (en) | The recognition methods of Loop networks, device and system | |
| CN109784636A (en) | Fraudulent user recognition methods, device, computer equipment and storage medium | |
| US10002144B2 (en) | Identification of distinguishing compound features extracted from real time data streams | |
| US7990878B2 (en) | Identifying components of a network having high importance for network integrity | |
| US20200021511A1 (en) | Performance analysis for transport networks using frequent log sequence discovery | |
| CN109816535A (en) | Cheat recognition methods, device, computer equipment and storage medium | |
| CN109859054A (en) | Network community method for digging, device, computer equipment and storage medium | |
| CN107391369A (en) | A kind of spanned item mesh failure prediction method based on data screening and data oversampling | |
| CN113259176B (en) | Alarm event analysis method and device | |
| CN109981326B (en) | Method and device for positioning household broadband sensing fault | |
| CN111935063B (en) | Abnormal network access behavior monitoring system and method for terminal equipment | |
| CN105282123A (en) | Network protocol identification method and device | |
| CN110532399A (en) | Knowledge mapping update method, system and the device of object game question answering system | |
| CN110414236A (en) | A kind of detection method and device of malicious process | |
| CN114153980A (en) | Knowledge graph construction method and device, inspection method and storage medium | |
| CN107977592A (en) | A kind of image text detection method and system, user terminal and server | |
| Ragunathan et al. | Link prediction by analyzing common neighbors based subgraphs using convolutional neural network | |
| CN114356989A (en) | Audit abnormal data detection method and device | |
| CN109993390A (en) | Alarm association and worksheet processing optimization method, device, equipment and medium | |
| CN109981389A (en) | Phone number recognition methods, device, equipment and medium | |
| CN106778352B (en) | Multisource privacy protection method for combined release of set value data and social network data | |
| CN112383431A (en) | Method and device for identifying data of internet of things in internet | |
| CN112686654A (en) | Block chain digital currency transaction identification method and device, electronic equipment and storage medium | |
| CN107454089A (en) | A kind of network safety situation diagnostic method based on multinode relevance | |
| CN115766176A (en) | Network traffic processing method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180928 |
|
| RJ01 | Rejection of invention patent application after publication |