Multi-path Allocation Scheduling Optimization Algorithm for Network Data Traffic Based on SDN Architecture

2020 ◽  
Vol 37 (4) ◽  
pp. 1237-1247
Author(s):  
Lihua Lu
Keyword(s):  
Scheduling Algorithm ◽  
Routing Algorithm ◽  
Network Data ◽  
Software Defined Network ◽  
Network Congestion ◽  
Data Traffic ◽  
Bandwidth Utilization ◽  
Traffic Scheduling ◽  
Load Balancing Algorithm ◽  
Scheduling Optimization Algorithm

Abstract The explosive growth of network data traffic puts new demands on traffic scheduling. In this paper, the scheduling algorithm based on the software-defined network (SDN) architecture is studied. Firstly, the SDN architecture was introduced, then an SDN-based adaptive multi-path load balancing algorithm was proposed and finally the algorithm was simulated on the Mininet simulation platform to compare the performance of the proposed algorithm and traditional equal-cost multi-path routing algorithm by using Ryu as the controller. It was found that the proposed algorithm had greater throughput, higher bandwidth utilization and shorter transmission time in allocation scheduling of network data traffic, which could effectively reduce network congestion and ensure the reliability of the network. This study verifies the effectiveness of the proposed method in allocation scheduling of network data traffic and provides some theoretical bases for the further application of the SDN architecture-based allocation scheduling algorithm.

scholarly journals Analisis Kinerja RouteFlow pada Jaringan SDN (Software Defined Network ) menggunakan Topologi Full-Mesh

2019 ◽  
Vol 7 (3) ◽  
pp. 585
Author(s):  
KUKUH NUGROHO ◽  
DHIMAS PRABOWO SETYANUGROHO
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Convergence Time ◽  
Software Defined Network ◽  
Data Traffic ◽  
Performance Measurements ◽  
Mesh Topology ◽  
Delay Jitter ◽  
Flow Table ◽  
Route Information

ABSTRAKPerangkat controller dalam jaringan SDN berfungsi untuk memberikan informasi tabel flow ke perangkat switch sebagai acuan dalam menentukan informasi rute. Kecepatan dalam memproses permintaan tabel flow yang dilakukan oleh perangkat switch tergantung dari pemilihan jenis controller yang digunakan. Terdapat beberapa jenis controller yang bisa digunakan untuk mengatur aliran trafik data dalam jaringan SDN. Pada penelitian ini akan digunakan jenis controller RouteFlow dengan menggunakan algoritma routing Djikstra. Jaringan uji menggunakan topologi Full-Mesh yang menyediakan koneksi penuh ke semua switch, dimana terdapat dua protokol layer transport yang digunakan untuk mengirimkan data dalam jaringan SDN yaitu TCP dan UDP. Hasil pengukuran kualitas jaringan menunjukkan bahwa penggunaan protokol UDP menghasilkan nilai delay, jitter, dan throughput yang lebih baik dibandingkan dengan TCP. Waktu konvergensi jaringan yang dihasilkan sebesar 12,18 ms ketika ukuran data yang dipertukarkan sebesar 64 Byte.Kata kunci: Controller, Full-Mesh, RouteFlow, Software Defined Network ABSTRACTThe controller device in the SDN network is applied to provide flow table information for all switches as a reference in determining route information. The speed in processing the flow table requests that are made by the switches depends on the choice of the type of controller used. There are several types of controllers that can be used to manage the data traffic flow in the SDN network. This research utilizes the RouteFlow controller and the Djikstra routing algorithm. The test network applies the Full-Mesh topology that provides fully connections to all switches, wherein two transport protocols are used to transmit data in SDN networks, i.e., TCP and UDP. The results of network performance measurements show that the use of the UDP obtains better values in delay, jitter, and throughput than TCP. The network convergence time is 12.18 ms when the size of data exchanged is set to 64 Bytes.Keywords: Controller, Full-Mesh, RouteFlow, Software Defined Network

scholarly journals An Efficient Framework to Improve QoS of CSP using Enhanced Minimal Resource Optimization based Scheduling Algorithm

