Research Article
Simulating Large-scale Dynamic Random Graphs in OMNeT++
@INPROCEEDINGS{10.4108/icst.simutools.2012.247732, author={Kristjan Jonsson and Ymir Vigfusson and Olafur Helgason}, title={Simulating Large-scale Dynamic Random Graphs in OMNeT++}, proceedings={5th International Workshop on OMNeT++}, publisher={ACM}, proceedings_a={OMNET++}, year={2012}, month={6}, keywords={discrete event simulation \{omnet++\} random graphs distributed aggregation protocols}, doi={10.4108/icst.simutools.2012.247732} }- Kristjan Jonsson
Ymir Vigfusson
Olafur Helgason
Year: 2012
Simulating Large-scale Dynamic Random Graphs in OMNeT++
OMNET++
ACM
DOI: 10.4108/icst.simutools.2012.247732
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.
Copyright © 2012–2024 ICST
