Simulating Large-scale Dynamic Random Graphs in OMNeT++

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.