DocumentCode :
2412302
Title :
Median graphs and anomalous change detection in communication networks
Author :
Dickinson, Patrick ; Bunke, Horst ; Dadej, Arek ; Kraetzl, M.
Author_Institution :
Commun. Div., Defence Sci. & Technol. Organ., Salisbury, SA, Australia
fYear :
2002
fDate :
11-13 Feb. 2002
Firstpage :
59
Lastpage :
64
Abstract :
To improve the network management of large enterprise data networks we propose a novel approach to abnormal network change detection. Periodic observations of logical communications within a network are represented as a time series of graphs. Based on two different graph distance measures, the concept of median graph is introduced. The median of a time series of graphs is a graph that is most representative of all graphs in the series. In the application to time series of communication networks considered in this paper, constraints exist that greatly decrease the computational complexity of the construction of median graphs. An application of median graphs to the analysis of a large data network is given.
Keywords :
business data processing; computational complexity; computer network management; graph theory; local area networks; time series; change detection; communication network management; computational complexity; enterprise data networks; graph distance; large data network; median graph; time series; Australia; Communication networks; Computational complexity; Intelligent networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information, Decision and Control, 2002. Final Program and Abstracts
Conference_Location :
Adelaide, SA, Australia
Print_ISBN :
0-7803-7270-0
Type :
conf
DOI :
10.1109/IDC.2002.995366
Filename :
995366
Link To Document :
بازگشت