A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
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
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the relevance of long-range dependence in network traffic
IEEE/ACM Transactions on Networking (TON)
TCP/IP performance with random loss and bidirectional congestion
IEEE/ACM Transactions on Networking (TON)
ACM SIGCOMM Computer Communication Review
Advances in Network Simulation
Computer
Rapid model parameterization from traffic measurements
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The effects of active queue management on web performance
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Best-path vs. multi-path overlay routing
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
IEEE Communications Magazine
| Hi-index | 0.00 |
Given that more than 90% of the Internet load is carried by TCP, most network simulation studies use TCP flows to generate the background traffic. A basic, but unresolved, question, however, is the following: how can one decide how many TCP flows to simulate from one network node to another? Simulating too many flows on a link can cause an unrealistically high loss rate on that link, while simulating too few flows can result in undesirably light load conditions. Similarly, to simulate realistic network conditions, one has to carefully control the load distribution on various network links (e.g., edge vs. core links), as well as the hop count (path length) of the simulated TCP flows. Previous simulation studies have dealt with these issues in a trial-and-error manner, experimenting with several traffic configurations until a realistic distribution of link load and loss rate is achieved. In this article, the authors present a methodology that determines the number of TCP flows that should be simulated between each pair of nodes in a network based on the network topology, a specification of the utilization and loss rate for certain links, and an average number of hops for the TCP flows. The proposed methodology is based on a linear program formulation that, while meeting the utilization and loss rate specifications, minimizes the number of required TCP flows. This optimization criterion minimizes the memory requirement of the simulation. The evaluations show that the proposed methodology can closely approximate the specified link conditions in terms of utilization and loss rate. The authors also analyze the largest approximation errors and reveal their causes.