Invalidation Report Scalability of Cache Access Mechanisms in Future Multiple-Cell Wireless Internet

In this paper, we carry out a comprehensive study to compare invalidation report (IR) to three other cache access algorithms, including poll-each-read (PER), call-back (CB), and lease schemes in future multiple cell wireless Internet. The purpose of this study is to study scalability of IR schemes. To the best of our knowledge, this is the first such study. We focus on the scalability issue of these four fundamental strong-consistent schemes in terms of network transmission costs regarding network size, database size, subscription ratio, and network traffic through extensive computer simulations. Our results show that: 1) the IR schemes do not perform well in multiple-cell wireless Internet with a large update rate, database size, and IR window size, and with a small subscription density; 2) the IR schemes do scale up well with the IR period and the access rate; however, good performance can be obtained when the IR period is large, which implies a large access latency; 3) the PER CB and the lease schemes perform well with a large update rate, small subscription ratio, and large database size.