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

Shuowei Jin

dblp:246/2987 · DBLP profile ↗
← Back
11ranked-venue papers
2as first author
10since 2021 · last 2025
0000-0002-5817-9029ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Computer networks · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Security and privacy · 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 networks
4 papers
Cellular and mobile networks · 44% Transport protocols and congestion control · 40% Content delivery and video streaming · 9%
Artificial intelligence
2 papers
Efficient and distributed learning · 88% Autonomous driving · 12%
Databases, data mining, and information retrieval
2 papers
Database system architecture and tuning · 46% Web and social media mining · 27% Recommender systems · 27%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 85% Cloud and datacenter computing · 15%
Network and information security
1 paper
Cyber-physical and IoT security · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › QUIC
QUIC performance
1.422024
QUIC is not Quick Enough over Fast Internet · WWW 2024
Poster: QUIC is not Quick Enough over Fast Internet · IMC 2023
Cellular and mobile networks
5g
1.122022
Vivisecting mobility management in 5G cellular networks · SIGCOMM 2022
A variegated look at 5G in the wild: performance, power, and QoE implications · SIGCOMM 2021
Machine learning › Efficient and distributed learning › inference efficiency
inference optimization
0.912025
Compute or Load KV Cache? Why Not Both? · ICML 2025
Machine learning › Efficient and distributed learning
KV cache management
0.912025
Compute or Load KV Cache? Why Not Both? · ICML 2025
Storage systems
i/o scheduling
0.912025
Compute or Load KV Cache? Why Not Both? · ICML 2025
Transport protocols and congestion control
transport protocol performance
0.812024
QUIC is not Quick Enough over Fast Internet · WWW 2024
Cyber-physical and IoT security
vehicular network security
0.812024
On Data Fabrication in Collaborative Vehicular Perception: Attacks and Countermeasures · USENIX Security Symposium 2024
Cellular and mobile networks › mobility management
handover
0.612022
Vivisecting mobility management in 5G cellular networks · SIGCOMM 2022
Cellular and mobile networks
mobility management
0.612022
Vivisecting mobility management in 5G cellular networks · SIGCOMM 2022
Database system architecture and tuning
configuration tuning
0.512021
ResTune: Resource Oriented Tuning Boosted by Meta-Learning for Cloud Databases · SIGMOD Conference 2021
Content delivery and video streaming
quality of experience
0.512021
A variegated look at 5G in the wild: performance, power, and QoE implications · SIGCOMM 2021
Recommender systems
graph convolutional network
0.412019
Graph Convolutional Networks on User Mobility Heterogeneous Graphs for Social Relationship Inference · IJCAI 2019
Web and social media mining › social network analysis
social link prediction
0.412019
Graph Convolutional Networks on User Mobility Heterogeneous Graphs for Social Relationship Inference · IJCAI 2019
Robotics › Autonomous driving
collaborative perception
0.212024
On Data Fabrication in Collaborative Vehicular Perception: Attacks and Countermeasures · USENIX Security Symposium 2024
Internet architecture and protocols › world wide web › web protocols
HTTP/3
0.212023
Poster: QUIC is not Quick Enough over Fast Internet · IMC 2023
Network measurement and analytics
mobile network measurement
0.112021
A variegated look at 5G in the wild: performance, power, and QoE implications · SIGCOMM 2021
Cloud and datacenter computing
database-as-a-service
0.112021
ResTune: Resource Oriented Tuning Boosted by Meta-Learning for Cloud Databases · SIGMOD Conference 2021

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

