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. scalefree 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.
منابع مشابه
Simulating process chain models with OMNeT++
This paper presents an approach to simulate complex hierarchical process chains resulting from large logistics networks in OMNeT++, a discrete event simulation environment designed for communication networks. For this purpose OMNeT++ has been integrated as a new simulation engine into the ProC/B toolset which is designed for the analysis and optimization of large logistics networks. The paper h...
متن کاملThe Omnet++ Discrete Event Simulation System
The paper introduces OMNeT++, a C++-based discrete event simulation package primarily targeted at simulating computer networks and other distributed systems. OMNeT++ is fully programmable and modular, and it was designed from the ground up to support modeling very large networks built from reusable model components. Large emphasis was placed also on easy traceability and debuggability of simula...
متن کاملAutomating Large-Scale Simulation and Data Analysis with OMNeT++: Lession Learned and Future Perspectives
Simulation is widely adopted in the study of modern computer networks. In this context, OMNeT++ provides a set of very effective tools that span from the definition of the network, to the automation of simulation execution and quick result representation. However, as network models become more and more complex to cope with the evolution of network systems, the amount of simulation factors, the ...
متن کاملScale-free Graphs for General Aviation Flight Schedules
In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the numb...
متن کاملOpportunistic networking in OMNeT++
This work describes mechanisms for simulating opportunistic and delay-tolerant networks in the OMNeT++ discrete event simulator. The mechanisms allow for simulating open systems of wireless mobile nodes where mobilityor contact traces are used to drive the simulations. This way mobility generation is separated from the core OMNeT++ protocol simulations which facilitates importing synthetic or r...
متن کامل