• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.605-619
• /
• 2010

Caching of frequently accessed data in multi-hop ad hoc environment is a technique that can improve data access performance and availability. Cooperative caching, which allows sharing and coordination of cached data among several clients, can further en-hance the potential of caching techniques. In this paper, we propose a fuzzy cooperative caching scheme in mobile ad hoc networks. The cache management of the proposed caching scheme not only uses adaptively CacheData or CachePath based on data sim-ilarity and data utility, but also uses the replacement manager based on data pro t. Also, the proposed caching scheme uses a prefetch manager. When the TTL of the cached data expires, the prefetch manager evaluates the popularity index of the data. If the popularity index is larger than a threshold, the data is prefetched. Otherwise, its space is released. The performance of the proposed scheme is evaluated analytically and is compared to that of other cooperative caching schemes.

• Proceedings of the CALSEC Conference
• /
• 2003.09a
• /
• pp.249-254
• /
• 2003

Object caching is a desirable feature to improve the both scalability and performance of distributed application systems for information infrastructure, the information management system leveraging the power of network computing. However, in order to exploit such benefits, we claim that the following problems: cache server placement, cache replacement, and cache synchronization, should be considered when designing any object cache system. We are under developing DOC: a Distributed Object Caching, as a part of building our information infrastructures. In this paper, we show how each problem is inter-related, and focus to highlight how we handle cache server deployment problem

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.469-474
• /
• 2004

As traffic on the web increases, users are faced with increasing delays. A key performance measure for the web is the speed with which object is served to users. Web caching is the one of the key method that improve performance of Web base system. Also, many studies for efficient management of storing scope on cache are performed actively. An important issue in web caching is how to improve a efficiency of a caching system. For this, efficient web cache management is required. A solution for this is to set up the caching strategy that consider a heterogeneity of Web object. In this paper, We propose 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 by increasing the caching efficiency of a multimedia object. In the experiment, We verified performance improvement of proposed web caching system through performance analysis of a proposed system.

• 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.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.17-22
• /
• 2022

Due to the recent advances in high-speed communication technologies as well as the easy production of high-quality video contents, IPTV is becoming increasingly popular. Meanwhile, as the number of IPTV channels increases, channel search time to find the desired channel keeps increasing. In this paper, we discuss how to improve the channel search latency in IPTV, and introduce caching and prefetching techniques that are widely used in memory management systems. Specifically, we adopt memory replacement, prefetching, and caching techniques in IPTV channel search interfaces and show the effectiveness of these techniques as the number of channels are varied.

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.153-161
• /
• 2019

Discrimination of media object segments in wireless home proxies has a significant impact on caching delay, and caching delay degrades the performance of the proxy. In this paper, we propose a Single Fetching Smart Caching (SFSC) strategy and a Multi-Fetching Smart Caching (MFSC) strategy to improve the proxy performance of the home network and improve the caching performance for media object segments. The SFSC strategy is a technique that performs caching by sequential fetching of object segments requested by the home node one at a time, which guarantees a faster cache hit rate, and the MFSC strategy is a technique that caches the media object segments by blocking object segments requested by the home node one at a time, which improves the throughput of cache. Simulation results show that the cache hit rate and the caching delay are more efficient than the MFSC technique, and the throughput of the object segment is more efficient than that of the SFSC technique.

• Convergence Security Journal
• /
• v.12 no.4
• /
• pp.91-96
• /
• 2012

MANET is developed technique fairly among many field of wireless network. Nodes which consist of MANET transmit data using multi-hop wireless connection. Caching scheme is technique which can improve data access capacity and availability of nodes. Previous studies were achieved about dynamic routing protocol to improve multi-hop connection of moving nodes. But management and maintenance of effective cache information because of movement of nodes is not easy. In this study, we proposed cluster-based caching scheme to manage connection by decreasing overhead and moving of nodes as moving node discovers cache of wish information. And HLP was used to maintain effective cache table in each cluster head. Efficiency of proposed technique in this study was confirmed by experiment.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.943-952
• /
• 2005

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to users' requests within a specified domain whereas the proposed caching policy runs by utilizing a number of users' requests across several domains. So, the proposed policy is applicable to random requests in mobile environments. Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit: object or segment. The result of performance evaluation tells that segment sizes, ratio of users' mobility and weights are major factors for the efficient operation of the cooperative caching.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.691-700
• /
• 2004

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to user's requests within a specified domain whereas the proposed caching policy runs by utilizing a number of user's requests across several domains. So, the proposed policy is applicable to random requests in mobile environments Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit object or segment. The result of performance analyze tells what a ratio of user's mobility is are major factors for the efficient operation of the cooperative caching.