Monitoring Changes in the Stability of Networks Using Eigenvector Centrality

Monitoring networks for anomalies is a typical duty of network operators. The conventional monitoring tools available today tend to almost ignore the topological characteristics of the whole network. This thesis takes a different approach from the conventional monitoring tools, by employing the principle of Eigenvector Centrality. Traditionally, this principle is used to analyse vulnerability and social aspects of networks. The proposed model reveals that topological characteristics of a network can be used to improve the conventional unreliability predictors, and to give a better indicator of its potential weaknesses. An effective expected adjacency matrix, k, is introduced in this work to be used with centrality calculations, and it reflects the factors which affect the reliability of a network, for e.g. link downtimes, link metrics, packet loss, etc. Using these calculations, all network backbone routers are assigned values which correspond to the importance of those routers in comparison to the rest of the network nodes. Furthermore, to observe how vulnerable each node could be, nodes are ranked according to the importance values, where the nodes with high ranking values are more vulnerable. This model is able to analyse temporal stability of the network, observing and comparing the rate of change in node ranking values and connectivity caused by the network link failures. The results show that the proposed model is dynamic, and changes according to the dynamics of the topology of the network, i.e. upgrading, link failures, etc.

[1]  Thomas W. Valente,et al.  The stability of centrality measures when networks are sampled , 2003, Soc. Networks.

[2]  Richard C. Harlan Network management with Nagios , 2003 .

[3]  Gagan L. Choudhury,et al.  Faster link-state IGP convergence and improved network scalability and stability , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.

[4]  Jie Wu,et al.  An Extended Fault-Tolerant Link-State Routing Protocol in the Internet , 2003, IEEE Trans. Computers.

[5]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[6]  Chris Oggerino High Availability Network Fundamentals , 2001 .

[7]  Understanding High Availability of IP and MPLS Networks , 2004 .

[8]  D. O. Awduche,et al.  MPLS and traffic engineering in IP networks , 1999, IEEE Commun. Mag..

[9]  Mark Burgess,et al.  Archipelago: A Network Security Analysis Tool , 2003, LISA.

[10]  Willy Zwaenepoel,et al.  Implementation and performance of Munin , 1991, SOSP '91.

[11]  Andrew S. Tanenbaum,et al.  Computer networks, third edition , 1996 .

[12]  Huaibei Zhou,et al.  End-to-end availability analysis of physical network , 2004, The Fourth International Conference onComputer and Information Technology, 2004. CIT '04..

[13]  Athina Markopoulou,et al.  Service Availability in IP Networks , .

[14]  Tzi-cker Chiueh,et al.  Experiences in building a multihoming load balancing system , 2004, IEEE INFOCOM 2004.

[15]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[16]  Ross W. Callon,et al.  Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.

[17]  Jon G. Riecke,et al.  Stability issues in OSPF routing , 2001, SIGCOMM.

[18]  Peter S. Weygant,et al.  Clusters for High Availability: A Primer of HP Solutions , 1996 .

[19]  Diane Teare,et al.  Building Scalable Cisco Networks , 2000 .

[20]  Olivier Bonaventure,et al.  Achieving sub-second IGP convergence in large IP networks , 2005, CCRV.

[21]  Vivek Alwayn,et al.  Advanced MPLS Design and Implementation , 2001 .

[22]  Mikkel Thorup,et al.  Robust optimization of OSPF/IS-IS weights , 2003 .

[23]  Taher H. Haveliwala Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search , 2003, IEEE Trans. Knowl. Data Eng..

[24]  Takashi Kurimoto,et al.  Enhancing the network scalability of link-state routing protocols by reducing their flooding overhead , 2003, Workshop on High Performance Switching and Routing, 2003, HPSR..

[25]  Alex Pentland,et al.  Sensing and modeling human networks using the sociometer , 2003, Seventh IEEE International Symposium on Wearable Computers, 2003. Proceedings..

[26]  Bianca Schroeder,et al.  IGP link weight assignment for transient link failures , 2003 .

[27]  D. Goderis,et al.  Service level agreements: a main challenge for next generation networks , 2002, 2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563).

[28]  Konstantina Papagiannaki,et al.  Measurement and analysis of single-hop delay on an IP backbone network , 2003, IEEE J. Sel. Areas Commun..

[29]  Antonio Nucci,et al.  Increasing the robustness of IP backbones in the absence of optical level protection , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[30]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[31]  Shu Zhang,et al.  Rtanaly: A System to Detect and Measure IGP Routing Changes , 2005, IPOM.

[32]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[33]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[34]  Abe Martey,et al.  IS-IS Network Design Solutions , 2002 .

[35]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[36]  R. Perlman A comparison between two routing protocols: OSPF and IS-IS , 1991, IEEE Network.

[37]  Mark Burgess,et al.  A graph-theoretical model of computer security , 2004, International Journal of Information Security.

[38]  Srihari Nelakuditi,et al.  Failure insensitive routing for ensuring service availability , 2003, IWQoS'03.

[39]  Anja Feldmann,et al.  NetScope: traffic engineering for IP networks , 2000, IEEE Netw..