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

Yicheng Shen

dblp:145/5521 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
3since 2021 · last 2022
—ORCID · unresolved

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

Computer networks · 3 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Distributed systems · 72% Cloud and datacenter computing · 28%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
consensus
0.512021
Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021
Distributed systems
fault tolerance
0.512021
Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021
Distributed systems › replication
state machine replication
0.512021
Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021
Machine learning › Efficient and distributed learning
distributed training
0.412020
CarML: distributed machine learning in vehicular clouds · MobiCom 2020
Cloud and datacenter computing › mobile cloud computing
vehicular cloud
0.412020
CarML: distributed machine learning in vehicular clouds · MobiCom 2020
Cloud and datacenter computing › datacenter storage
datacenter replication
0.112021
Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021

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

simulation · 0.9randomization · 0.5
YearPublicationVenuePosition
2022 Reliable Broadcast in Critical Applications: Asset Transfer and Smart Home
abstract
Asynchronous Byzantine reliable broadcast receives renewed attention recently, as it is fundamental to many fault-tolerant critical applications. This paper focuses on the Byzantine Reliable Broadcast protocol, which was first proposed by Bracha in 1987. Several recent protocols have improved the round and bit complexity of these algorithms. Motivated by practical network constraints in modern applications, this paper revisits the problem and reduces both complexity in communication and local computation. State-of-the-arts protocols are evaluated using the developed framework that simulates realistic bandwidth constraints. The evaluation demonstrates that our protocols, which use cryptographic hash functions and erasure coding in a novel way, have superior performance in critical applications such as asset transfer and smart home.
Yingjian Wu, Yicheng Shen, Haochen Pan, Lewis Tseng, Moayad Aloqaily
ICC2
2022 CRACAU: Byzantine Machine Learning Meets Industrial Edge Computing in Industry 5.0
abstract
Industry 5.0 is emerging as a result of the advancement in networking and communication technologies, artificial intelligence, distributed computing, and beyond 5G. Among the important enabling technologies, federated learning, industrial edge computing, and Byzantine-tolerant machine learning (ML) are key accelerators in Industry 5.0. We propose a framework to integrate these key components. Recent works have designed various Byzantine-tolerant ML algorithms for a datacenter or a cluster. However, these algorithms are difficult to be applied to industrial edge computing paradigms. In this article, a novel Byzantine-tolerant federated learning algorithm, CRACAU, is designed for the popular three-level edge computing architecture. In this algorithm, edge devices jointly learn an ML model using the data collected at each device, and their private data are never shared with others. Under standard assumptions, we formally prove that CRACAU converges to the optimal point, i.e., CRACAU finds the optimal parameters of the ML model. We also implement CRACAU in the MXNet framework and evaluate it on the popular benchmark MNIST and CIFAR-10 image classification datasets. Experimental results show that CRACAU achieves satisfying accuracy.
Anran Du, Yicheng Shen, Qinzi Zhang, Lewis Tseng, Moayad Aloqaily
IEEE Trans. Ind. Informatics2
2021 Rabia: Simplifying State-Machine Replication Through Randomization
abstract
We introduce Rabia, a simple and high performance framework for implementing state-machine replication (SMR) within a datacenter. The main innovation of Rabia is in using randomization to simplify the design. Rabia provides the following two features: (i) It does not need any fail-over protocol and supports trivial auxiliary protocols like log compaction, snapshotting, and reconfiguration, components that are often considered the most challenging when developing SMR systems; and (ii) It provides high performance, up to 1.5x higher throughput than the closest competitor (i.e., EPaxos) in a favorable setup (same availability zone with three replicas) and is comparable with a larger number of replicas or when deployed in multiple availability zones.
Haochen Pan, Jesse Tuglu, Neo Zhou, Yicheng Shen, Xiong Zheng, Joseph Tassarotti, Lewis Tseng, Roberto Palmieri
SOSP5
2020 CarML: distributed machine learning in vehicular clouds
abstract
This paper presents CarML, a distributed machine learning platform built on top of an emerging computing paradigm, vehicular clouds. We discuss our design and technical challenges, followed by our preliminary solutions. We verify the efficacy of our solutions using a customized simulator based on Python and SUMO.
Anran Du, Yicheng Shen, Lewis Tseng
MobiCom2
2013 Scheme for opportunistic spectrum access in cognitive radio
abstract
In this study, an opportunistic spectrum access model with learning strategy is presented for cognitive radio system. Consider a hidden Markov model in learning process, where the ternary hypothesis testing scheme is proposed to perform sensing with the goodness of fit testing. By using a gradient method, the secondary user can estimate the channel patterns and keep up with the variations of the primary user activities. An opportunistic access channel capacity is introduced to evaluate the quality of service of the objective licensed channel. Also, a partially observable Markov decision process framework is presented to exploit spectrum holes. Further analysis shows that, unlike the binary hypothesis testing where the idle state is always protected, the idea of the proposed ternary hypothesis testing puts both the idle and busy state in the same position, which reflects the real state of the licensed channel more precisely. Simulation results indicate that the proposed ternary hypothesis testing scheme outperforms the conventional binary hypothesis testing for both the goodness of fit testing and the energy detection.
Zhihui Ye, Yicheng Shen
IET Commun.3