Implementation issues for Modified Dijkstra's and Floyd-Warshall algorithms in OpenFlow

This paper continues the idea of a gearbox-like routing algorithm selection in runtime presented at IEEE LANMAN 2011. Following the results obtained by simulations, the objectives were this time to have a real implementation of the the Modified Dijkstra's and Floyd-Warshall algorithms in OpenFlow. The testbed under Fedora Core consisted on four virtual switches Open vSwitch 1.3 and a software controller Beacon 1.0.2. The individual performance evaluation of the two algorithms was done based on the end-to-end available transfer rate, using RTSP video flows over UDP without transfer rate obtrusion. The congestion was realized by generating UDP background traffic using iperf.