Scalability study of cache access mechanisms in multiple-cell wireless networks
Strong-consistent cache access algorithms have been proposed and studied for wireless networks. In this paper, we carry out a comprehensive study to compare four strong-consistent cache access algorithms including the invalidation report (IR), poll-each-read (PER), call-back (CB), and Lease schemes in multiple-cell wireless/mobile networks. The purpose of this study is to examine the scalability of the 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 a multiple-cell wireless/mobile networks with a large update rate, database size, and IR window size, and with a small subscription ratio; (2) the IR schemes do scale up well with the IR period and the access rate; however, while good performance can be obtained when the IR period is large, this implies a large access latency; (3) the PER, the CB and the Lease schemes perform well with a large update rate, small subscription ratio, and large database size.