Journal of Innovative Technology and Education, Vol. 3, 2016, no.

1, 51 - 59
HIKARI Ltd, www.m-hikari.com
http://dx.doi.org/10.12988/jite.2016.627

Proposed Approach of Extended Johnson

Algorithm Analysis for Load Balancing and

Congestion Control in Software Defined

Networking

M. Bindhu and G. P. Ramesh

Department of ECE, St. Peter's University ,Chennai, India

Copyright © 2016 M. Bindhu and G. P. Ramesh. This article is distributed under the Creative
Commons Attribution License, which permits unrestricted use, distribution, and reproduction in
any medium, provided the original work is properly cited.

Abstract

Software-Defined Networking (SDN), display cases of a paradigm shift from

traditional network towards a new era of Internet. This paper offers different
attempts to integrate congestion control (cc) and load balancing by combining
SDN approach in conjunction with Extended Johnson Algorithm applied for
sparse graphs. This proposed algorithm takes into consideration not only edge
weights but also node weights with negative cycles. This algorithm produces
efficient utilization of network resources, high throughput, jitter of all pairs with
shortest paths in a sparse weighted, dense and directed graph. Implementation of
this proposed algorithm is studied with OMNET++ emulation tool under the
Abilene network topology. Various parameters like response time, throughput,
latency, server load variation, and jitter are analysed for load balancing and
congestion control in SDN. The results obtained are compared with other existing
algorithms and performances of these parameters are discussed.

Keywords: Software-defined networking (SDN), Congestion Control (CC), Load

Balancing, Throughput
52 M. Bindhu and G. P. Ramesh

1. Introduction
Software Defined Networking (SDN) technology separates the control plane and
data plane of network devices [1] where a logically centralized controller
configures the forwarding tables ,which are responsible for forwarding the packets
of communication flows. At present, network traffic is growing fast and complex
as enterprises need to purchase more equipment to handle this complex network.
Network congestion and server overload are the serious problems faced by this
enterprises network. The traditional load balancing products cannot be used in
data centre with virtualisation environment. Many business are transforming into
cloud environment where the virtualisation technology help companies like cloud
computing, big data in integration of servers with maximum utility [2], thereby
saving money. Open Flow protocol [3] uses a Controller which can manage the
traffic across the network for better load balance trying to reduce the channel
congestion. This Extended Johnson Algorithm [4] can be applied to derive all
pair’s shortest paths, in a sparse weighted, directed graph with the negative edge
weights and node weights routing path for some specific SDN environment. This
proposed algorithm is faster than Floyd–Warshall on sparse graphs which uses as
subroutines both the Bellman-Ford and Dijkstra's algorithm to find the shortest
paths from each node to other vertex in the reweighted graph. Various parameters
like response time, throughput, latency, server load variation, jitter are analysed
for load balancing and congestion control in SDN.
This paper says about load balancing algorithm which helps in finding the
shortest path using Extended Johnson algorithm for SDN based networks under
OMNET++ emulation tool[4] under the Abilene network topology[5]. This
paper is organized as follows: Section 2 briefs about the related works in SDN
Load balancing, Section 3 describes proposed work algorithm, Section 4
discusses about the simulated results, Section 5,6 says about Comparison analysis
of various parameters tabulated and graphs, finally section 7 Concludes with
possible improvements in the work.

2. Related work

SDN based Load Balancing

The online services like e-commerce, websites, and social networks frequently use
multiple servers to get high reliability and accessibility. The paper [6] proposed a
load balancing algorithm, named LABERIO (LoAdBalancEd Routing wIth
OpenFlow), minimizes latency and response time increases the network
throughput. It uses ToR (Top of Rack) Switch-to-ToR Switch Paths Table
(S2SPT) and Load Allocation Table (LAT). So, LABERIO is not suitable in wide
area network because in the wide area we cannot predict the topology changes.
The paper [7] proposed the Plug-n-Serve system implementing a load balancing
algorithm, called LOBUS (LOad-Balancing over UnStructure networks) [8], using
OpenFlow for unstructured networks yields the lowest total response time for each
Proposed approach of extended Johnson algorithm analysis 53

newly arriving request. IP services uses Open Shortest Path First(OSPF), the
computation is based on Dijkstra's algorithm which calculates the shortest path
within the network with disadvantage is ,a blind search is done which involves in
time consumption and it cannot handle negative edges. The design [9] of an intra-
data centre switch architecture encompassing the proposed transmission scheme is
then presented with help of LDR optical signal inputs which are multiplexed is
transmitted and received in intra data centre under open flow principles

3. Proposed Extended Johnson Algorithm

