Author
Listed:
- Carlos Gómez-Pantoja
(Departamento de Ciencias de la Ingeniería, Facultad de Ingeniería, Universidad Andres Bello, Antonio Varas 880, Santiago 7500735, Chile)
- Daniela Baeza-Rocha
(Departamento de Ciencias de la Ingeniería, Facultad de Ingeniería, Universidad Andres Bello, Antonio Varas 880, Santiago 7500735, Chile)
- Alonso Inostrosa-Psijas
(Escuela de Ingeniería Informática, Facultad de Ingeniería, Universidad de Valparaíso, General Cruz 222, Valparaíso 2362905, Chile)
Abstract
This work proposes a behavior-aware caching architecture that improves cache hit rates by up to 10.8% over LRU and 36% over LFU in large-scale web applications, reducing redundant traffic and alleviating backend server load. The architecture partitions the cache into three sections—static, dynamic, and burst—according to query reuse patterns derived from user behavior. Static queries remain permanently stored, dynamic queries have time-bound validity, and burst queries are detected in real time using a statistical monitoring mechanism to prioritize sudden, high-demand requests. The proposed architecture was evaluated through simulation experiments using real-world query logs (a one-month trace of 1.5 billion queries from a commercial search engine) under multiple cache capacity configurations ranging from 1000 to 100,000 entries and in combination with the Least Recently Used (LRU) and Least Frequently Used (LFU) replacement policies. The results show that the proposed architecture consistently achieves higher performance than the baselines, with the largest relative gains in smaller cache configurations and applicability to distributed and hybrid caching environments without fundamental design changes. The integration of user-behavior modeling and burst-aware segmentation delivers a practical and reproducible framework that optimizes cache allocation policies in high-traffic and distributed environments.
Suggested Citation
Carlos Gómez-Pantoja & Daniela Baeza-Rocha & Alonso Inostrosa-Psijas, 2025.
"A Behavior-Aware Caching Architecture for Web Applications Using Static, Dynamic, and Burst Segmentation,"
Future Internet, MDPI, vol. 17(9), pages 1-18, September.
Handle:
RePEc:gam:jftint:v:17:y:2025:i:9:p:429-:d:1754013
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:17:y:2025:i:9:p:429-:d:1754013. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.