Abstract:
Caching was suggested as a solution for reducing bandwidth utilization and minimizing
query latency in mobile environments. Over the years, different caching approaches have
been proposed, some relying on the server to broadcast reports periodically informing of
the updated data while others allowed the clients to request for the data whenever needed.
Until recently a hybrid cache consistency scheme Scalable Asynchronous Cache
Consistency Scheme (SACCS) was proposed, which combined the two different
approaches benefits' and is proved to be more efficient and more scalable. Nevertheless,
caching has its limitations too, due to the limited cache size and the limited bandwidth,
which makes the implementation of cache replacement strategy an important aspect for
improving the cache consistency algorithms. In this thesis, we proposed a new cache
replacement strategy, the Least Unified Value strategy to replace the Least Recently Used
that SACCS was based on. This thesis studies the advantages and the drawbacks of the
new proposed strategy, comparing it with different categories of cache replacement
strategies.