Simulation of the Ford–Fulkerson Algorithm Using Omnet++
Journal Title: Acta Technica Napocensis- Electronica-Telecomunicatii (Electronics and Telecommunications) - Year 2012, Vol 53, Issue 2
Abstract
This paper presents a contribution to the OMNeT++ 4.1 simulator in C++ by integrating our own implementation of the FF - Ford-Fulkerson multipath routing algorithm. In order to validate it, an eight-node testbed works with dynamic requested and released flows on each link, updated every second. Four simple scenarios were proposed, considering all possible combinations of fixed and/or random variation laws. Additionally, the path search algorithm BFS - Breadth First Search was implemented too. This software package running under Fedora Core gets the input data from three files called Nodes, Connections and Params. This mechanism provides the interworking between the C++-based FF simulator and the Java-based application in Intellij IDEA 10.5, used as traffic variation simulator. The graphical representations of the occupied, the requested and, respectively, the released flows are obtained by aggregating the contributions of all flows from the paths for any given source–destination pair.
Authors and Affiliations
Paula SEVASTIAN , Andrei Bogdan RUS , Virgil DOBROTA
Keywords
Related Articles
- EP ID EP103440
- DOI -
- Views 145
- Downloads 0
Nonlinear System Identification Using Adaptive Volterra Filters for Echo Cancelling
Adaptive nonlinear filtering plays an important role in audio signal processing and echo control. In this contribution a nonlinear system identification method is proposed. The setup is built using adaptive Volterra filt...
Interactive Tools For Learning Foreign Languages – Case Study: Cluj-Napoca German Cultural Centre
The Cluj-Napoca German Cultural Centre organises German language courses for different levels of linguistic competence. In teaching German, the tutors implement interactive learning concepts, mostly serious game. A feed...
On Using DNA Distances And Consensus In Repeats Detection
Sequence repeats are the simplest form of regularity and analyzing repeats can lead to first clues to evidencing new biological phenomena. Many of the methods for detecting repeated sequences are part of the digital sign...
A PSPICE Model For T Matching Circuits
In electronics, impedance matching is an engineering technique employed in circuit design for matching unequal source and load impedances. This can be done by inserting a matching circuit between the source and a load. F...
A VLSI Implementation of a New Low Voltage 4th Order Differential Gm-C Band-Pass Filters For Different Approximation In CMOS Technology
In this paper we present a new low voltage 4th order differential Gm-C band-pass filter (BPF) for different approximations (Butterworth or Chebyshev), which has been designed in CMOS technology. This differential BPF is...