An effective weighted matrix algorithm for determining connection status of alarm emitting routes

In this paper, we propose an effective weighted matrix algorithm applicable to large-scale telecom services that determines the actual connection status after receiving network devices´ alarms. In this algorithm, the alarm emitting route is divided into paths. Each path is analyzed by calculating various given weights in accordance to alarm types. After the calculation, the result can accurately identify if services are affected by this network problem, and thus helps to reduce unnecessary dispatches and reduce the operating cost of carriers. Additionally, this algorithm can be applied to popular network structures like PDH (Plesiochronous Digital Hierarchy), SDH (Synchronous Digital Hierarchy), ADSL (Asymmetric Digital Subscriber Line), FTTx (Fiber To The X), and other complex routing structures like those with rings or link aggregations. We also prove that the algorithm has low computational complexity. It is both effective and accurate for determining if a network alarm really affects service usage in large-scale telecom services.