Data networks
3LS—A Peer-to-Peer Network Simulator
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Simulation of large scale networks I: simulation of large-scale networks using SSF
Proceedings of the 35th conference on Winter simulation: driving innovation
GPS: A General Peer-to-Peer Simulator and its Use for Modeling BitTorrent
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
On the efficiency of fluid simulation of networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
The state of peer-to-peer simulators and simulations
ACM SIGCOMM Computer Communication Review
Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
An overview of the OMNeT++ simulation environment
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
An extensible simulation tool for overlay networks and services
Proceedings of the 2009 ACM symposium on Applied Computing
Flow-Level Modeling of Parallel Download in Distributed Systems
CTRQ '10 Proceedings of the 2010 Third International Conference on Communication Theory, Reliability, and Quality of Service
NDP2PSim: a NS2-Based platform for peer-to-peer network simulations
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
When evaluating Peer-to-Peer content distribution systems by means of simulation, it is of vital importance to correctly mimic the bandwidth dynamics behaviour of the underlying network. In this paper, we propose a scalable and accurate flow-level network simulation model based on an evolution of the classical progressive filling algorithm which follows the max-min fairness idea. We build on top of the current state of the art by applying an optimization to reduce the cost of each bandwidth allocation/deallocation operation on a node-based directed network model. Unlike other works, our evaluation of the chosen approach focuses both on efficiency and on accuracy. Our experiments show that, in terms of scalability, our bandwidth allocation algorithm outperforms existing directed models when simulating large-scale structured overlay networks. In terms of accuracy we show that allocation dynamics of our proposed solution follow those of the NS-2 packet-level simulator by a small and nearly constant offset for the same scenarios. To the best of our knowledge, this is the first time that an accuracy study has been conducted on an improvement of the classical progressive filling algorithm.