Visible to the public Using k-nearest neighbor method to identify poison message failure

TitleUsing k-nearest neighbor method to identify poison message failure
Publication TypeConference Paper
Year of Publication2004
AuthorsDu, Xiaojiang
Conference NameIEEE Global Telecommunications Conference, 2004. GLOBECOM '04
Date Published29 Nov.-3 Dec. 2
ISBN Number 0-7803-8794-5
KeywordsAI Poisoning, Computer bugs, Computer science, control systems, data mining, Human Behavior, IP networks, Large-scale systems, learning (artificial intelligence), machine learning, network fault management, poison message failure identification, probabilistic k-nearest neighbor method, Probability distribution, Protocols, pubcrawl, resilience, Resiliency, Routing, Scalability, statistical distributions, System testing, telecommunication computing, telecommunication network management, telecommunication network reliability, telecommunication security, telecommunications networks, Telephony, Toxicology, unstable network
Abstract

Poison message failure is a mechanism that has been responsible for large scale failures in both telecommunications and IP networks. The poison message failure can propagate in the network and cause an unstable network. We apply a machine learning, data mining technique in the network fault management area. We use the k-nearest neighbor method to identity the poison message failure. We also propose a "probabilistic" k-nearest neighbor method which outputs a probability distribution about the poison message. Through extensive simulations, we show that the k-nearest neighbor method is very effective in identifying the responsible message type.

URLhttps://ieeexplore.ieee.org/document/1378384/
DOI10.1109/GLOCOM.2004.1378384
Citation Keydu_using_2004