Popularity prediction caching based on logistic regression in vehicular content centric networks. (6th October 2020)

• Record Type: Journal Article
• Authors: Yao, Kai; Li, Zhaoyang; Yao, Lin; Lang, Kuijun
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 35:Number 3(2020)
• Page Start: 150
• Page End: 161
• Publication Date: 2020-10-06
• Subjects: vehicular content centric network -- VCCN -- cache policy -- logistic regression -- popularity prediction; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

Abstract

To improve the network performance caused by mobility and sporadic connectivity in the vehicular network, vehicular content centric network (VCCN) is proposed by applying CCN into the vehicular network. The open in-network caching of CCN makes nodes cache contents cooperatively to facilitate information access. To improve the network performance such as access delay and hit ratio, road side units (RSUs) should try to cache more popular contents and provide better service for mobile users. This paper aims to propose a novel cache replacement policy - popularity prediction content caching (PPCC) for VCCN. In PPCC, we incorporate the future popularity of contents into our decision making. By learning the popularity of contents, we propose a cache replacement method based on logistic regression for RSUs in order to store those frequently access contents. The input data are related to the inherent characters of the received interests and the output is the predicted content popularity which guarantees that only popular contents are cached in the network infrastructures (i.e., RSUs). Simulation evaluations demonstrate that our scheme is very effective with higher cache hit, lower access latency and higher caching efficiency compared to other state-of-the-art schemes.