1 |
A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, 'Graph structure in the web: Experiments and models,' in Proc. World Wide Web Conf., 2000
|
2 |
L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos, 'A simple conceptual model for the Internet topology,' in Proc. IEEE Global Internet 2001, 2001
|
3 |
R. Albert, H. Jeong, and A. Barabasi, 'Attack and error tolerance of complex networks,' Nature, vol. 406, pp. 387-482, 2000
|
4 |
H. Reittu and I. Norros, 'On the power-law random graph model of the Internet,' Tech. Report, VTT Information Technology, 2002
|
5 |
M. Mihail and C. H. Papadimitriou, 'On the eigenvalue power-law,' Random,2002
|
6 |
D. R. White, J. Owen-Smith, J. Moody, and W. W. Powell, 'Network dynamics and field evolution: The growth of interorganizational collaboration in the life sciences,' Computational and Mathematical Organization Theory, vol. 10, no. 1, pp. 95-117, 2004
DOI
|
7 |
Y. Hyun, 'Walrus project,' http://mappa.mundi.net/maps/maps_020/, 2002
|
8 |
T. Bu and D. Towsley, 'On distinguishing between Internet power-law topology generators,' in Proc. IEEE INFOCOM 2002, 2002
|
9 |
C. Jin, Q. Chen, and S. Jamin, 'Inet: Internet topology generator,' Tech. Report UM CSE-TR-433-00, 2000
|
10 |
S. Bar, M. Gonen, and A. Wool, 'An incremental super-linear preferential Internet topology model,' in Proc. PAM 2004, 2004
|
11 |
G. Huston, http://www.telstra.net/gih, 2001
|
12 |
A. Medina, A. Lakhina, I. Matta, and J. Byers, 'BRITE: Topology generator,' http://www.cs.bu.edu/brite/
|
13 |
A. Medina, I. Matta, and J. Byers, 'On the origin of powerlaws in Internet topologies,' ACM Sigcomm Computer Commun. Rev., 2000
|
14 |
A. Barabasi and R. Albert, 'Emergence of scaling in random networks,' Science, vol. 286, pp. 509-512, 1999
DOI
ScienceOn
|
15 |
W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C. Cambridge University Press, 1992
|
16 |
G. Siganos, M. Faloutsos, P. Faloutsos, and C. Faloutsos, 'Power-laws and the AS-level Internet topology,' IEEE/ACM Trans. Networking, 2003
|
17 |
R. Albert and A. Barabasi, 'Topology of complex networks: Local events and universality,' Phys. Rev. Lett., vol. 85, pp. 5234-5237, 2000
DOI
ScienceOn
|
18 |
H. Tangmurankit, R. Govindan, S. Jamin, S. J. Shenker, and W. Willinger, 'Network topology generators: Degree-based vs. structural,' in Proc. ACM Sigcomm 2002, 2002
|
19 |
R. Cohen and S. Havlin, 'Scale-free networks are ultrasmall,' Phys. Rev. Lett., vol. 90, no. 5, 2002
|
20 |
J.-J. Pansiot and D Grad, 'On routes and multicast trees in the Internet,' ACM Sigcomm Computer Commun. Rev., 1998
|
21 |
A. Fabrikant, E. Koutsoupias, and C. H. Papadimitriou, 'Heuristically optimized trade-offs: A new paradigm for power-laws in the Internet,' in Proc. ICALP 2002, Springer-Verlag LNCS, pp.110-122
|
22 |
B. M. Waxman, 'Routing of multipoint connections,' IEEE J. Select. Areas Commun., pp. 1617-1622, 1988
|
23 |
B. Cheswick and H. Burch, 'Internet mapping project,' Wired Mag., Dec. 1998, available at http://cm.bell-labs.com/cm/cs/who/ches/map/index.html
|
24 |
M. Doar, 'A better model for generating test networks,' in Proc. IEEE Global Internet'96, 1996
|
25 |
L. Gao, 'On inferring automonous system relationships in the Internet,' IEEE/ACM Trans. Networking, vol. 9, no. 6, pp.733-745, 2001
DOI
ScienceOn
|
26 |
W. Aiello, F. Chung, and L. Lu, 'A random graph model for massive graphs,' in Proc. STOC 2000, 2000, pp. 171-180
|
27 |
J. Kleinberg, 'Authoritative sources in a hyperlinked environment,' J. ACM, 1999
|
28 |
J. D. Noh, 'Exact scaling properties of a hierarchical network model,' Phys. Rev. E., 2003
|
29 |
L. Subramanian, S. Agarwal, J. Rexford, and R. Katz, 'Characterizing the Internet hierarchy from multiple vantage points,' in Proc. IEEE INFOCOM 2002, 2002
|
30 |
F. Comellas, G. Fertin, and A. Raspaud, 'Vertex labeling and routing in recursive clique-trees, a new family of small-world scale-free graphs,' in Proc. Sirocco 2003, 2003
|
31 |
E. W. Zegura, K. L. Calvert, and M. J. Donahoo, 'A quantitative Com-parison of graph-based models for internetworks,' IEEE/ACM Trans. Networking, 1997
|
32 |
CAIDA Org., 'Skitter project,' http://www.caida.org/tools/measurement/skitter/
|
33 |
W. W. Powell, D. R. White, K. W. Koput, and J. Owen-Smith, 'Network dynamics and field evolution: The growth of interorganizational collaboration in the life sciences,' American J. Sociology, vol. 110, no. 4, pp. 1132-1205, 2005
DOI
ScienceOn
|
34 |
D. Magoni and J. J. Pansiot, 'Analysis ofthe autonomous system network topology,' ACM Sigcomm Computer Commun. Rev., 2001
|
35 |
University of Oregon Route Views Project, 'Online data and reports,' http://www.routeviews.org/
|
36 |
R. Govindan and A. Reddy, 'An analysis oflnternet inter-domain topology and route stability,' in Proc. IEEE INFOCOM'97, 1997
|
37 |
E. Ravasz and A.-L. Barabasi, 'Hierarchical organization in complex networks,' Phys. Rev. E. 2003
|
38 |
Z. Ge, D. Figueiredo, S. Jaiswal, and L. Gao, 'On the hierarchical structure ofthe logical Internet graph,' in Proc. SPIE ITComm 2001, 2001
|
39 |
C. Palmer, G. Siganos, M. Faloutsos, C. Faloutsos, and P. Gibbons, 'The connectivity and fault-tolerance of the Internet topology,' in Proc. NRDM 2001, Santa Barbara, 2001
|
40 |
Q. Chen, H. Chang, R. Govindan, S. J. Scott, J. Shenker, and W. Willinger, 'The origin of power-laws in Internet topologies revisited,' in Proc. IEEE INFOCOM 2001, 2001
|