# The Extended Dijkstra s-based Load Balancing for OpenFlow Network

Save this PDF as:

Size: px
Start display at page:

## Transcription

3 291 ISSN: Figure 3. The flow table entry of the OpenFlow switch [10] The algorithm uses ToR (Top of Rack) Switch-to-ToR Switch Paths Table (S2SPT) and Load Allocation Table (LAT). However, maintaining S2SPT becomes a problem for the LABERIO, if the network topology changes. So, the LABERIO is not suitable in wide area network network that has dynamic topology. 2.2 The Extended Dijkstra s Algorithm Given a weighted, directed graph G=(V, E) and a single source node s, the classical Dijkstra s algorithm can return a shortest path from the source node s to every other node, where V is the set of nodes and E is the set of edges, each of which is associated with a non-negative weight (or length) [11]. In the original Dijkstra s algorithm, nodes are associated with no weight. The paper [4] shows how to extend the original algorithm to consider both the edge weights and the node weights. Figure 4 shows the extended Dijkstra s algorithm, whose input is a given graph G=(V, E), the edge weight setting ew, the node weight setting nw, and the single source node s. The extended 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. Initially, d[s]=0, d[u]= for u V, u s, and p[u]=null for u V. Extended Dijkstra s Algorithm Input:G=(V, E), ew, nw, s Output:d[ V ], p[ V ] 1: d[s] 0; d[u], for each u s, u V 2: insertu with key d[u] into the priority queue Q, for each u V 3: while(q ) 4: u Extract-Min(Q) 5: for each v adjacent to u 6: ifd[v]>d[u]+ew[u,v]+nw[u] then 7: d[v] d[u]+ew[u,v]+nw[u] 8: p[v] d[u] Figure 4. The extended Dijkstra s algorithm [4] Note that the extended Dijkstra s algorithm is similar to the original Dijkstra s algorithm. The difference is that the extended version adds the node weight in line 6 and line 7 of the algorithm. The original Dijkstra s algorithm cannot achieve the same result just by adding node weights into edge weights. This is because the node weight should be considered only at the outgoing edge of an intermediate node on the path. Adding node weights into edge weights implies that an extra node weight of the destination node is added into the total weight of every shortest path, making the algorithm return the wrong result. The extended Dijkstra s algorithm is very useful in deriving the best routing path to send a packet from a specific source node to another node (i.e., the destination node) for the SDN environment in which significant latency occurs when the packet goes through intermediate nodes and edges (or links). Below, we show how to define the edge weights and node weights so that the extended Dijkstra s algorithm can be applied to derive routing path for some specific SDN environment. Assume that we can derive from the SDN topology a graph G=(V, E), which is weighted, directed, and connected. For a node v V and an edge e E, let Flow(v) and Flow(e) denote the set of all the flows passing through v and e, respectively, let Capability(v) be the capability of v (i.e., the number of bits that v can process per second), and let Bandwidth(e) be the bandwidth of e (i.e., the number of bits that e can transmit per second). The node weight nw[v] of v is defined according to Eq. (1), and the edge weight ew[e] of e is defined according to Eq. (2). IJECE Vol. 5, No. 2, April 2015 :

4 IJECE ISSN: (1) where Bits(f) stands for the number of f s bits processed by node v per second. (2) where Bits(f) stands for the number of f s bits passing through edge e per second. Note that we can easily obtain the number of a flow s bits processed by a node or passing through an edge with the help of the counters field of the OpenFlow switches flow tables. Also note that the numerators in Eq. (1) and Eq. (2) are of the unit of bits, and the denominators are of the unit of bits per second. Therefore, the node weight nw[v] and the edge weight ew[e] are of the unit of seconds. When we accumulate all the node weights and all the edge weights along a path, we can obtain the end-to-end latency from one end to the other end of the path. 3. PROPOSED LOAD-BALANCING ALGORITHM The load balancer is placed in the front-end of the online services systems to map the request from the clients to the servers. In the Linux virtual server (LVS) use Network Address Translation(NAT) to direct traffic from the Internet to a variable number of servers on the second layer, which in turn provide the necessary services. Service requests arriving at the LVS cluster are addressed to a virtual IP address or VIP. VIP is can be a public IP address that associates with a fully-qualified domain name and which is assigned to multiple servers [12]. Figure 5. Example Server Load-balancing Setup [13] Figure 5 explains the server load-balancing architecture by using VIP. In this paper, we use VIP address as IP public that will be accessed from the clients. Figure 5 is an example of a single point load balancer architecture. In this paper, the load-balancing algorithm was implemented on the Abilene topology that every switches in the topology act as a load balancer. Using naive algorithms, such as the round robin algorithm and the randomized algorithm, in widearea-network load-balancing has the possibility to forward a request to the farthest server. This is not efficient because the request and the replied data will go across the network and consume a lot of bandwidth of the whole network. In SDN, the controller has the global information of the whole network, and can decide to forward the request to the nearest server by finding the shortest path with the extended Dijkstra s algorithm from the client to a server, where the shortest path means the path with the smallest summation of node weights and edge weights. Figure 6 shows the proposed load-balancing algorithm. The basic idea is to forward each request to the nearest server with the link load (utilization of the link between the server and the switch) lower than a pre-specified threshold θ. However, if all the servers have link loads larger than the threshold, the algorithm still chooses the nearest server. In this way, we can prevent congestion on the servers. The Extended Dijkstra s-based Load Balancing for OpenFlow Network (Widhi Yahya)

