One Reduction Method of Telecommunications Nework Events

Article Preview

Abstract:

In this paper, the mass events of telecommunication network are researched, the none fault events reduction method and repeat events reduction method are proposed after researching the events of telecommunications network, on the basis of researching the characteristics of the events of telecommunications network, the improved methods were proposed. Further, in the aspect of event reduction performance, proposed the fingerprint algorithm, the events reduction process of inefficient much text comparison convert efficient integer value comparison, effectively improve the performance of the event reduction, meets real-time event handling performance requirements.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 301-303)

Pages:

1166-1171

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] RFC3309, Stream Control Transmission Protocol (SCTP) Checksum Change[S], J. Stone, R. Stewart, D. Otis, September (2002).

DOI: 10.17487/rfc3309

Google Scholar

[2] RFC1321, The MD5 Message-Digest Algorithm[S], MIT Laboratory for Computer Science and RSA Data Security, Inc. April (1992).

Google Scholar

[3] RFC3174, US Secure Hash Algorithm 1 (SHA1)[S], D. Eastlake, P. Jones, September (2001).

DOI: 10.17487/rfc3174

Google Scholar

[4] Dong D, Mc Avoy T.J. Nonlinear Principal component analysis-based on principal curves and neural networks[J], Computer Chemical Engineering, 1996, 20(l): 65-78.

DOI: 10.1016/0098-1354(95)00003-k

Google Scholar

[5] Bouloutas A. T, Calo S, Finkel A. Alarm Correlation and Fault Identification in Communication Networks[J]. IEEE Transactions on Communications. 1994, 42 : 523-533.

DOI: 10.1109/tcomm.1994.577079

Google Scholar

[6] Irene K, Mischa S. Schemes for Fault identification in Communication Networks[J]. IEEE/ACM Transaction on Networks. 1995, 3(6): 753-764.

Google Scholar