• Proceedings of the Korea Database Society Conference
• /
• 2001.11a
• /
• pp.536-554
• /
• 2001

인터넷 이용자의 증가와 멀티미디어 등 대용량 콘텐츠에 대한 수요의 증가로 인해 데이터 트래픽은 기하 급수적으로 늘어나는 데 비해 네트웍 성능향상에 대한 투자는 이에 미치지 못함으로서 결과적으로 인터넷은 트래픽의 병목현상, 즉 정체현상이 발생하게 되었으며 점차 그 정도가 심해지고 있다. 이 문제를 해결하기 위해 제안하는 방안이 바로 전략적 CDN(Content Delivery Network) 이다. 현실적으로, 본 연구는 물리적인 망 증설만으로는 트래픽 체증 문제를 해결하기는 어려우므로 주요 ISP 네트웍에 전략적 캐시서버를 설치하여 CP의 콘텐츠를 각 ISP 네트웍마다 분산하여 저장하고 이용자의 요청 시 이용자의 인터넷 회선이 물려 있는 ISP 네트웍에서 바로 콘텐츠를 전송하여 데이터 손실과 속도 저하 등의 문제를 해결하는 CDN의 구성과 그 효과를 실증적으로 밝혔다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.307-309
• /
• 2013

미래 인터넷 기술 중 하나인 컨텐츠 중심 네트워킹 (CCN)은 컨텐츠의 이름을 이용해 사용자가 원하는 컨텐츠를 요청하고 이를 받음으로써 현재 위치 기반에서 이름 기반으로 변화하고 있는 컨텐츠 패러다임을 반영하고 있다. 사용자가 요청한 컨텐츠가 서버에서 라우터를 거쳐 이동할 때 각 라우터마다 내장되어 있는 캐시에 저장하여 관리하는 방식을 사용하기 때문에 같은 컨텐츠가 중복으로 저장되는 문제가 발생한다. 본 논문에서는 AS 외부에 위치하는 서버로부터 컨텐츠를 받을 때 주변 라우터를 그룹으로 묶어 캐시를 관리함으로써 중복 저장되는 빈도를 낮추고 캐시 적중률 향상과 지연 시간 감소를 이끄는 전략을 제안하고 실험적으로 검증한다.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.37-50
• /
• 2021

Query applications based on nested data, the most commonly used form of data representation on the web, especially precise query, is becoming more extensively used. MapReduce, a distributed architecture with parallel computing power, provides a good solution for big data processing. However, in practical application, query requests are usually concurrent, which causes bottlenecks in server processing. To solve this problem, this paper first combines a column storage structure and an inverted index to build index for nested data on MapReduce. On this basis, this paper puts forward an optimization strategy which combines query execution service tree and frequent sub-query trajectory to reduce the response time of frequent queries and further improve the efficiency of multi-user concurrent queries on large scale nested data. Experiments show that this method greatly improves the efficiency of nested data query.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.83-86
• /
• 2021

비디오 컨텐츠 사용이 증가하면서, 사용자가 요구한 파일을 제시간 안에 전달하는 문제가 중요해졌다. 사용자와 가까운 곳에 파일을 캐싱해 두고 필요할 때 다운받으면 파일을 보다 빨리 전달할 수 있는데 사용자가 움직일 경우 이동성을 고려해야 한다. 본 논문에서는 사용자의 이동 경로와 파일의 인기도를 함께 고려해 딜레이드 오프로딩(delayed offloading) 스키마를 적용한 환경에서 마이크로 기지국(micro base station, MBS)에서 다운받는 데이터 크기를 최소로 만들어 비용을 최소화 하는 캐싱 기법을 제안한다. 실험을 통해 타알고리즘에 비해 MBS 로부터 다운받는 양을 줄이고 스몰 셀 기지국(small cell base station, SBS)에서 다운받을 성공 확률을 높이는데 효과가 있다는 것을 보였다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2524-2532
• /
• 1999

