CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A Timestamp based Novel Caching Mechanism for Distributed Web Systems

by Jay Parekh, Apurv Moroney, Lavina Golani, Radha Shankarmani
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 175 - Number 19
Year of Publication: 2020
Authors: Jay Parekh, Apurv Moroney, Lavina Golani, Radha Shankarmani
10.5120/ijca2020920718

Jay Parekh, Apurv Moroney, Lavina Golani, Radha Shankarmani . A Timestamp based Novel Caching Mechanism for Distributed Web Systems. International Journal of Computer Applications. 175, 19 ( Sep 2020), 36-46. DOI=10.5120/ijca2020920718

@article{ 10.5120/ijca2020920718,
author = { Jay Parekh, Apurv Moroney, Lavina Golani, Radha Shankarmani },
title = { A Timestamp based Novel Caching Mechanism for Distributed Web Systems },
journal = { International Journal of Computer Applications },
issue_date = { Sep 2020 },
volume = { 175 },
number = { 19 },
month = { Sep },
year = { 2020 },
issn = { 0975-8887 },
pages = { 36-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume175/number19/31562-2020920718/ },
doi = { 10.5120/ijca2020920718 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:25:30.628025+05:30
%A Jay Parekh
%A Apurv Moroney
%A Lavina Golani
%A Radha Shankarmani
%T A Timestamp based Novel Caching Mechanism for Distributed Web Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 175
%N 19
%P 36-46
%D 2020
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Microservices are a loosely coupled distributed systems architecture. With the uncertainty in prediction of the size of the application, microservices play an important role in development and scaling. As they are independently functioning applications, difficulties in caching data becomes manifold. Caching in microservices is achieved either by maintaining a local cache with peer to peer communication, or a global cache with single store communication. However, multiple local caches come with communication overheads and data consistency issues, while a global cache has data management issues. This project attempts to find a combination of both to reduce the communication overheads and data size, while solving the problem of data consistency. Focus is to create a mechanism which uses both a global cache and a local cache. The global cache would act as a verification cache and the local cache would act as a data cache. This will minimize the size of the global cache and the communication call size. In comparison to the existing cache management techniques, this system will act as a middle ground. It inherits the low communication overheads from the global caching systems and also manages to keep the global cache size minimum by storing only verification data. The impact of this research topic is multi-faceted, not only in scaling web applications to a global scale but also in maintaining modular, data-consistent caches in a cluster of microservices. Another advantage of the proposed solution is that it can ameliorate the problem of bandwidth always falling short in high load applications

References
  1. J. Thones. “Microservices”. In: IEEE Software 32.1 (2015), pp. 116–116.
  2. Claus Pahl and Pooyan Jamshidi. “Microservices: A Systematic Mapping Study.” In: CLOSER (1). 2016, pp. 137–146.
  3. Nicola Dragoni et al. “Microservices: Yesterday, Today, and Tomorrow”. In: Present and Ulterior Software Engineering. Ed. by Manuel Mazzara and Bertrand Meyer. Cham: Springer International Publishing, 2017, pp. 195–216. ISBN: 978-3-319-67425-4. DOI: 10.1007/ 978-3-319-67425-4 12. URL: https://doi.org/10.1007/ 978-3-319-67425-4 12.
  4. Werner Vogels, Robbert van Renesse, and Ken Birman. “The Power of Epidemics: Robust Communication for Large-Scale Distributed Systems”. In: SIGCOMM Comput. Commun. Rev. 33.1 (Jan. 2003), pp. 131–135. ISSN: 0146-4833. DOI: 10.1145/774763.774784. URL: https: //doi.org/10.1145/774763.774784.
  5. Michael Rabinovich and Oliver Spatscheck. Web caching and replication. Vol. 67. Addison-Wesley Boston, USA, 2002.
  6. G. Barish and K. Obraczke. “World Wide Web caching: trends and techniques”. In: IEEE Communications Magazine 38.5 (2000), pp. 178–184.
  7. Pooja Kohli and Rada Chirkova. “Cache Invalidation and Update Propagation in Distributed Caches (extended abstract)”. In: (June 2010).
  8. Guohong Cao. “A scalable low-latency cache invalidation strategy for mobile environments”. In: IEEE Transactions on Knowledge and Data Engineering 15.5 (2003), pp. 1251–1265.
  9. A. Gupta and W. -. Weber. “Cache invalidation patterns in shared-memory multiprocessors”. In: IEEE Transactions on Computers 41.7 (1992), pp. 794–810.
  10. Baihua Zheng, Jianliang Xu, and D. L. Lee. “Cache invalidation and replacement strategies for locationdependent data in mobile environments”. In: IEEE Transactions on Computers 51.10 (2002), pp. 1141– 1153.
  11. Sadiye Alici et al. “Timestamp-Based Result Cache Invalidation for Web Search Engines”. In: Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval. SIGIR ’11. Beijing, China: Association for Computing Machinery, 2011, pp. 973–982. ISBN: 9781450307574. DOI: 10.1145/2009916.2010046. URL: https://doi.org/ 10.1145/2009916.2010046.
Index Terms

Computer Science
Information Sciences

Keywords

distributed systems caching microservices web applications web services

Powered by PhDFocusTM