Ethernet routing for large scale distributed data center fabrics

2013 ◽  
Author(s):  
David Allan ◽  
Janos Farkas ◽  
Panagiotis Saltsidis ◽  
Jeff Tantsura
Keyword(s):  
Data Center ◽  
Large Scale ◽  
Distributed Data

Reliability of SSDs in Enterprise Storage Systems

2021 ◽  
Vol 17 (1) ◽  
pp. 1-27
Author(s):  
Stathis Maneas ◽  
Kaveh Mahdaviani ◽  
Tim Emami ◽  
Bianca Schroeder
Keyword(s):  
Field Study ◽  
Data Center ◽  
Field Data ◽  
Large Scale ◽  
Storage Systems ◽  
Distributed Data ◽  
Number Of Factors ◽  
Scale Field ◽  
Large Scale Field ◽  
Practical Implications

This article presents the first large-scale field study of NAND-based SSDs in enterprise storage systems (in contrast to drives in distributed data center storage systems). The study is based on a very comprehensive set of field data, covering 1.6 million SSDs of a major storage vendor (NetApp). The drives comprise three different manufacturers, 18 different models, 12 different capacities, and all major flash technologies (SLC, cMLC, eMLC, 3D-TLC). The data allows us to study a large number of factors that were not studied in prior works, including the effect of firmware versions, the reliability of TLC NAND, and the correlations between drives within a RAID system. This article presents our analysis, along with a number of practical implications derived from it.

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.

scholarly journals CHORD: Distributed Data-sharing via Hybrid ROS 1 and 2 for Multi-robot Exploration of Large-scale Complex Environments

2021 ◽  
pp. 1-1
Author(s):  
Muhammad Fadhil Ginting ◽  
Kyohei Otsu ◽  
Jeffrey Edlund ◽  
Jay Gao ◽  
Ali-akbar Agha-mohammadi
Keyword(s):  
Data Sharing ◽  
Large Scale ◽  
Distributed Data ◽  
Complex Environments ◽  
Multi Robot

scholarly journals The Management Strategy of Metadata in Large-scale Network Storage System

2018 ◽  
Vol 228 ◽  
pp. 01011
Author(s):  
Haifeng Zhong ◽  
Jianying Xiong
Keyword(s):  
Large Scale ◽  
Storage System ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Distributed Data ◽  
Mass Storage ◽  
Large Scale Network ◽  
Network Storage System ◽  
Mass Storage System ◽  
Scale Network

The wan Internet storage system based on Distributed Hash Table uses fully distributed data and metadata management, and constructs an extensible and efficient mass storage system for the application based on Internet. However, such systems work in highly dynamic environments, and the frequent entry and exit of nodes will lead to huge communication costs. Therefore, this paper proposes a new hierarchical metadata routing management mechanism based on DHT, which makes full use of the node stabilization point to reduce the maintenance overhead of the overlay. Analysis shows that the algorithm can effectively improve efficiency and enhance stability.

Sign in / Sign up

Export Citation Format

Share Document