Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments
IEEE Transactions on Computers
On semantic caching and query scheduling for mobile nearest-neighbor search
Wireless Networks - Special issue: Pervasive computing and communications
Interactive wifi connectivity for moving vehicles
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
A Telematics Service System Based on the Linux Cluster
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Predictive methods for improved vehicular WiFi access
Proceedings of the 7th international conference on Mobile systems, applications, and services
Design of a Cache Management Scheme for Gateways on the Vehicular Telematics Network
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part I
A hybrid prefetch policy for the retrieval of link-associated information on vehicular networks
Proceedings of the 2010 ACM Symposium on Applied Computing
Hi-index | 0.01 |
This paper measures and analyzes the performance of the hybrid prefetch scheme for gateways on the vehicular telematics network where every information is indexed by the link (street) ID, via simulation using a discrete event simulator. Combining the classic LRU and FAR techniques, the hybrid scheme groups links according to whether they are referenced during the given time interval or not, orders by the Euclidean distance in each group, and fetches the referenced set first. The exensive experiment results demonstrate that 1) the hybrid scheme can improve the request-level instant reply ratio by up to 20.3 %, overcoming 20 % loss of record-level hit ratio, compared with LRU, 2) this scheme outperforms other spatial-locality-based schemes at all satisfiability ranges and LRU when the satisfiability is above 0.8, also showing stable reply ratio for the practical time tolerance range, 3) it quickly stablizes after the prefetch memory initialization and is less affected by the hourly data access pattern change, maintaining steady instant reply ratio for the number of records in each request.