The omnet++ discrete event simulation system

Home
/
Papers
/
The omnet++ discrete event simulation system

The omnet++ discrete event simulation system

Andras Varga¹•Institutions (1)

Budapest University of Technology and Economics¹

01 Jan 2003-

TL;DR: 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.

read less

Abstract: 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 simulation models: one can execute the simulation under a powerful graphical user interface, which makes the internals of a simulation model fully visible to the person running the simulation: it displays the network graphics, animates the message flow and lets the user peek into objects and variables within the model. These features make OMNeT++ a good candidate for both research and educational purposes. The OMNeT++ simulation engine can be easily embedded into larger applications. OMNeT++ is opensource, free for non-profit use, and it has a fairly large user

...read moreread less

Citations

PDF

Open Access

More filters

Proceedings Article•DOI•

An adaptive energy-efficient MAC protocol for wireless sensor networks

[...]

Tijs van Dam¹, Koen Langendoen¹•Institutions (1)

Delft University of Technology¹

05 Nov 2003

TL;DR: T-MAC, a contention-based Medium Access Control protocol for wireless sensor networks, introduces an adaptive duty cycle in a novel way: by dynamically ending the active part of it to handle load variations in time and location.

...read moreread less

Abstract: In this paper we describe T-MAC, a contention-based Medium Access Control protocol for wireless sensor networks. Applications for these networks have some characteristics (low message rate, insensitivity to latency) that can be exploited to reduce energy consumption by introducing an activesleep duty cycle. To handle load variations in time and location T-MAC introduces an adaptive duty cycle in a novel way: by dynamically ending the active part of it. This reduces the amount of energy wasted on idle listening, in which nodes wait for potentially incoming messages, while still maintaining a reasonable throughput.We discuss the design of T-MAC, and provide a head-to-head comparison with classic CSMA (no duty cycle) and S-MAC (fixed duty cycle) through extensive simulations. Under homogeneous load, T-MAC and S-MAC achieve similar reductions in energy consumption (up to 98%) compared to CSMA. In a sample scenario with variable load, however, T-MAC outperforms S-MAC by a factor of 5. Preliminary energy-consumption measurements provide insight into the internal workings of the T-MAC protocol.

...read moreread less

2,844 citations

Cites methods from "The omnet++ discrete event simulati..."

...In the OMNeT++ discrete event simulation package [11], we have built a realistic model of the EYES wireless sensor nodes [13]....
[...]

Journal Article•DOI•

GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing

[...]

Rajkumar Buyya¹, Manzur Murshed²•Institutions (2)

University of Melbourne¹, Monash University, Gippsland campus²

01 Nov 2002-Concurrency and Computation: Practice and Experience

TL;DR: This work states that clusters, Grids, and peer‐to‐peer (P2P) networks have emerged as popular paradigms for next generation parallel and distributed computing and introduces a number of resource management and application scheduling challenges in the domain of security, resource and policy heterogeneity, fault tolerance, continuously changing resource conditions, and politics.

...read moreread less

Abstract: SUMMARY Clusters, Grids, and peer-to-peer (P2P) networks have emerged as popular paradigms for next generation parallel and distributed computing. They enable aggregation of distributed resources for solving largescale problems in science, engineering, and commerce. In Grid and P2P computing environments, the resources are usually geographically distributed in multiple administrative domains, managed and owned by different organizations with different policies, and interconnected by wide-area networks or the Internet. This introduces a number of resource management and application scheduling challenges in the domain of security, resource and policy heterogeneity, fault tolerance, continuously changing resource conditions, and politics. The resource management and scheduling systems for Grid computing need to manage resources and application execution depending on either resource consumers’ or owners’ requirements, and continuously adapt to changes in resource availability. The management of resources and scheduling of applications in such large-scale distributed systems is a complex undertaking. In order to prove the effectiveness of resource brokers and associated scheduling algorithms, their performance needs to be evaluated under different scenarios such as varying number of resources and users with different requirements. In a Grid environment, it is hard and even impossible to perform scheduler performance evaluation in a repeatable and controllable manner as resources and users are distributed across multiple organizations with their own policies. To overcome this limitation, we have developed a Java-based discrete-event Grid simulation toolkit called GridSim. The toolkit supports modeling and simulation of heterogeneous Grid resources (both time- and space-shared), users and application models. It provides primitives for creation of application tasks, mapping of tasks to resources, and their management. To demonstrate suitability of the GridSim toolkit, we have simulated a Nimrod-G

...read moreread less

1,604 citations

Cites background or methods from "The omnet++ discrete event simulati..."

