default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuocong Quan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Guocong Quan
, Atilla Eryilmaz, Ness B. Shroff:
Optimal Edge Caching for Individualized Demand Dynamics. IEEE/ACM Trans. Netw. 32(4): 2826-2841 (2024)- [j6]Guocong Quan, Atilla Eryilmaz, Ness B. Shroff:
Minimizing Edge Caching Service Costs Through Regret-Optimal Online Learning. IEEE/ACM Trans. Netw. 32(5): 4349-4364 (2024) - 2023
- [i3]Guocong Quan, Atilla Eryilmaz, Ness B. Shroff:
Optimal Edge Caching For Individualized Demand Dynamics. CoRR abs/2310.14631 (2023) - 2022
- [c6]Guocong Quan, Atilla Eryilmaz, Ness B. Shroff:
Regret-Optimal Learning for Minimizing Edge Caching Service Costs. WiOpt 2022: 105-112 - 2021
- [j5]Guocong Quan, Atilla Eryilmaz, Jian Tan, Ness B. Shroff:
Prefetching and caching for minimizing service costs: Optimal and approximation strategies. Perform. Evaluation 145: 102149 (2021) - 2020
- [j4]Guocong Quan, Atilla Eryilmaz, Jian Tan, Ness B. Shroff:
Prefetching and Caching for Minimizing Service Costs: Optimal and Approximation Strategies. SIGMETRICS Perform. Evaluation Rev. 48(3): 77-78 (2020) - [j3]Guocong Quan, Jian Tan, Atilla Eryilmaz:
Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels. IEEE/ACM Trans. Netw. 28(6): 2461-2474 (2020)
2010 – 2019
- 2019
- [j2]Guocong Quan, Jian Tan, Atilla Eryilmaz, Ness B. Shroff:
A New Flexible Multi-flow LRU Cache Management Paradigm for Minimizing Misses. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 39:1-39:30 (2019) - [c5]Guocong Quan, Jian Tan, Atilla Eryilmaz:
Counterintuitive Characteristics of Optimal Distributed LRU Caching Over Unreliable Channels. INFOCOM 2019: 694-702 - [c4]Guocong Quan, Jian Tan, Atilla Eryilmaz, Ness B. Shroff:
A New Flexible Multi-flow LRU Cache Management Paradigm for Minimizing Misses. SIGMETRICS (Abstracts) 2019: 49-50 - 2018
- [j1]Jian Tan, Guocong Quan, Kaiyi Ji, Ness B. Shroff:
On Resource Pooling and Separation for LRU Caching. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 5:1-5:31 (2018) - [c3]Kaiyi Ji, Guocong Quan, Jian Tan:
Asymptotic Miss Ratio of LRU Caching with Consistent Hashing. INFOCOM 2018: 450-458 - [c2]Guocong Quan, Kaiyi Ji, Jian Tan:
LRU Caching with Dependent Competing Requests. INFOCOM 2018: 459-467 - [c1]Jian Tan, Guocong Quan, Kaiyi Ji, Ness B. Shroff:
On Resource Pooling and Separation for LRU Caching. SIGMETRICS (Abstracts) 2018: 27 - [i2]Kaiyi Ji, Guocong Quan, Jian Tan:
Asymptotic Miss Ratio of LRU Caching with Consistent Hashing. CoRR abs/1801.02436 (2018) - 2017
- [i1]Jian Tan, Guocong Quan, Kaiyi Ji, Ness B. Shroff:
On Resource Pooling and Separation for LRU Caching. CoRR abs/1708.01673 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