The algorithm solves all pair’s shortest paths, in a sparse weighted, directed graph
with negative numbers. This algorithm is faster than Floyd–Warshall on sparse
graphs which uses as subroutines both Bellman-Ford and Dijkstra's algorithm to
find the shortest paths from each node to other vertex in the reweighted graph.
The idea of Extended Johnson’s algorithm is to re-weight all edges and make
them all positive, then apply Dijkstra’s algorithm for every vertex. The great thing
about this reweighting is, all position of paths linking any two vertices is
increased by same amount and all negative weights become non-negative. The
network congestion is prevented by sending the request to nearest by server with
threshold value which normally is lower than specified one.

Time Analysis:

The time difficulty of this algorithm, using Fibonacci pile Dijkstra's algorithm
[10] has O(V2log V + VE) and O(VE) time for the Bellman–Ford stage. Thus,
once the graph is sparse, the total time can be faster than the Floyd–Warshall
algorithm, which cracks the similar problem in time O(V3)[11] [12]
The node weight nw[v] of v is named according to Eq. (1),

nw[v]= ∑ f € flow bits(v) (1)

Capacity(v)

and the edge weight ew[e] of e is named according to Eq. (2).

ew[e]= ∑ f € flow bits(e) (2)

Capacity(e)

The technique of reweighting Assign new weights ŵ to each edge as follows:

ŵ(u, v) = w(u, v) + d(s, u) - d(s, v) (3)

w(u, v) + d(s, u) - d(s, v)≥0 (4)

54 M. Bindhu and G. P. Ramesh

Extended Johnson's algorithm

1. Compute G', which consists of G supplemented with s and a zero-weight edge

