A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
httperf—a tool for measuring web server performance
ACM SIGMETRICS Performance Evaluation Review
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Simulation: The Practice of Model Development and Use
Simulation: The Practice of Model Development and Use
Self-configuring network traffic generation
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Preliminary results using scale-down to explore worm dynamics
Proceedings of the 2004 ACM workshop on Rapid malcode
Simulation of large scale networks I: simulation of large-scale networks using SSF
Proceedings of the 35th conference on Winter simulation: driving innovation
SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation
IEEE/ACM Transactions on Networking (TON)
Tmix: a tool for generating realistic TCP application workloads in ns-2
ACM SIGCOMM Computer Communication Review
Realistic and responsive network traffic generation
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Path preserving scale down for validation of internet inter-domain routing protocols
Proceedings of the 38th conference on Winter simulation
Efficient identification of uncongested internet links for topology downscaling
ACM SIGCOMM Computer Communication Review
DieCast: testing distributed systems with an accurate scale model
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Large-scale virtualization in the Emulab network testbed
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Accurately Measuring Denial of Service in Simulation and Testbed Experiments
IEEE Transactions on Dependable and Secure Computing
Modeling and emulation of internet paths
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
A network in a laptop: rapid prototyping for software-defined networks
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Addressing scalability in a laboratory-based multihop wireless testbed
Mobile Networks and Applications
Forwarding devices: From measurements to simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A large-scale real-time network simulation study using prime
Winter Simulation Conference
Reducing large internet topologies for faster simulations
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Performance Preserving Topological Downscaling of Internet-Like Networks
IEEE Journal on Selected Areas in Communications
Reproducible network experiments using container-based emulation
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Hi-index | 0.00 |
Understanding the behavior of large-scale systems is challenging, but essential when designing new Internet protocols and applications. It is often infeasible or undesirable to conduct experiments directly on the Internet. Thus, simulation, emulation, and testbed experiments are important techniques for researchers to investigate large-scale systems. In this paper, we propose a platform-independent mechanism to partition a large network experiment into a set of small experiments that are sequentially executed. Each of the small experiments can be conducted on a given number of experimental nodes, e.g., the available machines on a testbed. Results from the small experiments approximate the results that would have been obtained from the original large experiment. We model the original experiment using a flow dependency graph. We partition this graph, after pruning uncongested links, to obtain a set of small experiments. We execute the small experiments iteratively. Starting with the second iteration, we model dependent partitions using information gathered about both the traffic and the network conditions during the previous iteration. Experimental results from several simulation and testbed experiments demonstrate that our techniques approximate performance characteristics, even with closed-loop traffic and congested links. We expose the fundamental tradeoff between the simplicity of the partitioning and experimentation process, and the loss of experimental fidelity.