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

Shujun Zhuang

dblp:268/1477 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Computer networks · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1

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
3 papers
Cloud and datacenter computing · 49% Storage systems · 46% Distributed systems · 5%
Computer networks
3 papers
Software-defined and programmable networks · 73% Transport protocols and congestion control · 27%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cloud storage
0.612022
From luna to solar: the evolutions of the compute-to-storage networks in Alibaba cloud · SIGCOMM 2022
Cloud and datacenter computing › cloud storage
elastic block storage
0.612022
From luna to solar: the evolutions of the compute-to-storage networks in Alibaba cloud · SIGCOMM 2022
Software-defined and programmable networks
programmable data plane
0.512021
HAVS: Hardware-accelerated Shared-memory-based VPP Network Stack · INFOCOM 2021
Storage systems
i/o optimization
0.512021
HAVS: Hardware-accelerated Shared-memory-based VPP Network Stack · INFOCOM 2021
Software-defined and programmable networks
network function virtualization
0.412020
RECANS: Low-Latency Network Function Chains with Hierarchical State Sharing · HPDC 2020
Transport protocols and congestion control › transport protocols
UDP
0.212022
From luna to solar: the evolutions of the compute-to-storage networks in Alibaba cloud · SIGCOMM 2022
Transport protocols and congestion control › TCP
user-space TCP
0.212022
From luna to solar: the evolutions of the compute-to-storage networks in Alibaba cloud · SIGCOMM 2022
Cloud and datacenter computing › datacenter architecture
datacenter server
0.112021
HAVS: Hardware-accelerated Shared-memory-based VPP Network Stack · INFOCOM 2021
Storage systems › networked storage
storage networking
0.112021
HAVS: Hardware-accelerated Shared-memory-based VPP Network Stack · INFOCOM 2021

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

hardware acceleration · 1.1hardware-software co-design · 1.0asynchronous copy architecture · 1.0shared memory · 0.9RDMA · 0.9
YearPublicationVenuePosition
2022 From luna to solar: the evolutions of the compute-to-storage networks in Alibaba cloud
abstract
This paper presents the two generations of storage network stacks that reduced the average I/O latency of Alibaba Cloud's EBS service by 72% in the last five years: Luna, a user-space TCP stack that corresponds the latency of network to the speed of SSD; and Solar, a storage-oriented UDP stack that enables both storage and network hardware accelerations.
Rui Miao 0001, Lingjun Zhu, Kun Qian 0021, Shujun Zhuang, Bo Li 0061, Shuguang Cheng, Binzhang Fu, Jiaji Zhu, Jiesheng Wu, Dennis Cai, Hongqiang Harry Liu
SIGCOMM5
2021 HAVS: Hardware-accelerated Shared-memory-based VPP Network Stack
abstract
The number of requests to transfer large files is increasing rapidly in web server and remote-storage scenarios, and this increase requires a higher processing capacity from the network stack. However, to fully decouple from applications, many latest userspace network stacks, such as VPP (vector packet processing) and snap, adopt a shared-memory-based solution to communicate with upper applications. During this communication, the application or network stack needs to copy data to or from shared memory queues. In our verification experiment, these multiple copy operations incur more than 50% CPU consumption and severe performance degradation when the transferred file is larger than 32 KB. This paper adopts a hardware-accelerated solution and proposes HAVS which integrates Intel I/O Acceleration Technology into the VPP network stack to achieve high-performance memory copy offloading. An asynchronous copy architecture is introduced in HAVS to free up CPU resources. Moreover, an abstract memcpy accelerator layer is constructed in HAVS to ease the use of different types of hardware accelerators and sustain high availability with a fault-tolerance mechanism. The comprehensive evaluation shows that HAVS can provide an average 50%-60% throughput improvement over the original VPP stack when accelerating the nginx and SPDK iSCSI target application.
Shujun Zhuang, Jian Li 0021, Haibing Guan
INFOCOM1
2020 RECANS: Low-Latency Network Function Chains with Hierarchical State Sharing
abstract
In this paper, we present RECANS, a low-latency NFV state management framework that supports elastic scaling of NF chains while meeting the increasingly stringent NFV performance requirements. Its design builds on the insight that an instance may be scaled to a local server or a remote server, and we thus adopt a hierarchical state-sharing approach that exploits shared memory and low-latency network (RDMA) features to realize state sharing in a server and across servers. Globally, all state data are divided into partitions spread across NF servers, and we reorganize the partitions dynamically through state migration implemented with carefully chosen RDMA primitives. Locally, each partition is maintained by a node store, which uses shared memory to share state with NFs in the same server and thus avoids remote accesses. Being aware of NF chaining, RECANS also adopts specially designed flow tables that support chain-wide batch operations. Our evaluation shows that RECANS has a submillisecond peak latency during scaling events, and outperforms traditional hash tables by 4.78 times for normal state access throughput in NF chains.
Shujun Zhuang, Jian Li 0021, Haibing Guan
HPDC2