With the rapid development of networks,users are increasingly seeking richer and high-quality content experience,and there is an urgent need to develop efficient content caching strategies to improve the content distr...With the rapid development of networks,users are increasingly seeking richer and high-quality content experience,and there is an urgent need to develop efficient content caching strategies to improve the content distribution efficiency of caching.Therefore,it will be an effective solution to combine content popularity prediction based on machine learning(ML)and content caching to enable the network to predict and analyze popular content.However,the data sets which contain users’private data cause the risk of privacy leakage.In this paper,to address this challenge,we propose a privacy-preserving algorithm based on federated learning(FL)and long short-term memory(LSTM),which is referred to as FL-LSTM,to predict content popularity.Simulation results demonstrate that the performance of the proposed algorithm is close to the centralized LSTM and better than other benchmark algorithms in terms of privacy protection.Meanwhile,the caching policy in this paper raises about 14.3%of the content hit rate.展开更多
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 manageme...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 applications for content publishers,service providers, online advisers and network operators.展开更多
Information-Centric Networking(ICN), an alternative architecture to the current Internet infrastructure, focuses on the distribution and retrieval of content by employing caches in a network to reduce network traffic....Information-Centric Networking(ICN), an alternative architecture to the current Internet infrastructure, focuses on the distribution and retrieval of content by employing caches in a network to reduce network traffic. The employment of caches may be accomplished using graph-based and content-based criteria such as the position of a node in a network and content popularity. The contribution of this paper lies on the characterization of content popularity for on-path in-network caching. To this end, four dynamic approaches for identifying content popularity are evaluated via simulations. Content popularity may be determined per chunk or per object, calculated by the number of requests for a content against the sum of requests or the maximum number of requests. Based on the results, chunk-based approaches provide 23% more accurate content popularity calculations than object-based approaches. In addition, approaches that are based on the comparison of a content against the maximum number of requests have been shown to be more accurate than the alternatives.展开更多
Named Data Networking(NDN)is one of the most excellent future Internet architectures and every router in NDN has the capacity of caching contents passing by.It greatly reduces network traffic and improves the speed of...Named Data Networking(NDN)is one of the most excellent future Internet architectures and every router in NDN has the capacity of caching contents passing by.It greatly reduces network traffic and improves the speed of content distribution and retrieval.In order to make full use of the limited caching space in routers,it is an urgent challenge to make an efficient cache replacement policy.However,the existing cache replacement policies only consider very few factors that affect the cache performance.In this paper,we present a cache replacement policy based on multi-factors for NDN(CRPM),in which the content with the least cache value is evicted from the caching space.CRPM fully analyzes multi-factors that affect the caching performance,puts forward the corresponding calculation methods,and utilize the multi-factors to measure the cache value of contents.Furthermore,a new cache value function is constructed,which makes the content with high value be stored in the router as long as possible,so as to ensure the efficient use of cache resources.The simulation results show that CPRM can effectively improve cache hit ratio,enhance cache resource utilization,reduce energy consumption and decrease hit distance of content acquisition.展开更多
Given the large volume of video content and the diversity of user attention, it is of great importance to understand the characteristics of online video popularity for technological, economic and social reasons. In th...Given the large volume of video content and the diversity of user attention, it is of great importance to understand the characteristics of online video popularity for technological, economic and social reasons. In this paper, based on the data collected from a leading online video service provider in China, namely Youku, the dynamics of online video popularity are analyzed in-depth from four key aspects: overall popularity distribution, individual popularity distribution, popularity evolution pattern and early-future popularity relationship. How the popularity of a set of newly upload videos distributes throughout the observation period is first studied. Then the notion popularity distributions of individual videos are carefully studied. of active days is proposed, and the per-day and per-hour Next, how the popularity of an individual video evolves over time is investigated. The evolution patterns are further defined according to the number and temporal locations of popularity bursts, in order to describe the popularity growth trend. At last, the linear relationship between early video popularity and future video popularity are examined on a log-log scale. The relationship is found to be largely impacted by the popularity evolution patterns. Therefore, the specialized models are proposed to describe the correlation according to the popularity evolution patterns. Experiment results show that specialized models can better fit the correlation than a general model. Above all, the analysis results in our work can provide direct help in practical for the interested parties of online video service such as service providers, online advisers, and network operators.展开更多
With the rapid development of location-based networks, point-of-interest(POI) recommendation has become an important means to help people discover interesting and attractive locations, especially when users travel o...With the rapid development of location-based networks, point-of-interest(POI) recommendation has become an important means to help people discover interesting and attractive locations, especially when users travel out of town. However, because users only check-in interaction is highly sparse, which creates a big challenge for POI recommendation. To tackle this challenge, we propose a joint probabilistic generative model called geographical temporal social content popularity(GTSCP) to imitate user check-in activities in a process of decision making, which effectively integrates the geographical influence, temporal effect, social correlation, content information and popularity impact factors to overcome the data sparsity, especially for out-of-town users. Our proposed the GTSCP supports two recommendation scenarios in a joint model, i.e., home-town recommendation and out-of-town recommendation. Experimental results show that GTSCP achieves significantly superior recommendation quality compared to other state-of-the-art POI recommendation techniques.展开更多
基金This work is supported in part by the National Natural Science Founda⁃tion of China(NSFC)under Grant No.62001387in part by the Young Elite Scientists Sponsorship Program by the China Association for Science and Technology(CAST)under Grant No.2022QNRC001in part by Shanghai Academy of Spaceflight Technology(SAST)under Grant No.SAST2022052.
文摘With the rapid development of networks,users are increasingly seeking richer and high-quality content experience,and there is an urgent need to develop efficient content caching strategies to improve the content distribution efficiency of caching.Therefore,it will be an effective solution to combine content popularity prediction based on machine learning(ML)and content caching to enable the network to predict and analyze popular content.However,the data sets which contain users’private data cause the risk of privacy leakage.In this paper,to address this challenge,we propose a privacy-preserving algorithm based on federated learning(FL)and long short-term memory(LSTM),which is referred to as FL-LSTM,to predict content popularity.Simulation results demonstrate that the performance of the proposed algorithm is close to the centralized LSTM and better than other benchmark algorithms in terms of privacy protection.Meanwhile,the caching policy in this paper raises about 14.3%of the content hit rate.
文摘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 applications for content publishers,service providers, online advisers and network operators.
基金funded by the Higher Education Authority (HEA)co-funded under the European Regional Development Fund (ERDF)
文摘Information-Centric Networking(ICN), an alternative architecture to the current Internet infrastructure, focuses on the distribution and retrieval of content by employing caches in a network to reduce network traffic. The employment of caches may be accomplished using graph-based and content-based criteria such as the position of a node in a network and content popularity. The contribution of this paper lies on the characterization of content popularity for on-path in-network caching. To this end, four dynamic approaches for identifying content popularity are evaluated via simulations. Content popularity may be determined per chunk or per object, calculated by the number of requests for a content against the sum of requests or the maximum number of requests. Based on the results, chunk-based approaches provide 23% more accurate content popularity calculations than object-based approaches. In addition, approaches that are based on the comparison of a content against the maximum number of requests have been shown to be more accurate than the alternatives.
基金This research was funded by the National Natural Science Foundation of China(No.61862046)the Inner Mongolia Natural Science Foundation of China under Grant No.2018MS06024+2 种基金the Research Project of Higher Education School of Inner Mongolia Autonomous Region under Grant NJZY18010the Inner Mongolia Autonomous Region Science and Technology Achievements Transformation Project(No.CGZH2018124)the CERNET Innovation Project under Grant No.NGII20180626.
文摘Named Data Networking(NDN)is one of the most excellent future Internet architectures and every router in NDN has the capacity of caching contents passing by.It greatly reduces network traffic and improves the speed of content distribution and retrieval.In order to make full use of the limited caching space in routers,it is an urgent challenge to make an efficient cache replacement policy.However,the existing cache replacement policies only consider very few factors that affect the cache performance.In this paper,we present a cache replacement policy based on multi-factors for NDN(CRPM),in which the content with the least cache value is evicted from the caching space.CRPM fully analyzes multi-factors that affect the caching performance,puts forward the corresponding calculation methods,and utilize the multi-factors to measure the cache value of contents.Furthermore,a new cache value function is constructed,which makes the content with high value be stored in the router as long as possible,so as to ensure the efficient use of cache resources.The simulation results show that CPRM can effectively improve cache hit ratio,enhance cache resource utilization,reduce energy consumption and decrease hit distance of content acquisition.
基金supported by the Video Super-Resolution Reconstruction Project (20130005110017)
文摘Given the large volume of video content and the diversity of user attention, it is of great importance to understand the characteristics of online video popularity for technological, economic and social reasons. In this paper, based on the data collected from a leading online video service provider in China, namely Youku, the dynamics of online video popularity are analyzed in-depth from four key aspects: overall popularity distribution, individual popularity distribution, popularity evolution pattern and early-future popularity relationship. How the popularity of a set of newly upload videos distributes throughout the observation period is first studied. Then the notion popularity distributions of individual videos are carefully studied. of active days is proposed, and the per-day and per-hour Next, how the popularity of an individual video evolves over time is investigated. The evolution patterns are further defined according to the number and temporal locations of popularity bursts, in order to describe the popularity growth trend. At last, the linear relationship between early video popularity and future video popularity are examined on a log-log scale. The relationship is found to be largely impacted by the popularity evolution patterns. Therefore, the specialized models are proposed to describe the correlation according to the popularity evolution patterns. Experiment results show that specialized models can better fit the correlation than a general model. Above all, the analysis results in our work can provide direct help in practical for the interested parties of online video service such as service providers, online advisers, and network operators.
基金supported by the National Key Project of Scientific and Technical Supporting Programs of China(2014BAK15B01)
文摘With the rapid development of location-based networks, point-of-interest(POI) recommendation has become an important means to help people discover interesting and attractive locations, especially when users travel out of town. However, because users only check-in interaction is highly sparse, which creates a big challenge for POI recommendation. To tackle this challenge, we propose a joint probabilistic generative model called geographical temporal social content popularity(GTSCP) to imitate user check-in activities in a process of decision making, which effectively integrates the geographical influence, temporal effect, social correlation, content information and popularity impact factors to overcome the data sparsity, especially for out-of-town users. Our proposed the GTSCP supports two recommendation scenarios in a joint model, i.e., home-town recommendation and out-of-town recommendation. Experimental results show that GTSCP achieves significantly superior recommendation quality compared to other state-of-the-art POI recommendation techniques.