Content Popularity Prediction Research Articles

Joint User Access Mode Selection and Content Popularity Prediction in Non-Orthogonal Multiple Access-Based F-RANs

Non-orthogonal multiple access (NOMA) is regarded as a promising technology for the next-generation wireless communication system. Introducing NOMA into the fog radio access networks (F-RANs) is able to provide simultaneous transmissions to multiple users and significantly enhance F-RAN performance. However, due to the increasing number of users and the constraint of caching storage capacity, there exists a tradeoff between NOMA transmission performance and fronthaul saving. In this paper, a hierarchical game framework is presented to solve the joint optimization problem of user access mode selection and content popularity prediction in NOMA based F-RANs. More specifically, the access mode selection problem is formulated as an evolutionary game. The proposals’ evolutionary payoff expressions are derived by stochastic geometry tool, and the cost functions are related to the fog access point (F-AP) content placement profile as well as the fronthaul constraint. Moreover, the problem of what contents the F-AP should cache is modeled as a content popularity prediction problem, and based on both local and global user request states, a machine learning algorithm is presented to solve it. Simulation results validate the accuracy of analytical results and demonstrate our proposed algorithms can further improve the performance of NOMA based F-RANs.

Cooperative Caching with Content Popularity Prediction for Mobile Edge Caching

Cooperative Caching with Content Popularity Prediction for Mobile Edge Caching

Predicting popularity via a generative model with adaptive peeking window

Predicting the popularity of online content is an important issue for uncovering rules governing collective human behaviors in networks. Also, content popularity prediction finds application in an array of areas. In this paper, we propose a generative approach using a Hawkes process, the purpose of which is to predict the eventual popularity of online content from the observed initial period of the information cascade. Our approach is distinguished from existing approaches via its ability to explore an adaptive peeking window and its added remarkable predictive power that was inherited from the feature-driven method. Further, we proposed a procedure for exploring an adaptive peeking window, which allows us to answer the question, “How can we obtain the most effective part of the history to make an accurate prediction?” And the added predictive layer bridges the gap between the generative method and the feature-driven method. Empirical studies on real world datasets demonstrate that the proposed method significantly outperformed the existing approaches.

User Preference Learning-Based Edge Caching for Fog Radio Access Network

In this paper, the edge caching problem in fog radio access network (F-RAN) is investigated. By maximizing the overall cache hit rate, the edge caching optimization problem is formulated to find the optimal policy. Content popularity in terms of time and space is considered from the perspective of regional users. We propose an online content popularity prediction algorithm by leveraging the content features and user preferences, and an offline user preference learning algorithm by using the online gradient descent (OGD) method and the follow the (proximally) regularized leader (FTRL-Proximal) method. Our proposed edge caching policy not only can promptly predict the future content popularity in an online fashion with low complexity, but also can track the content popularity with spatial and temporal popularity dynamic in time without delay. Furthermore, we design two learning-based edge caching architectures. Moreover, we theoretically derive the upper bound of the popularity prediction error, the lower bound of the cache hit rate, and the regret bound of the overall cache hit rate of our proposed edge caching policy. Simulation results show that the overall cache hit rate of our proposed policy is superior to those of the traditional policies and asymptotically approaches the optimal performance.

Deep Q-Learning-Based Content Caching With Update Strategy for Fog Radio Access Networks

In order to improve the edge caching efficiency of the fog radio access network (F-RAN), this paper put forward a distributed deep Q-learning-based content caching scheme based on user preference prediction and content popularity prediction. Given that the constraint that the storage capacity of each device is limited, and the optimization problem is formulated so as to maximize the caching hit rate. Specifically, by taking users’ selfishness into consideration, user preference is predicted in an offline manner by applying popular topic models. Then, the online predicted content popularity is achieved by combining the network topology relationship together with the obtained user preference. Finally, with the predicted user preference and content popularity, the deep Q-learning network (DQN)-based content caching algorithm is proposed to achieve the optimal content caching strategy. Moreover, we further present a content update policy with user preference and content popularity prediction, so that the proposed algorithm can handle the variations of contents popularity in a timely manner. Simulation results demonstrate that the proposed scheme achieves better caching hit rate compared with existing algorithms.

A Novel Content Popularity Prediction Algorithm Based on Auto Regressive Model in Information-Centric IoT

As information-centric networking (ICN) cache can effectively reduce the requests from customers to producers and improve the efficiency of content acquisition, there are many studies propose to improve system performance of the Internet of Things (IoT) by using the concept of the ICN. In the context of information-centric IoT, the addressing location based on content names and routing transport mechanisms, which presents a high demand for the statistics and prediction of the content popularity. To improve the accuracy of the content popularity prediction, in this paper, we demonstrate a particular analysis of the content popularity and propose a content popularity prediction algorithm based on auto-regressive (AR) model. The algorithm derives regression parameters based on least-squares estimates and predicts future trends of the content popularity through combining various known values in a certain period. The evaluation results show that the proposed algorithm can accurately predict the content popularity of the next time period in information-centric IoT. As a result, the algorithm can increase the cache hit rate in routers, and reduce the network traffic and service access delay effectively to improve the experience of users in various scenarios such as real-time streaming media services.

Content Popularity Prediction and Caching for ICN: A Deep Learning Approach With SDN

