• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.1379-1382
• /
• 2004

The use of a cache for storing and processing of Web objects is becoming larger. Also, many studies on the efficient management of the storing scope of caches are being done. Web caching algorithms have many differences from traditional algorithms. Particularly, heterogeneity of Web objects that are processing units of Web caching, and a variation of Web object reference characteristic with time are the important causes of the decrease the performance of existing algorithms. In this study, we proposed the new web-caching algorithm. A heterogeneity variation of an object can be reduced as the proposed method dividedly managing Web objects and a cache scope with heterogeneity, and it is adaptively reflecting a variation of object reference characteristics with the flowing of time. In the experiments, we verified that the performance of the proposed method was more improved than existing algorithms through the two experiment models which considered heterogeneity of an object.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.261-268
• /
• 2003

In this paper, we propose a new caching strategy for web servers. The proposed strategy collects only the statistics of the requested file, for example the popularity, when a request arrives. At a point of time, only files with higher forecasted popularity are cached all together. Forecasted popularity based lazy caching (FPLC) strategy uses exponential smoothing method for forecast popularity of web files. And, FPLC strategy shows that the cache hit ratio and the cache transfer ratio are better than those produced by other caching strategy. Furthermore, the experiment that is performed with real log files built from web servers shows our study on forecast method for popularity of web files improves cache efficiency.

• Annual Conference of KIPS
• /
• 2003.11b
• /
• pp.1007-1010
• /
• 2003

Efficient using of web cache is becoming important factor that decide system management efficiency in web-Based system. Cache performance depends heavily on replacement algorithms, which dynamically select a suitable subset of objects for caching in a finite space. However, replacement algorithm on web cache has many differences than traditional replacement algorithm. In this paper, a web-caching algorithm is proposed for efficient operation of web base system. The algorithm is designed based on a divided scope that considered size reference characteristic and heterogeneity on web object. The performance of the algorithm is analyzed with an experiment. With the experiment results, the algorithm is compared with previous replacement algorithms, and its performance is confirmed ith an improvement of response speed.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.305-313
• /
• 2004

The use of a cache for a storing and processing of Web object is becoming larger. Also, many studies for efficient management of storing scope on cache are performed actively. Web caching technique have many differences with traditional techniques. Particularly, a heterogeneity of Web object which is a processing unit of Web caching and a variation of Web object reference characteristic with time are the important causes to decrease performance of existing techniques. In this study, We proposed the ACASH which was new web caching technique. As ACASH divided and managed Web object and a cache scope with a heterogeneity, It can reduced a heterogeneity variation of an object. Also, it is reflecting a variation of object reference characteristics with time adaptively. In the experiment, We verified that the performance of ACASH was improved than existing techniques on the two experiment model which considered a heterogeneity of an object.

• Annual Conference of KIPS
• /
• 2002.11a
• /
• pp.167-170
• /
• 2002

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

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.129-134
• /
• 2003

This paper describes an application level composition mechanism called Generic Modeling Environment(GME) for web caching on an Application Level Active Network(ALAN). Web caching on an ALAN requires the application level composition mechanism and a service composition to support adaptability for self-organization. ALAN was developed to solve the problems of the network level Active Network(AN) ALAN has the features of both AN as well as mobile agents. The efficient composition mechanism for the existing AN Projects has been supported primarily for the network level AN. Conversely, ALAN lacks support for the application level AN The existing web caching technology is inter-connected in a manually configured hierarchical tree. Since a self-organization system is intended to be adaptive, web caching for self-organization does not involve a manual configuration or any low-level tuning of the individual nodes of the entire system but requires service composition to support adapting intelligence and fault-tolerance to enable self-organization.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.653-659
• /
• 2008

With the recent explosion in using of the Internet, the problem of caching web objects has gained considerable importance. Caching on the Internet differs from traditional caching in several ways. Especially, the conventional caching algorithms are not well suited for the Internet caching. The poor performance is mainly due to its unfair treatment of small objects since all the objects are treated the same even though they differ in size. In this paper, I give an overview of caching policies designed for web objects, and provide a new algorithm of my own. I also have performed trace-driven simulations about variable-size replacement algorithms, and derived a new algorithm to improve byte hit-ratio by classifying objects based on their sizes.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.15-23
• /
• 2004

This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia sever and inefficient use of network resources, The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests sevice are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos In order to reduce end-to-end delay.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.434-438
• /
• 2004

In this paper, We offer a new web caching technique for a performance improvement of a multimedia object process. The proposed method is based on a heterogeneity of Web object. And it increases performance of a caching system as increasing the caching efficiency of a multimedia object. In the experiment, We verified performance improvement through performance analysis of a proposed system.

• Journal of the Korea Society for Simulation
• /
• v.12 no.2
• /
• pp.25-34
• /
• 2003

Because of explosive growth in demand for web-based multimedia applications, proper proxy caching for large multimedia object (especially video) has become needed. For a video object which is much larger in size and has different access characteristics than the traditional web object such as image and text, caching the whole video file as a single web object is not efficient for the proxy cache. In this paper, we propose a proxy caching strategy with the constant-sized segment for video file and an improved proxy cache replacement policy. Through the event-driven simulation under various conditions, we show that our proposal is more efficient than the variable-sized segment strategy which has been proven to have higher hit ratio than other traditional proxy cache strategies.