5 293 ISSN: Proposed Load-Balancing Algorithm Input:sw src,s dst, Output: s, s S dst P edijkstra(sw src, S dst ) forevery p i P ifp i.server.kl > then move p i from P to Q ifp= then s min(p).server else s min(q).server returns Figure 6. Proposed Load-balancing Algorithm We assume server s i is attached to switch sw i and a switch is attached with at most one server. Later on, we use s i and sw i exchangabely for convenience. Given the source switch sw src to which the request client is attached, the set S dst of servers, and a prespecified threshold, the proposed algorithm will return the best server for load-balancing. The link load kl i of serve s i (the utilization of the link <s i, sw i > between the server s i and the switch sw i ) is defined as follows:,, (3) Since the proposed algorithm is based on the extended Dijkstra s algorithm [4], we also take the same mechanisms to obtain the node weights and the edge weights. Note that edijkstra(sw src, S dst ) will use the extended Dijkstra s algorithm to return a set P of shortest paths from the source switch sw src, to every server in the server set the S dst,. Also note that p i.server stands for the server associated with the path p i, and hence p i.server.kl stands for the link load of the server associated with the path p i. Furthermore, the function min(p) will return the shortest one among all shortest paths in P. 4. SIMULATION 4.1. Simulation Setting According to the Abilene core topology, we set up an OpenFlow controller and 11 Open Flow switches as nodes, each of which was linked to the controller logically, as shown in Figure 7. For loadbalancing testing, we assumed there are two web servers that placed and spread in two different locations in the Abilene network that will be accessed from clients. Controller OpenVswitch O i Server Client Figure 7. Topology Used in Simulation IJECE Vol. 5, No. 2, April 2015 :

6 IJECE ISSN: The POX was used as OpenFlow controller. The load-balancing algorithm was implemented using Pyretic. The VIP address was used as IP public that will be accessed from the Client. Table 1. Simulation and Settings Parameter Setting Bandwidth on edges 1Gbps Number of server 2 Number of switches 11 Number of edges 25 Controller POX 2.0 supporting Pyretic Openflow Switch OpenVSwitch 1.0 Testing tool Iperf, Netperf Testing time 30second In the Figure 7, there are 2 servers and 12 clients in the Abilene topology. In this simulation testing, we generated Transmission Control Protocol (TCP) data stream from the clients to the servers using Iperf. To extend more information we also used the Netperf to generate request from clients. For every testing, we defined the number of clients are 4, 8, and 12 clients. This simulation ran on AMD Phenom(tm) 9650 Quad- Core Processor and 8GB of RAM. To prove the algorithm s reliability, we compared it with the round robin and randomized algorithms which have no consider the shortest path Simulation Result In this experiment the request can happen in every switch in the topology that describe in the simulation settings. The proposed algorithm chooses the best path (nearest server) for a requesting client by using the extended Dijkstra s algorithm. It is more convenient than maintaining the S2SPT and the LAT like in the LABERIO. The LABERIO was designed for a data center that used term of Top-of-Rack switch to maintain the paths. Since the different topology, in this experiment we use all switch to maintain the path for the LABERIO. As shown in the Figure 8, the proposed algorithm outperforms the LABERIO in the term of latency. It is quite similar because both algorithms consider the link capacity, but the superiority of the proposed algorithm isalsoconsider the node capacity. We also compare the proposed algorithm with naive algorithm, such as round-robin and randomized algorithm that do not consider the nearest server. The simulation results show that the proposed algorithm is better than the two naive algorithms in the term of end-to-end latency, as shown in Figure 8. The network end-to-end latency was measured by using the ping tool to send 30 packets whose packet size is bytes from clients to the servers for 30 seconds. The superiority is because the proposed algorithm considers the shortest paths (nearest server) and also the congestion control. On the contrary, it is possible for the naive algorithms to forward requests to the far server to go through some switches. In the real network, a high performance IP routers and switches add approximately 200 microseconds of latency to the link due to packet processing. It means, if the request are deflected to the farthest server to go through a lot of switches, the latency will increase significantly. The throughput measurement and comparison was conducted to evaluate the capability of the proposed algorithm. Throughput is the rate of successful message delivery over a communication channel. In Figure 9, shows the proposed algorithm has higher throughput than the round robin,the randomized algorithm, and the LABERIO. The round robin and randomized algorithm may deflect request to the far server and even the link is congested. It causes the throughput is lower than the proposed algorithm.consider the node capacity derive the proposed has better throughput then the LABERIO. As shown in the Figure 10, we use standard deviation to measure the server load variation. Standard deviation measures the amount of variation or dispersion from the average. The load information is provided by the Iperf server program. In this experiment, the proposed algorithm shows good result (smallest) in the server s load variation. The Extended Dijkstra s-based Load Balancing for OpenFlow Network (Widhi Yahya)

