• Journal of the Korea Society for Simulation
• /
• v.9 no.2
• /
• pp.1-14
• /
• 2000

Recently, as construction of information infra including high-speed communication networks remarkably expands, more various information services have been provided. Thus the number of internet users rapidly increases, and it results in heavy load on Web server and higher traffics on networks. The phenomena cause longer response time that means worse quality of service. To solve such problems, much effort has been attempted to loosen bottleneck on Web server, reduce traffic on networks and shorten response times by caching informations being accessed more frequently at the proxy server that is located near to clients. And it is also possible to improve internet performance further by allowing clients to share informations stored in proxy caches. In this paper, we perform simulations of hierarchical proxy caches with the 3-level 4-ary tree structure by using real web traces, and analyze cache hit ratio for various cache replacement policies and cache sizes when the delayed-store scheme is applied. According to simulation results, the delayed-store scheme increases the remote cache hit ratio, that improves quality of service by shortening the service response time.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.327-332
• /
• 2002

Conventional proxy web cache, which is generally used to caching server, is a content-copy based system. This method focuses on speeding up the phase delivery not improving the webserver performance. However, if immense clients attempt to connect the webserver simultaneously, the proxy web cache cannot achieve the desired result. In this paper, we propose the web accelerator called the SCALA-AX, whitch improves web server performance by accelerating the delivery contents. The SCALA-AX is built in the Linux-based kernel as a kernel modulo and works in combination with the conventional webserver program. The SCALA-AX speeds up the processing rate of the webserver, because it processes the requests using the kernel thread. The SCALA-AX also applies the well-developed cache algorithm to the processing, and thus it obtains the advantage of the caching server without installing additional hardware. A banchmarking test demonstrates that the SCALA-AX improves webserver performance by up to 500％ for content delivery.

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

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

• Journal of Advanced Navigation Technology
• /
• v.23 no.1
• /
• pp.55-60
• /
• 2019

The web is one of the most intimate technologies in people's daily lives, and most of the time, people are sharing data on the web. Simple messenger, news, video, as well as various data are now spreading through the web. In addition, with the emergence of Web assembly technology, the programs that run in the existing native environment start to enter the domain of the Web, and the data shared by the Web is now getting wider and larger in terms of VR / AR contents and big data. Therefore, in this paper, we have studied how to effectively deliver web contentsto users who use Web service by using service worker that can operate independently without being dependent on browser and cache API that can effectively store data in web browser.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1473-1476
• /
• 2001

웹의 이용율 증가로 클라이언트의 요청이 급증하지만 웹 서버의 처리 능력은 한계에 다다르고 있다. 늘어나는 요청율에 응답하기 위해서 웹 서버는 불필요한 오버해드는 피해야 한다. 본 논문에서는 요청들에 대한 처리 순서를 고려함으로써 입출력 오버해드를 줄이는 동적 메인 메모리 캐슁을 제안하였으며 실험 결과 웹 서버의 처리율을 증가시켰다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.434-436
• /
• 2000

기하급수적인 인터넷 사용자의 증가는 네트워크 인프라의 발전속도를 능가하고 있다. 홈페이지를 관리하는 관리자가 네트워크의 대역폭을 늘린다거나 고성능의 서버를 도입하는 등 성능을 향상시키려는 노력을 하지 않는다면 사용자들이 웹에 접속하여 서비스를 받는데 걸리는 시간은 점차 늘어나게 된다. 최근의 사용자들은 정보를 얻기 위해 기다리기보다는 다른 홈페이지로 이동하므로 기업의 홈페이지도 보기 좋고 화려한 것에서 빠르게 접속할 수 있고 간결한 것으로 바뀌고 있다. 또한 더 적은 서버 자원과 네트워크 자원을 사용하는 알고리즘을 도입하여 사용자들을 만족시키려는 노력을 계속하고 있다. 본 논문은 강한 일관성을 유지하면서 서버의 자원을 적게 사용할 수 있는 발전된 적응적 리스 알고리즘을 제안하고 실험을 통하여 성능을 측정한다.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2010.06a
• /
• pp.274-276
• /
• 2010

Ajax(Asynchronous JavaScript and XML)를 이용한 표준 기반의 웹 응용프로그램 개발로 플러그인(Plug-In) 방식의 비표준 웹이 특정 브라우저에 종속적이지 않은 환경으로 변화하였다. 그러나 Ajax 타일지도는 몇 가지 한계점이 있으며 이러한 문제를 해결하기 위해서 본 논문에서는 새로운 HTML5 표준과 인코딩 된 data-URL을 이용하여 레스터웹 지도 서비스에 활용될 수 있는 공간정보 전송 및 저장기법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1691-1694
• /
• 2005

대부분의 웹 캐싱 관련 연구들은 객체적중률의 향상과 캐싱 비용의 절감을 중심으로 이루어졌다. 하지만, 웹 객체 참조의 확률분포특성은 웹 캐싱 기법들의 성능을 감소시키는 중대한 원인이 되고 있다. 따라서 웹 캐싱의 성능을 향상시키기 위해서는 객체 참조의 확률 분포특성을 기반으로 한 캐싱 능력 향상에 대한 연구가 필요하다. 본 연구에서는 객체 참조의 확률분포특성 기반의 적응성을 가진 새로운 웹 캐싱 기법을 제안하였다. 또한 실험을 통해 제안기법의 성능 향상을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.513-515
• /
• 1999

기하급수적으로 증가하는 인터넷 트래픽(traffic)의 대처방안으로 캐시 일관성 유지, 캐싱 알고리즘 등 웹 캐싱에 대한 연구가 끊임없이 진행되고 있다. 본 논문에서는 인터넷 트래픽의 양을 줄이기 위해 다중의 캐시 서버를 설계하였다. 다중의 캐시 서버는 단일 캐시 서버를 사용할 때 발생하는 웹 서버의 부하를 감소시켜 네트웍 트래픽의 양을 줄여준다. 또한 다중의 캐시는 라우터, 디스크, 메모리 같은 하드웨어의 비용을 절감할 수 있어 경제적인 측면에서도 효율적이다.