Content area
Full Text
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.
Keywords: Breadth First Search, Ford - Fulkerson, multipath routing algorithm, OMNeT++
(ProQuest: ... denotes formulae omitted.)
I. INTRODUCTION
The maximum flow determination has been a long term issue in several areas (including networking) for many years. Roughly speaking, it calculates the maximum amount of "stuff" that can be moved from one part of a network to another, being aware about the capacity limitations of the links. This "stuff" could be data packets travelling over the Internet, the water travelling through pipes or some trucks travelling on the highways. Thus the links limitations could refer to the bandwidth (for the Internet connections), the pipe dimensions (for the water distribution systems) and the average traffic speeds (for congested roads). The graph theory is offering a mathematical support to solve the problem of the max flow. One of the nodes (we prefer these terms instead of vertices) in the graph is called the source node, whilst another one is the destination (or sink). Each link (or edge) in this graph has an associated capacity. Limiting now the area of discussion to the current Internet, two arguments are driving the investigations proposed in this paper: a) the increased demand for higher transfer rates; b) the computational time for optimal routing decisions. A good candidate to help the well-known single path mechanisms in place nowadays is the multi-path packet forwarding.
Similar studies...