• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4572-4586
• /
• 2019

Mobile Edge Computing (MEC) and Information-Centric Networking (ICN) are essential network architectures for the future Internet. The advantages of MEC and ICN such as computation and storage capabilities at the edge of the network, in-network caching and named-data communication paradigm can greatly improve the quality of video streaming applications. However, the packet loss in wireless network environments still affects the video streaming performance and the existing loss recovery approaches in ICN does not exploit the capabilities of MEC. This paper proposes a Deep Learning based Loss Recovery Mechanism (DL-LRM) for video streaming over MEC based ICN. Different with existing approaches, the Forward Error Correction (FEC) packets are generated at the edge of the network, which dramatically reduces the workload of core network and backhaul. By monitoring network states, our proposed DL-LRM controls the FEC request rate by deep reinforcement learning algorithm. Considering the characteristics of video streaming and MEC, in this paper we develop content caching detection and fast retransmission algorithm to effectively utilize resources of MEC. Experimental results demonstrate that the DL-LRM is able to adaptively adjust and control the FEC request rate and achieve better video quality than the existing approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.262-268
• /
• 2005

The unit of the digital content delivery is the web object. For the improvement of the content delivery based on the web, it id required analysis of reference characteristics of the web object. In this study, we analyze reference characteristics of the web object and evaluate the performance. Using these analysis results, we propose the digital content delivery system which is improved delivery efficiency. The goal of the proposed system are the improvement of the processing time through enhancement of the caching efficiency with reflect reference characteristics of the web object. And the experiment result, we verify the performance enhancement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.4
• /
• pp.234-241
• /
• 2014

xTo improve network inefficiency caused by network congestion around a content-source, content-centric networking (CCN) allows network nodes transmitting contents to temporarily cache received contents and then send back the cached contents if the nodes receive relevant request messages without forwarding the request messages to content-sources. However, because nodes receiving requested contents through CCN cannot recognize real senders of the received contents, the receivers need to verify each received contents before using them. But such a verification procedure can cause long service/operation delay. Hence, in this paper, we review the problem of contents verification, propose an improved verification procedure and evaluate its performance.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1113-1120
• /
• 2021

Content Central Network (CCN) appeared to improve network efficiency by transforming IP-based network into content name-based network structures. Each router performs caching mechanism to improve network efficiency in the CCN. And the cache replacement policy applied to the CCN router is an important factor that determines the overall performance of the CCN. Therefore various studies has been done relating to cache replacement policy of the CCN. In this paper, we proposed a cache replacement policy that improves the limitations of the LFU policy. The proposal algorithm applies real-time producer popularity-based variables. And through experiments, we proved that the proposed policy shows a better cache hit ratio than existing policies.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.4
• /
• pp.975-985
• /
• 2018

ICN architecture, one of future Internet technologies, proposes that content request packets toward a content source can be responded by several distributed nodes. So, ICN can solve network congestion which is happened around content sources and provide a seamless content distribution service regardless of the network and system statuses of content sources. Especially, CCN implements content caching functionality in network nodes so that such intermediated network nodes can themselves respond to content requests. However, when receiving content from distributed nodes, users receiving content cannot authenticate the nodes providing the content. So CCN is vulnerable to various attacks such as an impersonation attack, a data pollution attack, and so on. This paper first describes CCN content authentication and its weakness. Then it proposes an improved content authentication scheme based on a blockchain and evaluates the performance of the proposed scheme.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.6
• /
• pp.1095-1102
• /
• 2023

Content Centric Network (CCN) is a network that emerged to improve the existing network structure and communicates based on content names instead of addresses. It utilises caches to distribute traffic and reduce response time by delivering content from intermediate nodes. In this paper, we propose a popularity-based caching policy to efficiently utilise the limited CS space in CCN environment. The performance of CCNs can vary significantly depending on which content is prioritised to be stored and released. To achieve the most efficient cache replacement, we propose a real-time content popularity-based efficient cache replacement policy that calculates and prioritises content popularity based on constructor popularity, constructor distance, and content hits, and demonstrate the effectiveness of the new policy through experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.4
• /
• pp.839-847
• /
• 2015

