• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4268-4290
• /
• 2015

Future mobile communications face enormous challenges as traditional voice services are replaced with increasing mobile multimedia and data services. To address the vast data traffic volume and the requirement of user Quality of Experience (QoE) in the next generation mobile networks, it is imperative to develop efficient content distribution technique, aiming at significantly reducing redundant data transmissions and improving content delivery performance. On the other hand, in recent years cloud computing as a promising new content-centric paradigm is exploited to fulfil the multimedia requirements by provisioning data and computing resources on demand. In this paper, we propose a cooperative caching framework which implements State based Content Distribution (SCD) algorithm for future mobile networks. In our proposed framework, cloud service providers deploy a plurality of cloudlets in the network forming a Distributed Cloud Service Network (DCSN), and pre-allocate content services in local cloudlets to avoid redundant content transmissions. We use content popularity and content state which is determined by content requests, editorial updates and new arrivals to formulate a content distribution optimization model. Data contents are deployed in local cloudlets according to the optimal solution to achieve the lowest average content delivery latency. We use simulation experiments to validate the effectiveness of our proposed framework. Numerical results show that the proposed framework can significantly improve content cache hit rate, reduce content delivery latency and outbound traffic volume in comparison with known existing caching strategies.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.40-47
• /
• 2009

Recently, dynamic proxy caching has been proposed on the distributed environment so that media objects by user's requests can be served directly from the proxy without contacting the server. However, it makes caching challenging due to multimedia large sizes, low latency and continuous streaming demands of media objects. To solve the problems caused by streaming demands of media objects, this paper has been proposed the grouping scheme with fuzzy filtering based on partition and mapping. For partition and mapping, this paper divides media block segments into fixed partition reference block(R$_f$P) and variable partition reference block(R$_v$P). For semantic relationship, it makes fuzzy relationship to performs according to the fixed partition temporal synchronization(T$_f$) and variable partition temporal synchronization(T$_v$). Simulation results show that the proposed scheme makes streaming service efficiently with a high average request response time rate and cache hit rate and with a low delayed startup ratio compared with other schemes.

• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1403-1412
• /
• 2013

In the maritime ships or airplanes, users should utilize the satellite channel in orer to use web service. However, the satellite channel is costly and does not give users satisfied response time. In the ship, the users may receive plenty of extra data when they obtain internet news. The extra data may be unnecessary image and advertise. Therefore, they should pay unnecessary data usage charges as well. In this paper, we suggest a proxy model that solves the problem of cost and speed. The proposed proxy reduces the of data through the satellite link by image and advertising blocking, caching, image re-requesting functions. It's performance was tested by a real satellite communication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.283-290
• /
• 2004

With the development of Web technologies, the demand for multimedia contents and network bandwidth is increasing explosively. In this situation, Caching, P2P and CDN are using for fast transmission with low traffic. In this research, we designed and implemented a redirection system for best replica selection where contents are distributed to multiple replicated web servers. This redirection system selects a close and least loaded replica and redirect a client's request to the replica. As a result, this system improved user-perceived performance. It is expected that this redirection system will contribute to the faster and more stable transmission of massive multimedia contents.

• The KIPS Transactions:PartD
• /
• v.8D no.1
• /
• pp.1-9
• /
• 2001

The SQL CLl (Call Level Interface) is a database application programming interface (API) that fits the client-server environment, and its de facto standards such as ODBC and JDBC are widely employed in various applications. The current SQL CLl standards, however, do not specify enough features for efficient retrieval of large objects (LOBs) that constitute the multimedia data. In this paper, we propose the LOB caching through the SQL CLl and describe the extension of the SQL eLl to achieve such a goal. We implement our proposal by extending the SQL CLl library for BADA - II DBMS developed at ETRI, and evaluate the performance of LOB retrieval through the cache compared to that of LOB retrieval conducted solely with the functions specified in the current SQL CLl standards.

• KNOM Review
• /
• v.24 no.1
• /
• pp.20-28
• /
• 2021

Extensive use of social media applications and mobile devices continues to increase data traffic. Social media applications generate an endless and massive amount of multimedia traffic, specifically video traffic. Many social media platforms such as YouTube, Daily Motion, and Netflix generate endless video traffic. On these platforms, only a few popular videos are requested many times as compared to other videos. These popular videos should be cached in the user vicinity to meet continuous user demands. MEC has emerged as an essential paradigm for handling consistent user demand and caching videos in user proximity. The problem is to understand how user demand pattern varies with time. This paper analyzes three publicly available datasets, MovieLens 20M, MovieLens 100K, and The Movies Dataset, to find the user request pattern over time. We find hourly, daily, monthly, and yearly trends of all the datasets. Our resulted pattern could be used in other research while generating and analyzing the user request pattern in MEC-based video caching scenarios.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.573-576
• /
• 2002

본 고의 멀티미디어 캐시 시스템은 이동 단말기의 보급 &발달로 예상되는 트랜스코더 부하의 증가와 응답 시간을 개선 하기 위한 것으로 기존의 웹 문서의 캐시 시스템과 비교 분석 하고, 빈번한 이동 단말기의 요구에 의해서 발생하는 많은 트랜스코더 작업을 최소화 할 수 있는 XML 기반의 캐시시스템을 연구 하고자 한다. 즉, 기존의 웹 캐시 시스템의 장점과 XML의 재 사용 성, 확장 성, 플랫폼 독립성, 다양한 종류의 응용 프로그램과의 접목 성 등의 장점을 살리고, 캐시 시스템 Manager에 의해 최소환의 트랜스코더 동작이 일어나도록 한다. 따라서 트랜스코더 된 작업을 캐시 시스템에 보관 관리하는 최적의 캐시 시스템 관리 방법을 제안하고자 한다.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1066-1077
• /
• 2004

Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.11-14
• /
• 2003

실시간 멀티미디어 시스템을 위한 캐슁 기법이 몇 가지 제안되었지만 그러한 기법들은 캐쉬 히트에 따른 디스크 대역폭 절약이라는 실질적인 효과에 초점을 맞추기보다는 적중률을 높이는데 주력을 하여왔다. 끊김이 없는 멀티미디어 데이터의 상영이 보장되지 않는다면 높은 캐쉬 적중률만으로는 성능이 우수하여졌다고 보기는 힘들다. 본 논문에서는 이러한 멀티디어의 특성을 고려하여 SPT-L, PSIC, DIC 등을 소개하고 있으며 이 기법에서는 끊김 없는 상영이 보장됨과 동시에 절약된 디스크 대역폭을 이용하여 더 많은 스트림을 서비스할 수 있는 기법들이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.355-357
• /
• 2003

본 논문은 기존에 제시되었던 협동적 캐슁 프록시 서버의 구조에 프록시 서버에 독립적인 prefix 배치와 프록시 서버간의 suffix 공유라는 동작을 추가하여, 무선 상에서의 효율적인 멀티미디어 콘텐츠 스트리밍이 가능하도록 하였다. 제안한 구조에 적합한 동작방법과 알고리즘 및 이에 따른 prefix의 특성을 제시하며, 콘텐츠 초기 지연 시간의 감소와 서버저장 능력 향상에 대한 성능 개선 효과를 기술한다.