from s to every vertex in G.
2. Run Bellman-Ford(G', w, s) to obtain the d(s,v)'s .
3. Reweight by computing ŵ for each edge.
4. Run on each vertex to compute, The extended Dijkstra algorithm uses d[u] to
store the distance of the current shortest path from the source node s to the
destination node u, and uses p[u] to store the previous node preceding u on the
current shortest path.
5. Undo reweighting factors to compute d.
6. d[v] > d[u]+ew[u,v]+nw[u] then,
7. d[v]←d[u]+ew[u,v]+nw[u] .
8. p[v]←d[u]
9. if p=Φ then
10. s ← min(P).server
11. else
12. s ← min(Q).server
13. return s

4. Simulation and Results Analysis

For Dijkstra’s algorithm under the Abilene network uses Pyretic to implement
the proposed algorithms and compare it with related basic algorithms, i.e., the
round-robin load-balancing algorithm and the randomized load-balancing
algorithm we refer to [13].

5. Comparison Analysis of various load balancing parameters

1. Reponse time:

Time taken for distributing the packets from the server to the host in balancing
way.
The figure 1 depicts the developed Extended Johnson algorithm values and
compared with randomised, round robin algorithm values [15],[16] ,the following
results are shown in table 1.
Extended Johnson: 0.10ms, Round robin: 0.14ms, Randomised: 0.17ms
Hence the extended Johnson algorithm produces average response time when
compared to round robin &randomised where the response time is low with in-
Proposed approach of extended Johnson algorithm analysis 55

stability for various number of clients. Extended Johnson algorithm

approximately gives 33.33 % better response time than the other algorithms.

2. Through put:

Amount of data successfully moved from one place to another.

The figure 2 depicts the developed Extended Johnson algorithm values and
compared with randomised, round robin algorithm values [15], [16], the
following results are shown in table 1.
Extended Johnson: 720Mbps, Roundrobin: 700Mbps, Randomised: 680Mbps
Throughput is higher for extended Johnson, Approximately 13.33 % better than
the other algorithms.

3. Latency:

Network latency says about of time taken for a packet of data to move from one
allocated point to another.
The figure 3 depicts the developed Extended Johnson algorithm values and
compared with randomised, round robin algorithm values [15], [16], the
following results are shown in table 1.
ExtendedJohnson: 1.1ms, Roundrobin: 1.8ms, Randomised: 2ms
Latency time of Johnson algorithm increase, almost stabilize with higher node
capacity.

4. Server load variation:

The standard deviation measures the amount of variation or dispersion from the
average server load.
The figure 4 depicts the developed Extended Johnson algorithm values and
compared with randomised, round robin algorithm values [15], [16], the
following results are shown in table 1.
Extended Johnson: 0, Round robin: 0.6, Randomised: 1.2

The standard deviation measures the amount of variation or dispersion from the
average server load which is almost negligible.
56 M. Bindhu and G. P. Ramesh

6. Tabulated Results

No of clients: 4
Algorithm Respo Latenc Throug Server Load
nsetie y ms hput Variation
ms Mbps

Randomised 0.12 1.95 550 2.5

Round robin 0.11 1.75 560 0.5
Djistkra 0.9 1 650 0.5
Extended
Johnson 0.85 0.9 640 0.3

No of clients: 8
Algorith Resp Latency ms Throughpu Server Load
m onseti t Mbps Variation
mems
Randomi
sed 0.12 1.98 650 1.5
Round
robin 0.12 1.8 720 0.6
Djistkra
0.11 1.2 740 0
Extended
Johnson 0.9 1.1 750 0.1

No of clients: 12
Algorith Response Laten Throughput Server Load
m time ms cy ms Mbps Variation
Randomis
ed 0.17 2 680 1.2
Round
robin 0.14 1.8 700 0.6
Djistkra
0.11 1.2 710 0
Extended
Johnson 0.10 1.1 720 0

Table 1: Tabulated results

Proposed approach of extended Johnson algorithm analysis 57

7. Graphs

Figure 1: Response time Figure 2: Throughput

Figure 3: Latency Figure 4: Server Load Variation

8. Conclusion

This paper described a performance analysis of various parameters used in load

balancing method in virtual environment based on OpenFlow technology .The
extended Johnson algorithm is been used in analysing the parameters like
response time, throughput, latency and server load variation. OpenFlow method
grants flexibility for the realization of different load balancing strategies, which is
conveniently used in software-defined network to achieve different load
balancing strategies in different network environment. Extended Johnson
algorithm approximately gives 33.33 % better response time than the other
algorithms. The Throughput is 13.33 % better than the other algorithms. Also
Latency time increase, almost stabilize with higher node capacity. The algorithm
results in efficient utilization of network resources with high throughput in
shortest paths identification in a sparse weighted, dense and directed graph.

References
[1] B. Nunes, M. Mendonça, X. Nguyen, K. Obraczk, and T. Turletti, A survey of
software-defined networking: Past, present, and future of programmable
networks, IEEE Communications Surveys & Tutorials, 16 (2014), 1617-1634.
http://dx.doi.org/10.1109/surv.2014.012214.00180
58 M. Bindhu and G. P. Ramesh

[2] Theophilus Benson, et al., Understanding data center traffic characteristics,

ACM SIGCOMM Computer Communication Review, 40 (2010), no. 1, 92-99.

[3] OpenFlow org Web Site (2013) Available at:

http://archive.openflow.org/wp/learnmore

[4] Omnet Website, http://www.omnetpp.org/omnetpp

[5] http://en.wikipedia.org/wiki/Abilene_Network-#cite_note-line-1, last accessed

on March 4, 2014. -Abilene Network

[6] H. Long, Y. Shen, M. Guo, and F. Tang, LABERIO: Dynamic load-balanced

routing in OpenFlow-enabled networks, IEEE 27th International Conference on
Advanced Information Networking and Applications, (2013), 290-297.
http://dx.doi.org/10.1109/aina.2013.7

[7,] N. Handigol, S. Seetharaman, M. Flajslik, N. McKeown, and R. Johari, Plug-

n-Serve: Load-balancing web traffic using OpenFlow, Demo at ACM
SIGCOMM, 2009, part 1.

[8] N. Handigol, S. Seetharaman, M. Flajslik, N. McKeown, and R. Johari, Plug-

n-Serve: Load-balancing web traffic using OpenFlow, Demo at ACM
SIGCOMM, 2009, part 2.

[9] M. Bindhu and G.P. Ramesh, Implementation of Asynchronous Amplitude

and Phase Shift Keying for Optical Data in SDN-Intra-Data Centre Network,
Middle-East Journal of Scientific Research, 23 (Sensing, Signal Processing and
Security) (2015), 314-318.

[10] Jehn-Ruey Jiang, Hsin-Wen Huang, Ji-Hau Liao, and Szu-Yuan Chen,
Extending Dijkstra’s Shortest Path Algorithm for Software Defined Networking,
Proc. of the 16th Asia-Pacific Network Operations and Management Symposium
(APNOMS 2014), (2014), 1-4. http://dx.doi.org/10.1109/apnoms.2014.6996609

[11] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford

Stein, Introduction to Algorithms, MIT Press and McGraw-Hill, 2001.

[12] Paul E. Black, Johnson's Algorithm, Dictionary of Algorithms and Data

Structures, National Institute of Standards and Technology, 2004.

[13] M. Bindhu, G.P. Ramesh. The Journey to SDN: A Peek into the History of
Programmable Networks, IJCSEC- International Journal of Computer Science
and Engineering Communications, 2 (2014), no. 5, 500-506.
Proposed approach of extended Johnson algorithm analysis 59

[14] A. Varga. INET Framework for the OMNeT++ Discrete Event Simulator,
http://github.com/inet-framework/inet, 2012.

[15] M. Bindhu, G.P. Ramesh, Load Balancing and Congestion Control in

Software Defined Networking using the Extended Johnson Algorithm for Data
Centre, International Journal of Applied Engineering Research, 10 (2015), no. 17,
12911-12914. http://www.ripublication.com

[16] Jehn-Ruey Jiang, Widhi Yahya and Mahardeka Tri Ananta, Load Balancing
and Multicasting Using the Extended Dijkstra’s Algorithm in Software Defined
Networking.

Received: March 8, 2016; Published: May 4, 2016