GA3: scalable, distributed address assignment for dynamic data center networks

2017 ◽  
Vol 72 (11-12) ◽  
pp. 693-702 ◽  
Author(s):  
Elisa Rojas ◽  
Joaquin Alvarez-Horcajo ◽  
Isaias Martinez-Yelmo ◽  
Jose M. Arco ◽  
Juan A. Carral
Keyword(s):  
Data Center ◽  
Data Center Networks ◽  
Dynamic Data

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.

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
Sign in / Sign up

Export Citation Format

Share Document