In this paper, we present a new buffer pool management scheme designed for video type news objects to build a cost-effective News On Demand storage server for serving users requests beyond the limitation of disk bandwidth. In a News On Demand Server where many of users request for video type news objects have to be serviced keeping their playback deadline, the maximum numbers of concurrent users are limited by the maximum disk bandwidth the server provides. With our proposed buffer cache management scheme, a requested data is checked to see whether or not it is worthy of caching by checking its average arrival interval and current disk traffic density. Subsequently, only granted news objects are permitted to get into the buffer pool, where buffer allocation is made not on the block basis but on the object basis. We evaluated the performance of our proposed caching algorithm through simulation. As a result of the simulation, we show that by using this caching scheme to support users requests for real time news data, compared with serving those requests only by disks, 30% of extra requests are served without additional cost increase.

• Journal of Information Technology Applications and Management
• /
• v.11 no.1
• /
• pp.189-200
• /
• 2004

Recently Flash Memory which is small and low-powered is widely used as a storage of embedded system, because an embedded system requests portability and a fast response. To resolve a difference of access time between a storage and RAM, Linux is using disk caching which copies a part of file on disk into RAM. It is not also an exception on embedded system. A READ access-time of flash memory is similar to RAMs. So, when a process on an embedded system reads data, it is similar to the time to access cached data in RAM and to access directly data on a flash memory. On the embedded system using limited memory, using a disk cache is that wastes much time and memory spaces to manage it and can not reflects the characteristic of a flash memory. This paper proposes the regular file access of limited using a page cache in the file system based on a flash memory and reflects the characteristic of a flash memory. The proposed algorithm minimizes power consumption because access numbers of the RAM are reduced and doesn't waste a memory space because it accesses directly to a flash memory Therefore, the performance improvement of the system applying the proposed algorithm is expected.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.99-107
• /
• 2002

Broadcast disks are suited for disseminating information to a large number of clients in mobile computing environments. In broadcast disks, the server continuously and repeatedly broadcasts all data items in the database to clients without specific requests. The clients monitor the broadcast channel and retrieve data items as they arrive on the broadcast channel. The broadcast channel then becomes a disk from which clients can retrieve data items. In this paper, we propose a cache conscious concurrency control ($C^4$) scheme to preserve the consistency of client transactions, when the values of broadcast data items are updated at the server. $C^4$ scheme is novel in the sense that it can reduce the response time of client transactions with minimal control information to be broadcast from the server. This is achieved by the judicious caching strategy of the clients.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.280-288
• /
• 2019

In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.536-540
• /
• 2006

The interest in the service of 3D mobile contents becomes larger due to the technological advance of production and services of mobile contents and the appearance of the exclusive mobile phone for 3D game. Therefore, the researches about the efficient mobile services of large 3D contents are wanted in the circumstances of the narrow bandwidth and the burden of the connection charge of wireless mobile communications. In this paper, we suggest a strategy of caching for looking up and downloading the 3D marine characters efficiently and a system model for mobile service of 3D marine characters. The suggested system is designed for serving efficiently the high-quality 3D characters through the wireless mobile communications using the database on the 3D marine objects of cyber aquarium constructed for the services through the wired internet.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.421-431
• /
• 2007

Due to the rapid development of wireless communication technology, demands on data services in mobile computing environment are gradually increasing. In mobile computing environments, a mobile host began to use cache to overcome the weak point. Caching at mobile host could reduce the bandwidth consumption and query response time, but mobile host must maintain cache consistency. In this paper, we propose a cache consistency strategy to consider the period of data usage. The server allows an effective broadcasting by classifying data into two groups of periodic and non-periodic. By classifying the data, it prevent from elimination of cache after disconnection of periodic data by using expired time. By storing IR(Invalidation Report) messages, this scheme divides cached data by selection after disconnection. Consequently, we have shown much improvement in total consumption of bandwidth than the conventional scheme.