Ziyou Si

dblp:428/8482 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

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

Computer networks · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
1.012026
MCOP: A Multiple Containers in One Pod Placement Strategy towards Application Completion Time Minimization · INFOCOM 2026
Cloud and datacenter computing › cluster resource management and scheduling
container placement
1.012026
MCOP: A Multiple Containers in One Pod Placement Strategy towards Application Completion Time Minimization · INFOCOM 2026
Cloud and datacenter computing › virtualization
container
0.312026
MCOP: A Multiple Containers in One Pod Placement Strategy towards Application Completion Time Minimization · INFOCOM 2026
Cloud and datacenter computing
virtualization
0.312026
MCOP: A Multiple Containers in One Pod Placement Strategy towards Application Completion Time Minimization · INFOCOM 2026

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

pod placement · 1.0
YearPublicationVenuePosition
2026 MCOP: A Multiple Containers in One Pod Placement Strategy towards Application Completion Time Minimization
Ziyou Si, Lin Gu 0002, Deze Zeng, Hao Fan 0006, Quan Chen 0002
INFOCOM1
2026 Collaborative multi-granularity distributed registry planning for fast container image pulling
abstract
Abstract The increasing popularity of container technology raises significant challenges in efficiently storing millions of container images in registries to enable fast on-demand image pulling. This is further complicated by (1) registries are geographically distributed, with independent and heterogeneous storage resources; (2) container images are pulled in layers, but can be stored at different levels of granularity, i.e., layer-level or file-level, each with varying storage requirement and pulling latency. To address the above challenges, we propose MIS, a multi-granularity image storage strategy, for distributed registries to determine the storage granularity and schedule image storage collaboratively, aiming to reduce the image pulling latency while improving the storage utilization. We formulate the image storage problem into a nonlinear mixed-integer programming form with NP-hardness by incorporating both layer-level and file-level storage constraints. We propose a low computational complexity algorithm via randomized rounding with a guaranteed approximation ratio. Extensive experimental results demonstrate the effectiveness of our strategy, with image pulling latency reductions of 28.67%, 21.69%, and 28.94% respectively compared to the state-of-the-art solutions.
Ziyou Si, Lin Gu 0002, Yunzhuo Ju, Deze Zeng, Hai Jin 0001
Frontiers Comput. Sci.1