7 295 ISSN: Milliseconds Proposed Round Robin Randomized LABERIO Number of Clients Mbps Proposed Round Robin Randomized Number of Clients Figure 8. End-to-End Latency Figure 9. Throughput Proposed Randomized Round Robin LABERIO Number of Clients Figure 10. Standard Deviation Load of Servers 5. CONCLUSION This paper proposes a load-balancing algorithm that takes advantage of the extended Dijkstra s shortest path algorithm. The extended Dijkstra s shortest path algorithm was used to find the nearest server for a requesting client. The extended Dijkstra s algorithmconsiders not only the edge weights but also the node weights for a graph derived from the underlying SDN topology. We use Pyretic to implement the proposed load-balancing algorithm under the Abilene network topology with the Mininet emulation tool. The simulation results show that the proposed load-balancing algorithm outperforms others in terms of the network end-to-end latency, and throughput. REFERENCES [1] 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 [2] N. Handigol, S. Seetharaman, M. Flajslik, N. McKeown, and R. Johari. Plug-n-Serve: Load-balancing web traffic using Open Flow. Demo at ACM SIGCOMM, Aug [3] M. Koerner and O. Kao. Multiple Service Load-Balancing with Open Flow. IEEE 13th International Conference on High Performance Switching and Routing [4] J.R. Jiang, H.W. Huang, J.H. Liao, and S.Y. Chen. "Extending Dijkstra s Shortest Path Algorithm for Software Defined Networking". in Proc. of the 16th APNOMS [5] Abilene Network, last accessed on March 4, [6] J. Reich, C. Monsanto, N. Foster, J. Rexford, and D. Walker, Modular SDN Programming with Pyretic. Technical Reprot of USENIX, available athttp:// IJECE Vol. 5, No. 2, April 2015 :

8 IJECE ISSN: [7] Mininet Website, last accessed on May [8] Open Network Foundation (ONF) Website (SDN white paper), last accessed on January [9] Open Networking Foundation. OpenFlow Switch Specification version October 14, [10] N. McKeown, et. al. Open Flow: Enabling Innovation in Campus Networks. ACM SIGCOMM Computer Communication [11] E. Dijkstra, A note on two problems in connexion with graphs. Numerische mathematik. vol. 1, no.1, 1959, pp [12] Red Hat, Inc. Linux Virtual Server Administration: RHEL5: Linux Virtual Server (LVS) Doc [13] Wiki Cisco, _Configuring_Server_Load_Balancing, last accessed on june BIOGRAPHIES OF AUTHORS Widhi Yahya received the Master Science degree in Department of Computer Science and Information Engineering, National Central University, Taiwan in 2014 as an International Dual Degree Master student between University of Brawijaya and National Central University. He got Bachelor degree in Department of Informatics Engineering, University of Brawijaya, Indonesia. His research interest area is in the computer science and information technology areas, especially in network programming. Achmad Basuki is a senior lecturer in Department of Electrical Engineering, University of Brawijaya, Indonesia. He is expert in computer networking research area, especially in IP multicast,p2p, CDN, data center, and networking. He got Ph. D. degree from KEIO University, Japan. He presently work in PTIK, University of Brawijaya, Indonesia as a Chairman of the PTIK UB. Jehn-Ruey Jiang received his Ph. D. degree in Computer Science in 1995 from National Tsing- Hua University, Taiwan, R.O.C. He joined Chung-Yuan Christian University as an Associate Professor in He joined Hsuan-Chuang University in 1998 and became a full Professor in He is currently with the Department of Computer Science and Information Engineering, National Central University, and co-leads the Adaptive Computing and Networking (ACN) Laboratory, which aims at developing adaptive mechanisms for collaborative computing entities to make proper adjustments according to their current understandings about the computing environments or resources, in order to efficiently perform given tasks. The Extended Dijkstra s-based Load Balancing for OpenFlow Network (Widhi Yahya)

### Load Balancing and Multicasting Using the Extended Dijkstra s Algorithm in Software Defined Networking

Load Balancing and Multicasting Using the Extended Dijkstra s Algorithm in Software Defined Networking Jehn-Ruey Jiang 1, Widhi Yahya 1,2, and Mahardeka Tri Ananta 1,2 1 Department of Computer Science

### OpenFlow based Load Balancing for Fat-Tree Networks with Multipath Support

OpenFlow based Load Balancing for Fat-Tree Networks with Multipath Support Yu Li and Deng Pan Florida International University Miami, FL Abstract Data center networks are designed for satisfying the data

### Multiple Service Load-Balancing with OpenFlow

2012 IEEE 13th International Conference on High Performance Switching and Routing Multiple Service Load-Balancing with OpenFlow Marc Koerner Technische Universitaet Berlin Department of Telecommunication

### OpenFlow-Based Dynamic Server Cluster Load Balancing with Measurement Support

OpenFlow-Based Dynamic Server Cluster Load Balancing with Measurement Support Qingwei Du and Huaidong Zhuang College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics,

### Research Article Dynamic Server Cluster Load Balancing in Virtualization Environment with OpenFlow

International Journal of Distributed Sensor Networks Volume 215, Article ID 531538, 9 pages http://dx.doi.org/1.1155/215/531538 Research Article Dynamic Server Cluster Load Balancing in Virtualization

### Securing Local Area Network with OpenFlow

Securing Local Area Network with OpenFlow Master s Thesis Presentation Fahad B. H. Chowdhury Supervisor: Professor Jukka Manner Advisor: Timo Kiravuo Department of Communications and Networking Aalto University

### A Study on Software Defined Networking

