CN111817903B - Link fault analysis and alarm method for digital signal transmission processing equipment - Google Patents

Abstract

The invention belongs to the technical field of digital instrument and equipment monitoring, and particularly relates to a link fault analysis and alarm method for digital audio and video signal transmission processing equipment, which comprises the following steps of 1: converting the device link into N DAGs; step 2: marking an alarm signal node; and step 3: performing breadth-first traversal on the DAG being processed, and sequencing the alarm signal nodes into a set C1; and 4, step 4: using an independent path finding algorithm for set C1; and 5: if the number N of DAGs in the data structure G in step 1 is greater than 1, repeating steps 2-4, finding out a fault path and a fault source in each DAG, and ending the algorithm. The invention can accurately analyze and position the fault source, improve the processing efficiency, help the user to find the fault source quickly, shorten the fault response time, and improve the safety of the whole system.

Description

Link fault analysis and alarm method for digital signal transmission processing equipment

Technical Field

The invention belongs to the technical field of instrument and equipment monitoring, and particularly relates to a link fault analysis and alarm method for digital signal transmission processing equipment.

Background

With the rapid development of information technology, more and more services are provided related to the transmission and processing of digital audio/video signals, and the system is more and more complex. In a transmission link, a plurality of signal sources are required to distribute, switch, process and schedule digital audio and video signals, and a few professional devices and a plurality of tens of professional devices are required to perform cooperative processing. Failure of any of these devices can have an effect on the final output signal, and it is impractical to monitor and manage such a large number of devices manually. Therefore, various comprehensive informatization solutions for monitoring, alarming and processing are presented in the industry, and are called as a comprehensive monitoring system.

The "integrated monitoring system" can monitor all critical equipment of the equipment link, signals flowing through each equipment and the environment, temperature, etc. of the machine room. When equipment failure or signal loss occurs, the system can give an audible and visual alarm, and wrong equipment is indicated on a display for manual reference.

However, the fault analysis and positioning method in the existing "integrated monitoring system" has some defects such as when no signal is output from the upstream device, all the downstream devices using the signal have no signal input and output, so that a large amount of alarm information is generated, without a complete topology, it is difficult to determine the source of the error, and when there are multiple device failures, the situation is further complicated, and some general control systems provide a dynamic display of the topology of the device connections, but only the personnel on site can see and locate the source of the problem according to the experience, other people who remotely receive the alarm through short messages or other modes are inconvenient to judge, so that a system fault analysis and positioning method which can help users to quickly find a fault source, shorten the fault response time, improve the broadcasting safety, optimize the fault alarm information display and prevent the users from receiving a lot of disordered alarm information is urgently needed.

Disclosure of Invention

The invention provides a link fault analysis and alarm method for digital signal transmission processing equipment, which is characterized by comprising the following steps of:

step 1: converting an equipment link into N DAGs, wherein the equipment link comprises k equipment and m signal connecting lines among the equipment, and the k equipment can be converted into k independent node sets Cv = { Vertex [1], Vertex [2], … and Vertex [ k ] } in the DAGs; the m signal connecting lines can be converted into m Edge sets Ce = { Edge [1], Edge [2], …, Edge [ m ] }inthe DAG; any Edge [ j ] in the set Ce is connected with 2 corresponding nodes in the set Cv, the flow direction of the Edge is the flow direction of the signal, and the node set Cv and the Edge set Ce form a data structure G; if there are N relatively independent sublinks in a device link, and the sublinks are not connected to each other by edges, then in G, there are also N independent DAGs (N > = 1);

step 2: an alarm signal mark, when a monitoring agent detects that a certain device is abnormal, the monitoring agent reports abnormal information to a monitoring server, a plurality of devices are abnormal at the same time, the server receives a plurality of abnormalities, the device abnormality can be automatically recovered in the process, the recovery information is notified to the server, in a DAG after conversion, alarm information is processed, namely, a corresponding node V [ i ] is marked as an abnormal point when the abnormality occurs, when the abnormality is recovered, the abnormal mark of the corresponding node V [ i ] is cancelled, and a mark point set C = { V1, V2.. Vn } at the current moment can be obtained when the device abnormality occurs every time;

