A Recommended Replacement Algorithm for the Scalable Asynchronous Cache Consistency Scheme

LAUR Repository

Show simple item record

dc.contributor.author Haraty, Ramzi A.
dc.contributor.author Nahas, Lama Hasan
dc.contributor.editor Kim, Kuinam J.
dc.contributor.editor Kim, Hyuncheol
dc.contributor.editor Baek, Nakhoon
dc.date.accessioned 2018-02-23T13:33:00Z
dc.date.available 2018-02-23T13:33:00Z
dc.date.copyright 2018 en_US
dc.date.issued 2018-02-23
dc.identifier.isbn 9789811064517 en_US
dc.identifier.uri http://hdl.handle.net/10725/7121
dc.description.abstract Acknowledging the widespread prevalence of mobile computing and the prominence of data caching in mobile networks has led to a myriad of efforts to alleviate their associated problems. These challenges are inherited from the mobile environment because of low bandwidth, limited battery power, and mobile disconnectedness. Many caching techniques were presented in literature; however, Scalable Asynchronous Cache Consistency Scheme (SACCS) that proved to be highly scalable with minimum database management overhead. SACCS was initially implemented with Least Recently Used (LRU) as a cache replacement policy. In this project we adopted the Extended LRU (E-LRU) as a cache replacement strategy to be applied in SACCS. A simulation of SACCS was done with the E-LRU, Least Recently Used, Most Recently Used, Most Frequently Used, and Least Frequently Used; and the comparative evaluation showed that SACCS with E-LRU is superior in terms of delay time, hit ratio, miss ratio and data downloaded per query. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Engineering -- Congresses en_US
dc.subject Computer security -- Congresses en_US
dc.subject Computational intelligence -- Congresses en_US
dc.subject Electrical engineering -- Congresses en_US
dc.title A Recommended Replacement Algorithm for the Scalable Asynchronous Cache Consistency Scheme en_US
dc.type Conference Paper / Proceeding en_US
dc.author.school SAS en_US
dc.author.idnumber 199729410 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.publication.place Singapore en_US
dc.keywords Mobile computing en_US
dc.keywords Cache consistency en_US
dc.keywords Replacement policy en_US
dc.keywords Invalidation strategy en_US
dc.keywords Hybrid algorithms en_US
dc.description.bibliographiccitations Includes bibliographical references. en_US
dc.identifier.doi https://doi.org/10.1007/978-981-10-6451-7_11 en_US
dc.identifier.ctation Haraty, R. A., & Nahas, L. H. (2018). A Recommended Replacement Algorithm for the Scalable Asynchronous Cache Consistency Scheme. In IT Convergence and Security 2017 (pp. 88-96). Springer, Singapore. en_US
dc.author.email rharaty@lau.edu.lb en_US
dc.conference.date 2017 en_US
dc.conference.pages 88-96 en_US
dc.conference.place Seoul, Korea en_US
dc.conference.title IT Convergence and Security 2017 en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://link.springer.com/chapter/10.1007/978-981-10-6451-7_11 en_US
dc.orcid.id https://orcid.org/0000-0002-6978-3627 en_US
dc.publication.date 2018 en_US
dc.volume 1 en_US
dc.author.affiliation Lebanese American University en_US
dc.relation.numberofseries 449 en_US
dc.title.volume Lecture notes in electrical engineering en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account