Toward rendering-latency reduction for composable web services via priority-based object caching
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 systemat...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140197 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-140197 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1401972020-05-27T05:41:30Z Toward rendering-latency reduction for composable web services via priority-based object caching Hu, Han Li, Yuanlong Wen, Yonggang School of Computer Science and Engineering Engineering::Computer science and engineering Webpage Caching Submodular Function Maximization 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. MOE (Min. of Education, S’pore) 2020-05-27T05:41:29Z 2020-05-27T05:41:29Z 2017 Journal Article Hu, H., Li, Y., & Wen, Y. (2018). Toward rendering-latency reduction for composable web services via priority-based object caching. IEEE Transactions on Multimedia, 20(7), 1864-1875. doi:10.1109/TMM.2017.2779041 1520-9210 https://hdl.handle.net/10356/140197 10.1109/TMM.2017.2779041 2-s2.0-85036582204 7 20 1864 1875 en IEEE Transactions on Multimedia © 2017 IEEE. All rights reserved. |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Computer science and engineering Webpage Caching Submodular Function Maximization |
spellingShingle |
Engineering::Computer science and engineering Webpage Caching Submodular Function Maximization Hu, Han Li, Yuanlong Wen, Yonggang Toward rendering-latency reduction for composable web services via priority-based object caching |
description |
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. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Hu, Han Li, Yuanlong Wen, Yonggang |
format |
Article |
author |
Hu, Han Li, Yuanlong Wen, Yonggang |
author_sort |
Hu, Han |
title |
Toward rendering-latency reduction for composable web services via priority-based object caching |
title_short |
Toward rendering-latency reduction for composable web services via priority-based object caching |
title_full |
Toward rendering-latency reduction for composable web services via priority-based object caching |
title_fullStr |
Toward rendering-latency reduction for composable web services via priority-based object caching |
title_full_unstemmed |
Toward rendering-latency reduction for composable web services via priority-based object caching |
title_sort |
toward rendering-latency reduction for composable web services via priority-based object caching |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/140197 |
_version_ |
1681056700043362304 |