Per-User Checkpointing for Mobility Database Failure Restoration
IEEE Transactions on Mobile Computing
Strongly consistent access algorithms for wireless data networks
Wireless Networks
On-Bound Selection Cache Replacement Policy for Wireless Data Access
IEEE Transactions on Computers
Detecting diseases in farm animals with embedded system
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Scalability study of cache access mechanisms in multiple-cell wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A weakly consistent scheme for IMS presence service
IEEE Transactions on Wireless Communications
Competitive wireless access for data streaming over vehicle-to-roadside communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Cooperative wireless data access algorithms in multi-radio wireless networks
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Journal of Parallel and Distributed Computing
SPR proxy mechanism for 3GPP Policy and Charging Control System
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cache invalidation strategies for Internet-based vehicular ad hoc networks
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
An update-based step-wise optimal cache replacement for wireless data access
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gossip-based cooperative caching for mobile applications in mobile wireless networks
Journal of Parallel and Distributed Computing
User-defined consistency sensitive cache invalidation strategies for wireless data access
Computer Communications
| Hi-index | 0.01 |
In wireless data transmission, the capacity of wireless links is typically limited. Since many applications exhibit temporal locality for data access, the cache mechanism can be built in a wireless terminal to effectively reduce the data access time. This paper studies the cache performance of the wireless terminal by considering a business-card application. We investigate the least-recently used replacement policy and two strongly consistent data access algorithms called poll-each-read and callback. An analytic model is proposed to derive the effective hit ratio of data access, which is used to validate against simulation experiments. Our study reports how the data access rate and the data update distribution affect the cache performance in a wireless terminal.