Comparative Study between Analytical Models and Packet-Level Worm Simulations
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Advanced concepts in large-scale network simulation
WSC '05 Proceedings of the 37th conference on Winter simulation
A realistic simulation of internet-scale events
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Packet-level integration of fluid TCP models in real-time network simulation
Proceedings of the 38th conference on Winter simulation
An Abstract Internet Topology Model for Simulating Peer-to-Peer Content Distribution
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
Stochastic Process Models for Packet/Analytic-Based Network Simulations
Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation
Simulating Routing Schemes on Large-Scale Topologies
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Models and analysis of active worm defense
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
| Hi-index | 0.00 |
Simulation of large-scale networks demands that we model some flows at coarser time-scales than others, simply to keep the execution cost manageable. This paper studies a method for periodically computing traffic at a time-scale larger than that typically used for detailed packet simulations. Applications of this technique include computation of background flows (against which detailed foreground flows are simulated), and simulation of worm propagation in the Internet. Our approach considers aggregatedtraffic between Internet Points of Presence, and computes the throughput of each POP-to-POP flow through each router on its path. This problem formulation leads to a non-linear system of equations. We develop means of reducing this system to a smaller set of equations, which are solved using fixed point iteration. We study the convergence behavior, as a function of traffic load, on topologies based on Internet backbone networks. We find that the problem reduction method is very effective, and that convergence is achieved rapidly.We also examine the comparative speedup of the method relative to using pure packet simulation for background flows, and observe speedups of exceeding 5000 using an ordinary PC. We also simulate foreground flows interacting with background flows, and compare the foreground behavior using our solution with that of pure packet flows. We find that these flows behave accurately enough in our approach to justify use of the technique in our motivating application.