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

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2131-2136
• /
• 2003

Since the number of user-requests increases dramatically on the Internet, the servers and networks can be swamped unexpectedly without any prior notice. Therefore, the end-users are waiting or refused for the responses of the contents from the originating servers. To solve this problem, it has been considered that a distributed web caching system efficiently utilizes structural elements of the network. Because a distributed web caching system uses the caches that are close to end-users on the network, it transmits the contents to users faster than the original network system. This paper proposes a simple client-based distributed web caching system(2HRCS) that client can directly perform object allocation and load balancing without an additional DNS for load balancing in CARP (Cache Array Routing Protocol) and GHS (Global Hosting System) that are the recent distributed web caching system protocol. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system. The system has clients with consistent hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to consistent hashing system. Because this system can keep performance of the existing system and reduce costs, it has the advantage of constructing medium or small scale CDN (Contents Delivery Network).

• The Journal of Society for e-Business Studies
• /
• v.13 no.4
• /
• pp.161-171
• /
• 2008

The most important reason for increasing web traffic and overloaded web servers is a dramatic growth of web users which leads to a great dissatisfaction of each individual user. For overcoming this situation, studies for an acceleration of web content have been conducted actively. We use web caching technology for reducing the load of the web system and traffic in the network. In this paper, we proposed a new web caching technology with the related web object which based on the unit of web processing and characteristics of the web object. Also we verified the availability of the proposed system with comparison and experiments.,

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.161-164
• /
• 2003

The sharing of caches among Web proxies is an important technique to reduce Web Traffic and alleviate network bottlenecks. Additionally, due to emerging network technologies cooperative Web caching among proxies shows great promise to become an effective approach for reducing Web document access latencies. Nevertheless it is not widely deployed due to the overhead of existing protocols such as ICP. We propose iSCSI-based hierarchical web caching scheme which provides more improved performance than existing web caching scheme.

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

• The Journal of Society for e-Business Studies
• /
• v.13 no.3
• /
• pp.67-83
• /
• 2008

Web caching server is one of the important components of any web site, as it makes the access of users to web content much faster while balancing the network and server load. There are many caching approaches proposed in order to solve this problem. Classically, we know several caching algorithms like FIFO, LRU, LRU-min and etc. Most of them have their advantages and disadvantages based on specific context. The purpose of this paper is to introduce the new concept of caching objects along with their related content and test the performance of the proposed caching method using CPN Tools simulator program. It is generally known that the use of Colored Petri Nets(CPNs) for modeling the simulation of new idea is one of the popular methods of system evaluation throughout software development projects. Moreover it could be very handy in describing the overall logic of the system. The CPN Tools is one of the most robust simulator programs which supports all necessary tools and functions to build and run the simulation model for CPN. Therefore in this paper, we will use CPN Tools software in order to build a simulator for our innovative caching approach named as web caching with related content. Then we will analyze the results derived from the simulation of our model and will make corresponding conclusions.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.1-11
• /
• 2008

An effective solution to the problems caused by the explosive growth of World Wide Web is a web caching that employing an additional server, called proxy cache, between the clients and main server for caching the popular web objects near the clients. However, a single proxy cache can easily become the bottleneck. Deploying groups of cooperative caches provides scalability and robustness by eliminating the limitations caused by a single proxy cache. Two common architectures to implement the cooperative caching are hierarchical and distributed caching systems. Unfortunately, both architectures suffer from performance limitations. We propose an efficient hybrid caching architecture eliminating these limitations by using both the hierarchical and same level caches. Our performance evaluation with our investigated simulator shows that the proposed architecture offers the best of both existing architectures in terms of cache hit rate, the number of query messages from clients, and response time.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.785-794
• /
• 2006

Nowadays, Internet is used worldwide and network traffic is increasing dramatically. Much of Internet traffic is due to the web applications. And I propose a new cooperative web caching scheme, called DCOORD which tries to minimize the overall cost of Web caching. DCOORD reduces the communication cost by coordinating the objects which are cached at each cache server. In this paper, I compare the Performance of DCOORD with two well-known cooperative Web caching schemes, ICP and CARP, using trace driven simulation. In order to reflect the cost factor in the network communication, I used the CSR(Cost-Saving Ratio) as our performance metric, instead of the traditional hit ratio. The performance evaluations show that DCOORD is more cost effective than ICP and CARP.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.52-66
• /
• 2010

Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

• Convergence Security Journal
• /
• v.6 no.4
• /
• pp.91-99
• /
• 2006

Generally, a study of web caching is conducted on a performance improvement with structural approaches and a new hybrid method using existing methods, and studies on caching method itself. And existing analysis of reference-characteristic are conducted on a history analysis and a preference of users, a view point of data mining by log analysis. In this study, we analyze the reference-characteristic of web object on a view point of a characteristic of probability-distribution and a mean value of lifetime of a web-object. And using this result, we propose the new method for a performance improvement of a web-caching.