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

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.

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 280
Author(s):  
Junjie Geng ◽  
Jinyao Yan ◽  
Yuan Zhang

Modern data centers aim to offer very high throughput and ultra-low latency to meet the demands of applications such as online intensive services. Traditional TCP/IP stacks cannot meet these requirements due to their high CPU overhead and high-latency. Remote Direct Memory Access (RDMA) is an approach that can be designed to meet this demand. The mainstream transport protocol of RDMA over Ethernet is RoCE (RDMA over Converged Ethernet), which relies on Priority Flow Control (PFC) within the network to enable a lossless network. However, PFC is a coarse-grained protocol which can lead to problems such as congestion spreading, head-of-the-line blocking. A congestion control protocol that can alleviate these problems of PFC is needed. We propose a protocol, called P4QCN for this purpose. P4QCN is a congestion control scheme for RoCE and it is an improved Quantized Congestion Notification (QCN) design based on P4, which is a flow-level, rate-based congestion control mechanism. P4QCN extends the QCN protocol to make it compatible with IP-routed networks based on a framework of P4 and adopts a two-point algorithm architecture which is more effective than the three-point architecture used in QCN and Data Center QCN(DCQCN). Experiments show that our proposed P4QCN algorithm achieves the expected performance in terms of latency and throughput.


2016 ◽  
Vol E99.B (11) ◽  
pp. 2361-2372 ◽  
Author(s):  
Chang RUAN ◽  
Jianxin WANG ◽  
Jiawei HUANG ◽  
Wanchun JIANG

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1774
Author(s):  
Ming-Chin Chuang ◽  
Chia-Cheng Yen ◽  
Chia-Jui Hung

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.


Author(s):  
Tariq Emad Ali ◽  
Ameer Hussein Morad ◽  
Mohammed A. Abdala

<span>In the last two decades, networks had been changed according to the rapid changing in its requirements.  The current Data Center Networks have large number of hosts (tens or thousands) with special needs of bandwidth as the cloud network and the multimedia content computing is increased. The conventional Data Center Networks (DCNs) are highlighted by the increased number of users and bandwidth requirements which in turn have many implementation limitations.  The current networking devices with its control and forwarding planes coupling result in network architectures are not suitable for dynamic computing and storage needs.  Software Defined networking (SDN) is introduced to change this notion of traditional networks by decoupling control and forwarding planes. So, due to the rapid increase in the number of applications, websites, storage space, and some of the network resources are being underutilized due to static routing mechanisms. To overcome these limitations, a Software Defined Network based Openflow Data Center network architecture is used to obtain better performance parameters and implementing traffic load balancing function. The load balancing distributes the traffic requests over the connected servers, to diminish network congestions, and reduce underutilization problem of servers. As a result, SDN is developed to afford more effective configuration, enhanced performance, and more flexibility to deal with huge network designs</span>


Author(s):  
Chengxi Gao ◽  
Shuhui Chu ◽  
Hong Xu ◽  
Minxian Xu ◽  
Kejiang Ye ◽  
...  

Author(s):  
Muhammad Ishaq ◽  
Mohammad Kaleem ◽  
Numan Kifayat

This chapter briefly introduces the data center network and reviews the challenges for future intra-data-center networks in terms of scalability, cost effectiveness, power efficiency, upgrade cost, and bandwidth utilization. Current data center network architecture is discussed in detail and the drawbacks are pointed out in terms of the above-mentioned parameters. A detailed background is provided that how the technology moved from opaque to transparent optical networks. Additionally, it includes different data center network architectures proposed so far by different researchers/team/companies in order to address the current problems and meet the demands of future intra-data-center networks.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 31782-31790 ◽  
Author(s):  
Jin Ye ◽  
Luting Feng ◽  
Ziqi Xie ◽  
Jiawei Huang ◽  
Xiaohuan Li

Sign in / Sign up

Export Citation Format

Share Document