A Study on Software Defined Networking Yogita Shivaji Hande, M. Akkalakshmi Research Scholar, Dept. of Information Technology, Gitam University, Hyderabad, India Professor, Dept. of Information Technology,

### ulobal: Enabling In-Network Load Balancing for Arbitrary Internet Services on SDN

ulobal: Enabling In-Network Load Balancing for Arbitrary Internet Services on SDN Alex F R Trajano, Marcial P Fernandez Universidade Estadual do Ceará Fortaleza, Ceará, Brazil Email: alex.ferreira@uece.br,

OpenFlow Based Load Balancing Hardeep Uppal and Dane Brandon University of Washington CSE561: Networking Project Report Abstract: In today s high-traffic internet, it is often desirable to have multiple

### CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING

CHAPTER 6 CROSS LAYER BASED MULTIPATH ROUTING FOR LOAD BALANCING 6.1 INTRODUCTION The technical challenges in WMNs are load balancing, optimal routing, fairness, network auto-configuration and mobility

### Open Source Network: Software-Defined Networking (SDN) and OpenFlow

Open Source Network: Software-Defined Networking (SDN) and OpenFlow Insop Song, Ericsson LinuxCon North America, Aug. 2012, San Diego CA Objectives Overview of OpenFlow Overview of Software Defined Networking

### Software Defined Networking What is it, how does it work, and what is it good for?

Software Defined Networking What is it, how does it work, and what is it good for? slides stolen from Jennifer Rexford, Nick McKeown, Michael Schapira, Scott Shenker, Teemu Koponen, Yotam Harchol and David

### MultiPath TCP (MPTCP)

פרויקטים בתקשורת מחשבים - 236340 - סמסטר אביב 2016 MultiPath TCP (MPTCP) MultiPath TCP (MPTCP) is an ongoing effort of the Internet Engineering Task Force's (IETF) Multipath TCP working group, which aims

### OpenFlow: Load Balancing in enterprise networks using Floodlight Controller

OpenFlow: Load Balancing in enterprise networks using Floodlight Controller Srinivas Govindraj, Arunkumar Jayaraman, Nitin Khanna, Kaushik Ravi Prakash srinivas.govindraj@colorado.edu, arunkumar.jayaraman@colorado.edu,

### A Fast Path Recovery Mechanism for MPLS Networks

A Fast Path Recovery Mechanism for MPLS Networks Jenhui Chen, Chung-Ching Chiou, and Shih-Lin Wu Department of Computer Science and Information Engineering Chang Gung University, Taoyuan, Taiwan, R.O.C.

### A Method for Load Balancing based on Software- Defined Network

, pp.43-48 http://dx.doi.org/10.14257/astl.2014.45.09 A Method for Load Balancing based on Software- Defined Network Yuanhao Zhou 1, Li Ruan 1, Limin Xiao 1, Rui Liu 1 1. State Key Laboratory of Software

### Ethernet-based Software Defined Network (SDN) Cloud Computing Research Center for Mobile Applications (CCMA), ITRI 雲 端 運 算 行 動 應 用 研 究 中 心

Ethernet-based Software Defined Network (SDN) Cloud Computing Research Center for Mobile Applications (CCMA), ITRI 雲 端 運 算 行 動 應 用 研 究 中 心 1 SDN Introduction Decoupling of control plane from data plane

### OpenFlow and Onix. OpenFlow: Enabling Innovation in Campus Networks. The Problem. We also want. How to run experiments in campus networks?

OpenFlow and Onix Bowei Xu boweixu@umich.edu [1] McKeown et al., "OpenFlow: Enabling Innovation in Campus Networks," ACM SIGCOMM CCR, 38(2):69-74, Apr. 2008. [2] Koponen et al., "Onix: a Distributed Control

### Research on Video Traffic Control Technology Based on SDN. Ziyan Lin

Joint International Mechanical, Electronic and Information Technology Conference (JIMET 2015) Research on Video Traffic Control Technology Based on SDN Ziyan Lin Communication University of China, Beijing

### Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation

Improving the Performance of TCP Using Window Adjustment Procedure and Bandwidth Estimation R.Navaneethakrishnan Assistant Professor (SG) Bharathiyar College of Engineering and Technology, Karaikal, India.

### A collaborative model for routing in multi-domains OpenFlow networks

A collaborative model for routing in multi-domains OpenFlow networks Xuan Thien Phan, Nam Thoai Faculty of Computer Science and Engineering Ho Chi Minh City University of Technology Ho Chi Minh city, Vietnam

### Load Balancing Mechanisms in Data Center Networks

Load Balancing Mechanisms in Data Center Networks Santosh Mahapatra Xin Yuan Department of Computer Science, Florida State University, Tallahassee, FL 33 {mahapatr,xyuan}@cs.fsu.edu Abstract We consider

### Implementation of Address Learning/Packet Forwarding, Firewall and Load Balancing in Floodlight Controller for SDN Network Management

Research Paper Implementation of Address Learning/Packet Forwarding, Firewall and Load Balancing in Floodlight Controller for SDN Network Management Raphael Eweka MSc Student University of East London

### Path Selection Analysis in MPLS Network Based on QoS

Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt:36, No: 6 Özel Sayı (2015) ISSN: 1300-1949 Cumhuriyet University Faculty of Science Science Journal (CSJ), Vol. 36, No: 6 Special

### Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions

Investigation and Comparison of MPLS QoS Solution and Differentiated Services QoS Solutions Steve Gennaoui, Jianhua Yin, Samuel Swinton, and * Vasil Hnatyshin Department of Computer Science Rowan University

### Assignment #3 Routing and Network Analysis. CIS3210 Computer Networks. University of Guelph

Assignment #3 Routing and Network Analysis CIS3210 Computer Networks University of Guelph Part I Written (50%): 1. Given the network graph diagram above where the nodes represent routers and the weights

Data Analysis Load Balancer Design Document: Version: 1.0 Last saved by Chris Small April 12, 2010 Abstract: The project is to design a mechanism to load balance network traffic over multiple different

### Disjoint Path Algorithm for Load Balancing in MPLS network

International Journal of Innovation and Scientific Research ISSN 2351-8014 Vol. 13 No. 1 Jan. 2015, pp. 193-199 2015 Innovative Space of Scientific Research Journals http://www.ijisr.issr-journals.org/

### An Introduction to Software-Defined Networking (SDN) Zhang Fu

An Introduction to Software-Defined Networking (SDN) Zhang Fu Roadmap Reviewing traditional networking Examples for motivating SDN Enabling networking as developing softwares SDN architecture SDN components

### MMPTCP: A Novel Transport Protocol for Data Centre Networks

MMPTCP: A Novel Transport Protocol for Data Centre Networks Morteza Kheirkhah FoSS, Department of Informatics, University of Sussex Modern Data Centre Networks FatTree It provides full bisection bandwidth

### Benchmarking the Performance of XenDesktop Virtual DeskTop Infrastructure (VDI) Platform

Benchmarking the Performance of XenDesktop Virtual DeskTop Infrastructure (VDI) Platform Shie-Yuan Wang Department of Computer Science National Chiao Tung University, Taiwan Email: shieyuan@cs.nctu.edu.tw

### Analysis of IP Network for different Quality of Service

2009 International Symposium on Computing, Communication, and Control (ISCCC 2009) Proc.of CSIT vol.1 (2011) (2011) IACSIT Press, Singapore Analysis of IP Network for different Quality of Service Ajith

### International Journal of Advanced Research in Computer Science and Software Engineering

Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Experimental

### Simulation of Heuristic Usage for Load Balancing In Routing Efficiency

Simulation of Heuristic Usage for Load Balancing In Routing Efficiency Nor Musliza Mustafa Fakulti Sains dan Teknologi Maklumat, Kolej Universiti Islam Antarabangsa Selangor normusliza@kuis.edu.my Abstract.

### Routing in packet-switching networks

Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call

### A Catechistic Method for Traffic Pattern Discovery in MANET

A Catechistic Method for Traffic Pattern Discovery in MANET R. Saranya 1, R. Santhosh 2 1 PG Scholar, Computer Science and Engineering, Karpagam University, Coimbatore. 2 Assistant Professor, Computer

### QoSIP: A QoS Aware IP Routing Protocol for Multimedia Data

QoSIP: A QoS Aware IP Routing Protocol for Multimedia Data Md. Golam Shagadul Amin Talukder and Al-Mukaddim Khan Pathan* Department of Computer Science and Engineering, Metropolitan University, Sylhet,

### VIDEO STREAMING OVER SOFTWARE DEFINED NETWORKS WITH SERVER LOAD BALANCING. Selin Yilmaz, A. Murat Tekalp, Bige D. Unluturk

VIDEO STREAMING OVER SOFTWARE DEFINED NETWORKS WITH SERVER LOAD BALANCING Selin Yilmaz, A. Murat Tekalp, Bige D. Unluturk College of Engineering, Koç University, 34450 Sariyer, Istanbul, Turkey ABSTRACT

### Design and Implementation of Dynamic load balancer on OpenFlow enabled SDNs

IOSR Journal of Engineering (IOSRJEN) e-issn: 2250-3021, p-issn: 2278-8719 Vol. 3, Issue 8 (August. 2013), V4 PP 32-41 Design and Implementation of Dynamic load balancer on OpenFlow enabled SDNs Ragalatha

### Referring to the above question, the end-to-end delay (transmission delay plus propagation delay) is

CS326e Quiz 3 The first correct 10 answers will be worth 1 point each. Each subsequent correct answer will be worth 0.2 points. Circle the correct answer. UTEID In the following 7 problems, we are sending

### Software Defined Networks

Software Defined Networks Damiano Carra Università degli Studi di Verona Dipartimento di Informatica Acknowledgements! Credits Part of the course material is based on slides provided by the following authors

### Comparisons of SDN OpenFlow Controllers over EstiNet: Ryu vs. NOX

Comparisons of SDN OpenFlow Controllers over EstiNet: Ryu vs. NOX Shie-Yuan Wang Hung-Wei Chiu and Chih-Liang Chou Department of Computer Science, National Chiao Tung University, Taiwan Email: shieyuan@cs.nctu.edu.tw

### Empowering Software Defined Network Controller with Packet-Level Information

Empowering Software Defined Network Controller with Packet-Level Information Sajad Shirali-Shahreza, Yashar Ganjali Department of Computer Science, University of Toronto, Toronto, Canada Abstract Packet

