Performance analysis methods for list-based caches with non-uniform access
- Submitting institution
-
Imperial College of Science, Technology and Medicine
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 5103
- Type
- D - Journal article
- DOI
-
10.1109/TNET.2020.3042869
- Title of journal
- IEEE ACM Transactions on Networking
- Article number
- -
- First page
- 1
- Volume
- 2020
- Issue
- 12
- ISSN
- 1063-6692
- Open access status
- Compliant
- Month of publication
- December
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- First use of singular perturbation methods from geometric optics in performance analysis of cache replacement policies, yielding asymptotic solutions. Extension of Best in Session Presentation INFOCOM’18 paper, (https://ieeexplore.ieee.org/document/8485894, acceptance rate 19%/1606). The work led to collaboration with Nicola Gast (INRIA Grenoble) to develop first analytical method to analyse cache replacement policies within queueing network models, and implemented within our royalty-free solver LINE (https://github.com/line-solver/line/wiki/Getting-started#example-6-a-queueing-network-with-caching)
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
