摘要
Web services serve as the cornerstone of the Internet for rendering webpages. The initial rendering latency of webpages, which depends on a subset of critical objects required by the webpage, is a key metric for web services. In this work, we propose to identify this set of critical objects systematically with the goal of caching them at a higher priority to reduce the initial rendering time. We first conduct a measurement study on a mainstream content delivery network provider, the results of which suggest that not all currently cached objects are critical and that only a small portion of the critical objects are cached. Thus, we model the critical-object aware caching scheme as a constrained optimization problem. Using the stochastic optimization framework, we decompose the problem into a set of one-shot optimization problems, which are proved to be NP-hard. We then develop two greedy algorithms with different computational complexity but the same performance bound. Finally, we integrate the resulting approximation algorithms into an online algorithm. Through trace-based simulations, we verify that our proposed algorithm can reduce service latency and network traffic by ensuring a higher cache hit ratio.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 1864-1875 |
| 页数 | 12 |
| 期刊 | IEEE Transactions on Multimedia |
| 卷 | 20 |
| 期 | 7 |
| DOI | |
| 出版状态 | 已出版 - 7月 2018 |
| 已对外发布 | 是 |
学术指纹
探究 'Toward Rendering-Latency Reduction for Composable Web Services via Priority-Based Object Caching' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver