scholarly journals HOLMES : Holistic Mice-Elephants Stochastic Scheduling in Data Center Networks

2018 ◽  
Author(s):  
Tingqiu Tim Yuan ◽  
Cong Xu ◽  
Tao Huang ◽  
Jian Li
Keyword(s):  
Data Center ◽  
Stochastic Scheduling ◽  
Data Center Networks

scholarly journals A New Approach to Stochastic Scheduling in Data Center Networks

2018 ◽  
Vol 10 (5) ◽  
pp. 01-25 ◽  
Author(s):  
Tingqiu Tim Yuan ◽  
Tao Huang ◽  
Cong Xu ◽  
Jian Li
Keyword(s):  
Data Center ◽  
Stochastic Scheduling ◽  
Data Center Networks ◽  
New Approach

Analysis on Buffer Occupancy of Quantized Congestion Notification in Data Center Networks

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

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

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.

An Efficient Flow Detection and Scheduling Method in Data Center Networks

2021 ◽  
Author(s):  
Zhiyu Liu ◽  
Mangui Lian ◽  
Jin Guo ◽  
Guangchao Wang
Keyword(s):  
Data Center ◽  
Data Center Networks ◽  
Scheduling Method ◽  
Flow Detection

Mitigating Packet Reordering for Random Packet Spraying in Data Center Networks

2021 ◽  
pp. 1-14
Author(s):  
Jiawei Huang ◽  
Wenjun Lyu ◽  
Weihe Li ◽  
Jianxin Wang ◽  
Tian He
Keyword(s):  
Data Center ◽  
Data Center Networks ◽  
Packet Reordering

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.

Sign in / Sign up

Export Citation Format

Share Document