Julian Sorensen, Peter Dickinson, and Martin Schubert (2003),
Sensitivity of Graph Distance Measures,
Computing Science and Statistics, 35,
I2003Proceedings/SorensenJulian/SorensenJulian.paper.pdf
Abstract
The performance management of computer networks is becoming increasingly important given the dynamic nature of traffic on these networks. There exists a number of graph similarity measures for network monitoring and abnormal change detection. It is necessary to quantify and compare the performance of these measures, against known types of abnormal network behaviour, to assess their suitability for use in a variety of network monitoring activities. We present a preliminary study of the performance of graph distance measures using simulated and real network traffic.