2018 ◽  
Vol 12 (3) ◽  
pp. 1179
Author(s):  
Ravi Mahadevan ◽  
Neelamegam Anbazhagan
Keyword(s):  
Processing Time ◽  
Service Providers ◽  
Scheduling Algorithm ◽  
Cloud Service ◽  
Daily Basis ◽  
Resource Optimization ◽  
Cloud Environment ◽  
Bandwidth Utilization ◽  
Scheduling Policy ◽  
Minimal Resource

<span>Online Nowadays, the enterprises &amp; individuals are contributing their workloads on cloud service providers which are going to increase on daily basis. There are   large amount CSP are available to offer virtualized and dynamic resource on pay and use basis. However, there are almost CSP failed to maintain quality of service (QOS) and minimal resource optimization. Some of the existing approaches are highly dedicated on scheduling policy but, it does not considered reliable services with optimized QOS. To offer best solution of above problem, the framework proposes Enhanced Minimal Resource Optimization based Scheduling Algorithm to minimize the resources and maintain the QOS.  The method avoids delay in Request-Response model in cloud environment. To avoid overload for resource allocation, the proposed design utilized optimized scheduling policy.  Proposed mechanisms utilized optimized service brokering policy to reduce the delay response in cloud environment. The framework also help cloud user to prefer best CSP according to their prior services. The method offers rising trend of resource based structure to reduce the placement churn extensively. Proposed system utilized efficient scheduling policy to transmit data request to CSP with minimal data processing time. The entire utilization is to improve the QOS of cloud service provider in the features of multi-dimensional resource. Based on experimental evaluations, proposed technique improves the CPT (Computation Processing Time) 301.72 milliseconds, BU (Bandwidth Utilization) 20 Mbps, CPUU (CPU Utilization) 5% &amp; MRU (Memory Resource Utilization) 3% on given input parameters compare than existing methodology.</span>

A Novel Routing Network Algorithm Via Neutrosphic Fuzzy Set Approach

2021 ◽  
pp. 9-22
Author(s):  
S.Krishna Prabha ◽  
◽  
Broumi said ◽  
Selçuk Topal ◽  
◽  
...  
Keyword(s):  
Public Transportation ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Routing Algorithms ◽  
Network Data ◽  
Main Function ◽  
Network Nodes ◽  
Web Interfaces ◽  
Telephone Networks ◽  
Set Up

Routers steer and bid network data, through packets that hold a variety of categories of data such as records, messages, and effortless broadcasts like web interfaces. The procedure of choosing a passageway for traffic in a network or between several networks is called routing. Starting from telephone networks to public transportation the principles of routing are applied. Routing is the higher-level decision-making that directs network packets from their source en route for their destination through intermediate network nodes by specific packet forwarding mechanisms. The main function of the router is to set up optimized paths among the different nodes in the network. An efficient novel routing algorithm is proposed with the utilization of neutrosophic fuzzy logic in this work addition to many routing algorithms for finding the optimal path in the literature. In this approach, each router makes its own routing decision in the halting time. Various concepts like routing procedures, most expected vector, most expected object, and list of estimated delays are explained.

Energy-Efficient Virtualized Scheduling and Load Balancing Algorithm in Cloud Data Centers

2021 ◽  
Vol 11 (3) ◽  
pp. 34-48
Author(s):  
J. K. Jeevitha ◽  
Athisha G.
Keyword(s):  
Quality Of Service ◽  
Load Balancing ◽  
Energy Efficient ◽  
Data Centers ◽  
Scheduling Algorithm ◽  
Cloud Data ◽  
The Third ◽  
Cloud Data Centers ◽  
Load Balancing Algorithm

To scale back the energy consumption, this paper proposed three algorithms: The first one is identifying the load balancing factors and redistribute the load. The second one is finding out the most suitable server to assigning the task to the server, achieved by most efficient first fit algorithm (MEFFA), and the third algorithm is processing the task in the server in an efficient way by energy efficient virtual round robin (EEVRR) scheduling algorithm with FAT tree topology architecture. This EEVRR algorithm improves the quality of service via sending the task scheduling performance and cutting the delay in cloud data centers. It increases the energy efficiency by achieving the quality of service (QOS).

Sign in / Sign up

Export Citation Format

Share Document