To seamlessly provide content through the Internet, it is generally considered to use distributed processing for content requests converged on original content providers like P2P, CDN, and ICN. That is, after other nodes temporally save content, they handle content requests instead of original content providers. However, in this case, it may be possible that a content sender is different from the original provider of the content. In this case, users may be exposed to various risks. To solve such a problem, it is highly recommended to verify received contents before using them, but it can cause network traffic increases as well as a serious service delay. This paper proposes an efficient content verification scheme for distributed networking/data store environments and analyzes its performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.2021-2024
• /
• 2003

Information security is becoming a more important factor in distribution of digital contents. Generally, illegal facsimile of high-quality multimedia products such as DVDs, MP3s and AACs is possible without damaging quality. Thus, the illegal distribution of duplicated contents on the Web is causing digital content providers great economic loss. Therefore, a study of security and efficient distribution of digital contents is required. The most important issues in the design of a digital content distribution system are user convenience, execution speed and security. In this study, we designed a digital contents distribution system that uses web caching technology and encryption/decryption techniques in hierarchical structures. We propose a digital content distribution system that improves user convenience, security and execution speed. The superior performance of the proposed system has been proven in the tests. The results of experiment show that the developed system has improved the security of DC without decreasing process speed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1476-1484
• /
• 1999

TV 방송 분야에서 다양한 정보와 상호 작용성을 제공하기 위해서 최근 기존 방송 내용인 A/V 스트림 외 부가정보 방송이 시도되고 있다. 데이타 방송에 대한 기존 연구는 대부분 고정된 내용의 데이타를 방송하는 환경을 가정하고 있어서 그 결과가 방송 내용의 변화가 많은 환경에 부적합하다. 본 논문에서는 데이타에 대한 접근이 반복되지 않을 가능성이 높고 사용자 접근 확률을 예상하기 어려운 상황에서 응답 시간을 개선하는 방안으로 수신 데이타를 무조건 캐쉬에 반입하고 교체가 필요한 경우 다음 방송 시각이 가장 가까운 페이지를 축출하는 사용자 단말 시스템에서의 캐슁 정책을 제안하였다. 제안된 캐쉬 관리 정책은 평균적인 캐쉬 접근 실패 비용을 줄임으로써 사용자 응답 시간을 개선하며, 서로 다른 스케줄링 기법을 사용하는 다양한 방송 제공자가 공존하는 환경에서 보편적으로 효과를 가져올 수 있다.Abstract Recently, many television broadcasters have tried to disseminate digital multimedia data in addition to the traditional content (audio-visual stream). The broadcast data need to be cached by a client system, to provide a reasonable response time for a user request. Previous studies assumed the dissemination of a fixed set of items, and the results are not suitable when broadcast items are frequently changed. In this paper, we propose a novel cache management scheme that chooses the replacement victim based on the remaining time to the next broadcast instance. The proposed scheme reduces response time, where it is hard to predict the probability distribution of user accesses. The caching policy we present here significantly reduces expected response time by minimizing expected cache miss penalty, and can be applied without difficulty to different scheduling algorithms.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.854-859
• /
• 2017

Caching popular videos in the storage of base stations is an efficient method to reduce the transmission latency. This paper proposes an incentive proactive cache mechanism in the wireless network to motivate the content providers (CPs) to participate in the caching procedure. The system consists of one/many Infrastructure Provider (InP) and many CPs. The InP aims to define the price it charges the CPs to maximize its revenue while the CPs compete to determine the number of files they cache at the InP's base stations (BSs). We conceive this system within the framework of Stackelberg game where InP is considered as the leader and CPs are the followers. By using backward induction, we show closed form of the amount of cache space that each CP renting on each base station and then solve the optimization problem to calculate the price that InP leases each CP. This is different from the existing works in that we consider the non-uniform pricing scheme. The numerical results show that InP's profit in the proposed scheme is higher than in the uniform pricing.