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 Estimation of the ABW for Mobile Broadband over SDN using SFC-Constrained Shortest Path Algorithm

2019 ◽  
Vol 9 (1) ◽  
pp. 4282-4286
Keyword(s):  
Network Performance ◽  
Computer Network ◽  
Convergence Time ◽  
Software Defined Network ◽  
Bandwidth Utilization ◽  
Mobile Broadband ◽  
Novel Approach ◽  
Shortest Distance ◽  
Wide Range ◽  
Network Transformation

Software-Defined Networking (SDN) is an evolving algorithm which is depended upon the computer network transformation. In SDN, Bandwidth Utilization is a critical aspect to enhance network performance. To obtain the accessible bandwidth for the Mobile Broadband over SDN and in sequence enhance the accessible Mobile Broadband is the main objective. A significant characteristic is ABW (ABW), having a robust influence on a wide range of applications. However, this metric is very complex to estimate using traditional or conventional methodologies. The Traditional Bandwidth Estimation Technique has limited accuracy along with huge convergence time. The Estimation Time cannot be predicted as it depends on the existence of appropriate traffic produced through any thirdparty applications. 50% of Systematic Errors are not uncommon. In order to overcome the above-mentioned issues, in this paper, a novel approach is introduced for the estimation of ABW over SDN using three different scenarios. In which, SFC constraint shortest distance algorithm is employed for solving the classical max-flow issue that occurs in multiple scenarios while evaluating the ABW. The experiment result is carried out using Mininet testbed for network emulation and Floodlight as an SDN controller. Some of the interesting cases are considered, and the ABW is measured for the proposed software-defined network and compared with the existing traditional network and existing software-defined network

scholarly journals LSEA: Software-Defined Networking-Based QoS-Aware Routing Mechanism for Live-Soccer Event Applications in Smart Cities

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Yingcheng Zhang ◽  
Gang Zhao
Keyword(s):  
Network Performance ◽  
Smart Cities ◽  
Routing Algorithm ◽  
Software Defined Networking ◽  
Live Streaming ◽  
Streaming Applications ◽  
Delay Jitter ◽  
Building Process ◽  
Routing Mechanism

The smart cities provide a better connection between services and citizens based on new Internet technologies. During the building process of smart cities, some burgeoning applications have been emerging and changing the daily lifestyle of people, e.g., live streaming applications. Especially, the live-soccer event applications have attracted much attention and can improve people’s enjoyment of life to a great extent, such as the Europe five major league matches and FIFA world cup. For such applications, the traditional routing strategies cannot do Quality-of-Service (QoS) awareness, and thus, the network performance and the Quality of Experience (QoE) of users cannot be guaranteed. In this paper, we employ Software-Defined Networking (SDN) to make QoS awareness for the special live-soccer event applications, in which the QoS-aware routing mechanism is proposed, called LSEA. Meanwhile, delay, delay jitter, and packet loss rate are considered as three objects. On this basis, the improved Dijkstra routing algorithm and SDN-based disjoint routing algorithm are devised. Finally, the proposed LSEA is implemented over Mininet, and the experimental results demonstrate its feasibility and efficiency.

scholarly journals Label Stacking Scenarios in Hybrid Wavelength and Code-Switched GMPLS Networks

Electronics ◽  
2018 ◽  
Vol 7 (10) ◽  
pp. 251 ◽  
Author(s):  
Kai-Sheng Chen
Keyword(s):  
Wavelength Division Multiplexing ◽  
High Speed ◽  
Network Performance ◽  
Packet Switching ◽  
Routing Algorithm ◽  
Wavelength Assignment ◽  
Optical Packet Switching ◽  
Data Traffic ◽  
Wavelength Division ◽  
Increasing Demand

Multi-protocol label switching (MPLS) is a promising solution to implement high-speed internet protocol (IP) networks by reducing the layer number. To meet the increasing demand for data traffic, optical packet switching (OPS) is integrated under IP to provide high bandwidth to end users. Generalized MPLS (GMPLS) is perfectly compatible with the routing algorithm in IP/MPLS as it supports packet-switching functions. In this paper, we investigate the label stacking scenarios in GMPLS networks. In GMPLS, label stacking is done to reduce the node complexity by appending multiple labels to a single packet. Wavelength-division multiplexing (WDM) and optical code-division multiplexing (OCDM) signals have been widely used as identifying labels. As the labels can be permutated among the wavelengths or code dimensions, the structure of a label stack can be varied. However, studies on the relationship between label stacking scenarios and network performance are limited. To investigate this issue, we propose three label stacking models: sequential code distribution; sequential wavelength distribution, and random label distribution. The simulation results show that the sequential wavelength assignment, wherein the labels are uniformly distributed among the wavelengths, exhibits the best system performance in terms of the label-error rate (LER).

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 An Optimal Routing Algorithm in Service Customized 5G Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Haipeng Yao ◽  
Chao Fang ◽  
Yiru Guo ◽  
Chenglin Zhao
Keyword(s):  
Big Data ◽  
Network Architecture ◽  
Network Performance ◽  
Routing Algorithm ◽  
Optimal Routing ◽  
Cache Replacement ◽  
Data Traffic ◽  
Average Response ◽  
5G Networks ◽  
Content Centric Networking