bidirectional scheduling · 1.7adaptive scheduling · 1.7measurement study · 1.7data fabrication · 1.5anomaly detection · 1.5meta-learning · 1.0user-space profiling · 0.8packet trace analysis · 0.8kernel profiling · 0.8power profiling · 0.5unsupervised embedding learning · 0.4semi-supervised learning · 0.4graph convolutional network · 0.4
YearPublicationVenuePosition
2025 Compute or Load KV Cache? Why Not Both?
abstract
Large Language Models (LLMs) are increasingly deployed in large-scale online services, enabling sophisticated applications. However, the computational overhead of generating key-value (KV) caches in the prefill stage presents a major bottleneck, particularly for long-context inputs. Prefix caching mitigates this issue by storing KV caches for reuse, reducing redundant computation. Despite its advantages, prefix caching suffers from high latency due to the limited I/O bandwidth of storage devices, constraining inference efficiency. To address this challenge, we introduce Cake, a novel KV cache loading system that optimally utilizes both computational and I/O resources in parallel. Cake employs a bidirectional scheduling strategy that dynamically balances KV cache computation and loading, ensuring efficient resource utilization. Additionally, Cake incorporates an adaptive scheduling mechanism that seamlessly integrates with non-prefix caching requests, improving system throughput and adapting to fluctuating resource availabilty. Through extensive evaluations across various hardware configurations, datasets, and storage conditions, Cake achieves on average 2.6× reduction in Time to First Token (TTFT) compared to compute-only and I/O-only methods. Our findings highlight Cake as an effective and practical solution for optimizing long-context LLM inference, bridging the gap between computation and I/O efficiency in large-scale AI deployments.
Shuowei Jin, Xueshen Liu, Qingzhao Zhang 0001, Z. Morley Mao
ICML1
2025 Small Fault Sample Adversarial Generation and Diagnosis Method for Vehicular Energy Network
abstract
This paper addresses the challenge of fault analysis in the Vehicular Energy Network (VEN) caused by small fault samples due to transient faults and complex disturbances. The proposed generation and diagnosis networks (GDNs) are developed without necessitating prior knowledge or manual intervention. The approach starts with an encoding and diagnosis network that converts multi-dimensional signals into images through supervised learning. A sample enhancement network, improved with module transfer and a relaxation objective function, is then proposed to increase the reliability of convergence and diversity of features for small fault samples. Additionally, a joint iterative training strategy between these two networks improves diagnostic accuracy and generalization through feature feedback. Performance validation on a semi-physical simulation platform demonstrates that the proposed GDNs achieve a 20% improvement in diagnostic accuracy with small datasets (200 samples) and maintain superior performance as sample volume grows. Thus, the proposed approach offers a potent solution for fault diagnosis in VENs with scarce samples, enhancing the analysis of complex systems. Note to Practitioners—This paper delves into fault diagnosis in the vehicular energy network (VEN) using small samples, employing a data-driven and deep learning model. The proposed method is versatile, suitable for analyzing complex systems with multiple and heterogeneous signals. An end-to-end model, named generation and diagnosis networks (GDNs), is introduced for generating small samples and conducting fault diagnosis without requiring prior knowledge or manual input. This method encodes multiple signals into signal images, which are then processed by a specially designed sample enhancement model, improved through the relaxation objective function and module transfer method. The enhanced samples are utilized for accurate analysis within the encoding and diagnosis networks’ diagnostic unit. The paper also provides a comparison of diagnosis results for reference. This approach enables researchers and engineers to efficiently augment and analyze small samples in practical applications, offering a practical framework for junior and inexperienced analysts. Preliminary experiments conducted using the RT-Lab semi-physical simulation platform suggest the method’s feasibility and effectiveness. Future research will explore the optimization of the model’s topology and parameters for lightweight design.
Yongheng Pang, Dongsheng Yang 0001, Mohammad Shojafar, Shuowei Jin, Mamoun Alazab, Shaohua Wan 0001, Liang Zhao 0004
IEEE Trans Autom. Sci. Eng.4
2024 OASIS: Collaborative Neural-Enhanced Mobile Video Streaming
abstract
Neural-enhanced video streaming (e.g., super-resolution) is an ongoing revolution which can provide extremely high-quality video streaming services breaking the restriction of bandwidth. However, such enhancements require intense computation power that is not affordable for a single mobile device, which hinders their real-world deployment. To address the limitation, we propose OASIS, the first system that facilitates multiple users in close proximity to execute intense neural-enhanced video streaming in realtime. To this end, OASIS intelligently distributes computation tasks among multiple mobile devices, selects appropriate video bitrates and super-resolution models, and optimizes video chunk delivery. As a result, the expensive neural-enhanced streaming is done through distributed collaboration, achieving optimal quality of experience (QoE). We implement and evaluate OASIS on commodity smartphones from different vendors, under various network and computation conditions. Extensive experiments demonstrate the high efficiency of OASIS: it improves the video streaming QoE by 40%-200% and reduces each participant's energy consumption by 60% when the system scales up from a single device to six devices.
Shuowei Jin, Ruiyang Zhu, Ahmad Hassan 0004, Xiao Zhu 0001, Xumiao Zhang, Z. Morley Mao, Feng Qian 0001, Zhi-Li Zhang
MMSys1
2024 On Data Fabrication in Collaborative Vehicular Perception: Attacks and Countermeasures
Qingzhao Zhang 0001, Shuowei Jin, Ruiyang Zhu, Xumiao Zhang, Qi Alfred Chen, Z. Morley Mao
USENIX Security Symposium2
2024 QUIC is not Quick Enough over Fast Internet
abstract
QUIC is expected to be a game-changer in improving web application performance. In this paper, we conduct a systematic examination of QUIC's performance over high-speed networks. We find that over fast Internet, the UDP+QUIC+HTTP/3 stack suffers a data rate reduction of up to 45.2% compared to the TCP+TLS+HTTP/2 counterpart. Moreover, the performance gap between QUIC and HTTP/2 grows as the underlying bandwidth increases. We observe this issue on lightweight data transfer clients and major web browsers (Chrome, Edge, Firefox, Opera), on different hosts (desktop, mobile), and over diverse networks (wired broadband, cellular). It affects not only file transfers, but also various applications such as video streaming (up to 9.8% video bitrate reduction) and web browsing. Through rigorous packet trace analysis and kernel- and user-space profiling, we identify the root cause to be high receiver-side processing overhead, in particular, excessive data packets and QUIC's user-space ACKs. We make concrete recommendations for mitigating the observed performance issues.
Xumiao Zhang, Shuowei Jin, Yi He 0015, Ahmad Hassan 0004, Z. Morley Mao, Feng Qian 0001, Zhi-Li Zhang
WWW2
2023 Poster: QUIC is not Quick Enough over Fast Internet
abstract
QUIC is a multiplexed transport-layer protocol over UDP and comes with enforced encryption. It is expected to be a game-changer in improving web application performance. Together with the network layer and layers below, UDP, QUIC, and HTTP/3 form a new protocol stack for future network communication, whose current counterpart is TCP, TLS, and HTTP/2. In this study, to understand QUIC's performance over high-speed networks and its potential to replace the TCP stack, we carry out a series of experiments to compare the UDP+QUIC+HTTP/3 (QUIC) stack and the TCP+TLS+HTTP/2 (HTTP/2) stack. Preliminary measurements on file download reveal that QUIC suffers from a data rate reduction compared to HTTP/2 across different hosts.
Xumiao Zhang, Shuowei Jin, Yi He 0015, Ahmad Hassan 0004, Z. Morley Mao, Feng Qian 0001, Zhi-Li Zhang
IMC2
2022 Vivisecting mobility management in 5G cellular networks
abstract
With 5G's support for diverse radio bands and different deployment modes, e.g., standalone (SA) vs. non-standalone (NSA), mobility management - especially the handover process - becomes far more complex. Measurement studies have shown that frequent handovers cause wild fluctuations in 5G throughput, and worst, service outages. Through a cross-country (6,200 km+) driving trip, we conduct in-depth measurements to study the current 5G mobility management practices adopted by three major U.S. carriers. Using this rich dataset, we carry out a systematic analysis to uncover the handover mechanisms employed by 5G carriers, and compare them along several dimensions such as (4G vs. 5G) radio technologies, radio (low-, mid- & high-)bands, and deployment (SA vs. NSA) modes. We further quantify the impact of mobility on application performance, power consumption, and signaling overheads. We identify key challenges facing today's NSA 5G deployments which result in unnecessary handovers and reduced coverage. Finally, we design a holistic handover prediction system Prognos and demonstrate its ability to improve QoE for two 5G applications 16K panoramic VoD and realtime volumetric video streaming. We have released the artifacts of our study at https://github.com/SIGCOMM22-5GMobility/artifact.
Ahmad Hassan 0004, Arvind Narayanan, Anlan Zhang, Wei Ye 0009, Ruiyang Zhu, Shuowei Jin, Jason Carpenter, Z. Morley Mao, Feng Qian 0001, Zhi-Li Zhang
SIGCOMM6
2021 A variegated look at 5G in the wild: performance, power, and QoE implications
abstract
Motivated by the rapid deployment of 5G, we carry out an in-depth measurement study of the performance, power consumption, and application quality-of-experience (QoE) of commercial 5G networks in the wild. We examine different 5G carriers, deployment schemes (Non-Standalone, NSA vs. Standalone, SA), radio bands (mmWave and sub 6-GHz), protocol configurations (_e.g._ Radio Resource Control state transitions), mobility patterns (stationary, walking, driving), client devices (_i.e._ User Equipment), and upper-layer applications (file download, video streaming, and web browsing). Our findings reveal key characteristics of commercial 5G in terms of throughput, latency, handover behaviors, radio state transitions, and radio power consumption under the above diverse scenarios, with detailed comparisons to 4G/LTE networks. Furthermore, our study provides key insights into how upper-layer applications should best utilize 5G by balancing the critical tradeoff between performance and energy consumption, as well as by taking into account the availability of both network and computation resources. We have released the datasets and tools of our study at https://github.com/SIGCOMM21-5G/artifact.
Arvind Narayanan, Xumiao Zhang, Ruiyang Zhu, Ahmad Hassan 0004, Shuowei Jin, Xiao Zhu 0001, Denis Rybkin, Zhengxuan Yang, Z. Morley Mao, Feng Qian 0001, Zhi-Li Zhang
SIGCOMM5
2021 ResTune: Resource Oriented Tuning Boosted by Meta-Learning for Cloud Databases
abstract
Modern database management systems (DBMS) contain tens to hundreds of critical performance tuning knobs that determine the system runtime behaviors. To reduce the total cost of ownership, cloud database providers put in drastic effort to automatically optimize the resource utilization by tuning these knobs. There are two challenges. First, the tuning system should always abide by the service level agreement (SLA) while optimizing the resource utilization, which imposes strict constrains on the tuning process. Second, the tuning time should be reasonably acceptable since time-consuming tuning is not practical for production and online troubleshooting.
Xinyi Zhang 0002, Zhuo Chang, Shuowei Jin, Jian Tan 0001, Feifei Li 0001, Tieying Zhang, Bin Cui 0001
SIGMOD Conference4
2021 Multiple delay-dependent finite-time boundedness and input-output finite-time mean square stabilization of uncertain semi-Markovian jump systems with input constraint
Yongheng Pang, Ting Li 0021, Shuowei Jin, Shaoxin Sun
Neural Comput. Appl.4
2019 Graph Convolutional Networks on User Mobility Heterogeneous Graphs for Social Relationship Inference
abstract
Inferring social relations from user trajectory data is of great value in real-world applications such as friend recommendation and ride-sharing. Most existing methods predict relationship based on a pairwise approach using some hand-crafted features or rely on a simple skip-gram based model to learn embeddings on graphs. Using hand-crafted features often fails to capture the complex dynamics in human social relations, while the graph embedding based methods only use random walks to propagate information and cannot incorporate external semantic data provided. We propose a novel model that utilizes Graph Convolutional Networks (GCNs) to learn user embeddings on the User Mobility Heterogeneous Graph in an unsupervised manner. This model is capable of propagating relation layer-wisely as well as combining both the rich structural information in the heterogeneous graph and predictive node features provided. Our method can also be extended to a semi-supervised setting if a part of the social network is available. The evaluation on three real-world datasets demonstrates that our method outperforms the state-of-the-art approaches.
Defu Lian, Shuowei Jin, Enhong Chen
IJCAI3