• Title/Summary/Keyword: web cache

Search Result 150, Processing Time 0.028 seconds

Design and analytical evaluation of a fuzzy proxy caching for wireless internet

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.6
    • /
    • pp.1177-1190
    • /
    • 2009
  • In this paper, we propose a fuzzy proxy cache scheme for caching web documents in mobile base stations. In this scheme, a mobile cache model is used to facilitate data caching and data replication. Using the proposed cache scheme, the individual proxy in the base station makes cache decisions based solely on its local knowledge of the global cache state so that the entire wireless proxy cache system can be effectively managed without centralized control. To improve the performance of proxy caching, the proposed cache scheme predicts the direction of movement of mobile hosts, and uses various cache methods for neighboring proxy servers according to the fuzzy-logic-based control rules based on the membership degree of the mobile host. The performance of our cache scheme is evaluated analytically in terms of average response delay and average energy cost, and is compared with that of other mobile cache schemes.

  • PDF

DOC: A Distributed Object Caching System for Information Infrastructure (분산 환경에서의 객체 캐슁)

  • 이태희;심준호;이상구
    • 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

  • PDF

An Adaptive Web Caching Method based on the Heterogeneity of Web Object (웹 객체 이질성 기반의 적응형 웹캐싱 기법)

  • Ko, Il-Suk;Na, Yun-Ji;Leem, Chun-Seong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 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.

  • PDF

Development of a Distributed Web Caching Network through Consistent Hashing and Dynamic Load Balancing

  • Hwan Chang;Jong Ho Park;Ju Ho Park;Kil To Chong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1040-1045
    • /
    • 2002
  • This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

A Study on the Performance of Prefetching Web Cache Proxy (Prefetch하는 웹 캐쉬 프록시의 성능에 대한 연구)

  • 백윤철
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.11
    • /
    • pp.1453-1464
    • /
    • 2001
  • Explosive growth of Internet populations results performance degradations of web service. Popular web sites cannot provide proper level of services to many requests, and such poor services cannot give user a satisfaction. Web caching, the remedy of this problem, reduces the amount of network traffic and gives fast response to user. In this paper, we analyze the characteristics of web cache traffics using traces of NLANR(National Laboratory for Applied Network Research) root caches and Education network cache in Seoul National University. Based on this analysis, we suggest a method of prefetching and we discuss the gains of our prefetching. As a result, we find proposed prefetching enhances hit rate up to 3%, response time up to 5%.

  • PDF

Forecasted Popularity Based Lazy Caching Strategy (예측된 선호도 기반 게으른 캐싱 전략)

  • Park, Chul;Yoo, Hae-Young
    • 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.

ACASH: An Adaptive Web Caching Method with Heterogeneity of Web Object and Reference Characteristics (ACASH: 웹 객체의 이질성과 참조특성 기반의 적응형 웹 캐싱 기법)

  • 고일석;임춘성;나윤지
    • 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.

Effective Reference Probability Incorporating the Effect of Expiration Time in Web Cache (웹 캐쉬에서 만기시간의 영향을 고려한 유효참조확률)

  • Lee, Jeong-Joon;Moon, Yang-Se;Whang, Kyu-Young;Hong, Eui-Kyung
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.688-701
    • /
    • 2001
  • Web caching has become an important problem addressing the performance issues in web applications. In this paper we propose a method that enhances the performance of web caching by incorporating the expiration time of web data we introduce the notion of the effective reference probability that incorporates the effect of expiration time into the reference probability used in the existing cache replacement algorithms .We formally define the effective reference probability and derive it theoretically using a probabilistic model. By simply replacing probabilities with the effective reference probability in the existing cache replacement algorithms we can take the effect of expiration time into account The results of performance evaluation through experiments show that the replacement algorithms using the effective reference probability always outperform the existing ones. The reason is that the proposed method precisely reflects the theoretical probability of getting the cache effect, and thus, incorporates the influence of the expiration time more effectively. In particular when the cache fraction is 0.05 and data update is comparatively frequent (i.e. the update frequency is more than 1/0 of the reference frequency) the performance enhancement is more than 30% in LRU-2 and 13% in Aggarwal's method (PSS integrating a refresh overhead factor) The results show that effective reference probability contributes significantly to the performance enhancement of the web cache in the presence of expiration time.

  • PDF

WebDBs : A User oriented Web Search Engine (WebDBs: 사용자 중심의 웹 검색 엔진)

  • 김홍일;임해철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1331-1341
    • /
    • 1999
  • This paper propose WebDBs(Web Database system) which retrieves information registered in web using query language similar to SQL. This proposed system automatically extracts information which is needed to retrieve from HTML documents dispersed in web. Also, it has an ability to process SQL based query intended for the extracted information. Web database system takes the most of query processing time for capturing documents going through network line. And so, the information previously retrieved is reused in similar applications after stored in cache in perceiving that most of the web retrieval depends on web locality. In this case, we propose cache mechanism adapted to user applications by storing cached information associated with retrieved query. And, Web search engine is implemented based on these concepts.

  • PDF

General Web Cache Implementation Using NIO (NIO를 이용한 범용 웹 캐시 구현)

  • Lee, Chul-Hui;Shin, Yong-Hyeon
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.1
    • /
    • pp.79-85
    • /
    • 2016
  • Network traffic is increased rapidly, due to mobile and social network, such as smartphones and facebook, in recent web environment. In this paper, we improved web response time of existing system using direct buffer of NIO and DMA. This solved the disadvantage of JAVA, such as CPU performance reduction due to the blocking of I/O, garbage collection of buffer. Key values circulated many data due to priority change put on a hash map operated easily and apply a priority modification algorithm. Large response data is separated and stored at a fast direct buffer and improved performance. This paper showed that the proposed method using NIO was much improved performance, in many test situations of cache hit and cache miss.