With the widespread use of Internet, the scale of mobile data traffic grows explosively, which makes 5G networks in cellular networks become a growing concern. Recently, the ideas related to future network, for example, Software Defined Networking (SDN), Content-Centric Networking (CCN), and Big Data, have drawn more and more attention. In this paper, we propose a service-customized 5G network architecture by introducing the ideas of separation between control plane and data plane, in-network caching, and Big Data processing and analysis to resolve the problems traditional cellular radio networks face. Moreover, we design an optimal routing algorithm for this architecture, which can minimize average response hops in the network. Simulation results reveal that, by introducing the cache, the network performance can be obviously improved in different network conditions compared to the scenario without a cache. In addition, we explore the change of cache hit rate and average response hops under different cache replacement policies, cache sizes, content popularity, and network topologies, respectively.

A Optimization Traffic Grooming Algorithm Based on Bidirectional SONET Ring Topology Network

2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui
Keyword(s):  
Resource Utilization ◽  
Network Performance ◽  
Minimum Weight ◽  
Routing Algorithm ◽  
Traffic Grooming ◽  
Network Routing ◽  
Ring Network ◽  
Network Resource ◽  
Blocking Rate ◽  
The Impact

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

scholarly journals Performance evaluation of video streaming on LTE with coexistence of Wi-Fi signal

2019 ◽  
Vol 8 (3) ◽  
pp. 890-897
Author(s):  
Y. J. I. A. Yaqoob ◽  
W. L. Pang ◽  
S. K. Wong ◽  
K. Y. Chan
Keyword(s):  
Video Streaming ◽  
Network Performance ◽  
Software Radio ◽  
Radio Spectrum ◽  
Application Framework ◽  
Data Traffic ◽  
Continuous Growth ◽  
Lte Network ◽  
The Impact ◽  
Unlicensed Band

The continuous growth in mobile data traffic and limited license wireless spectrum have led to dramatically increase the demand of the radio spectrum. It is widespread the concern about the coexistence of long term evolution (LTE) and Wi-Fi in the unlicensed band. There are several techniques have been proposed to enable the coexistence of LTE and Wi-Fi in the unlicensed band, but these works are targeted on the impact of the LTE to the Wi-Fi network performance. An experiment is carried out in this work to evaluate the impact of Wi-Fi signal on the video streaming in the LTE network. The experimental test comprised of the national instrument (NI) universal software radio peripheral (USRP) 2953R that is controlled by the LabVIEW Communication LTE application framework. Extensiveexperiments are carried out under two scenarios, i.e. (1) Coexistence of LTE and Wi-Fi signal, (2) LTE signal only. Performance evaluations are carried out with different Modulation and coding schemes (MCS) values and different mode of operations, i.e. frequency division duplex (FDD) and time division duplex (TDD) mode. The results illustrated that the interference from Wi-Fi signal caused the performance degradation of the LTE network in throughput and the power received by user equipment (UE).

scholarly journals Antnet: A Robust Routing Algorithm for Data Networks

1970 ◽  
Vol 5 (1) ◽  
Author(s):  
Shariq Haseeb Khairul Azami Sidek Ahmad Faris Ismail, Lai W.K. ◽  
Aw Yit Mei
Keyword(s):  
Mobile Agents ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Convergence Time ◽  
Data Networks ◽  
Successful Implementation ◽  
Link State ◽  
Performance Matrix ◽  
Telecommunications Network ◽  
Routing Tables

Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth.  AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.Key Words: mobile agents, swarm intelligence, networks and constant bit rate

scholarly journals Social Distancing and the Internet: What Can Network Performance Measurements Tell Us?

2020 ◽  
Author(s):  
Jessica De Oliveira Moreira ◽  
Amey Pasarkar ◽  
Wenjun Chen ◽  
Wenkai Hu ◽  
Jan Janak ◽  
...  
Keyword(s):  
Network Performance ◽  
The Internet ◽  
Performance Measurements ◽  
Social Distancing
Sign in / Sign up

Export Citation Format

Share Document