### Controlling the Internet in the era of Software Defined and Virtualized Networks. Fernando Paganini Universidad ORT Uruguay

Controlling the Internet in the era of Software Defined and Virtualized Networks Fernando Paganini Universidad ORT Uruguay CDS@20, Caltech 2014 Motivation 1. The Internet grew in its first 30 years with

### Remaining Capacity Based Load Balancing Architecture for Heterogeneous Web Server System

Remaining Capacity Based Load Balancing Architecture for Heterogeneous Web Server System Tsang-Long Pao Dept. Computer Science and Engineering Tatung University Taipei, ROC Jian-Bo Chen Dept. Computer

### The Internet: A Remarkable Story. Inside the Net: A Different Story. Networks are Hard to Manage. Software Defined Networking Concepts

The Internet: A Remarkable Story Software Defined Networking Concepts Based on the materials from Jennifer Rexford (Princeton) and Nick McKeown(Stanford) Tremendous success From research experiment to

### A Fuzzy Logic-Based Information Security Management for Software-Defined Networks

A Fuzzy Logic-Based Information Security Management for Software-Defined Networks Sergei Dotcenko *, Andrei Vladyko *, Ivan Letenko * * The Bonch-Bruevich Saint-Petersburg State University of Telecommunications,

### Getting to know OpenFlow. Nick Rutherford Mariano Vallés {nicholas,mariano}@ac.upc.edu

Getting to know OpenFlow Nick Rutherford Mariano Vallés {nicholas,mariano}@ac.upc.edu OpenFlow Switching 1. A way to run experiments in the networks we use everyday. A pragmatic compromise Allow researchers

### Hadoop Technology for Flow Analysis of the Internet Traffic

Hadoop Technology for Flow Analysis of the Internet Traffic Rakshitha Kiran P PG Scholar, Dept. of C.S, Shree Devi Institute of Technology, Mangalore, Karnataka, India ABSTRACT: Flow analysis of the internet

### Understanding OpenFlow

Understanding OpenFlow Technical Whitepaper June, 2014 Saurabh Kumar Agarwal Email: saurabh29july@gmail.com Abstract Technical overview of OpenFlow Switch Specification, Version 1.0.0, published on December

### 5 Performance Management for Web Services. Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology. stadler@ee.kth.

5 Performance Management for Web Services Rolf Stadler School of Electrical Engineering KTH Royal Institute of Technology stadler@ee.kth.se April 2008 Overview Service Management Performance Mgt QoS Mgt

### Quantifying the Performance Degradation of IPv6 for TCP in Windows and Linux Networking

Quantifying the Performance Degradation of IPv6 for TCP in Windows and Linux Networking Burjiz Soorty School of Computing and Mathematical Sciences Auckland University of Technology Auckland, New Zealand

### OPENFLOW-BASED LOAD BALANCING GONE WILD

OPENFLOW-BASED LOAD BALANCING GONE WILD RICHARD WANG MASTER S THESIS IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE MASTER OF SCIENCE IN ENGINEERING DEPARTMENT OF COMPUTER SCIENCE PRINCETON UNIVERSITY

### CH.1. Lecture # 2. Computer Networks and the Internet. Eng. Wafaa Audah. Islamic University of Gaza. Faculty of Engineering

Islamic University of Gaza Faculty of Engineering Computer Engineering Department Networks Discussion ECOM 4021 Lecture # 2 CH1 Computer Networks and the Internet By Feb 2013 (Theoretical material: page

### An Intelligent Framework for Vehicular Ad-hoc Networks using SDN Architecture

435 An Intelligent Framework for Vehicular Ad-hoc Networks using SDN Architecture Balamurugan.V School of Computing Science and Engineering, VIT University Chennai Campus, 600127, Tamilnadu, India. Abstract

### Software Defined Networking What is it, how does it work, and what is it good for?

Software Defined Networking What is it, how does it work, and what is it good for? Many slides stolen from Jennifer Rexford, Nick McKeown, Scott Shenker, Teemu Koponen, Yotam Harchol and David Hay Agenda

### QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES

QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering

### Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks ABSTRACT:

Using Fuzzy Logic Control to Provide Intelligent Traffic Management Service for High-Speed Networks ABSTRACT: In view of the fast-growing Internet traffic, this paper propose a distributed traffic management

### Application Performance Analysis and Troubleshooting

Exam : 1T6-520 Title : Application Performance Analysis and Troubleshooting Version : DEMO 1 / 6 1. When optimizing application efficiency, an improvement in efficiency from the current 90% to an efficiency

### PERFORMANCE ANALYSIS OF VOIP TRAFFIC OVER INTEGRATING WIRELESS LAN AND WAN USING DIFFERENT CODECS

PERFORMANCE ANALYSIS OF VOIP TRAFFIC OVER INTEGRATING WIRELESS LAN AND WAN USING DIFFERENT CODECS Ali M. Alsahlany 1 1 Department of Communication Engineering, Al-Najaf Technical College, Foundation of

### SOFTWARE-DEFINED NETWORKING AND OPENFLOW

SOFTWARE-DEFINED NETWORKING AND OPENFLOW Freddie Örnebjär TREX Workshop 2012 2012 Brocade Communications Systems, Inc. 2012/09/14 Software-Defined Networking (SDN): Fundamental Control