and step 3: running breadth-first traversal on the DAG being processed, and sequencing the nodes in the set C according to the breadth-first traversal sequence, wherein the sequenced set is C1;

and 4, step 4: using an independent PATH search algorithm for the set C1 to search mutually independent PATHs, forming a PATH set Cp = { PATH1, PATH 2.. PATH } (n > =1), where a starting point Vs of each PATH in the Cp is a fault source;

and 5: and if the number N of DAGs in the data structure G in the step 1 is more than 1, repeating the steps 2-4, finding out a fault path and a fault source in each DAG, and ending the algorithm.

Preferably, the breadth-first traversal in step 3 is a traversal strategy of the connected graph, and starts from the starting node V0, and traverses a wider area around the starting node radially and preferentially, and the specific steps are as follows:

1: accessing an initial node v and marking the node v as accessed;

2: the node v is queued;

3: when the queue is not empty, the execution is continued, otherwise, the algorithm is ended;

4: dequeuing to obtain a head node u;

5: searching a first adjacent node w of the node u;

6: if the adjacent node w of the node u does not exist, turning to the step 3, otherwise, circularly executing the following three steps:

1) if node w has not been visited, then node w is visited and marked as visited;

2) node w enqueues;

3) searching the next adjacent node w of the node u after the adjacent node w, and turning to the step 5;

the traversal sequence of the breadth-first algorithm is as follows: 1- >2- >3- >4- >5- >6- >7- > 8.

Preferably, the specific steps of step 4 are as follows:

a, newly building an empty PATH, PATH, and taking out a first node V1 in C1 to add into the PATH;

b, in the DAG of the graph in which V1 is located, finding a subsequent node set { Vnext1, Vnext2,. Vnextm } of V1, and if the subsequent node is in the set C1, taking the node out of C1 and adding the node into the PATH PATH;

c, repeating the steps A and B until no subsequent node belongs to C1, and thus finding an independent PATH PATH;

and D, repeating the steps A, B and C until the nodes in the C1 set are empty.

The invention has the beneficial effects that:

1. the method can accurately analyze and position the fault source, improve the processing efficiency, help the user to quickly find the fault source, shorten the fault response time and improve the broadcasting safety;

2. the invention can optimize the information display of the fault alarm, and the user can not receive a lot of disordered alarm information.

Drawings

FIG. 1 is a flow chart of the present invention.

Fig. 2 is a schematic diagram of a data structure G.

Fig. 3 is a traversal order diagram of the breadth first algorithm.

Detailed Description

The present invention will be described in further detail with reference to examples, but the embodiments of the present invention are not limited thereto. The embodiments of the present invention are not limited to the embodiments described above, and any other changes, modifications, substitutions, combinations, and simplifications which do not depart from the spirit and principle of the present invention should be construed as equivalents thereof, and they are included in the scope of the present invention.

The invention provides a link fault analysis and alarm method for digital audio and video signal transmission processing equipment. The engineering technicians in the field can compile algorithm programs according to the invention, and implant the compiled programs into corresponding equipment, thereby realizing accurate analysis and positioning of fault sources and optimizing fault alarm information.

Example 1:

as shown in fig. 1 and fig. 2, a link failure analysis and alarm method for a digital audio/video signal transmission processing device includes the following steps:

step 1: converting an equipment link into N DAGs, wherein the equipment link comprises m signal connecting lines between N equipment and the equipment, the N equipment (Dev [ i ]) can be converted into N independent nodes Vertex [ i ] in the DAG, the m signal connecting lines can be converted into m edges [ j ], the edges [ j ] are connected with 2 corresponding nodes in the DAG, the flow direction of the edges is also the flow direction of the signals, the N independent nodes Vertex [ i ] and the m edges [ j ] form a data structure G, if N relatively independent sub-links exist in the equipment link, and the sub-links are not connected with each other by edges, then N independent DAGs (N > =1) also exist in the G;

