Minimizing routing state for light-weight network simulation

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

Volumn , Issue , 2001, Pages 108-116

  Huang, P ^a   Heidemann, J ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LIGHT WEIGHT NETWORKS;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; INTERNET; LARGE SCALE SYSTEMS; TOPOLOGY;

ROUTERS;

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

References (27)

1. A note on two problems in connection with graphs
2. A Border Gateway Protocol 4 (BGP-4)
3. OSPF Version 2
4. Routing information protocol
5. Asymptotic scaling behavior of global recovery in SRM
6. Advances in network simulation
7. A quantitative comparison of graph-based models for internet topology
8. Enabling large-scale simulations: Selective abstraction approach to the study of multicast protocols
9. BGP Route Reflection - An alternative to full mesh IBGP
10. Speedup vs. simulation granularity
11. Capturing TCP burstiness for lightweight simulation
12. Time-stepped hybrid simulation (TSHS) for large scale networks
13. Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
14. Stateless routing in network simulations
15. On power-law relationships of the internet topology
16. Heuristics for internet map discovery
17. On the origin of power-laws in Internet topologies
18. Thoughts on router-level topology modeling
19. On finding lowest common ancestors: Simplification and parallelization
20. A polynomial time approximation scheme for minimum routing cost spanning trees
21. The impact of routing policy on internet paths