• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.97-99
• /
• 2021

Edge caching can provide high QoE by reducing traffic in the backhaul network and reducing latency in video streaming services. But due to the limited capacity of edge cache, large amounts of content cannot be cached. In this paper, we propose an edge-fog prefix caching that reduces playback delay by caching prefixes of video content on edges and storing the rest in fog cache.

• Journal of Communications and Networks
• /
• v.16 no.5
• /
• pp.568-577
• /
• 2014

We consider a mobile content delivery network (mCDN) in which special mobile devices designated as caching servers (caching-server device: CSD) can provide mobile stations with popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSD's are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We demonstrate that the proposed ODSA takes fewer iterations, on the order of O(log N) searches, for caching N contents in the system to find the optimal solution, as compared to the number of iterations in the conventional subgradient method, with an acceptable accuracy in practice. Furthermore, we identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing the mCDN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2650-2667
• /
• 2021

In this paper, we derive the expression of the cache hitting probability with random caching policy and propose the joint optimization algorithm based on difference of convex algorithm (DCA) in the three-tier caching heterogeneous cellular network assisted by macro base stations, helpers and users. Under the constraint of the caching capacity of caching devices, we establish the optimization problem to maximize the cache hitting probability of the network. In order to solve this problem, a convex function is introduced to convert the nonconvex problem to a difference of convex (DC) problem and then we utilize DCA to obtain the optimal caching probability of macro base stations, helpers and users for each content respectively. Simulation results show that when the density of caching devices is relatively low, popular contents should be cached to achieve a good performance. However, when the density of caching devices is relatively high, each content ought to be cached evenly. The algorithm proposed in this paper can achieve the higher cache hitting probability with the same density.

• ETRI Journal
• /
• v.36 no.5
• /
• pp.819-828
• /
• 2014

To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in-network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content's popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in-network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.111-118
• /
• 2021

This paper proposes a novel method of caching contents that can be encoded into multiple quality levels in device-to-device (D2D)-assisted caching networks. Different from the existing caching schemes, the author allows caching fractions of an individual file and considers the self cache hit event, which the user can find the desired content in its device. The author analyzes the tradeoff between the quality of cached contents and the cache hit rate, and proposes the device caching method maximizing the expected quality that the user can enjoy. Depending on the parameter of the relationship between the quality and the file size, the optimal caching method can be obtained by solving the convex optimization problem and the DC programming problem. If the file size increases faster than the quality, the cached fractions of the contents continuously increase as the popularity grows. Meanwhile, if the file size increases slower than the quality, some of the high-popularity files are entirely cached but others are not cached at all.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.2
• /
• pp.43-50
• /
• 2022

As the use of mobile data increases, the proportion of video content is increasing steeply. In order to solve problems that arise when mobile users receive data from geographically remote cloud servers, methods of caching data in advance to edge servers geographically close to the users are attracting lots of attention. In this paper, we present a caching policy that stores data on Small Cell Base Station(SBS) to effectively provide content files to mobile users by applying a delayed offloading scheme in a cellular network. The goal of the proposed policy is to minimize the size of data transmitted from Macro Base Station(MBS) because the delayed offloading scheme requires more cost than when downloaded from MBS than from SBS. The caching policy is proposed to determine the size of content file and which content file to be cached to SBS using the probability of mobile users' paths and the popularity of content files, and to replace content files in consideration of the overlapping coverage of SBS. In addition, through performance evaluation, it has been proven that the proposed policy reduces the size of data downloaded from MBS compared to other algorithms.

• The Journal of the Korea Contents Association
• /
• v.16 no.4
• /
• pp.224-230
• /
• 2016

Recently, CCN(Content Centric Network) has been extensively interested in the literature to transfer data traffic efficiently according to the rapid growth of multimedia services on the Internet. CCN is a new networking paradigm to deliver contents efficiently based on the named content not the named or addressed host. This paper presents a mathematical approach for analyzing CCN-caching systems with two routers. Considering the stochastic characteristics of communication networks, the caching system is modeled as a two dimensional Markov chain. This paper analyzes the structural feature of the transition rate matrix in the Markov chain and presents a numerical solution for the CCN-caching performance of the two router system. In addition, various numerical examples are presented.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.291-299
• /
• 2016

To enhance network efficiency, named-data networking (NDN) implements data caching functionality on intermediate network nodes, and then the nodes directly respond to request messages for cached data. Through the processing of request messages in intermediate node, NDN can efficiently reduce the amount of network traffic, also solve network congestion problems near data sources. Also, NDN provides a data authenticate mechanism so as to prevent various Internet accidents caused from the absence of an authentication mechanism. Hence, through applying NDN to various smart IT convergence services, it is expected to efficiently control the explosive growth of network traffic as well as to provide more secure services. Basically, it is important factors of NDN which data is cached and where nodes caching data is located in a network topology. This paper first analyzes previous works caching content based on the popularity of the content. Then ii investigates the hitting rate of caches in each node of a network topology, and then propose an improved caching scheme based on the result of the analyzation. Finally, it evaluates the performance of the proposal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.703-710
• /
• 2012

The new article, related to temporary copy on exploitation of copyrighted works, has been introduced in the copyright law as partly revised on December 2, 2011. While number of researches on in-network caching including Content-Centric Networking are conducted quite actively in recent years, the need for legal and institutional considerations has arisen since temporal storage (i.e. temporal copy) may be made not only at user devices but also in routers such as network equipments. This paper examines issues on temporary copy of copyrighted works mainly focusing on the articles and the related articles of the recently revised copyright law as well as the Free Trade Agreement between the Republic of Korea and the United States of America and further studies necessary institutions required to actualize in-network caching.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1498-1507
• /
• 2017

According to recent report, global mobile data traffic is expected to increase by 11 times from 2016 to 2020. Moreover, this growth is expected to be driven mainly by mobile video traffic which is expected to account for about 70% of the total mobile data traffic. To cope with enormous mobile traffic, we need to understand video traffic's characteristic. Recently, the repetitive requests of some popular content such as popular YouTube videos cause a enormous network traffic overheads. If we constitute a network with the nodes capable of content caching based on the content popularity, we can reduce the network overheads by using the cached content for every request. Through device-to-device, multicast, and helpers, the video throughput can improve about 1.5~2 times and prefix caching reduces the playback delay by about 0.2~0.5 times than the conventional method. In this paper, we introduce some recent work on content popularity-based caching techniques in wireless networks.