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

Ni Jin

dblp:280/4271 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
—ORCID · unresolved

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

Computer networks · 3 · 1 first-author · 3 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
1 paper
Transport protocols and congestion control · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
congestion control evaluation
1.012026
CCEval: Accurately and Confidently Evaluating Performance Metrics of Congestion Control Algorithms for Datacenter Networks · NSDI 2026

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

statistical evaluation · 1.0confidence estimation · 1.0
YearPublicationVenuePosition
2026 HeraClass: Towards Open-World Network Flow Classification via Traffic-Language Mapping
Ni Jin, Libin Liu 0001, Yukai Miao, Li Chen 0008, Dan Li 0001, Xizheng Wang, Xiuting Xu, Baojiang Cui
IWQoS1
2026 CCEval: Accurately and Confidently Evaluating Performance Metrics of Congestion Control Algorithms for Datacenter Networks
Tianfeng Liu, Kaihui Gao, Li Chen 0008, Dan Li 0001, Jin Guang, Vincent Liu 0001, Yiwei Zhang 0016, Ni Jin
NSDI10
2025 Construction of Repairable Threshold Key Sharing Schemes Based on Resolvable Balanced Incomplete Block Design
abstract
In this paper, we construct two repairable threshold schemes (RTSs) using a resolvable balanced incomplete block design (RBIBD). First, a resolvable transversal design is given by mutually orthogonal Latin squares. Further, a RBIBD is obtained through the filling hole method, and two repairable key sharing threshold schemes based on the Ramp threshold scheme are constructed based on this design. Finally, the information rate, the repairing degree and the communication complexity of two RTSs are calculated, and the performance of the schemes is analyzed. Compared with the existing schemes, the results show that two schemes constructed in this paper have a higher information rate, a larger repairing degree and lower communication complexity.
Ni Jin, Yangmei Deng
IET Inf. Secur.2
2025 Fed-RWM: A Robust Watermarking Approach for Federated Learning Model Ownership Protection
abstract
The interconnected nature of the Internet of Things (IoT) significantly enhances the efficiency of industries such as smart manufacturing, but it also raises concerns about data privacy. Federated learning (FL) utilizes an edge-cloud collaborative mode that shares models in the cloud instead of data, effectively mitigating data privacy leakage in edge IoT devices. However, FL suffers from the risk of model leakage, and both the cloud and the edge may illegally copy and sell the model, infringing on model ownership. To prevent such misbehavior, it is essential to design a robust method for verifying the model ownership. In this paper, we propose Fed-RWM, a novel watermarking method for FL models that provides robust ownership verification and avoids both edge and cloud leakage of watermark information. Fed-RWM trains the watermark by sharing parameters with an additional model and incorporates a watermark recovery method during verification to counter complex watermark removal attacks, which enhances the verification robustness. Fed-RWM introduces a new training paradigm that performs continuous watermarking training at the FL task initiator, preventing access to watermark information at both the edge and the cloud. The experimental results demonstrate that Fed-RWM performs well in model ownership verification and fidelity, is robust to different watermark removal attacks, and can provide reliable protection for federated learning models.
Shike Li, Ni Jin, Baojiang Cui
IEEE Trans. Netw. Serv. Manag.3