Shaoke Fang

dblp:306/7428 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2026
0009-0001-9757-1031ORCID · corroborated

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

Computer networks · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
Cloud and datacenter computing · 50% GPUs and heterogeneous computing · 50%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cloud networking
1.012026
TurboTSS: A Packet Classifier with Fast Rule Lookup and Update for the Cloud · INFOCOM 2026
GPUs and heterogeneous computing › packet processing
packet classification
1.012026
TurboTSS: A Packet Classifier with Fast Rule Lookup and Update for the Cloud · INFOCOM 2026
Internet architecture and protocols
packet processing
0.312026
TurboTSS: A Packet Classifier with Fast Rule Lookup and Update for the Cloud · INFOCOM 2026

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

rule lookup · 2.0packet classification · 2.0
YearPublicationVenuePosition
2026 TurboTSS: A Packet Classifier with Fast Rule Lookup and Update for the Cloud
Shaoke Fang, Yuchen Xu 0003, Weize Gao, Jianglong Nie, Wenfei Wu
INFOCOM1
2026 EPIC: Abstraction and Polymorphism of In-Network Collectives on Ethernet
Yitao Yuan, Jianglong Nie, Tianyu Bai, Ruizhe Zhou, Siyuan Cao, Xujie Fan, Yuchen Xu 0003, Junkai Chen, Chenqi Zhao, Nengyuan Zhang, Shaoke Fang, Jiangyuan Chen, Yuanfeng Chen, Zhan Wang 0003, Yuchao Zhang 0004, Yang Liu 0038, Xiangrui Yang 0002, Xiaohe Hu, Limin Xiao 0001, Weifeng Zhang 0003, Yazhu Lan, Jianbo Dong, Binzhang Fu, Wenfei Wu
SIGCOMM11
2023 Learning To Regularized Resource Allocation with Budget Constraints
abstract
Online resource allocation problem with budget constraints has a wide range of applications in network science and operation research. In this problem, the decision maker needs to make actions that consume resources to accumulate rewards. Contrary to prior work, we introduce a non-linear and non-separable regularizer to this problem that acts on the total resource consumption. The motivation for introducing the regularizer is allowing the decision maker to tradeoff the reward maximization and metrics optimization such as load-balancing and fairness that appears frequently in practical needs. Our goal is to simultaneously maximize additively separable rewards and the value of a non-separable regularizer without violating resource budget constraints. We develop a primal-dual-type online algorithm for this problem in the online learning setting and confirm its no-regret guarantee and zero constraint violations for stochastic i.i.d. input models. Furthermore, the general convex resource consumption functions allow our model to be more applicable. Numerical experiments are conducted to demonstrate the theoretical guarantee of our algorithm.
Shaoke Fang, Qingsong Liu 0001, Wenfei Wu
ICASSP1
2021 HyperNAT: Scaling Up Network Address Translation with SmartNICs for Clouds
abstract
Network address translation (NAT) is a basic functionality in cloud gateways. With the increasing traffic volume and number of flows introduced by the cloud tenants, the NAT gateway needs to be implemented on a cluster of servers. We propose to scale up the gateway servers, which could reduce the number of servers so as to reduce the capital expense and operation expense. We design HyperNAT, which leverages smartNICs to improve the server's processing capacity. In HyperNAT, the NAT functionality is distributed on multiple NICs, and the flow space is divided and assigned accordingly. HyperNAT overcomes the challenge that the packets in two directions of one connection need to be processed by the same NAT rule (named two-direction consistency, TDC) by cloning the rule to both data paths of the two directions. Our implementation and evaluation of HyperNAT show that HyperNAT could scale up cloud gateway effectively with low overhead.
Shaoke Fang, Qingsong Liu 0001, Wenfei Wu
GLOBECOM1