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

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

Oddlab: fault-tolerant aware load-balancing framework for data center networks

annals of telecommunications - annales des télécommunications ◽

10.1007/s12243-021-00898-0 ◽

2021 ◽

Author(s):

Aymen Hasan Alawadi ◽

Sándor Molnár

Keyword(s):

Data Center ◽

Traffic Engineering ◽

Fault Tolerant ◽

Weak Link ◽

Rooted Tree ◽

Shortest Paths ◽

Data Center Networks ◽

Link Failures ◽

Link Utilization ◽

Network Utilization

AbstractData center networks (DCNs) act as critical infrastructures for emerging technologies. In general, a DCN involves a multi-rooted tree with various shortest paths of equal length from end to end. The DCN fabric must be maintained and monitored to guarantee high availability and better QoS. Traditional traffic engineering (TE) methods frequently reroute large flows based on the shortest and least-congested paths to maintain high service availability. This procedure results in a weak link utilization with frequent packet reordering. Moreover, DCN link failures are typical problems. State-of-the-art approaches address such challenges by modifying the network components (switches or hosts) to discover and avoid broken connections. This study proposes Oddlab (Odds labels), a novel deployable TE method to guarantee the QoS of multi-rooted data center (DC) traffic in symmetric and asymmetric modes. Oddlab creatively builds a heuristic model for efficient flow scheduling and faulty link detection by exclusively using the gathered statistics from the DCN data plane, such as residual bandwidth and the number of installed elephant flows. Besides, the proposed method is implemented in an SDN-based DCN without altering the network components. Our findings indicate that Oddlab can minimize the flow completion time, maximize bisection bandwidth, improve network utilization, and recognize faulty links with sufficient accuracy to improve DC productivity.

Download Full-text

PDLB: Path Diversity-aware Load Balancing with Adaptive Granularity in Data Center Network

10.21203/rs.3.rs-819781/v1 ◽

2022 ◽

Author(s):

weimin gao ◽

huang jiawei ◽

Li zhaoyi ◽

zou shaojun ◽

wang jianxin

Keyword(s):

Load Balancing ◽

Data Center ◽

Large Scale ◽

Rooted Tree ◽

Coarse Grained ◽

Data Center Network ◽

Path Diversity ◽

Packet Reordering ◽

Fine Grained ◽

Multiple Paths

Abstract Modern data center topologies often take the form of a multi-rooted tree with rich parallel paths to provide high bandwidth. However, various path diversities caused by traffic dynamics, link failures and heterogeneous switching equipments widely exist in production data center network. Therefore, the multi-path load balancer in data center should be robust to these diversities. Although prior fine-grained schemes such as RPS and Presto make full use of available paths, they are prone to experi-ence packet reordering problem under asymmetric topology. The coarse-grained solutions such as ECMP and LetFlow effectively avoid packet reordering, but easily lead to under-utilization of multiple paths. To cope with these inefficiencies, we propose a load balancing mechanism called PDLB, which adaptively adjusts flowcell granularity according to path diversity. PDLB increases flowcell granularity to alleviate packet reordering under large degrees of topology asymmetry, while reducing flowcell granularity to obtain high link utilization under small degrees of topology asymmetry. PDLB is only deployed on the sender without any modification on switch. We evaluate PDLB through large-scale NS2 simulations. The experimental results show that PDLB reduces the average flow completion time by up to ∼11-53% over the state-of-the-art load balancing schemes.

Download Full-text

Mitigating Packet Reordering for Random Packet Spraying in Data Center Networks

IEEE/ACM Transactions on Networking ◽

10.1109/tnet.2021.3056601 ◽

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

Download Full-text

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

Electronics ◽

10.3390/electronics10151774 ◽

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.

Download Full-text

Scalable Data Center Networks for Future Large-Scale Cloud Applications

Asia Communications and Photonics Conference 2014 ◽

10.1364/acpc.2014.aw4g.2 ◽

2014 ◽

Author(s):

Jie Xiao ◽

Yanli Zhang ◽

Yun Shi ◽

Changde Li ◽

Bin Wu ◽

...

Keyword(s):

Data Center ◽

Large Scale ◽

Data Center Networks ◽

Cloud Applications

Download Full-text

Layout-Independent Wireless Facility Constructing and Scheduling for Data Center Networks

Wireless Communications and Mobile Computing ◽

10.1155/2017/1354273 ◽

2017 ◽

Vol 2017 ◽

pp. 1-12 ◽

Cited By ~ 2

Author(s):

Xianglin Wei ◽

Qin Sun

Keyword(s):

Data Center ◽

Network Performance ◽

Data Center Networks ◽

Data Packets ◽

Typical Data ◽

Calculation Step ◽

Scheduling Method ◽

Series Of Experiments ◽

Traffic Estimation ◽

And Control

The control packets in the data center networks (DCNs) have to contest with the data packets although they are usually much shorter in size and much more important in network management. Moreover, the uneven distribution of the packets may create potential traffic hotspots in the DCN which could degrade network performance drastically. To bridge these gaps, a layout-independent constructing algorithm and a scheduling method are put forward towards layout-independent wireless facility in data centers. First of all, a conflict aware spanning tree algorithm is developed to construct the wireless facility network (WFN). Secondly, a scheduling method which contains three steps, route calculation, traffic estimation, and flow scheduling, is presented. In the route calculation step, a route set between each node pair is calculated in advance for later usage. The scheduler estimates the traffic loads on the links on a regular basis in the traffic estimation step. Then, arrived data and control flows are scheduled according to multiple policies based on given route sets and scheduling objectives in the flow scheduling step. Finally, a series of experiments have been conducted on NS3 based on two typical data center layouts. Experimental results in both scenarios have validated our proposal’ effectiveness.

Download Full-text

Free Space Intra-Datacenter Interconnects Based on 2D Optical Beam Steering Enabled by Photonic Integrated Circuits

Photonics ◽

10.3390/photonics5030021 ◽

2018 ◽

Vol 5 (3) ◽

pp. 21 ◽

Cited By ~ 5

Author(s):

Charidimos Chaintoutis ◽

Behnam Shariati ◽

Adonis Bogris ◽

Paul Dijk ◽

Chris Roeloffzen ◽

...

Keyword(s):

Integrated Circuits ◽

Integrated Circuit ◽

Data Center ◽

Free Space ◽

Large Scale ◽

Beam Steering ◽

Optical Beam ◽

Switching Network ◽

Free Space Optical ◽

Data Center Networks

Data centers are continuously growing in scale and can contain more than one million servers spreading across thousands of racks; requiring a large-scale switching network to provide broadband and reconfigurable interconnections of low latency. Traditional data center network architectures, through the use of electrical packet switches in a multi-tier topology, has fundamental weaknesses such as oversubscription and cabling complexity. Wireless intra-data center interconnection solutions have been proposed to deal with the cabling problem and can simultaneously address the over-provisioning problem by offering efficient topology re-configurability. In this work we introduce a novel free space optical interconnect solution for intra-data center networks that utilizes 2D optical beam steering for the transmitter, and high bandwidth wide-area photodiode arrays for the receiver. This new breed of free space optical interconnects can be developed on a photonic integrated circuit; offering ns switching at sub-μW consumption. The proposed interconnects together with a networking architecture that is suitable for utilizing those devices could support next generation intra-data center networks, fulfilling the requirements of seamless operation, high connectivity, and agility in terms of the reconfiguration time.

Download Full-text