5th International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Accurate and Efficient Simulation of Bandwidth\\Dynamics for Peer-To-Peer Overlay Networks

Download532 downloads
  • @INPROCEEDINGS{10.4108/icst.valuetools.2011.245721,
        author={Alexandros Gkogkas and Roberto Roverso and Seif Haridi},
        title={Accurate and Efficient Simulation of Bandwidth\textbackslash\textbackslashDynamics for Peer-To-Peer Overlay Networks},
        proceedings={5th International ICST Conference on Performance Evaluation Methodologies and Tools},
        publisher={ICST},
        proceedings_a={VALUETOOLS},
        year={2012},
        month={6},
        keywords={bandwidth dynamics simulation flow-level simulation peer-to-peer systems progressive filling},
        doi={10.4108/icst.valuetools.2011.245721}
    }
    
  • Alexandros Gkogkas
    Roberto Roverso
    Seif Haridi
    Year: 2012
    Accurate and Efficient Simulation of Bandwidth\\Dynamics for Peer-To-Peer Overlay Networks
    VALUETOOLS
    ICST
    DOI: 10.4108/icst.valuetools.2011.245721
Alexandros Gkogkas1,*, Roberto Roverso1, Seif Haridi2
  • 1: Peerialism Inc.
  • 2: Royal Institute of Technology (KTH)
*Contact email: gkogkas@kth.se

Abstract

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.