Changing Routing Module in Floodlight

Ilhan, Hilmi Tunahan; Yiltas-Kaplan, Derya

doi:10.1109/icecce49384.2020.9179298

Cited by 1 publication

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The output is the shortest path with a cost value. REST API accomplishes several operations such as insertion, deletion, and interrogation of the flow inputs [Ilhan and Yiltas-Kaplan 2020], [Özbek et al 2020].…”

Section: Floodlight and Mininetmentioning

confidence: 99%

“…Java 8 was installed as mentioned in the Floodlight setup documents, and IntelliJ IDEA was used instead of Eclipse. The Python programming language was utilized for the commands in Mininet side [Ilhan and Yiltas-Kaplan 2020] for constructing a sample network with 20 switches.…”

Section: Floodlight and Mininetmentioning

confidence: 99%

“…When the destination node is added into the graph list, there is exactly one shortest path in the last path set. The path between a source and destination pair is obtained, according to the tree structure [Ilhan and Yiltas-Kaplan 2020], [Wong 1984…”

Section: Dual Ascent Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Traffic Optimization with Software-Defined Network Controller on a New User Interface

Yiltas-Kaplan

2022

jucs

Self Cite

View full text Add to dashboard Cite

Software-defined networking (SDN) has emerged as a solution to the cumbersome structures of classical computer networks. It separates control and data planes to give independence to devices with respect to either traffic routing or network management. The two isolated planes communicate with each other via the help of software modules, which are located in an SDN controller, such as Floodlight, NOX, or Ryu. In this study, Floodlight is used and an SDN topology with 20 switches is constructed with Python code in Mininet. All algorithms have been coded with Java. The default routing algorithm in Floodlight is Dijkstra’s algorithm. Four different network optimization algorithms, namely Bellman-Ford, Ford-Fulkerson, Auction, and Dual Ascent algorithms, are utilized in ordinary network routing instead of Dijkstra’s algorithm. None of these four algorithms were used in SDN before and network implementations using Ford-Fulkerson, Auction, or Dual Ascent algorithms were scarce in the literature. The results are analyzed with multiple types of normalization on a new user interface communicating with Floodlight part via HTTP requests. There has not been a user interface that performs the same operations in Floodlight. In the future, this study may possibly be improved with considering normalization processes based on various proportions among the metric values and accounting the computational time of the algorithms.

show abstract

Section: Floodlight and Mininetmentioning

confidence: 99%

Section: Floodlight and Mininetmentioning

confidence: 99%