most citedMDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees

1 citations · 1 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT2023

Generalized Simple Regenerating Codes: Trading Sub-packetization and Fault Tolerance

Zhengyi Jiang, Hao Shi, Zhongyi Huang +3

Maximum distance separable (MDS) codes have the optimal trade-off between storage efficiency and fault tolerance, which are widely used in distributed storage systems. As typical n…

cs.IT2023

MDS Array Codes With Small Sub-packetization Levels and Small Repair Degrees

Jie Li, Yi Liu, Xiaohu Tang +3

High-rate minimum storage regenerating (MSR) codes are known to require a large sub-packetization level, which can make meta-data management difficult and hinder implementation in…

cs.NI2023

dMAPAR-HMM: Reforming Traffic Model for Improving Performance Bound with Stochastic Network Calculus

Qingqing Yang, Xi Peng, Huiwen Yang +2

A popular branch of stochastic network calculus (SNC) utilizes moment-generating functions (MGFs) to characterize arrivals and services, which enables end-to-end performance analys…

cs.IT20231 cited

MDS Array Codes With (Near) Optimal Repair Bandwidth for All Admissible Repair Degrees

Jie Li, Yi Liu, Xiaohu Tang +3

Abundant high-rate (n, k) minimum storage regenerating (MSR) codes have been reported in the literature. However, most of them require contacting all the surviving nodes during a n…

math.PR2022

Tail Quantile Estimation for Non-preemptive Priority Queues

Jin Guang, Guiyu Hong, Xinyun Chen +4

Motivated by applications in computing and telecommunication systems, we investigate the problem of estimating p-quantile of steady-state sojourn times in a single-server multi-cla…