DocumentCode
3664857
Title
pfs: Parallelized, flow-based network simulation
Author
Mukta Gupta;Ramakrishnan Durairajan;Meenakshi Syamkumar;Paul Barford;Joel Sommers
Author_Institution
Department of Computer Sciences, University of Wisconsin - Madison, 1210 W. Dayton St., 53706, USA
fYear
2015
fDate
7/1/2015 12:00:00 AM
Firstpage
1
Lastpage
8
Abstract
Simulation is a compelling option for evaluating Internet protocols, configurations and behaviors. While current simulation tools have been used effectively to consider questions in small-scale networks, they are incapable of evaluating large scale phenomena such as routing configurations, DDoS attacks and data center deployments. In this paper, we describe pfs, a parallelized version of the fs flow-level simulator [1] that offers the opportunity to conduct very large-scale simulations of networks. Our approach to parallelization is based on decomposing simulation configurations both spatially and temporally into independent chunks that can be run simultaneously on massively scalable, parallel processing infrastructures. We demonstrate the capabilities of pfs through a series of experiments that highlight both the speedup that can be achieved as well as the costs that are incurred in terms of the accuracy of the simulation results.
Keywords
"Accuracy","Topology","Network topology","Clustering algorithms","Standards","Generators","Computational modeling"
Publisher
ieee
Conference_Titel
Performance Evaluation of Computer and Telecommunication Systems (SPECTS), 2015 International Symposium on
Type
conf
DOI
10.1109/SPECTS.2015.7285287
Filename
7285287
Link To Document