Design of a cache management scheme for gateways on the vehicular telematics network

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes and measures the performance of a cache management scheme for vehicular telematics network so as to provide an advanced route recommendation service, concentrating on gateways which relay information between a specific server and vehicles. As an enhanced version of pure FAR (Furthest Away Replacement), the proposed scheme 1) replaces Euclidean distance by network distance in estimating the distance to a data item, 2) binds each cache item to a link in the target road network, 3) introduces a directional weight to consider the directional tendency of current traffic flow, and finally 4) schedules the cache requests according to their angular locations to efficiently deal with the multiple pending requests. Simulation results, conducted using the real-life trajectory data obtained from a tracking system currently in operation, show that the proposed scheme can improve the cache hit ratio by up to 9.2 %, compared with FAR as well as that the proposed angle-based scheduling scheme can further improve the cache hit ratio by up to 2.3 %. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lee, J., Shin, I. H., Park, G. L., Kim, I. C., & Rhee, Y. J. (2009). Design of a cache management scheme for gateways on the vehicular telematics network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5592 LNCS, pp. 831–840). https://doi.org/10.1007/978-3-642-02454-2_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free