Robust event correlation scheme for fault identification in communication networks

✍ Scribed by Chi-Chun Lo; Shing-Hong Chen

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 134 KB
• Volume: 12
• Category: Article
• ISSN: 1074-5351
• DOI: 10.1002/(sici)1099-1131(199905/06)12:3<217::aid-dac397>3.0.co;2-b

✦ Synopsis

The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly di$cult. Since faults are inevitable, quick detection, identi"cation, and recovery are crucial to make the systems more robust and their operation more reliable. This paper proposes a novel event correlation scheme for fault identi"cation in communication networks. This scheme is based on the algebraic operations of sets. The causality graph model is used to describe the cause-and-e!ect relationships between network events. For each disorder, and each manifestation, a unique prime number is assigned. The use of the greatest common devisor (GCD) makes the correlation process simple and fast. A simulation model is developed to verify the e!ectiveness and e$ciency of the proposed scheme. From simulation results, we notice that this scheme not only identi"es multiple disorders at one time but also is insensitive to noise. The time complexity of the correlation process is close to a function of n, where n is the number of observed manifestations, with order O(n); therefore, the on-line fault identi"cation is easy to achieve.