暂无分享,去创建一个
Priya Mahadevan | Amin Vahdat | Dmitri V. Krioukov | Kimberly C. Claffy | Xenofontas A. Dimitropoulos | Marina Fomenkov | Bradley Huffaker | K. Claffy | Amin Vahdat | B. Huffaker | Marina Fomenkov | Priya Mahadevan | X. Dimitropoulos | D. Krioukov
[1] Rajeev Rastogi,et al. Efficiently monitoring bandwidth and latency in IP networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[2] T. Erlebach,et al. A Spectral Analysis of the Internet Topology , 2001 .
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] Fan Chung,et al. Spectral Graph Theory , 1996 .
[5] 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).
[6] Alexei Vazquez,et al. Clustering coefficient without degree correlations biases , 2004 .
[7] Robert Nowak,et al. Internet tomography , 2002, IEEE Signal Process. Mag..
[8] Alessandro Vespignani,et al. Exploring networks with traceroute-like probes: theory and simulations , 2004, Theor. Comput. Sci..
[9] M E J Newman. Assortative mixing in networks. , 2002, Physical review letters.
[10] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[11] kc claffy,et al. Traceroute and BGP AS Path Incongruities , 2003 .
[12] S. N. Dorogovtsev. Networks with given correlations , 2003 .
[13] Xiaowei Yang,et al. Compact routing on Internet-like graphs , 2003, IEEE INFOCOM 2004.
[14] Michalis Faloutsos,et al. Analyzing BGP policies: methodology and tool , 2004, IEEE INFOCOM 2004.
[15] 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.
[16] 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.
[17] P. Fraigniaud. A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs , 2005 .
[18] Priya Mahadevan,et al. Comparative Analysis of the Internet AS-Level Topologies Extracted from Different Data Sources , 2004 .
[19] Walter Willinger,et al. Network topology generators: degree-based vs. structural , 2002, SIGCOMM '02.
[20] Albert-László Barabási,et al. Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .
[21] 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).
[22] Sugih Jamin,et al. Inet-3.0: Internet Topology Generator , 2002 .
[23] 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..
[24] Walter Willinger,et al. Towards capturing representative AS-level Internet topologies , 2002, SIGMETRICS '02.
[25] Maurizio Patrignani,et al. Dynamic Analysis of the Autonomous System Graph , 2004 .
[26] Béla Bollobás,et al. Random Graphs , 1985 .
[27] Fan Chung Graham,et al. A random graph model for massive graphs , 2000, STOC '00.
[28] Jia Wang,et al. Towards an accurate AS-level traceroute tool , 2003, SIGCOMM '03.
[29] Walter Willinger,et al. A first-principles approach to understanding the internet's router-level topology , 2004, SIGCOMM '04.
[30] Alessandro Vespignani,et al. K-core Decomposition: a Tool for the Visualization of Large Scale Networks , 2005, ArXiv.
[31] Yakov Rekhter,et al. A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.
[32] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[33] 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.
[34] M. Newman. Properties of highly clustered networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[35] Heejo Lee,et al. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets , 2001, SIGCOMM '01.
[36] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[37] Walter Willinger,et al. Towards capturing representative AS-level Internet topologies , 2004, Comput. Networks.
[38] S. N. Dorogovtsev. Clustering of correlated networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[39] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[40] Tony Bates,et al. Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.
[41] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[42] K. Walsh,et al. Scalability and accuracy in a large-scale network emulator , 2002, OSDI.
[43] Dejan Kostic,et al. Scalability and accuracy in a large-scale network emulator , 2002, CCRV.
[44] Béla Bollobás,et al. Mathematical results on scale‐free random graphs , 2005 .
[45] SaberiAmin,et al. Conductance and congestion in power law graphs , 2003 .
[46] Christos Gkantsidis,et al. Conductance and congestion in power law graphs , 2003, SIGMETRICS '03.
[47] Jia Wang,et al. Scalable and accurate identification of AS-level forwarding paths , 2004, IEEE INFOCOM 2004.
[48] Shi Zhou,et al. Accurately modeling the Internet topology , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.