### Limitations of Current Networking Architecture OpenFlow Architecture

CECS 572 Student Name Monday/Wednesday 5:00 PM Dr. Tracy Bradley Maples OpenFlow OpenFlow is the first open standard communications interface that enables Software Defined Networking (SDN) [6]. It was

### Testing Software Defined Network (SDN) For Data Center and Cloud VERYX TECHNOLOGIES

Testing Software Defined Network (SDN) For Data Center and Cloud VERYX TECHNOLOGIES Table of Contents Introduction... 1 SDN - An Overview... 2 SDN: Solution Layers and its Key Requirements to be validated...

### Disaster-Resilient Backbone and Access Networks

The Workshop on Establishing Resilient Life-Space in the Cyber-Physical Integrated Society, March. 17, 2015, Sendai, Japan Disaster-Resilient Backbone and Access Networks Shigeki Yamada (shigeki@nii.ac.jp)

### Towards Load Balancing in SDN Networks During DDoS attacks

Towards Load Balancing in SDN Networks During DDoS attacks Mikhail Belyaev St.Petersburg Polytechnic University Svetlana Gaivoronski Moscow State University ARCCN DDoS - attacks DDoS attack distributed

### Restorable Logical Topology using Cross-Layer Optimization

פרויקטים בתקשורת מחשבים - 236340 - סמסטר אביב 2016 Restorable Logical Topology using Cross-Layer Optimization Abstract: Today s communication networks consist of routers and optical switches in a logical

### Network performance in virtual infrastructures

Network performance in virtual infrastructures A closer look at Amazon EC2 Alexandru-Dorin GIURGIU University of Amsterdam System and Network Engineering Master 03 February 2010 Coordinators: Paola Grosso

### POX CONTROLLER PERFORMANCE FOR OPENFLOW NETWORKS. Selçuk Yazar, Erdem Uçar POX CONTROLLER ЗА OPENFLOW ПЛАТФОРМА. Селчук Язар, Ердем Учар

УПРАВЛЕНИЕ И ОБРАЗОВАНИЕ MANAGEMENT AND EDUCATION TOM IX (6) 2013 VOL. IX (6) 2013 POX CONTROLLER PERFORMANCE FOR OPENFLOW NETWORKS Selçuk Yazar, Erdem Uçar POX CONTROLLER ЗА OPENFLOW ПЛАТФОРМА Селчук

### Analysis of QoS Routing Approach and the starvation`s evaluation in LAN

