EDBT 2026 Demo / reviewers in the wild / expert
Lanzheng Liu
dblp:71/11208
· DBLP profile ↗
4ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 since 2021Computer networks · 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
2 papers |
Cloud and datacenter computing · 64% Memory systems · 25% Distributed systems · 7% | |
| Computer networks
1 paper |
Routing and switching · 56% Internet architecture and protocols · 44% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols
IPv6 |
1.0 | 1 | 2026 | PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree · NSDI 2026 |
Routing and switching › IP lookup
IPv6 lookup |
1.0 | 1 | 2026 | PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree · NSDI 2026 |
Cloud and datacenter computing › serverless computing
container cold start |
0.8 | 1 | 2024 | Block-level Image Service for the Cloud · ACM Trans. Storage 2024 |
Memory systems › cache
prefetching |
0.8 | 1 | 2024 | Block-level Image Service for the Cloud · ACM Trans. Storage 2024 |
Cloud and datacenter computing
application deployment |
0.4 | 1 | 2020 | DADI: Block-Level Image Service for Agile and Elastic Application Deployment · USENIX ATC 2020 |
Routing and switching
packet forwarding |
0.3 | 1 | 2026 | PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree · NSDI 2026 |
Storage systems › multimedia storage
image storage |
0.1 | 1 | 2020 | DADI: Block-Level Image Service for Agile and Elastic Application Deployment · USENIX ATC 2020 |
Methods — techniques the papers use, named apart from their topics
b+tree · 1.0pull-push collaborative prefetching · 0.8pull-based prefetching · 0.8block-level image service · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree
Lanzheng Liu, Huiba Li, Jiwu Shu, Windsor W. Hsu, Yiming Zhang 0003 |
NSDI | 2 |
| 2024 | Block-level Image Service for the CloudabstractBusinesses increasingly need agile and elastic computing infrastructure to respond quickly to real-world situations. By offering efficient process-based virtualization and a layered image system, containers are designed to enable agile and elastic application deployment. However, creating or updating large container clusters is still slow due to the image downloading and unpacking process. In this article, we present DADI Image Service (DADI), a block-level image service for increased agility and elasticity in deploying applications. DADI replaces the waterfall model of starting containers (downloading image, unpacking image, starting container) with fine-grained on-demand transfer of remote images, realizing instant start of containers. To accelerate the cold start of containers, DADI designs a pull-based prefetching mechanism that allows a host to read necessary image data beforehand at the granularity of image layers. We design a peer-to-peer–based decentralized image sharing architecture to balance traffic among all the participating hosts and propose a pull-push collaborative prefetching mechanism to accelerate cold start. DADI efficiently supports various kinds of runtimes including cgroups, QEMU, and so on, further realizing “build once, run anywhere.” DADI has been deployed at scale in the production environment of Alibaba, serving one of the world’s largest ecommerce platforms. Performance results show that DADI can cold start 10,000 containers on 1,000 hosts within 4 s. Huiba Li, Lanzheng Liu, Yiming Zhang 0003, Windsor W. Hsu |
ACM Trans. Storage | 6 |
| 2020 | DADI: Block-Level Image Service for Agile and Elastic Application Deployment
Huiba Li, Lanzheng Liu, Windsor W. Hsu |
USENIX ATC | 5 |
| 2011 | A Hierarchical Memory Service Mechanism in Server Consolidation EnvironmentabstractIncreasing Internet business and computing footprint motivate server consolidation in data centers. Through virtualization technology, server consolidation can reduce physical hosts and provide scalable services. However, the ineffective memory usage among multiple virtual machines (VMs) becomes the bottleneck in server consolidation environment. Because of inaccurate memory usage estimate and the lack of memory resource managements, there is much service performance degradation in data centers, even though they have occupied a large amount of memory. In order to improve this scenario, we first introduce VM's memory division view and VM's free memory division view. Based on them, we propose a hierarchal memory service mechanism. We have designed and implemented the corresponding memory scheduling algorithm to enhance memory efficiency and achieve service level agreement. The benchmark test results show that our implementation can save 30% physical memory with 1% to 5% performance degradation. Based on Xen virtualization platform and balloon driver technology, our works actually bring dramatic benefits to commercial cloud computing center which is providing more than 2,000 VMs' services to cloud computing users. Liufeng Wang, Huaimin Wang 0001, Lu Cai, Rui Chu, Pengfei Zhang 0006, Lanzheng Liu |
ICPADS | 6 |