step 2: an alarm signal mark, wherein when a monitoring agent detects that a certain device is abnormal, the monitoring agent reports abnormal information to a monitoring server, multiple devices are abnormal at the same time, the server receives multiple abnormalities, the device abnormality is also possible to be automatically recovered in the process, the recovery information is notified to the server, in a converted DAG, alarm information is processed, namely, corresponding nodes are marked (V [ i ]. Exception = true) when the abnormality occurs, and when the abnormality is recovered, the marks (V [ i ]. Exception = false) of the corresponding nodes are cancelled, and a mark point set C = { V1, V2.. Vn } at the current moment can be obtained each time when the device abnormality occurs;

and step 3: running breadth-first traversal on the DAG being processed, and sequencing the nodes in the set C according to the breadth-first traversal sequence, wherein the sequenced set is C1;

and 4, step 4: using an independent PATH search algorithm for the set C1 to search mutually independent PATHs, forming a PATH set Cp = { PATH1, PATH 2.. PATH } (n > =1), where a starting point Vs of each PATH in the Cp is a fault source;

and 5: if the number N of DAGs in the data structure G in step 1 is greater than 1, repeating steps 2-4, finding out a fault path and a fault source in each DAG, and ending the algorithm.

The DAG is a directed acyclic graph and is a special directed graph in graph theory. The graph is used as a data structure and consists of edges and points, wherein the edges in the directed graph are unidirectional and cannot be retrograde, and when one directed graph cannot start from a certain node and return to the node through a plurality of edges.

The device link is a digital audio and video signal transmission processing device link, in the transmission link, a plurality of signal sources are needed for distribution, switching, processing and scheduling of digital audio and video signals, and a few professional devices and dozens of professional devices are needed for processing the digital audio and video signals.

The digital audiovisual signal flow direction of the present invention is unidirectional, being transmitted from one device to another or more devices, and thus the entire device link may be described as one or more Directed Acyclic Graphs (DAGs). After the alarm of the equipment occurs, the equipment is marked and processed in a DAG data structure, and a plurality of alarm paths can be conveniently found out by utilizing a correlation algorithm of a graph theory, so that an alarm source is determined.

Example 2:

based on embodiment 1, as shown in fig. 3, the breadth-first traversal in step 3 is a traversal strategy of the connected graph, and starts from the starting node V0, a wider area around the starting node is radially traversed preferentially, that is, starting from V0, each non-visited adjacent point W1, W2, …, Wk of V0 is visited, and then, starting from W1, W2, …, Wk, each non-visited adjacent point is visited in turn. The method comprises the following specific steps:

1: accessing an initial node v and marking the node v as accessed;

2: the node v is queued;

3: when the queue is not empty, the execution is continued, otherwise, the algorithm is ended;

4: dequeuing to obtain a head node u;

5: searching a first adjacent node w of the node u;

6: if the adjacent node w of the node u does not exist, turning to the step 3, otherwise, circularly executing the following three steps:

1) if node w has not been visited, then node w is visited and marked as visited;

2) node w enqueues;

3) searching the next adjacent node w of the node u after the adjacent node w, and turning to the step 5;

the traversal sequence of the breadth-first algorithm is as follows: 1- >2- >3- >4- >5- >6- >7- > 8.

And v, u and w are node names.

Example 3:

on the basis of the embodiment 1, the specific steps of the step 4 are as follows:

a, newly building an empty PATH, PATH, and taking out a first node V1 in C1 to add into the PATH;

b, in the DAG of the graph in which V1 is located, finding a subsequent node set { Vnext1, Vnext2,. Vnextm } of V1, and if the subsequent node is in the set C1, taking the node out of C1 and adding the node into the PATH PATH;

