Comparative Analysis of the Internet AS-Level Topologies Extracted from Different Data Sources
暂无分享,去创建一个
[1] Harry Buhrman,et al. Kolmogorov Random Graphs and the Incompressibility Method , 1999, SIAM J. Comput..
[2] Evi Nemeth,et al. Internet expansion, refinement and churn , 2002, Eur. Trans. Telecommun..
[3] Bruce A. Reed,et al. The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.
[4] Fan Chung Graham,et al. A random graph model for massive graphs , 2000, STOC '00.
[5] Alessandro Vespignani,et al. A statistical approach to the traceroute-like exploration of networks: theory and simulations , 2004, ArXiv.
[6] Walter Willinger,et al. Towards capturing representative AS-level Internet topologies , 2002, SIGMETRICS '02.
[7] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[8] Maurizio Patrignani,et al. Dynamic Analysis of the Autonomous System Graph , 2004 .
[9] Walter Willinger,et al. A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM '04.
[10] S. N. Dorogovtsev. Clustering of correlated networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[11] D. Bernard,et al. Maximal entropy random networks with given degree distribution , 2002 .
[12] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[13] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[14] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[15] Robert Nowak,et al. Internet tomography , 2002, IEEE Signal Process. Mag..
[16] M E J Newman. Assortative mixing in networks. , 2002, Physical review letters.
[17] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[18] Jia Wang,et al. Towards an accurate AS-level traceroute tool , 2003, SIGCOMM '03.
[19] Peng Xie,et al. Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[20] Michalis Faloutsos,et al. Power laws and the AS-level internet topology , 2003, TNET.
[21] Daniel Massey,et al. An analysis of BGP multiple origin AS (MOAS) conflicts , 2001, IMW '01.
[22] Walter Willinger,et al. Scaling phenomena in the Internet: Critically examining criticality , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[23] Béla Bollobás,et al. Mathematical results on scale‐free random graphs , 2005 .
[24] Michalis Faloutsos,et al. Analyzing BGP policies: methodology and tool , 2004, IEEE INFOCOM 2004.
[25] S. N. Dorogovtsev,et al. Metric structure of random networks , 2002, cond-mat/0210085.
[26] Christos Gkantsidis,et al. Spectral analysis of Internet topologies , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[27] Jia Wang,et al. Scalable and accurate identification of AS-level forwarding paths , 2004, IEEE INFOCOM 2004.
[28] kc claffy,et al. Traceroute and BGP AS Path Incongruities , 2003 .
[29] Walter Willinger,et al. The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[30] T. Erlebach,et al. A Spectral Analysis of the Internet Topology , 2001 .
[31] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[32] Yakov Rekhter,et al. A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.
[33] Shi Zhou,et al. Accurately modeling the Internet topology , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[34] Albert-László Barabási,et al. Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .
[35] Arnold L. Rosenberg,et al. Comparing the structure of power-law graphs and the Internet AS graph , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..
[36] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[37] Frank Harary,et al. Graph Theory , 2016 .
[38] Jaap-Henk Hoepman,et al. Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method , 1999, SIAM J. Comput..
[39] Xiaowei Yang,et al. Compact routing on Internet-like graphs , 2003, IEEE INFOCOM 2004.
[40] Donald F. Towsley,et al. On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[41] Alon Orlitsky,et al. Zero-Error Information Theory , 1998, IEEE Trans. Inf. Theory.
[42] kc claffy,et al. Internet topology: connectivity of IP graphs , 2001, SPIE ITCom.
[43] S. Shenker,et al. Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.
[44] Tony Bates,et al. Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.