BRITE: An approach to universal topology generation

IEEE International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems - Proceedings

Volumn , Issue , 2001, Pages 346-353

  Medina, A ^a   Lakhina, A ^a   Matta, I ^a   Byers, J ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

Annotated topologies; Graph models; Growth models; Network topology; Simulation environments; Topology generation

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; INTEROPERABILITY; LARGE SCALE SYSTEMS; TOPOLOGY;

TOPOLOGY GENERATION;

INTERNET;

EID: 0034836055     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A random graph model for massive graphs
2. Emergence of scaling in random networks
3. Modeling internet topology
4. A better model for generating test networks
5. On power-law relationships of the internet topology
6. On inferring autonomous system relationships in the internet
7. Heuristics for internet map discovery
8. On the origin of power-laws in internet topologies
9. Why we don't know how to simulate the internet
10. The impact of routing policy on internet paths
11. Dynamic distance maps of the internet
12. Routing of multipoint connections