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.

Botao Feng

dblp:191/3903 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0003-3662-0183ORCID · conflict

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

Software engineering, systems software and programming languages · 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
Distributed systems · 40% Performance modeling and evaluation · 40% Cloud and datacenter computing · 20%

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

TopicWeightPapersLastEvidence papers
Distributed systems › observability › distributed monitoring
distributed tracing
0.712023
STEAM: Observability-Preserving Trace Sampling · ESEC/SIGSOFT FSE 2023
Cloud and datacenter computing
microservices
0.712023
STEAM: Observability-Preserving Trace Sampling · ESEC/SIGSOFT FSE 2023
Distributed systems
observability
0.712023
STEAM: Observability-Preserving Trace Sampling · ESEC/SIGSOFT FSE 2023
Performance modeling and evaluation
trace analysis
0.712023
STEAM: Observability-Preserving Trace Sampling · ESEC/SIGSOFT FSE 2023
Performance modeling and evaluation
trace sampling
0.712023
STEAM: Observability-Preserving Trace Sampling · ESEC/SIGSOFT FSE 2023

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

logical clauses · 0.7graph neural network · 0.7dissimilarity sampling · 0.7
YearPublicationVenuePosition
2024 Improved Design of Resource Hopping Based Multiple Access for Grant-Free Random Access in 6G mMTC System
abstract
In order to satisfy the increasingly massive connection in mMTC system, multiple access technology is a key enabler in the future 6G mMTC. Recently, an emerging multiple access scheme named resource hopping based multiple access (RHMA) has been proposed to achieve reliable user identification and data detection in grant-free random access for mMTC. However, the collision resolution of RHMA is still limited for the future 6G mMTC requirements. Therefore, an improved design is proposed in this paper to enhance the collision resolution capability of RHMA. Specifically, successive interference cancellation (SIC) is combined with user identification and segment decoding at the receiver of RHMA. Also, the user identification of RHMA is improved to eliminate the false alarm user caused by collision and blind channel estimation is considered to recover the signal on the colliding segments. The simulation results show that the improved design is able to achieve a higher collision resolution capability of RHMA.
Wanyue Zhang, Guangkai Li, Yiyan Ma, Wanqiao Wang, Botao Feng, Bo Ai 0001
VTC Spring6
2023 Implementation of User Access Control based on Resource Hopping Multiple Access Scheme in mMTC Scenario
abstract
With the emergence of various IoT applications, a large-scale IoT system is set to revolutionize the various industry. Massive machine type communication will play a crucial role in providing robust support to this system. However, in mMTC, implementing user access control to block malicious users remains a critical issue that needs to be addressed. To this end, this paper proposes a user access control scheme based on resource hopping multiple access (RHMA). This scheme utilizes the unique resource hopping patterns of different users to control user access. The controllability of these resource hopping patterns effectively prevents malicious users from intruding into the system. Moreover, the proposed user access control scheme is implemented in practice with USRP platform. The experimental results confirm the reliability and effectiveness of the proposed access control system.
Botao Feng, Yiyan Ma, Dan Fei, Jingjing Liao, Xinjian Ou, Bo Ai 0001
PIMRC1
2023 STEAM: Observability-Preserving Trace Sampling
abstract
In distributed systems and microservice applications, tracing is a crucial observability signal employed for comprehending their internal states. To mitigate the overhead associated with distributed tracing, most tracing frameworks utilize a uniform sampling strategy, which retains only a subset of traces. However, this approach is insufficient for preserving system observability. This is primarily attributed to the long-tail distribution of traces in practice, which results in the omission or rarity of minority yet critical traces after sampling. In this study, we introduce an observability-preserving trace sampling method, denoted as STEAM, which aims to retain as much information as possible in the sampled traces. We employ Graph Neural Networks (GNN) for trace representation, while incorporating domain knowledge of trace comparison through logical clauses. Subsequently, we employ a scalable approach to sample traces, emphasizing mutually dissimilar traces. STEAM has been implemented on top of OpenTelemetry, comprising approximately 1.6K lines of Golang code and 2K lines of Python code. Evaluation on four benchmark microservice applications and a production system demonstrates the superior performance of our approach compared to baseline methods. Furthermore, STEAM is capable of processing 15,000 traces in approximately 4 seconds.
Shilin He, Botao Feng, Liqun Li, Xu Zhang 0024, Yu Kang 0006, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang 0001
ESEC/SIGSOFT FSE2