scholarly journals Class-based Flow Scheduling Framework in SDN-based Data Center Networks

2020 ◽  
Author(s):  
Maiass Zaher ◽  
Aymen Alawadi ◽  
Sandor Molnar
Keyword(s):  
Quality Of Service ◽  
Data Center ◽  
Completion Time ◽  
Emerging Technologies ◽  
Control Plane ◽  
Traffic Patterns ◽  
Data Center Networks ◽  
Available Bandwidth

The emerging technologies leveraging Data Center Networks (DCN) and their consequent traffic patterns impose more necessity for improving Quality of Service (QoS). In this paper, we propose Sieve, a new distributed SDN framework that efficiently schedules flows based on the available bandwidth to improve Flow Completion Time (FCT) of mice flows. In addition, we propose a lightweight sampling mechanism to sample a portion of flows. In particular, Sieve schedules the sampled flows, and it reschedules only elephant flows upon threshold hits. Furthermore, our framework allocates a portion of the flows to ECMP, so that the associated overhead can be mitigated in the control plane and ECMP-related packet collisions are fewer as well. Mininet has been used to evaluate the proposed solution, and Sieve provides better FCT up to 50% in comparison to the existing solutions like ECMP and Hedera.

scholarly journals Class-based Flow Scheduling Framework in SDN-based Data Center Networks

2020 ◽  
Author(s):  
Maiass Zaher ◽  
Aymen Alawadi ◽  
Sandor Molnar
Keyword(s):  
Quality Of Service ◽  
Data Center ◽  
Completion Time ◽  
Emerging Technologies ◽  
Control Plane ◽  
Traffic Patterns ◽  
Data Center Networks ◽  
Available Bandwidth

The emerging technologies leveraging Data Center Networks (DCN) and their consequent traffic patterns impose more necessity for improving Quality of Service (QoS). In this paper, we propose Sieve, a new distributed SDN framework that efficiently schedules flows based on the available bandwidth to improve Flow Completion Time (FCT) of mice flows. In addition, we propose a lightweight sampling mechanism to sample a portion of flows. In particular, Sieve schedules the sampled flows, and it reschedules only elephant flows upon threshold hits. Furthermore, our framework allocates a portion of the flows to ECMP, so that the associated overhead can be mitigated in the control plane and ECMP-related packet collisions are fewer as well. Mininet has been used to evaluate the proposed solution, and Sieve provides better FCT up to 50% in comparison to the existing solutions like ECMP and Hedera.

AggreFlow: Achieving Power Efficiency, Load Balancing, and Quality of Service in Data Center Networks

2020 ◽  
pp. 1-17
Author(s):  
Zehua Guo ◽  
Yang Xu ◽  
Ya-Feng Liu ◽  
Sen Liu ◽  
H. Jonathan Chao ◽  
...  
Keyword(s):  
Quality Of Service ◽  
Load Balancing ◽  
Data Center ◽  
Power Efficiency ◽  
Data Center Networks

scholarly journals Energy Optimization for Software-Defined Data Center Networks Based on Flow Allocation Strategies

Electronics ◽  
2019 ◽  
Vol 8 (9) ◽  
pp. 1014 ◽  
Author(s):  
Zebin Lu ◽  
Junru Lei ◽  
Yihao He ◽  
Zhengfa Li ◽  
Shuhua Deng ◽  
...  
Keyword(s):  
Quality Of Service ◽  
Energy Consumption ◽  
Data Center ◽  
Energy Savings ◽  
Minimum Energy ◽  
Energy Optimization ◽  
Traffic Load ◽  
Data Center Networks ◽  
Energy Consumption Optimization

Nowadays, energy consumption has become an important issue in data center networks. The most promising energy-saving schemes are those that shut down unnecessary network devices and links while meeting the demand of traffic loads. Existing research mainly focuses on the strategies of energy savings in software-defined data center networks (SD-DCN). Few studies have considered both energy savings and the quality of service (QoS) of the traffic load. In this paper, we investigate the energy savings guaranteed by traffic load satisfaction ratio. To ensure the minimum-power consumption in data centers, we formulate the SD-DCN energy consumption optimization problem as an Integer Linear Programming model. To achieve a high success rate for traffic transmission, we propose three flow scheduling strategies. On this foundation, we propose a strategy-based Minimum Energy Consumption (MEC) heuristic algorithm to ensure the QoS satisfaction ratio in the process of energy optimization. The results show that our algorithm can save energy efficiently under the conditions of low traffic load and medium traffic load. Under high traffic load, our algorithm can achieve better network performance than existing solutions in terms of quality of service satisfaction ratio of flow allocation.

scholarly journals Bandwidth-Aware Rescheduling Mechanism in SDN-Based Data Center Networks

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1774
Author(s):  
Ming-Chin Chuang ◽  
Chia-Cheng Yen ◽  
Chia-Jui Hung
Keyword(s):  
Data Center ◽  
Completion Time ◽  
Network Performance ◽  
Data Locality ◽  
Task Completion ◽  
Data Center Networks ◽  
Task Completion Time ◽  
Data Packets ◽  
Network Bandwidth ◽  
Data Process

Recently, with the increase in network bandwidth, various cloud computing applications have become popular. A large number of network data packets will be generated in such a network. However, most existing network architectures cannot effectively handle big data, thereby necessitating an efficient mechanism to reduce task completion time when large amounts of data are processed in data center networks. Unfortunately, achieving the minimum task completion time in the Hadoop system is an NP-complete problem. Although many studies have proposed schemes for improving network performance, they have shortcomings that degrade their performance. For this reason, in this study, we propose a centralized solution, called the bandwidth-aware rescheduling (BARE) mechanism for software-defined network (SDN)-based data center networks. BARE improves network performance by employing a prefetching mechanism and a centralized network monitor to collect global information, sorting out the locality data process, splitting tasks, and executing a rescheduling mechanism with a scheduler to reduce task completion time. Finally, we used simulations to demonstrate our scheme’s effectiveness. Simulation results show that our scheme outperforms other existing schemes in terms of task completion time and the ratio of data locality.

