Asymptotic Miss Ratio of LRU Caching with Consistent Hashing. - Kaiyi Ji; Guocong Quan; Jian Tan 001 (INFOCOM, 2018)

LRU Caching with Dependent Competing Requests. - Guocong Quan; Kaiyi Ji; Jian Tan 001 (INFOCOM, 2018)

On Resource Pooling and Separation for LRU Caching. - Jian Tan 001; Guocong Quan; Kaiyi Ji; Ness B. Shroff (Proc. ACM Meas. Anal. Comput. Syst., 2018)

A New Flexible Multi-flow LRU Cache Management Paradigm for Minimizing Misses. - Guocong Quan; Jian Tan 001; Atilla Eryilmaz; Ness B. Shroff (Proc. ACM Meas. Anal. Comput. Syst., 2019)

Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels. - Guocong Quan; Jian Tan 001; Atilla Eryilmaz (IEEE/ACM Trans. Netw., 2020)

Prefetching and caching for minimizing service costs: Optimal and approximation strategies. - Guocong Quan; Atilla Eryilmaz; Jian Tan 001; Ness B. Shroff (Perform. Evaluation, 2021)

Regret-Optimal Learning for Minimizing Edge Caching Service Costs. - Guocong Quan; Atilla Eryilmaz; Ness B. Shroff (WiOpt, 2022)

Optimal Edge Caching for Individualized Demand Dynamics. - Guocong Quan; Atilla Eryilmaz; Ness B. Shroff (IEEE/ACM Trans. Netw., 2024)

Minimizing Edge Caching Service Costs Through Regret-Optimal Online Learning. - Guocong Quan; Atilla Eryilmaz; Ness B. Shroff (IEEE/ACM Trans. Netw., 2024)