Sonum: Software-Defined Synergetic Sampling Approach and Optimal Network Utilization Mechanism for Long Flow in a Data Center Network

Long flow detection and load balancing are crucial techniques for data center running and management. However, both of them have been independently studied in previous studies. In this paper, we propose a complete solution called Sonum, which can complete long flow detection and scheduling at the same time. Sonum consists of a software-defined synergetic sampling approach and an optimal network utilization mechanism. Sonum detects long flows through consolidating and processing sampling information from multiple switches. Compared with the existing prime solution, the missed detection rate of Sonum is reduced by 2.3%–5.1%. After obtaining the long flow information, Sonum minimizes the potential packet loss rate as the optimization target and then translates load balancing into an optimization problem of arranging a minimum packet loss path for long flows. This paper also introduces a heuristic algorithm for solving this optimization problem. The experimental results show that Sonum outperforms ECMP and Hedera in terms of network throughput and flow completion time.

Download Full-text

Sonum: Software-Defined Optimal Network Utilization Mechanism for Long Flow Scheduling in Data Center Networks

2019 International Conference on Networking and Network Applications (NaNA) ◽

10.1109/nana.2019.00035 ◽

2019 ◽

Author(s):

Kun Yu ◽

Li-zhuang Tan ◽

Xiao-jin Wu ◽

Wei Su

Keyword(s):

Data Center ◽

Data Center Networks ◽

Network Utilization ◽

Optimal Network

Download Full-text

Virtualized Fog Network with Load Balancing for IoT based Fog-to-Cloud

JOIV International Journal on Informatics Visualization ◽

10.30630/joiv.4.3.374 ◽

2020 ◽

Vol 4 (3) ◽

Author(s):

Istabraq M. Al-Joboury ◽

Emad H. Al-Hemiary

Keyword(s):

Load Balancing ◽

Packet Loss ◽

Fog Computing ◽

Transport Protocol ◽

Network Simulator ◽

Huge Number ◽

Message Queue ◽

Limited Bandwidth ◽

Cloud Architecture ◽

Fog Network

Fog Computing is a new concept made by Cisco to provide same functionalities of Cloud Computing but near to Things to enhance performance such as reduce delay and response time. Packet loss may occur on single Fog server over a huge number of messages from Things because of several factors like limited bandwidth and capacity of queues in server. In this paper, Internet of Things based Fog-to-Cloud architecture is proposed to solve the problem of packet loss on Fog server using Load Balancing and virtualization. The architecture consists of 5 layers, namely: Things, gateway, Fog, Cloud, and application. Fog layer is virtualized to specified number of Fog servers using Graphical Network Simulator-3 and VirtualBox on local physical server. Server Load Balancing router is configured to distribute the huge traffic in Weighted Round Robin technique using Message Queue Telemetry Transport protocol. Then, maximum message from Fog layer are selected and sent to Cloud layer and the rest of messages are deleted within 1 hour using our proposed Data-in-Motion technique for storage, processing, and monitoring of messages. Thus, improving the performance of the Fog layer for storage and processing of messages, as well as reducing the packet loss to half and increasing throughput to 4 times than using single Fog server.

Download Full-text

HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

Journal of Cloud Computing Advances Systems and Applications ◽

10.1186/s13677-021-00248-4 ◽

2021 ◽

Vol 10 (1) ◽

Author(s):

Jiawei Huang ◽

Shiqi Wang ◽

Shuping Li ◽

Shaojun Zou ◽

Jinbin Hu ◽

...

Keyword(s):

Data Center ◽

Large Scale ◽

Network Performance ◽

Rooted Tree ◽

Heterogeneous Traffic ◽

Data Center Networks ◽

Packet Reordering ◽

Traffic Characteristics ◽

Network Utilization ◽

The Impact

AbstractModern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical to achieve low latency and high throughput. Although the per-packet schemes such as Random Packet Spraying (RPS) can achieve high network utilization and near-optimal tail latency in symmetric topologies, they are prone to cause significant packet reordering and degrade the network performance. Moreover, some coding-based schemes are proposed to alleviate the problem of packet reordering and loss. Unfortunately, these schemes ignore the traffic characteristics of data center network and cannot achieve good network performance. In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC to eliminate the impact of packet reordering and improve the performance of short and long flows. HTPC smoothly adjusts the number of redundant packets based on the multi-path congestion information and the traffic characteristics so that the tailing probability of short flows and the timeout probability of long flows can be reduced. Through a series of large-scale NS2 simulations, we demonstrate that HTPC reduces average flow completion time by up to 60% compared with the state-of-the-art mechanisms.

Download Full-text

Efficient Placement of Service Function Chains in Cloud Computing Environments

Electronics ◽

10.3390/electronics10030323 ◽

2021 ◽

Vol 10 (3) ◽

pp. 323

Author(s):

Marwa A. Abdelaal ◽

Gamal A. Ebrahim ◽

Wagdy R. Anis

Keyword(s):

Energy Consumption ◽

Load Balancing ◽

Response Time ◽

Optimization Problem ◽

Service Providers ◽

Virtual Network ◽

Placement Problem ◽

Service Function ◽

Network Functions ◽

Bandwidth Consumption

The widespread adoption of network function virtualization (NFV) leads to providing network services through a chain of virtual network functions (VNFs). This architecture is called service function chain (SFC), which can be hosted on top of commodity servers and switches located at the cloud. Meanwhile, software-defined networking (SDN) can be utilized to manage VNFs to handle traffic flows through SFC. One of the most critical issues that needs to be addressed in NFV is VNF placement that optimizes physical link bandwidth consumption. Moreover, deploying SFCs enables service providers to consider different goals, such as minimizing the overall cost and service response time. In this paper, a novel approach for the VNF placement problem for SFCs, called virtual network functions and their replica placement (VNFRP), is introduced. It tries to achieve load balancing over the core links while considering multiple resource constraints. Hence, the VNF placement problem is first formulated as an integer linear programming (ILP) optimization problem, aiming to minimize link bandwidth consumption, energy consumption, and SFC placement cost. Then, a heuristic algorithm is proposed to find a near-optimal solution for this optimization problem. Simulation studies are conducted to evaluate the performance of the proposed approach. The simulation results show that VNFRP can significantly improve load balancing by 80% when the number of replicas is increased. Additionally, VNFRP provides more than a 54% reduction in network energy consumption. Furthermore, it can efficiently reduce the SFC placement cost by more than 67%. Moreover, with the advantages of a fast response time and rapid convergence, VNFRP can be considered as a scalable solution for large networking environments.

Download Full-text