An integrated model for the latency and steady-state throughput of TCP connections
Performance Evaluation
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
SS '96 Proceedings of the 29th Annual Simulation Symposium (SS '96)
Simulation analysis of RED with short lived TCP connections
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Simulation input analysis: difficulties in simulating queues with Pareto service
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Simulation Study of TCP in Overload
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
Improving confidence in network simulations
Proceedings of the 38th conference on Winter simulation
Lognormal and Pareto distributions in the Internet
Computer Communications
Internet data flow characterization and bandwidth sharing modelling
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Our goal is to achieve deeper understanding of the limitation of queueing models, on one hand, and of common simulation practice, on the other hand, as tools for predicting performance of bandwidth sharing between competing TCP flows. In particular, we (i) present an overview of simulation problems that are expected to arise due to the very heavy tail of the distribution of the size of TCP flows, and (ii) through simulations we show that the average sojourn time of competing flows are quite sensitive to various network parameters. The understanding that we get from the first point allows us to better assess when are the conclusions from simulation results on bandwidth sharing reliable. Using simulations in ns2, we study bandwidth sharing under various load factors and show the benefit of using bootstrap as a post simulation tool for analyzing the simulation results.