On Characterizing Network Hierarchy

Our previous work in topology characterization and hierarchy [1] introduced a hierarchy metric to explore the hierarchical structure in various networks. This metric is non-intuitive and complicated. In this paper, we propose a simpler and more natural metric for measuring network hierarchy. This simpler metric uses slightly different criteria in selecting backbone links than the more complicated one. Nevertheless, the network classifications according to both metrics agree with each other. Furthermore, we have extended the hierarchy analysis to examine path characteristics and found that the hierarchical nature of degree-based networks better resembles the hierarchy of the Internet at the AS level than at the routerlevel.

[1]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[2]  Ramesh Govindan,et al.  Internet path inflation due to policy routing , 2001, SPIE ITCom.

[3]  Rajeev Motwani,et al.  Lecture notes on approximation algorithms: Volume I , 1993 .

[4]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[5]  Jean-Jacques Pansiot,et al.  On routes and multicast trees in the Internet , 1998, CCRV.

[6]  Walter Willinger,et al.  Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.

[7]  Kimberly C. Claffy,et al.  Measurement and visualization of internet connectivity and performance , 2001 .

[8]  Deborah Estrin,et al.  The impact of policy on internet paths , 2001, INFOCOM 2001.

[9]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[12]  Sugih Jamin,et al.  Inet: Internet Topology Generator , 2000 .

[13]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[14]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

[15]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[16]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[17]  Lixin Gao.  On inferring autonomous system relationships in the internet , 2001, TNET.

[18]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[19]  T. Erlebach,et al.  A Spectral Analysis of the Internet Topology , 2001 .

[20]  Bill Cheswick,et al.  Mapping the Internet , 1999, Computer.