...The notable ones are: Bricks [16], MicroGrid [18], Simgrid [ 17 ], and our GridSim toolkit....
[...]
...The Simgrid toolkit [ 17 ], developed in the University of California at San Diego (UCSD), is a...
[...]
...They include simulation languages (e.g., Simscript [14]), simulation environments (e.g., Parsec [15]), simulation libraries (SimJava [1]), and application specific simulators (e.g., OMNet++ network simulator [ 19 ])....
[...]

Proceedings Article•DOI•

An overview of the OMNeT++ simulation environment

[...]

Andras Varga, Rudolf Hornig

03 Mar 2008

TL;DR: An overview of the OMNeT++ framework, recent challenges brought about by the growing amount and complexity of third party simulation models, and the solutions the authors introduce in the next major revision of the simulation framework are presented.

...read moreread less

Abstract: The OMNeT++ discrete event simulation environment has been publicly available since 1997. It has been created with the simulation of communication networks, multiprocessors and other distributed systems in mind as application area, but instead of building a specialized simulator, OMNeT++ was designed to be as general as possible. Since then, the idea has proven to work, and OMNeT++ has been used in numerous domains from queuing network simulations to wireless and ad-hoc network simulations, from business process simulation to peer-to-peer network, optical switch and storage area network simulations. This paper presents an overview of the OMNeT++ framework, recent challenges brought about by the growing amount and complexity of third party simulation models, and the solutions we introduce in the next major revision of the simulation framework.

...read moreread less

1,450 citations

Cites background from "The omnet++ discrete event simulati..."

...OMNeT++[1][2] is a C++-based discrete event simulator for modeling communication networks, multiprocessors and other distributed or parallel systems....
[...]

Journal Article•DOI•

Bidirectionally Coupled Network and Road Traffic Simulation for Improved IVC Analysis

[...]

Christoph Sommer¹, Reinhard German¹, Falko Dressler¹•Institutions (1)

University of Erlangen-Nuremberg¹

01 Jan 2011-IEEE Transactions on Mobile Computing

TL;DR: The hybrid simulation framework Veins (Vehicles in Network Simulation), composed of the network simulator OMNeT++ and the road traffic simulator SUMO, is developed and can advance the state-of-the-art in performance evaluation of IVC and provide means to evaluate developed protocols more accurately.

...read moreread less

Abstract: Recently, many efforts have been made to develop more efficient Inter-Vehicle Communication (IVC) protocols for on-demand route planning according to observed traffic congestion or incidents, as well as for safety applications. Because practical experiments are often not feasible, simulation of network protocol behavior in Vehicular Ad Hoc Network (VANET) scenarios is strongly demanded for evaluating the applicability of developed network protocols. In this work, we discuss the need for bidirectional coupling of network simulation and road traffic microsimulation for evaluating IVC protocols. As the selection of a mobility model influences the outcome of simulations to a great extent, the use of a representative model is necessary for producing meaningful evaluation results. Based on these observations, we developed the hybrid simulation framework Veins (Vehicles in Network Simulation), composed of the network simulator OMNeT++ and the road traffic simulator SUMO. In a proof-of-concept study, we demonstrate its advantages and the need for bidirectionally coupled simulation based on the evaluation of two protocols for incident warning over VANETs. With our developed methodology, we can advance the state-of-the-art in performance evaluation of IVC and provide means to evaluate developed protocols more accurately.

...read moreread less

1,356 citations

Cites methods from "The omnet++ discrete event simulati..."

...Ç...
[...]
...Before we outline the architecture and behavior of the bidirectionally coupled simulation using Veins, we briefly introduce the mentioned simulation domains and motivate our selection of adequate candidate tools....
[...]

Journal Article•DOI•

Distributed localization in wireless sensor networks: a quantitative comparison

[...]

Koen Langendoen¹, Niels Reijers¹•Institutions (1)

Delft University of Technology¹

15 Nov 2003-Computer Networks

TL;DR: This paper compares three distributed localization algorithms (Ad-hoc positioning, Robust positioning, and N-hop multilateration) on a single simulation platform and concludes that no single algorithm performs best.

...read moreread less

1,106 citations

Cites background from "The omnet++ discrete event simulati..."

...The underlying OMNeT++ discrete event simulator [17] takes care of the semiconcurrent execution of the specific localization algorithm....
[...]

1
2
3
4
…
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200

Collapse

References

PDF

Open Access

More filters

Journal Article•DOI•

Parsec: a parallel simulation environment for complex systems

[...]

Rajive Bagrodia¹, Richard A. Meyer¹, Mineo Takai¹, Yu-an Chen¹, Xiang Zeng¹, Jay Martin¹, Ha Yoon Song¹ - Show less +3 more•Institutions (1)