In information-centric networking, accurately predicting content popularity can improve the performance of caching. Therefore, based on software defined network (SDN), this paper proposes Deep-Learning-based Content Popularity Prediction (DLCPP) to achieve the popularity prediction. DLCPP adopts the switch’s computing resources and links in the SDN to build a distributed and reconfigurable deep learning network. For DLCPP, we initially determine the metrics that can reflect changes in content popularity. Second, each network node collects the spatial-temporal joint distribution data of these metrics. Then, the data are used as input to stacked auto-encoders (SAE) in DLCPP to extract the spatiotemporal features of popularity. Finally, we transform the popularity prediction into a multi-classification problem through discretizing the content popularity into multiple classifications. The Softmax classifier is used to achieve the content popularity prediction. Some challenges for DLCPP are also addressed, such as determining the structure of SAE, realizing the neuron function on an SDN switch, and deploying DLCPP on an OpenFlow-based SDN. At the same time, we propose a lightweight caching scheme that integrates cache placement and cache replacement—caching based on popularity prediction and cache capacity (CPC). Abundant experiments demonstrate good performance of DLCPP, and it achieves close to 2.1%~15% and 5.2%~40% accuracy improvements over neural networks and auto regressive, respectively. Benefitting from DLCPP’s better prediction accuracy, CPC can yield a steady improvement of caching performance over other dominant cache management frameworks.

On the Measurement and Prediction of Web Content Utility

Nowadays, various types and large amount of content are available on the Web. Characterizing the Web content and predicting its inherent usefulness become important problems that may benefit many applications such as information filtering and content recommendation. In this article, we present a brief review of the existing measurements and the corresponding prediction methods for Web content utility. Specially, we focus on three close and widely studied tasks, i.e., content popularity prediction, content quality prediction, and scientific article impact prediction. While reviewing the existing work in each of the above three tasks, we mainly aim to answer the following two fundamental questions: how to measure the Web content utility, and how to make the predictions under the measurement. We find that while the three tasks are closely related, they bear subtle differences in terms of prediction urgency, feature extraction, and algorithm design. After that, we discuss some future directions in measuring and predicting Web content utility

Beyond 1 Million Nodes: A Crowdsourced Video Content Delivery Network

To deliver video traffic with guaranteed quality of experience, providers have been deploying content delivery networks (CDNs) closer to users. CDN providers are also starting to use the storage and network resources of edge network devices for content delivery - that is, crowdsourced CDN. This article envisions a crowdsourced CDN and proposes a set of practical strategies to guide the implementation of this new paradigm. The authors perform a large-scale measurement to explore the popularity of geocontent. They then design solutions for the system's operation, including regional content popularity prediction, region partition, and collaborative content replication. In addition, they propose an auction mechanism to cope with resource competition among multiple content providers, and they demonstrate the performance gain of the design using data-driven simulation.

Analysis and prediction of content popularity for online video service: a Youku case study

Understanding the characteristics and predicting the popularity of the newly published online videos can provide direct implications in various contexts such as service design, advertisement planning, network management and etc. In this paper, we collect a real-world large-scale dataset from a leading online video service provider in China, namely Youku. We first analyze the dynamics of content publication and content popularity for the online video service. Then, we propose a rich set of features and exploit various effective classification methods to estimate the future popularity level of an individual video in various scenarios. We show that the future popularity level of a video can be predicted even before the video's release, and by introducing the historical popularity information the prediction performance can be improved dramatically. In addition, we investigate the importance of each feature group and each feature in the popularity prediction, and further reveal the factors that may impact the video popularity. We also discuss how the early monitoring period influences the popularity level prediction. Our work provides an insight into the popularity of the newly published online videos, and demonstrates promising practical application for content publishers, service providers, online advisers and network operators.

A survey on predicting the popularity of web content

Social media platforms have democratized the process of web content creation allowing mere consumers to become creators and distributors of content. But this has also contributed to an explosive growth of information and has intensified the online competition for users attention, since only a small number of items become popular while the rest remain unknown. Understanding what makes one item more popular than another, observing its popularity dynamics, and being able to predict its popularity has thus attracted a lot of interest in the past few years. Predicting the popularity of web content is useful in many areas such as network dimensioning (e.g., caching and replication), online marketing (e.g., recommendation systems and media advertising), or real-world outcome prediction (e.g., economical trends). In this survey, we review the current findings on web content popularity prediction. We describe the different popularity prediction models, present the features that have shown good predictive capabilities, and reveal factors known to influence web content popularity.

From popularity prediction to ranking online news

News articles are an engaging type of online content that captures the attention of a significant amount of Internet users. They are particularly enjoyed by mobile users and massively spread through online social platforms. As a result, there is an increased interest in discovering the articles that will become popular among users. This objective falls under the broad scope of content popularity prediction and has direct implications in the development of new services for online advertisement and content distribution. In this paper, we address the problem of predicting the popularity of news articles based on user comments. We formulate the prediction task as a ranking problem, where the goal is not to infer the precise attention that a content will receive but to accurately rank articles based on their predicted popularity. Using data obtained from two important news sites in France and Netherlands, we analyze the ranking effectiveness of two prediction models. Our results indicate that popularity prediction methods are adequate solutions for this ranking task and could be considered as a valuable alternative for automatic online news ranking.