Mathematical modelling approach in web cache scheme

Abstract

A scalable website garantee future information system by supporting additional users .Web caching has been proven to be a highly efficient method in reducing the network bandwidth consumption, as well as improving website scalability. In a web cache placement strategy, an important issue is to utilize the available resources by performing a cache placement to achieve the desirable scalability. The current study has tried to explore the scalability improvement strategies by taking advantage from the distributed cache placement technique.A Finite Series Model (FSM) was introduced to analyze the hit ratio saving resulted from the copies made in the cache for the requested objects. By using this model, the scalability problem can be formulated as a function of the object requests that hit the server successfully.This study also proved that the hit ratio for a single object on the origin server along adopted cache schemes follows the finite series functions. As a result, it was possible to achieve the mathematical solution by using such series.

Using Finite Series Model (FSM) and cache techniques for estimating scalability level

“…there are some other study that focused on minimized access cost in order to utilize certain cache techniques [17] The presented method uses Finite Series models enabling estimation of the client's requests in presence of cache techniques. The models were previously applied in the hit ratio estimation perceived by original server in the clusters [18].There are also other papers estimating client's request response time [19] It should be remembered that prior model just described probability of the object being hit which only can support a certain level of clients. Instead, the current model can extract the hit size received by an object to predict middle server or cluster size.…”