Adaptive probabilistic caching technique for caching networks with dynamic content popularity

Tarnoi, Saran; Kumwilaisak, Wuttipong; Suppakitpaisarn, Vorapong; Fukuda, Kensuke; Ji, Yusheng

doi:10.1016/j.comcom.2019.03.001

Cited by 11 publications

(8 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [19], a cached content locating scheme was proposed, which jointly used bloom filter and compressed sensing to maintain the information consistency with the help of Software-Defined Networking (SDN) controller. In [20], an adaptive probabilistic caching mechanism is explored to enable the caching system to quickly adjust the cached data to dynamic content popularity without intervention of network administrators and synchronization. In [21], a distributed cache placement scheme for large-scale CCN was proposed to push the popular contents to the edge network and keep the relatively less-popular contents at the core network.…”

Section: A Homogeneous Cache Allocationmentioning

confidence: 99%

See 1 more Smart Citation

Heterogeneous CCN Cache Allocation Strategy With Collaboration Support

Jiang

2021

IEEE Access

View full text Add to dashboard Cite

Content-Centric Networking (CCN) is regarded as a promising network architecture which has received the distinct interest from many global research communities thanks to its friendly structure, especially its caching technology has attracted the most widespread attention. However, the current caching strategies have some limitations, such as redundant content copies, low cache utilization rate and unbalanced node load. In order to further optimize cache, this paper investigates the classical cache allocation problem, i.e., distributing the cache capacity across some Content Routers (CRs) under a constrained and fixed total cache budget. At first, both topology information and traffic characteristics as two factors to determine the importance of CR, where the evaluation of network topology depends on degree centrality, betweenness centrality and closeness centrality while that of traffic characteristics depends on node load and interest preference. In particular, given the data redundancy due to the high-dimensional feature, increasing the complexity of computation, t-distributed Stochastic Neighbor Embedding (t-SNE) is used to reduce the dimensions of data. Then, for the CR with cache capacity, its Content Store (CS) is divided into collaborative region and non-collaborative region by a heuristic algorithm to facilitate the optimal performance, and the CS with collaboration needs to interact the cached information with its neighborhoods. Finally, the performance evaluation is driven by the real dataset over GTS-CE topology. The experimental results reveal that the proposed collaboration-supported cache allocation strategy is more efficient than two baselines, i.e., increasing cache hit ratio by 7.79%, increasing cache utilization rate by 11.31%, decreasing routing delay by 49.38% and decreasing load balance by 50.98%.

show abstract

Section: A Homogeneous Cache Allocationmentioning

confidence: 99%

“…According to (20), for the high-dimensional space, the joint probability distribution function on dpx i and dpx j is defined as:…”

Section: Dimensionality Reductionmentioning

confidence: 99%

Heterogeneous CCN Cache Allocation Strategy With Collaboration Support

Jiang

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Although Bilibili is frequently credited for popularising danmu, the pioneer of such a textover-screen technology is the largest Japanese video-sharing website called Niconico (nicovideo.jp), which is inextricably intertwined with ACG fan culture, communities and practices formed around media mix projects (Qin 2014, Tarnoi et al 2019. Through transforming and producing content, Niconico users can establish subcultural and local networks that foster innovative formats of media mix.…”

Section: History Of Danmu and 'Danmu' In Historymentioning

confidence: 99%

Emergence and Development of Bullet Comments in China

Wang

2021

View full text Add to dashboard Cite

Danmu denotes user-generated dynamic and contextualised comments scrolling across the screen. Owing to its resemblance to a bullet curtain, such a text-over-screen technology is referred to as ‘bullet comment/message’ or ‘barrage subtitling’. Since being adopted from Japan, danmu has expeditiously developed from a niche subcultural entity into a prominent property of Chinese online video culture. Danmu obtains popularity among young audiences, in that it establishes social media co-viewing, creates a sense of belonging, allows self-expression and facilitates social connectedness. Moreover, danmu enables creators to demonstrate a sense of existence, especially via informative, alerting and spoiler comments. The popularity of danmu in China is ascribed to diversified and concise literacy practice. More significantly, it is attributed to linguistic and cultural prerequisites: the Chinese written language is featured by a high information density and robust parafoveal preview effects; the Chinese culture is marked by a high level of polychronicity and collectivism, as well as conspicuous social and peer pressure.

show abstract

“…Content popularity also plays a pivotal role in designing an efficient caching technique [73], [74]. Goian et al [75] discussed the features of video files and summarized existing techniques adopted in content caching for the prediction of content popularity.…”

Section: B Survey Articles On Cachingmentioning

confidence: 99%

“…In addition, dynamic popularity-based caching models consider multiple factors to evaluate content popularity. These factors include delivery distance, cache capacity, node centrality, and so on [74], [96].…”

Section: B Popular Content Selectionmentioning

confidence: 99%

A Review on Green Caching Strategies for Next Generation Communication Networks

et al. 2020

View full text Add to dashboard Cite

In recent years, the ever-increasing demand for networking resources and energy, fueled by the unprecedented upsurge in Internet traffic, has been a cause for concern for many service providers. Content caching, which serves user requests locally, is deemed to be an enabling technology in addressing the challenges offered by the phenomenal growth in Internet traffic. Conventionally, content caching is considered as a viable solution to alleviate the backhaul pressure. However, recently, many studies have reported energy cost reductions contributed by content caching in cache-equipped networks. The hypothesis is that caching shortens content delivery distance and eventually achieves significant reduction in transmission energy consumption. This has motivated us to conduct this study and in this article, a comprehensive survey of the state-of-the-art green caching techniques is provided. This review paper extensively discusses contributions of the existing studies on green caching. In addition, the study explores different cache-equipped network types, solution methods, and application scenarios. We categorically present that the optimal selection of the caching nodes, smart resource management, popular content selection, and renewable energy integration can substantially improve energy efficiency of the cache-equipped systems. In addition, based on the comprehensive analysis, we also highlight some potential research ideas relevant to green content caching.

show abstract

Adaptive probabilistic caching technique for caching networks with dynamic content popularity

Cited by 11 publications

References 26 publications

Heterogeneous CCN Cache Allocation Strategy With Collaboration Support

Heterogeneous CCN Cache Allocation Strategy With Collaboration Support

Emergence and Development of Bullet Comments in China

A Review on Green Caching Strategies for Next Generation Communication Networks

Contact Info

Product

Resources

About