Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
An auto-adaptive dead reckoning algorithm for distributed interactive simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Advances in Network Simulation
Computer
Fluid models and solutions for large-scale IP networks
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Large-Scale TCP Models Using Optimistic Parallel Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Time-driven fluid simulation for high-speed networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
Traffic models in broadband networks
IEEE Communications Magazine
| Hi-index | 0.00 |
In discrete-event network simulations, a significant portion of resources are dedicated to the processing of packet events. For large-scale network simulations, the processing of packet events is the most time consuming aspect of the simulation. In this work, we develop a technique that saves on the processing of packet events for TCP flows using the well established results showing that the average behavior of a TCP flow is predictable given a steady-state path condition. We exploit this to predict the average behavior of a TCP flow over a future period of time where steady-state conditions hold, thus allowing for a reduction (or elimination) of the processing required for packet events. We call the flows simulated with our scheme "predicted flows", in contrast to the "packet-based flows" in usual packet level simulations. We design a simulation framework that provides the flexibility to incorporate this method of simulating TCP packet flows. Our goal is (1) to accommodate different network configurations, on/off flow behaviors and interaction between predicted flows and packet-based flows; and (2) to preserve the statistical behavior of every entity in the system so as to maintain the accuracy of the network simulation as a whole. In order to illustrate the promise of this idea, we implement it in the context of the ns2 simulation system. A set of experiments illustrate the speedup and approximation of the simulation framework, and relate the effectiveness of the scheme to the transient behavior of TCP congestion control. We compare two approaches to predicting TCP throughput and show that formula-based prediction suffers inaccuracy under certain scenarios due to the simple assumptions made about inter-loss time, as most fluid models do, but otherwise achieves a good approximation faster than direct measurement prediction.