메뉴 건너뛰기




Volumn 32, Issue 4, 2002, Pages 147-159

Network topology generators: Degree-based vs. structural

Author keywords

Degree based generators; Hierarchy; Large scale structure; Network topology; Structural generators; Topology characterization; Topology generators; Topology metrics

Indexed keywords

DEGREE-BASED GENERATORS; HIERARCHY; LARGE-SCALE STRUCTURE; NETWORK TOPOLOGY; STRUCTURAL GENERATORS; TOPOLOGY CHARACTERIZATION; TOPOLOGY GENERATORS; TOPOLOGY METRICS;

EID: 33744908559     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/964725.633040     Document Type: Conference Paper
Times cited : (156)

References (51)
  • 2
    • 0142077573 scopus 로고    scopus 로고
    • Topology of evolving networks: Local events and universality
    • R. Albert and A.-L. Barabasi. 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    Barabasi, A.-L.2
  • 3
    • 0034721164 scopus 로고    scopus 로고
    • Attack and error tolerance of complex networks
    • R. Albert, H. Jeong, and A.-L. Barabasi. Attack and Error Tolerance of Complex Networks. Nature, 406, 2000.
    • (2000) Nature , pp. 406
    • Albert, R.1    Jeong, H.2    Barabasi, A.-L.3
  • 4
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • A.-L. Barabasi and R. Albert. Emergence of Scaling in Random Networks. Science, 286:509-512, 1999.
    • (1999) Science , vol.286 , pp. 509-512
    • Barabasi, A.-L.1    Albert, R.2
  • 5
    • 0030393774 scopus 로고    scopus 로고
    • Probabilistic approximations of metric spaces and its algorithmic applications
    • October
    • Y. Bartal. Probabilistic Approximations of Metric Spaces and its Algorithmic Applications, In Proc. 37th IEEE Symposium on Foundations of Computer Science, pages 184-193, October 1996.
    • (1996) Proc. 37th IEEE Symposium on Foundations of Computer Science , pp. 184-193
    • Bartal, Y.1
  • 6
    • 0004219960 scopus 로고
    • Academic Press, Inc., Orlando, Florida
    • B. Bollobás. Random Graphs. Academic Press, Inc., Orlando, Florida, 1985.
    • (1985) Random Graphs
    • Bollobás, B.1
  • 8
    • 0036349136 scopus 로고    scopus 로고
    • On distinguishing between Internet power-law generators
    • T. Bu and D. Towsley. On Distinguishing Between Internet Power-Law Generators. In Proc. of IEEE Infocom, 2002.
    • (2002) Proc. of IEEE Infocom
    • Bu, T.1    Towsley, D.2
  • 9
    • 84992267980 scopus 로고    scopus 로고
    • Mapping the Internet
    • April
    • H. Burch and B. Cheswick. Mapping the Internet. IEEE Computer, 32(4):97-98, April 1999.
    • (1999) IEEE Computer , vol.32 , Issue.4 , pp. 97-98
    • Burch, H.1    Cheswick, B.2
  • 11
    • 0035009221 scopus 로고    scopus 로고
    • Modeling the branching characteristics and efficiency gains in global multicast trees
    • (to appear), Anchorage, Alaska, USA, April
    • R. C. Chalmers and K. C. Almeroth. Modeling the Branching Characteristics and Efficiency Gains in Global Multicast Trees. In Proceedings of the IEEE Infocom 2001 (to appear), Anchorage, Alaska, USA, April 2001.
    • (2001) Proceedings of the IEEE Infocom 2001
    • Chalmers, R.C.1    Almeroth, K.C.2
  • 15
  • 18
    • 0034478521 scopus 로고    scopus 로고
    • Inferring autonomous system relationships in the internet
    • San Francisco, CA
    • L. Gao. Inferring autonomous system relationships in the internet. In Proc. IEEE Globecom, San Francisco, CA, 2000.
    • (2000) Proc. IEEE Globecom
    • Gao, L.1
  • 19
    • 33744901249 scopus 로고    scopus 로고
    • Extending greedy multicast routing to delay sensitive applications
    • Stanford Univ. Tech Note STAN-CS-TN-99-89, July. Short abstract appeared in the Symposium on Discrete Algorithms, 2000
    • A. Goel and K. Munagala. Extending Greedy Multicast Routing to Delay Sensitive Applications. Technical report, Stanford Univ. Tech Note STAN-CS-TN-99-89, July 1999. Short abstract appeared in the Symposium on Discrete Algorithms, 2000.
    • (1999) Technical Report
    • Goel, A.1    Munagala, K.2
  • 21
    • 0000602164 scopus 로고
    • Optimum communication spanning trees
    • T. C. Hu. Optimum Communication Spanning Trees. SIAM Journal of Computing, 3:188-195, 1974.
    • (1974) SIAM Journal of Computing , vol.3 , pp. 188-195
    • Hu, T.C.1
  • 22
    • 84858889036 scopus 로고    scopus 로고
    • Optimization in complex networks
    • November
    • R. F. i Cancho and R. V. Sole. Optimization in Complex Networks. Condensed Matter Archives, http://xxx.lanl.gov/abs/cond-mat, November 2001.
    • (2001) Condensed Matter Archives
    • Cancho, R.F.I.1    Sole, R.V.2
  • 23
    • 0003726345 scopus 로고    scopus 로고
    • Inet: Internet topology generator
    • EECS Department, University of Michigan
    • C. Jin, Q. Chen, and S. Jamin. Inet: Internet Topology Generator. Technical Report CSE-TR-433-00, EECS Department, University of Michigan, 2000.
    • (2000) Technical Report , vol.CSE-TR-433-00
    • Jin, C.1    Chen, Q.2    Jamin, S.3
  • 24
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing, 20(1):359-92, 1998.
    • (1998) SIAM Journal on Scientific Computing , vol.20 , Issue.1 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 26
    • 0000923074 scopus 로고    scopus 로고
    • Measuring link bandwidths using a deterministic model of packet delay
    • K. Lai and M. G. Baker. Measuring Link Bandwidths Using a Deterministic Model of Packet Delay. In Proceedings of the ACM SIGCOMM, 2000.
    • (2000) Proceedings of the ACM SIGCOMM
    • Lai, K.1    Baker, M.G.2
  • 36
    • 0003642560 scopus 로고    scopus 로고
    • On characterizing network topologies and analyzing their impact on protocol design
    • University of Southern California, Dept. of CS, February
    • P. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan, S. Shenker, and D. Estrin. On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design. Technical Report 00-731, University of Southern California, Dept. of CS, February 2000.
    • (2000) Technical Report , Issue.731
    • Radoslavov, P.1    Tangmunarunkit, H.2    Yu, H.3    Govindan, R.4    Shenker, S.5    Estrin, D.6
  • 37
    • 0002106517 scopus 로고
    • On the enumeration of trees
    • Gordon and Breach, Science Publishers, June
    • A. Rényi. On the Enumeration of Trees. In Combinatorial Structures and Their Applications, pages 355-360. Gordon and Breach, Science Publishers, June 1969.
    • (1969) Combinatorial Structures and Their Applications , pp. 355-360
    • Rényi, A.1
  • 42
    • 0037840705 scopus 로고    scopus 로고
    • Network topology generators: Degree-based vs. structural
    • Technical report, Computer Science Department, University of Southern California
    • H. Tangmunarunkit, R. Govindan, S. Jamin, and S. S. W. Willinger. Network Topology Generators: Degree-Based vs. Structural. Technical report, Computer Science Department, University of Southern California, 2002. Technical Report 02-760.
    • (2002) Technical Report , vol.2 , Issue.760
    • Tangmunarunkit, H.1    Govindan, R.2    Jamin, S.3    Willinger, S.S.W.4
  • 47
    • 0001506396 scopus 로고    scopus 로고
    • Collective dynamics of small-world networks
    • D. J. Watts and S. H. Strogatz. Collective Dynamics of Small-World Networks. Nature, 363:202-204, 1998.
    • (1998) Nature , vol.363 , pp. 202-204
    • Watts, D.J.1    Strogatz, S.H.2


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