Online Tree Caching-Reference-Cited by-同舟云学术

Online Tree Caching

Published:2017-07-24 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Bienkowski Marcin¹,Marcinkowski Jan¹,Pacut Maciej¹,Schmid Stefan²,Spyra Aleksandra¹

Affiliation:

1. University of Wroclaw, Wroclaw, Poland

2. Aalborg University, Aalborg, Denmark

Funder

Polish National Science Centre

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3087556.3087558

Reference36 articles.

1. BGP Statistics from Route-Views Data. http://bgp.potaroo.net/bgprpts/rva-index.html. BGP Statistics from Route-Views Data. http://bgp.potaroo.net/bgprpts/rva-index.html.

2. Competitive analysis of randomized paging algorithms

3. Better Approximations for Tree Sparsity in Nearly-Linear Time

4. Randomized Competitive Algorithms for Generalized Caching

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Flow Table Caching Architecture and Replacement Policy for SDN Switches;Journal of Network and Systems Management;2024-06-18

2. Dependency-Aware Online Caching;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

3. Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing;ACM SIGMETRICS Performance Evaluation Review;2023-06-26

4. Go-to-Controller is Better: Efficient and Optimal LPM Caching with Splicing;Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems;2023-06-19

5. Self-Adjusting Partially Ordered Lists;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17