Cache policies for linear utility maximization
暂无分享,去创建一个
[1] Laurent Massoulié,et al. A Utility Optimization Approach to Network Cache Design , 2019, IEEE/ACM Transactions on Networking.
[2] Konstantina Papagiannaki,et al. Measurement-Based Self Organization of Interfering 802.11 Wireless Access Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[3] John N. Tsitsiklis,et al. Markov Chains with Rare Transitions and Simulated Annealing , 1989, Math. Oper. Res..
[4] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[5] Philippe Robert,et al. A versatile and accurate approximation for LRU cache performance , 2012, 2012 24th International Teletraffic Congress (ITC 24).
[6] Alhussein A. Abouzeid,et al. On designing optimal memory damage aware caching policies for content-centric networks , 2016, 2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).
[7] S. Albers. Competitive Online Algorithms , 1996 .
[8] M. Draief,et al. Placing dynamic content in caches with small population , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.
[9] Hao Che,et al. Hierarchical Web caching systems: modeling, design and experimental results , 2002, IEEE J. Sel. Areas Commun..
[10] John Odentrantz,et al. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.
[11] E. S. Page. CONTINUOUS INSPECTION SCHEMES , 1954 .
[12] Dennis Komm,et al. The online knapsack problem: Advice and randomization , 2014, Theor. Comput. Sci..
[13] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.
[14] Ken R. Duffy,et al. Modeling conservative updates in multi-hash approximate count sketches , 2012, 2012 24th International Teletraffic Congress (ITC 24).
[15] Pierre Granjon,et al. The CUSUM algorithm a small review , 2012 .
[16] Sandy Irani,et al. Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.
[17] Neal E. Young,et al. Online Paging and Caching , 2008, Encyclopedia of Algorithms.
[18] Mihaela van der Schaar,et al. Popularity-driven content caching , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.
[19] Valentino Pacifici,et al. Coordinated Selfish Distributed Caching for Peering Content-Centric Networks , 2016, IEEE/ACM Transactions on Networking.
[20] H. Young,et al. Individual Strategy and Social Structure: An Evolutionary Theory of Institutions , 1999 .
[21] Carra Damiano,et al. Access-Time Aware Cache Algorithms , 2016, International Test Conference.
[22] Michele Garetto,et al. A unified approach to the performance analysis of caching systems , 2013, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.
[23] Donald F. Towsley,et al. Performance evaluation of hierarchical TTL-based cache networks , 2014, Comput. Networks.
[24] Predrag R. Jelenkovic,et al. Optimizing LRU Caching for Variable Document Sizes , 2004, Combinatorics, Probability and Computing.
[25] Ronald Fagin,et al. Asymptotic Miss Ratios over Independent References , 1977, J. Comput. Syst. Sci..
[26] David Williams,et al. Probability with Martingales , 1991, Cambridge mathematical textbooks.
[27] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[28] Awi Federgruen,et al. Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods , 1987, Oper. Res..
[29] H. Young,et al. The Evolution of Conventions , 1993 .
[30] Neal E. Young,et al. On-Line File Caching , 2002, SODA '98.
[31] A. Federgruen,et al. Simulated annealing methods with general acceptance probabilities , 1987, Journal of Applied Probability.
[32] Dario Rossi,et al. Cost-Aware Caching: Caching More (Costly Items) for Less (ISPs Operational Expenditures) , 2016, IEEE Transactions on Parallel and Distributed Systems.
[33] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..