See

discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/280135980

Dynamic and Fair Management of Flow Routing

in OpenFlow

Conference Paper June 2015

CITATIONS READS

0 105

1 author:

Abebe Abeshu Diro

La Trobe University
8 PUBLICATIONS 2 CITATIONS

SEE PROFILE

All content following this page was uploaded by Abebe Abeshu Diro on 20 July 2015.

The user has requested enhancement of the downloaded file.

 2015

OpenFlow

, ,

abebe.abeshu@kumoh.ac.kr, wdragon@kumoh.ac.kr, schae@kumoh.ac.kr

Dynamic and Fair Management of Flow Routing in OpenFlow

Abebe Abeshu, Soo Young Shin, Seok Chae

Kumoh National Institute of Technology, South Korea.

Summary
SDN OpenFlow introduces new features that enables us to create and manage networks which are not possible to
create and manage with IP and Ethernet protocols. This paper discusses dynamic flow forwarding using fair
scheduling of ports in mesh multi-hop topologies such as mesh networks. We have shown the possibility of
installing and scheduling flows dynamically in OpenFlow routing elements fair enough along various paths.

. Introduction part to the NOX OpenFlow controller to

Software defined networking (SDN) is a new
networking paradigm which separates and
abstracts data plane and forwarding plane
in a network. Network intelligence is
logically centralized in controller layer and
abstracted from underlying physical network.
SDN results in more efficient network
management, more flexibility in response to
demands and faster innovation. OpenFlow is open
communication protocol which connects the
controller layer and the infrastructure layer of
the SDN architecture. OpenFlow introduces new
features that enables us to create and manage
networks which are not possible to create and
manage with IP and Ethernet protocols [1]. Many
routing protocols have been implemented using
OpenFlow protocol in a software defined network
(SDN) environment. Multiprotocol Label
Switching [2] and shortest path forwarding [3]
are worth mentioning implementation using
OpenFlow. The method employed in [4] sets
forward the idea of diving sets of flows
over server replicas in a data center as
large flow is aggregated from microflows using
wildcard rules, and direct each larger flows to one
of server. [5] integrated a load balancing
support random and load-based policies to
divide traffic between server replicas. The work
done in [6] avoids the purchasing of expensive
load balancing hardware, and distribute load
sharing functionality among forwarding
boxes decrease the probability of occurring
single point of failure in a data center. Flowvisor
[7] is used to direct messages between
routers/switches and controllers in a
network. This paper discusses dynamic flow
forwarding using round robin scheduling of ports
in mesh networks.
. Dynamic Routing Using OpenFlow
In traditional IP networks, routing is performed
per packet basis while SDN employs flow based
forwarding. In Software defined mesh networks,
having several egress ports and paths,load
balancing can easily be performed in fair
scheduling egress ports in per flow basis.
Dynamic routing behaviour in an SDN
OpenFlow networks is to provide equal slice
time for each output port and for each desired
destination address, and to install flow table
entries on the fly. After flow entry population
in flow table in the given slice of time, the next

- 1501 -
 2015

step is to enable router to perform routing Fig2: Test-bed

using the current port. figure 1 shows the To test the communication, we used ping
algorithm. command using 10 packets per second from host
h1 to host h4. As you can see from the output of
the Controller from figure 3, the traffic coming
from host h1 flows in through the three ports of
AP1 turn by turn. Particularly, it indicates as the
packets flow from h1 to h4 via R1-R4,R1-R2 and
R1-R4 in round robin fashion.

Fig.3: Output of communication

IV. Conclusion
We have shown the possibility of installing and
scheduling flows dynamically in OpenFlow routing
Fig.1: Dynamic Flow scheduling algorithm elements fair enough along various paths. The
III. Implementation & Analysis OpenFlow provides the flexibility to implement rules in
Controller and decouple it from data plane. Since the the
A simple network topology shown in figure 2
rules are decoupled from the switch, we could schedule
was used to test the algorithm for the emulation on
the forwarding decision based on the current load of the
Mininet 2.2.1 version. The main components are mobile
network, and creating more robust system.
entities communicating over wireless links of APs.
The Algorithm used to schedule the traffic in APs was
ACKNOWLEDGMENT
In this
coded using Python, and placed in Controller.
scenario OpenFlow controllers is in charge of This research was supported by research fund of
Kumoh National Institute of Technology, Gumi, South
programing forwarding boxes to direct Korea.
each traffic type to the responsible
References
ports.
[1]. Komail Shahmir, Stochastic Switching Using OpenFlow,
Master of Telematics - Communication Networks and
Networked Services, July 2013

[2]. SHARAFAT, A. R., DAS, S., PARULKAR, G. &

MCKEOWN, N. Mpls-te and mpls vpns with openflow.
ACM SIGCOMM Computer Communication Review, 2011.
ACM, 452-453.

[3]. SOEURT, J. & HOOGENDOORN, I. 2012. Shortest path

forwarding using OpenFlow

[4]. WANG, R., BUTNARIU, D. & REXFORD, J. 2011.

OpenFlow-based server load balancing gone wild.
Proceedings of the 11th USENIX conference on Hot topics
in management of internet, cloud, and enterprise networks
and services. Boston,MA: USENIX Association.

[5]. UPPAL, H. & BRANDON, D. 2010. OpenFlow Based

Load Balancing. CSE561: Networking Project Report,
University of Washington

- 1502 -
View publication stats