DocumentCode :
1994099
Title :
Predicting Critical Intradomain Routing Events
Author :
Medem, Amelie ; Teixeira, Renata ; Usunier, Nicolas
Author_Institution :
CNRS, UPMC Paris Universitas, Paris, France
fYear :
2010
fDate :
6-10 Dec. 2010
Firstpage :
1
Lastpage :
5
Abstract :
Network equipments generate an overwhelming number of reports and alarms every day, but only a small fraction of these alarms require the intervention of network operators. Our goal is to build a system to automatically select the set of critical alarms, so that network operators can focus their time and effort on these critical events. As a first step, we focus on alarms from intradomain routing. Our key observation is that operators already use trouble ticketing systems to record all events that require their intervention. Hence, we can use the history of trouble tickets combined with intradomain routing messages to train a classifier. Then, we can apply this classifier online to process intradomain routing messages and single out the critical events. This paper shows the feasibility of this approach by using the k-nearest neighbor algorithm to build classifiers from IS-IS and trouble ticket data from two networks. Our results show that we can accurately pinpoint approximately 70% of critical events for both networks.
Keywords :
IP networks; telecommunication network routing; classifiers; critical alarms; critical intradomain routing event; intradomain routing message; k-nearest neighbor algorithm; trouble ticketing systems; Delay; IEEE Communications Society; Prediction algorithms; Routing; Routing protocols; Training; Virtual private networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Conference_Location :
Miami, FL
ISSN :
1930-529X
Print_ISBN :
978-1-4244-5636-9
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2010.5683780
Filename :
5683780
Link To Document :
بازگشت