Simulating large-scale dynamic random graphs in OMNeT++

  • Authors:
  • Kristján Valur Jónsson;Ýmir Vigfússon;Ólafur Helgason

  • Affiliations:
  • Reykjavik University, Iceland;Reykjavik University, Iceland;KTH - Royal Inst. of Tech.

  • Venue:
  • Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Simulating large-scale dynamic systems becomes increasingly more important as real-world systems grow in scale. We present a set of components for the OMNeT++ discrete event simulator which enable efficient modeling of large-scale random graphs that capture real-world properties, e. g. scale-free networks and small-world topologies. The complexities of the network are abstracted into a single component while enabling detailed end-system modeling in a realistic connectivity graph. We describe the modeling components and demonstrate their use in a case study of a distributed aggregation protocol.