www.ijcsi.org 360 Analysis of QoS Routing Approach and the starvation`s evaluation in LAN 1 st Ariana Bejleri Polytechnic University of Tirana, Faculty of Information Technology, Computer Engineering Department,

### International Journal of Software and Web Sciences (IJSWS) Comparative Performance Analysis of MPLS Network & IP Network

International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

### Modeling and Simulation of Queuing Scheduling Disciplines on Packet Delivery for Next Generation Internet Streaming Applications

Modeling and Simulation of Queuing Scheduling Disciplines on Packet Delivery for Next Generation Internet Streaming Applications Sarhan M. Musa Mahamadou Tembely Matthew N. O. Sadiku Pamela H. Obiomon

### Outline. Institute of Computer and Communication Network Engineering. Institute of Computer and Communication Network Engineering

Institute of Computer and Communication Network Engineering Institute of Computer and Communication Network Engineering Communication Networks Software Defined Networking (SDN) Prof. Dr. Admela Jukan Dr.

### Quality of Service using Traffic Engineering over MPLS: An Analysis. Praveen Bhaniramka, Wei Sun, Raj Jain

Praveen Bhaniramka, Wei Sun, Raj Jain Department of Computer and Information Science The Ohio State University 201 Neil Ave, DL39 Columbus, OH 43210 USA Telephone Number: +1 614-292-3989 FAX number: +1

### A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks

A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.

### CS 91: Cloud Systems & Datacenter Networks Networks Background

CS 91: Cloud Systems & Datacenter Networks Networks Background Walrus / Bucket Agenda Overview of tradibonal network topologies IntroducBon to soeware- defined networks Layering and terminology Topology

### Fuzzy Active Queue Management for Assured Forwarding Traffic in Differentiated Services Network

Fuzzy Active Management for Assured Forwarding Traffic in Differentiated Services Network E.S. Ng, K.K. Phang, T.C. Ling, L.Y. Por Department of Computer Systems & Technology Faculty of Computer Science

### AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK

Abstract AN OVERVIEW OF QUALITY OF SERVICE COMPUTER NETWORK Mrs. Amandeep Kaur, Assistant Professor, Department of Computer Application, Apeejay Institute of Management, Ramamandi, Jalandhar-144001, Punjab,

### 48 0890-8044/15/\$25.00 2015 IEEE

An Extended SDN Architecture for Network Function Virtualization with a Case Study on Intrusion Prevention Ying-Dar Lin, Po-Ching Lin, Chih-Hung Yeh, Yao-Chun Wang, and Yuan-Cheng Lai Abstract In conventional

### Data Center Network Structure using Hybrid Optoelectronic Routers

Data Center Network Structure using Hybrid Optoelectronic Routers Yuichi Ohsita, and Masayuki Murata Graduate School of Information Science and Technology, Osaka University Osaka, Japan {y-ohsita, murata}@ist.osaka-u.ac.jp

### Xperience of Programmable Network with OpenFlow

International Journal of Computer Theory and Engineering, Vol. 5, No. 2, April 2013 Xperience of Programmable Network with OpenFlow Hasnat Ahmed, Irshad, Muhammad Asif Razzaq, and Adeel Baig each one is

### Performance Monitoring on Networked Virtual Environments

Performance Monitoring on Networked Virtual Environments C. Bouras 1, 2, E. Giannaka 1, 2 Abstract As networked virtual environments gain increasing interest and acceptance in the field of Internet applications,

### Computer Network. Interconnected collection of autonomous computers that are able to exchange information

Introduction Computer Network. Interconnected collection of autonomous computers that are able to exchange information No master/slave relationship between the computers in the network Data Communications.

### A Network Control Plane for Massive Video Delivery

A Network Control Plane for Massive Video Delivery Giuseppe Cofano Politecnico di Bari, Dipartimento di Ingegneria Elettrica e dell Informazione, Via E. Orabona 4 70125 Bari, Italy - giuseppe.cofano@poliba.it

### Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc

(International Journal of Computer Science & Management Studies) Vol. 17, Issue 01 Performance Evaluation of AODV, OLSR Routing Protocol in VOIP Over Ad Hoc Dr. Khalid Hamid Bilal Khartoum, Sudan dr.khalidbilal@hotmail.com

### HAVEN: Holistic Load Balancing and Auto Scaling in the Cloud

HAVEN: Holistic Load Balancing and Auto Scaling in the Cloud Rishabh Poddar IBM Research rishabh.poddar@in.ibm.com Anilkumar Vishnoi IBM Research vishnoianil@gmail.com Vijay Mann IBM Research vijay.mann@in.ibm.com

### A Complex Network Structure Design for Load Balancing and Redundant

A Complex Network Structure Design for Load Balancing and Redundant Fengming M. Chang Department of Industrial Engineering and Management Tungfang Institute of Technology, Kaohsiung, Taiwan data@nckualumni.org.tw

### Concepts and Mechanisms for Consistent Route Transitions in Software-defined Networks

Institute of Parallel and Distributed Systems Department Distributed Systems University of Stuttgart Universitätsstraße 38 D-70569 Stuttgart Studienarbeit Nr. 2408 Concepts and Mechanisms for Consistent

### Internet Firewall CSIS 4222. Packet Filtering. Internet Firewall. Examples. Spring 2011 CSIS 4222. net15 1. Routers can implement packet filtering

Internet Firewall CSIS 4222 A combination of hardware and software that isolates an organization s internal network from the Internet at large Ch 27: Internet Routing Ch 30: Packet filtering & firewalls

### DEMYSTIFYING ROUTING SERVICES IN SOFTWAREDEFINED NETWORKING

DEMYSTIFYING ROUTING SERVICES IN STWAREDEFINED NETWORKING GAUTAM KHETRAPAL Engineering Project Manager, Aricent SAURABH KUMAR SHARMA Principal Systems Engineer, Technology, Aricent DEMYSTIFYING ROUTING

### Modelling of OpenFlow Controllers with Alloy: A Load-Balancing Protocol

Modelling of OpenFlow Controllers with Alloy: A Load-Balancing Protocol Spring 13 Semester Project for CS512: Formal Methods Charalampos Mavroforakis Dimitris Papadopoulos 1 Introduction OpenFlow is a

### Stability of QOS. Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu

Stability of QOS Avinash Varadarajan, Subhransu Maji {avinash,smaji}@cs.berkeley.edu Abstract Given a choice between two services, rest of the things being equal, it is natural to prefer the one with more

### G.Vijaya kumar et al, Int. J. Comp. Tech. Appl., Vol 2 (5), 1413-1418

An Analytical Model to evaluate the Approaches of Mobility Management 1 G.Vijaya Kumar, *2 A.Lakshman Rao *1 M.Tech (CSE Student), Pragati Engineering College, Kakinada, India. Vijay9908914010@gmail.com

### Enabling Software Defined Networking using OpenFlow

Enabling Software Defined Networking using OpenFlow 1 Karamjeet Kaur, 2 Sukhveer Kaur, 3 Vipin Gupta 1,2 SBS State Technical Campus Ferozepur, 3 U-Net Solutions Moga Abstract Software Defined Networking

### CHAPTER 6. VOICE COMMUNICATION OVER HYBRID MANETs

CHAPTER 6 VOICE COMMUNICATION OVER HYBRID MANETs Multimedia real-time session services such as voice and videoconferencing with Quality of Service support is challenging task on Mobile Ad hoc Network (MANETs).

### VoIP Performance Over different service Classes Under Various Scheduling Techniques

Australian Journal of Basic and Applied Sciences, 5(11): 1416-1422-CC, 211 ISSN 1991-8178 VoIP Performance Over different service Classes Under Various Scheduling Techniques Ahmad Karim Bahauddin Zakariya

### High-Performance IP Service Node with Layer 4 to 7 Packet Processing Features

UDC 621.395.31:681.3 High-Performance IP Service Node with Layer 4 to 7 Packet Processing Features VTsuneo Katsuyama VAkira Hakata VMasafumi Katoh VAkira Takeyama (Manuscript received February 27, 2001)