9 citations · 11 across the 11 of their papers we have counts for
11 papers
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…
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…
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…
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…
PMDS Array Codes With Small Sub-packetization, Small Repair Bandwidth/Rebuilding Access
Jie Li, Xiaohu Tang, Hanxu Hou +3
Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code lengt…
Trading off Quality for Efficiency of Community Detection: An Inductive Method across Graphs
Meng Qin, Chaorui Zhang, Bo Bai +2
Many network applications can be formulated as NP-hard combinatorial optimization problems of community detection (CD). Due to the NP-hardness, to balance the CD quality and effici…
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…
Structural Entropy of the Stochastic Block Models
Jie Han, Tao Guo, Qiaoqiao Zhou +3
With the rapid expansion of graphs and networks and the growing magnitude of data from all areas of science, effective treatment and compression schemes of context-dependent data i…
A Convergent Semi-Proximal Alternating Direction Method of Multipliers for Recovering Internet Traffics from Link Measurements
Zhenyu Ming, Liping Zhang, Hao Wu +4
It is challenging to recover the large-scale internet traffic data purely from the link measurements. With the rapid growth of the problem scale, it will be extremely difficult to…
Lower Bound on the Optimal Access Bandwidth of ()-MDS Array Code with Degraded Read Friendly
Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li +4
Accessing the data in the failed disk (degraded read) with low latency is crucial for an erasure-coded storage system. In this work, the maximum distance separable (MDS) array code…
Coded Caching in Fog-RAN: b-Matching Approach
Bo Bai, Wanyi Li, Li Wang +1
Fog radio access network (Fog-RAN), which pushes the caching and computing capabilities to the network edge, is capable of efficiently delivering contents to users by using careful…