c, repeating the steps A and B until no subsequent node belongs to C1, and thus finding an independent PATH PATH;

and D, repeating the steps A, B and C until the nodes in the C1 set are empty.

The PATH refers to a set of associated points and edges in the graph, and is a proper subset of the graph.

Claims (3)

1. A link fault analysis and alarm method for digital signal transmission processing equipment is characterized by comprising the following steps:

step 1: converting an equipment link into N DAGs, wherein the equipment link comprises k equipment and m signal connecting lines among the equipment, and the k equipment can be converted into k independent node sets Cv = { Vertex [1], Vertex [2], … and Vertex [ k ] } in the DAGs; the m signal connecting lines can be converted into m Edge sets Ce = { Edge [1], Edge [2], …, Edge [ m ] }inthe DAG; any Edge [ j ] in the set Ce is connected with 2 corresponding nodes in the set Cv, the flow direction of the Edge is the flow direction of the signal, and the node set Cv and the Edge set Ce form a data structure G; if there are N relatively independent sublinks in a device link, and the sublinks are not connected to each other by edges, then in G, there are also N independent DAGs (N > = 1);

step 2: an alarm signal mark, when a monitoring agent detects that a certain device is abnormal, the monitoring agent reports abnormal information to a monitoring server, a plurality of devices are abnormal at the same time, the server receives a plurality of abnormalities, the device abnormality can be automatically recovered in the process, the recovery information is notified to the server, in a DAG after conversion, alarm information is processed, namely, a corresponding node V [ i ] is marked as an abnormal point when the abnormality occurs, when the abnormality is recovered, the abnormal mark of the corresponding node V [ i ] is cancelled, and a mark point set C = { V1, V2.. Vn } at the current moment can be obtained when the device abnormality occurs every time;

and step 3: running breadth-first traversal on the DAG being processed, and sequencing the nodes in the set C according to the breadth-first traversal sequence, wherein the sequenced set is C1;

and 4, step 4: using an independent PATH search algorithm for the set C1 to search mutually independent PATHs, forming a PATH set Cp = { PATH1, PATH 2.. PATH } (n > =1), where a starting point Vs of each PATH in the Cp is a fault source;

and 5: and if the number N of DAGs in the data structure G in the step 1 is more than 1, repeating the steps 2-4, finding out a fault path and a fault source in each DAG, and ending the algorithm.

2. The method for analyzing and alarming link failure of digital signal transmission processing equipment according to claim 1, wherein the breadth-first traversal in step 3 is a traversal strategy of the connectivity graph, and starts from a starting node V1, and radially and preferentially traverses a wider area around the starting node V1, and specifically comprises the following steps:

1: accessing an initial node v and marking the node v as accessed;

2: the node v is queued;

3: when the queue is not empty, the execution is continued, otherwise, the algorithm is ended;

4: dequeuing to obtain a head node u;

5: searching a first adjacent node w of the node u;

6: if the adjacent node w of the node u does not exist, turning to the step 3, otherwise, circularly executing the following three steps:

1) if node w has not been visited, then node w is visited and marked as visited;

2) node w enqueues;

3) searching the next adjacent node w of the node u after the adjacent node w, and turning to the step 5;

the traversal sequence of the breadth-first algorithm is as follows: 1- >2- >3- >4- >5- >6- >7- > 8.

3. The method for analyzing and alarming link failure of digital signal transmission processing equipment according to claim 1, wherein the specific steps of the step 4 are as follows:

a, newly building an empty PATH, PATH, and taking out a first node V1 in C1 to add into the PATH;

b, in the DAG of the graph in which V1 is located, finding a subsequent node set { Vnext1, Vnext2,. Vnextm } of V1, and if the subsequent node is in the set C1, taking the node out of C1 and adding the node into the PATH PATH;

c, repeating the steps A and B until no subsequent node belongs to C1, and thus finding an independent PATH PATH;

and D, repeating the steps A, B and C until the nodes in the C1 set are empty.

Images