Cited 0 time in
Cited 1 time in
Towards Multi-metric Cache Replacement Policies in Vehicular Named Data Networks
- Towards Multi-metric Cache Replacement Policies in Vehicular Named Data Networks
- Ostrovskaya, S.; Surnin, O.; Hussain, R.; Bouk, Safdar Hussain; Lee, J.; Mehran, N.; Ahmed, S.H.; Benslimane, A.
- Issue Date
- 29th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2018
- Vehicular Named Data Network (VNDN) uses NDN as an underlying communication paradigm to realize intelligent transportation system applications. Content communication is the essence of NDN, which is primarily carried out through content naming, forwarding, intrinsic content security, and most importantly the in-network caching. In vehicular networks, vehicles on the road communicate with other vehicles and/or infrastructure network elements to provide passengers a reliable, efficient, and infotainment-rich commute experience. Recently, different aspects of NDN have been investigated in vehicular networks and in vehicular social networks (VSN); however, in this paper, we investigate the in-network caching, realized in NDN through the content store (CS) data structure. As the stale contents in CS do not just occupy cache space, but also decrease the overall performance of NDN-driven VANET and VSN applications, therefore the size of CS and the content lifetime in CS are primary issues in VNDN communications. To solve these issues, we propose a simple yet efficient multi-metric CS management mechanism through cache replacement (M2CRP). We consider the content popularity, relevance, freshness, and distance of a node to devise a set of algorithms for selection of the content to be replaced in CS in the case of replacement requirement. Simulation results show that our multi-metric strategy outperforms the existing cache replacement mechanisms in terms of Hit Ratio. © 2018 IEEE.
- Institute of Electrical and Electronics Engineers Inc.
There are no files associated with this item.
- ETC2. Conference Papers
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.