Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yingjie Fan 0005

dblp:374/0712 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0002-7521-3214ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems › storage reliability
erasure coding
0.812024
A Repair-Efficient Piggybacking Design With Small Number of Substripes · IEEE/ACM Trans. Netw. 2024
Storage systems
storage reliability
0.812024
A Repair-Efficient Piggybacking Design With Small Number of Substripes · IEEE/ACM Trans. Netw. 2024
Coding theory › distributed storage
distributed storage codes
0.812024
A Repair-Efficient Piggybacking Design With Small Number of Substripes · IEEE/ACM Trans. Netw. 2024
Storage systems
distributed storage
0.212024
A Repair-Efficient Piggybacking Design With Small Number of Substripes · IEEE/ACM Trans. Netw. 2024

Methods — techniques the papers use, named apart from their topics

finite field addition · 1.5
YearPublicationVenuePosition
2024 A Repair-Efficient Piggybacking Design With Small Number of Substripes
abstract
With the rapid growth of data scale and limitation on bandwidth in networks, coding scheme in distributed storage system is becoming the research hotspot. The piggybacking framework can solve the problem of high repair bandwidth of traditional MDS codes in distributed storage systems, while satisfying the properties of maximum-distance-separability (MDS) and high code rate which can guarantee the high storage efficiency. Several piggybacking designs have been proposed mainly aiming at the repair of systematic nodes. For the repair of parity nodes, these designs either adopt the traditional MDS code decoding or reduce the repair bandwidth by multiplying the number of substripes, which is not ideal in practice. In this paper, based on an single instance of repair efficiency piggybacking scheme, some specially designed simple finite field additions are introduced to encode parity symbols. The new design scheme is called NREPB. It can effectively reduce the repair bandwidth of parity nodes while ensuring no side-effect on the repair of systematic nodes. And the number of substripes in NREPB remains small, which is important in practical applications.
Yingjie Fan 0005
IEEE/ACM Trans. Netw.2