scholarly journals Efficient Online Scheduling of Electric Vehicle Charging Using a Service-Price Menu

2021 ◽  
Author(s):  
Angeliki Mathioudaki ◽  
Georgios Tsaousoglou ◽  
Emmanouel varvarigos ◽  
Dimitris Fotakis
Keyword(s):  
Quality Of Service ◽  
Electric Vehicles ◽  
Completion Time ◽  
Online Algorithm ◽  
Charging Station ◽  
Electric Vehicle Charging ◽  
Guaranteed Quality ◽  
Time Minimization ◽  
Weighted Completion Time

We present an online algorithm for scheduling the charging of Electric Vehicles (EVs) in a Charging Station, aiming to optimize the overall quality of service through sum of weighted completion time minimization. Upon arrival of each EV, the algorithm generates a menu of service-price options. By letting the EV users pick their most preferable option, the algorithm offers guaranteed quality of service, achieves near optimal performance, and prevents the users from acting strategically.

scholarly journals Buffer Occupancy-Based Transport to Reduce Flow Completion Time of Short Flows in Data Center Networks

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 646 ◽  
Author(s):  
Hasnain Ahmed ◽  
Muhammad Junaid Arshad
Keyword(s):  
Congestion Control ◽  
Data Center ◽  
Completion Time ◽  
Current Data ◽  
Transport Protocol ◽  
Transport Protocols ◽  
Data Center Networks ◽  
Buffer Occupancy ◽  
Control Scheme ◽  
Precise Measure

Today’s data centers host a variety of different applications that impose specific requirements for their flows. Applications that generate short flows are usually latency sensitive; they require their flows to be completed as fast as possible. Short flows suffer to quickly increase their sending rate due to the existing long flows occupying most of the available capacity. This problem is caused due to the slow convergence of the current data center transport protocols. In this paper, we present a buffer occupancy-based transport protocol (BOTCP) to reduce flow completion time of short flows. BOTCP consists of two parts: (i) A novel buffer occupancy-based congestion signal, and (ii) a congestion control scheme that uses the congestion signal to reduce flow completion time of short flows. The proposed buffer occupancy-based congestion signal gives a precise measure of congestion. The congestion control scheme makes a differentiated treatment of short and long flows to reduce flow completion time of short flows. The results show that BOTCP significantly improves flow completion time of short flows over the existing transport protocols in data center networks.

scholarly journals Analisis Perbandingan Quality Of Service (Qos) Pada Performa Bandwidth Jaringan Dengan Metode Hierarchical Token Bucket (Htb) Dan Per Connection Queque (Pcq).

Respati ◽  
2020 ◽  
Vol 15 (3) ◽  
pp. 24
Author(s):  
Adytia A. Tambunan ◽  
Lukman Lukman
Keyword(s):  
Quality Of Service ◽  
Large Scale ◽  
Improve Quality ◽  
Bandwidth Management ◽  
Available Bandwidth ◽  
Service Parameter ◽  
Token Bucket ◽  
Large Scale Networks ◽  
Network Administrators

INTISARIQuality of Service (QoS) adalah cara cerdas untuk mengalokasikan bandwidth yang tersedia. Penggunaan manajemen bandwidth sebagai parameter Quality of Service tidak hanya membatasi tetapi menjaga kualitas bandwidth, sehingga semua pengguna yang terhubung dalam satu jaringan mendapatkan kualitas internet yang merata dan stabil. Ada beberapa cara untuk mengaplikasikan bandwidth managemen untuk meningkatkan Quality of Service, salah satunya yakni menggunakan mikrotik.Ada banyak metode manajemen   bandwidth yang dapat digunakan atau diterapkan pada jaringan yang menggunakan router mikrotik. Adapun yang paling sering digunakan dalam jaringan berskala menengah atau pun besar seperti metode Hierarchical Token Bucket (HTB) dan Per Connection Queue (PCQ).Penelitian ini akan melakukan analisis variabel Quality of Service (QoS) terhadap performa bandwidth dengan membandingkan dua metode antrian yaitu metode Hierarchical Token Bucket (HTB) dan metode Per Connection Queue (PCQ).  Penelitian dilakukan untuk mengetahui metode manakah lebih baik untuk di implementasikan oleh administrator jaringan agar efesien dan tepat untuk digunakan.Kata kunci: Manajemen Bandwidth, QOS, PCQ, HTB, Mikrotik. ABSTRACTQuality of Service (QoS) is a smart way to allocate available bandwidth. The use of bandwidth management as a Quality of Service parameter not only limits but maintains bandwidth quality, so that all users connected in one network get an even and stable internet quality. There are several ways to apply bandwidth management to improve Quality of Service, one of which is using a proxy.There are many bandwidth management methods that can be used or applied to networks that use a proxy router. As for what is most often used in medium or large scale networks such as the Hierarchical Token Bucket (HTB) and Per Connection Queue (PCQ) methods.This study will analyze the Quality of Service (QoS) variable on bandwidth performance by comparing two queuing methods, namely the Hierarchical Token Bucket (HTB) method and the Per Connection Queue (PCQ) method. The study was conducted to determine which method is better for network administrators to implement in order to be efficient and appropriate to use.Keywords: Bandwidth Management, QOS, PCQ, HTB, Mikrotik.

Sign in / Sign up

Export Citation Format

Share Document