메뉴 건너뛰기




Volumn 3405, Issue , 2005, Pages 140-153

Traceronte-like exploration of unknown networks: A statistical analysis

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MAPPING; OPTIMIZATION; STATISTICAL METHODS; TOPOLOGY;

EID: 24344432112     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527954_13     Document Type: Conference Paper
Times cited : (9)

References (30)
  • 1
    • 24344476522 scopus 로고    scopus 로고
    • The National Laboratory for Applied Network Research (NLANR), sponsored by the National Science Foundation, (see http://moat.nlanr.net/).
  • 2
    • 24344446698 scopus 로고    scopus 로고
    • The Cooperative Association for Internet Data Analysis (CAIDA), located at the San Diego Supercomputer Center, (see http://www.caida.org/home/).
  • 3
    • 24344473239 scopus 로고    scopus 로고
    • Topology project, Electric Engineering and Computer Science Department, University of Michigan (http://topology.eecs.umich.edu/).
  • 4
    • 24344491728 scopus 로고    scopus 로고
    • SCAN project, Information Sciences Institute (http://www.isi.edu/div7/scan/).
  • 5
    • 24344511004 scopus 로고    scopus 로고
    • Internet mapping project at Lucent Bell Labs (http://www.es.bell-labs.com/who/ches/map/).
  • 11
    • 41349090299 scopus 로고    scopus 로고
    • Large-scale topological and dynamical properties of the Internet
    • A. Vázquez, R. Pastor-Satorras, and A. Vespignani, "Large-scale topological and dynamical properties of the Internet," Phys. Rev. E. 65, 066130 (2002).
    • (2002) Phys. Rev. E , vol.65 , pp. 066130
    • Vázquez, A.1    Pastor-Satorras, R.2    Vespignani, A.3
  • 13
    • 0003038733 scopus 로고    scopus 로고
    • BRITE: A flexible generator of Internet topologies
    • Boston University
    • A. Medina and I. Matta, "BRITE: a flexible generator of Internet topologies," Tech. Rep. BU-CS-TR-2000-005, Boston University, 2000.
    • (2000) Tech. Rep. BU-CS-TR-2000-005
    • Medina, A.1    Matta, I.2
  • 14
    • 0003726345 scopus 로고    scopus 로고
    • INET: Internet topology generators
    • EECS Dept., University of Michigan
    • C. Jin, Q. Chen, and S. Jamin, "INET: Internet topology generators," Tech. Rep. CSE-TR-433-00, EECS Dept., University of Michigan, 2000.
    • (2000) Tech. Rep. , vol.CSE-TR-433-00
    • Jin, C.1    Chen, Q.2    Jamin, S.3
  • 18
    • 84992267980 scopus 로고    scopus 로고
    • Mapping the internet
    • H. Burch and B. Cheswick, "Mapping the internet," IEEE computer, 32(4), 97-98 (1999).
    • (1999) IEEE Computer , vol.32 , Issue.4 , pp. 97-98
    • Burch, H.1    Cheswick, B.2
  • 20
    • 4244120176 scopus 로고    scopus 로고
    • Sampling biases in IP topology measurements
    • Department of Computer Sciences, Boston University
    • A. Lakhina, J. W. Byers, M. Crovella and P. Xie, "Sampling Biases in IP Topology Measurements," Technical Report BUCS-TR-2002-021, Department of Computer Sciences, Boston University (2002).
    • (2002) Technical Report , vol.BUCS-TR-2002-021
    • Lakhina, A.1    Byers, J.W.2    Crovella, M.3    Xie, P.4
  • 22
    • 2942628018 scopus 로고    scopus 로고
    • Exploration of scale-free networks - Do we measure the real exponents?
    • T. Petermann and P. De Los Rios, "Exploration of scale-free networks - Do we measure the real exponents?", Eur. Phys. J B 38, 201 (2004).
    • (2004) Eur. Phys. J B , vol.38 , pp. 201
    • Petermann, T.1    De Los Rios, P.2
  • 23
    • 84865730611 scopus 로고
    • A set of measures of centrality based on betweenness
    • L. C. Freeman, "A Set of Measures of Centrality Based on Betweenness," Sociometry 40, 35-41 (1977).
    • (1977) Sociometry , vol.40 , pp. 35-41
    • Freeman, L.C.1
  • 24
    • 0035648637 scopus 로고    scopus 로고
    • A faster algorithm for betweenness centrality
    • U. Brandes, "A Faster Algorithm for Betweenness Centrality," J. Math. Soc. 25(2), 163-177, (2001).
    • (2001) J. Math. Soc. , vol.25 , Issue.2 , pp. 163-177
    • Brandes, U.1
  • 25
    • 0035981014 scopus 로고    scopus 로고
    • Universal behavior of load distribution in scale-free networks
    • K.-I. Goh, B. Kahng, and D. Kim, "Universal Behavior of Load Distribution in Scale-Free Networks," Phys. Rev. Lett. 87, 278701 (2001).
    • (2001) Phys. Rev. Lett. , vol.87 , pp. 278701
    • Goh, K.-I.1    Kahng, B.2    Kim, D.3
  • 27
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of small-world networks
    • D. J. Watts and S. H. Strogatz, "Collective dynamics of small-world networks," Nature 393, 440-442 (1998).
    • (1998) Nature , vol.393 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 28
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • A.-L. 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.-L.1    Albert, R.2
  • 29
    • 0035365355 scopus 로고    scopus 로고
    • Size-dependent degree distribution of a scale-free growing network
    • S. N. Dorogovtsev, J. F. F. Mendes, and A. N. Samukhin, "Size-dependent degree distribution of a scale-free growing network," Phys. Rev. E 63, 062101 (2001)
    • (2001) Phys. Rev. E , vol.63 , pp. 062101
    • Dorogovtsev, S.N.1    Mendes, J.F.F.2    Samukhin, A.N.3
  • 30
    • 2942566632 scopus 로고    scopus 로고
    • Betweenness centrality in large complex networks
    • M. Barthélemy, "Betweenness Centrality in Large Complex Networks," Eur. Phys. J B 38, 163 (2004).
    • (2004) Eur. Phys. J B , vol.38 , pp. 163
    • Barthélemy, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.