Guocong Quan

Orcid: 0000-0001-8340-055X

According to our database1, Guocong Quan authored at least 9 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Minimizing Edge Caching Service Costs Through Regret-Optimal Online Learning.
IEEE/ACM Trans. Netw., October, 2024

Optimal Edge Caching for Individualized Demand Dynamics.
IEEE/ACM Trans. Netw., August, 2024

2022
Regret-Optimal Learning for Minimizing Edge Caching Service Costs.
Proceedings of the 20th International Symposium on Modeling and Optimization in Mobile, 2022

2021
Prefetching and caching for minimizing service costs: Optimal and approximation strategies.
Perform. Evaluation, 2021

2020
Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels.
IEEE/ACM Trans. Netw., 2020

2019
A New Flexible Multi-flow LRU Cache Management Paradigm for Minimizing Misses.
Proc. ACM Meas. Anal. Comput. Syst., 2019

2018
On Resource Pooling and Separation for LRU Caching.
Proc. ACM Meas. Anal. Comput. Syst., 2018

LRU Caching with Dependent Competing Requests.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

Asymptotic Miss Ratio of LRU Caching with Consistent Hashing.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018


  Loading...