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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Lee, J., Park, G. L., Hong, Y., Shin, I. H., & Lee, S. J. (2010). Performance measurement of the hybrid prefetch scheme on vehicular telematics networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6018 LNCS, pp. 52–62). Springer Verlag. https://doi.org/10.1007/978-3-642-12179-1_6
Mendeley helps you to discover research relevant for your work.