-
2
-
-
0142077573
-
Topology of evolving networks: Local events and universality
-
R. Albert and A. Barabási. Topology of evolving networks: Local events and universality. Physical Review Letters, 85:5234-5237, 2000.
-
(2000)
Physical Review Letters
, vol.85
, pp. 5234-5237
-
-
Albert, R.1
Barabási, A.2
-
3
-
-
0038483826
-
Emergence of scaling in random networks
-
A. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
-
(1999)
Science
, vol.286
, pp. 509-512
-
-
Barabási, A.1
Albert, R.2
-
5
-
-
0036349136
-
On distinguishing between Internet power law topology generators
-
T. Bu and D. Towsley. On distinguishing between Internet power law topology generators. In Proceedings of IEEE INFOCOM, 2002.
-
(2002)
Proceedings of IEEE INFOCOM
-
-
Bu, T.1
Towsley, D.2
-
6
-
-
0036346132
-
The origin of power laws in Internet topologies revisited
-
Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. The origin of power laws in Internet topologies revisited. In Proceedings of IEEE INFOCOM, 2002.
-
(2002)
Proceedings of IEEE INFOCOM
-
-
Chen, Q.1
Chang, H.2
Govindan, R.3
Jamin, S.4
Shenker, S.5
Willinger, W.6
-
8
-
-
84947986204
-
-
The CAIDA Website
-
Cooperative Association for Internet Data Analysis. The CAIDA Website. http://www.caida.org.
-
-
-
-
13
-
-
0033726520
-
The small-world phenomenon: An algorithm perspective
-
May
-
J. Kleinberg. The small-world phenomenon: An algorithm perspective. In ACM Symposium on Theory of Computing (STOC), pages 163-170, May 2000.
-
(2000)
ACM Symposium on Theory of Computing (STOC)
, pp. 163-170
-
-
Kleinberg, J.1
-
17
-
-
0002687371
-
The small world problem
-
S. Milgram. The small world problem. Psychology Today, 2:60-67, 1967.
-
(1967)
Psychology Today
, vol.2
, pp. 60-67
-
-
Milgram, S.1
-
19
-
-
0043186292
-
Does AS size determine degree in AS topology?
-
October
-
H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Does AS size determine degree in AS topology? ACM SIGCOMM Computer Communication Review, October 2001.
-
(2001)
ACM SIGCOMM Computer Communication Review
-
-
Tangmunarunkit, H.1
Doyle, J.2
Govindan, R.3
Jamin, S.4
Shenker, S.5
Willinger, W.6
-
20
-
-
0037840705
-
Network topology generators: Degree based vs. structural
-
H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topology generators: Degree based vs. structural. In Proceedings of ACM SIGCOMM, 2002.
-
(2002)
Proceedings of ACM SIGCOMM
-
-
Tangmunarunkit, H.1
Govindan, R.2
Jamin, S.3
Shenker, S.4
Willinger, W.5
-
21
-
-
84947929842
-
-
Topology Project at
-
Topology Project at University of Michigan. AS graph data sets. http://topology.eecs.umich.edu/data.html.
-
AS Graph Data Sets
-
-
-
22
-
-
84943545141
-
-
USC Information Sciences Institute. Internet maps. http://www.isi.edu/div7/scan/mercator/maps.html.
-
Internet Maps
-
-
-
23
-
-
11244340239
-
Collective dynamics of small-world networks
-
D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, 363:202-204, 1998.
-
(1998)
Nature
, vol.363
, pp. 202-204
-
-
Watts, D.1
Strogatz, S.2
-
25
-
-
1642277919
-
Scaling phenomena in the Internet: Critically examining criticality
-
W. Willinger, R. Govindan, S. Jamin, V. Paxson, and S. Shenker. Scaling phenomena in the Internet: Critically examining criticality. In Proceedings of the National Academy of Sciences, 2001.
-
(2001)
Proceedings of the National Academy of Sciences
-
-
Willinger, W.1
Govindan, R.2
Jamin, S.3
Paxson, V.4
Shenker, S.5
-
27
-
-
0031334402
-
A quantitative comparison of graph-based models for Internet topology
-
E. W. Zegura, K. L. Calvert, and M. J. Donahoo. A quantitative comparison of graph-based models for Internet topology. IEEE/ACM Transactions on Networking, 5(6):770-783, 1997.
-
(1997)
IEEE/ACM Transactions on Networking
, vol.5
, Issue.6
, pp. 770-783
-
-
Zegura, E.W.1
Calvert, K.L.2
Donahoo, M.J.3
|