University of California, Los Angeles¹

01 Oct 1998-IEEE Computer

TL;DR: The simulation environment the authors developed at UCLA attempts to address some of the issues facing widespread use of parallel simulation, including a lack of tools for integrating parallel model execution into the overall framework of system simulation.

...read moreread less

Abstract: Design and development costs for extremely large systems could be significantly reduced if only there were efficient techniques for evaluating design alternatives and predicting their impact on overall system performance metrics. Due to the systems' analytical intractability, simulation is the most common performance evaluation technique for such systems. However, the long execution times needed for sequential simulation models often hampers evaluation. The slow speeds of sequential model execution have led to growing interest in the use of parallel execution for simulating large-scale systems. Widespread use of parallel simulation, however; has been significantly hindered by a lack of tools for integrating parallel model execution into the overall framework of system simulation. Another drawback to widespread use of simulations is the cost of model design and maintenance. The simulation environment the authors developed at UCLA attempts to address some of these issues. It consists of three primary components: a parallel simulation language called Parsec (parallel simulation environment for complex systems), its GUI, called Pave, and the portable runtime system that implements the simulation algorithms.

...read moreread less

699 citations

"The omnet++ discrete event simulati..." refers result in this paper

...…a very brief overview by picking some of the most important or most representative ones in both categories and comparing them to OMNeT++: Parsec (Bagrodia et al. 1998), SMURPH (Gburzynski 1996), ns (Bajaj et al. 2000), Ptolemy (Davis et al. 1999), NetSim++ (Maranda et al. 1996), C++Sim (Little…...
[...]
...This section gives a very brief overview by picking some of the most important or most representative ones in both categories and comparing them to OMNeT++: Parsec (Bagrodia et al. 1998), SMURPH (Gburzynski 1996), ns (Bajaj et al....
[...]
...This section gives a very brief overview by picking some of the most important or most representative ones in both categories and comparing them to OMNeT++: Parsec (Bagrodia et al. 1998), SMURPH (Gburzynski 1996), ns (Bajaj et al. 2000), Ptolemy (Davis et al. 1999), NetSim++ (Maranda et al. 1996), C++Sim (Little and McCue 1993), CLASS (Marsan et al. 1994) as noncommercial, and OPNET (OPNET Technologies, Inc.), EcoPREDICTOR (formerly COMNET III; Compuware Corp.) as commercial tools....
[...]

Overview of the Ptolemy project

[...]

Edward A. Lee

01 Jan 2001

TL;DR: The Ptolemy project studies heterogeneous modeling and design of concurrent systems, particularly those that mix technologies, including for example analog a digital electronics, hardware and software, and electronics and mechanical devices.

...read moreread less

Abstract: The Ptolemy project studies heterogeneous modeling and design of concurrent systems. Th is on embedded systems , particularly those that mix technologies, including for example analog a digital electronics, hardware and software, and electronics and mechanical devices (including M microelectromechanical systems). The focus is also on systems that are complex in the sense t mix widely different operations, such as signal processing, feedback control, sequential decision ing, and user interfaces. Modelingis the act of representing a system or subsystem formally. A model might be mathe cal, in which case it can be viewed as a set of assertions about properties of the system such as tionality or physical dimensions. A model can also be constructive, in which case it defin computational procedure that mimics a set of properties of the system. Constructive models ar used to describe behavior of a system in response to stimulus from outside the system. Cons models are also called executable models. Designis the act of defining a system or subsystem. Usually this involves defining one or m models of the system and refining the models until the desired functionality is obtained within a constraints. Design and modeling are obviously closely coupled. In some circumstances, models m immutable, in the sense that they describe subsystems, constraints, or behaviors that are ex imposed on a design. For instance, they may describe a mechanical system that is not under des must be controlled by an electronic system that is under design. Executable models are sometimes called simulations, an appropriate term when the executab model is clearly distinct from the system it models. However, in many electronic systems, a mode starts as a simulation mutates into a software implementation of the system. The distinction be the model and the system itself becomes blurred in this case. This is particularly true for emb software.

...read moreread less

594 citations

Additional excerpts

...This section gives a very brief overview by picking some of the most important or most representative ones in both categories and comparing them to OMNeT++: Parsec (Bagrodia et al. 1998), SMURPH (Gburzynski 1996), ns (Bajaj et al. 2000), Ptolemy ( Davis et al. 1999 ), NetSim++ (Maranda et al. 1996), C++Sim (Little and McCue 1993), CLASS (Marsan et al. 1994) as noncommercial, and OPNET (OPNET Technologies, Inc.), EcoPREDICTOR (formerly COMNET ......
[...]

Proceedings Article•DOI•

Parallel DEVS: a parallel, hierarchical, modular, modeling formalism

[...]

Alex Chung-Hen Chow¹, Bernard P. Zeigler²•Institutions (2)

IBM¹, University of Arizona²

11 Dec 1994

TL;DR: The revision distinguishes between transition collisions and ordinary external events in the external transition function of DEVS models, which enables it to extend the modeling capability of the collisions.

...read moreread less

Abstract: We present a revision of the hierarchical, modular Discrete Event System Specification (DEVS) modeling formalism. The revision distinguishes between transition collisions and ordinary external events in the external transition function of DEVS models. Such separation enables us to extend the modeling capability of the collisions. The revision also does away with the necessity for tie-breaking of simultaneously scheduled events, as embodied in the select function. The latter is replaced by a well-defined and consistent formal construct that allows all transitions to be simultaneously activated. The revision provides a modeler with both conceptual and parallel execution benefits.

...read moreread less

287 citations

"The omnet++ discrete event simulati..." refers methods in this paper

...The concept of simple and compound modules is similar to DEVS (Zeigler 1990; Chow and Zeigler 1994) atomic and coupled models....
[...]

Improving Simulation for Network Research

[...]

Sandeep Bajaj, Lee Breslau, Deborah Estrin, Kevin Fall, Sally Floyd, Padma Haldar, Mark Handley, Ahmed Helmy, John Heidemann, Polly Huang, Satish Kumar, Steven McCanne, Reza Rejaie - Show less +9 more

01 Jan 1999

TL;DR: ns as mentioned in this paper is a multi-protocol network simulator designed to address the needs of networking researchers and provides multiple levels of abstraction to permit simulations to span a wide range of scales, emulation, where real-world packets can enter the simulator.

...read moreread less

Abstract: New protocols and algorithms are being developed to meet changing operational requirements in the Internet. Simulation is a vital tool to quickly and inexpensively explore the behavior of these new protocol across the range of topologies, cross-traÆc, and interactions that might occur in the Internet. This paper describes ns, a widely used, multi-protocol network simulator designed to address the needs of networking researchers. Ns provides multiple levels of abstraction to permit simulations to span a wide-range of scales, emulation, where real-world packets can enter the simulator. We describe the ns architecture and examine the range of ways simulation and ns are used in networking research.

...read moreread less

261 citations

"The omnet++ discrete event simulati..." refers background in this paper

...OMNeT++ tries to fill the gap between open-source, research-oriented simulation software such as ns (Bajaj et al. 2000) and expensive commercial alternatives like OPNET (OPNET Technologies, Inc....
[...]
...1998), SMURPH (Gburzynski 1996), ns (Bajaj et al. 2000), Ptolemy (Davis et al....
[...]
...…important or most representative ones in both categories and comparing them to OMNeT++: Parsec (Bagrodia et al. 1998), SMURPH (Gburzynski 1996), ns (Bajaj et al. 2000), Ptolemy (Davis et al. 1999), NetSim++ (Maranda et al. 1996), C++Sim (Little and McCue 1993), CLASS (Marsan et al. 1994) as…...
[...]
...OMNeT++ tries to fill the gap between open-source, research-oriented simulation software such as ns (Bajaj et al. 2000) and expensive commercial alternatives like OPNET (OPNET Technologies, Inc.)....
[...]

Journal Article•DOI•

The P2 algorithm for dynamic calculation of quantiles and histograms without storing observations

[...]

Raj Jain, Imrich Chlamtac¹•Institutions (1)

Technion – Israel Institute of Technology¹

01 Oct 1985-Communications of The ACM

TL;DR: A heuristic algorithm is proposed for dynamic calculation of the median and other quantiles that has a very small and fixed storage requirement regardless of the number of observations and is ideal for implementing in a quantile chip that can be used in industrial controllers and recorders.

...read moreread less

Abstract: A heuristic algorithm is proposed for dynamic calculation of the median and other quantiles. The estimates are produced dynamically as the observations are generated. The observations are not stored; therefore, the algorithm has a very small and fixed storage requirement regardless of the number of observations. This makes it ideal for implementing in a quantile chip that can be used in industrial controllers and recorders. The algorithm is further extended to histogram plotting. The accuracy of the algorithm is analyzed.

...read moreread less

193 citations

"The omnet++ discrete event simulati..." refers background in this paper

...The latter include three highly configurable histogram classes and the implementations of the P2 (Jain and Chlamtac 1985) and the ksplit (Varga and Fakhamzadeh 1997) algorithms....
[...]
...It is also possible for the embedding application to assemble models from the available module types on the fly – in such cases, model topology will often come from a database....
[...]