• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.603-608
• /
• 2005

Disk I/O is a major performance bottleneck of web proxy server. Today's most web proxy sowers are design to run on top of a general purpose file system. But general purpose file system can not efficiently handle web cache workload, small files, leading to the performance degradation of entire web proxy servers. In this paper we evaluate the performance potential of raw disk to reduce disk I/O overhead of web proxy servers. To show the performance potential of raw disk, we design a storage management system called Block-structured Storage Management System (BSMS). And we also actually implement web proxy server that incorporate BSMS in Squid. Comprehensive experimental evaluations show that raw disk can be a good solution to improve disk I/O performance significantly for web proxy servers.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.28-30
• /
• 2002

대규모 네트워크 환경에서의 Web Proxy 서버의 효과와 유용성을 알아보기 위하여 방대한 규모의 인터넷을 실제로 구축하고 구축된 환경에서 다양한 알고리즘을 실험하는 것도 우수한 전략이나 대규모 네트워크를 모델링한 후 다양한 환경에 대하여 시뮬레이션을 수행하는 것도 여러 점에서 장점을 가지고 있다. SSFNet(Scalable Simulation Framework Net)은 대규모 네트워크의 행동을 효과적으로 시뮬레이션할 수 있는 기반을 제공하고 있다. 그러나 SSFNet을 이용하여 Web proxy의 효과를 측정하기에는 여러 가지 한계를 가지고 있다. 이에 본 연구에서는 SSFNet을 확장하고 SSFNet상에서 구동되는 Web Proxy 서버와 사용자 모델을 구축하였다. 본 연구의 결과로 구축된 시뮬레이션 기반은 다양한 Web proxy 서버의 연구에 유용하게 사용될 것으로 본다.

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

최근 기하급수적으로 증가하는 WWW(World Wide Web)의 사용으로 인하여 전체적인 네트워크의 성능이 저하되어 서버가 클라이언트에 빠른 서비스를 할 수 없는 경우가 자주 발생되고 있다. 이러한 서비스 지연의 해결방안으로 web proxy를 사용하여 서버의 부하와 traffic을 줄이는 방법을 많이 사용하고 있다. 이와 같은 web proxy는 인터넷상에서의 위치에 따라 그 효용이 달라지게 되는데, 이와 관련하여 [5]에서는 트리 구조의 인터넷상에서 전체적인 access time을 줄이기 위해 미리 정해진 개수(M)의 proxy의 위치를 구하는 방법에 대해 설명하고 있다. 하지만 서버 관리자의 측면에서는 서버를 구축하고 유지하는데 드는 비용과 직결되는 필요한 proxy의 개수를 정하는 것도 중요한 문제이다. 그러므로 본 논문에서는 인터넷상에서 트리 구조의 서비스 노드들 각각이 정해진 임계 응답시간을 만족하기 위해 필요한 최소한의 proxy의 개수와 그의 위치를 동시에 찾아내는 알고리즘을 제안한다.

• Journal of Internet Computing and Services
• /
• v.13 no.6
• /
• pp.55-62
• /
• 2012

Grid web applications by standard Web technology are increasingly used to provide grid service to users as normal Web user interface and service. It is however difficult to integrate a grid security system such as Grid Security Infrastructure (GSI) into Web applications because the delegation way of standard Web security is not the same as the one of Grid security. This can be solved by allowing Web applications to get a Grid credential by using an online credential repository system such as MyProxy. In this paper, we investigate the problem that occurs when MyProxy, which assumes mutual trust between a user and Grid web application, is adapted for achieving security integration between Web and Grid, and we propose a new Grid proxy delegation service to delegate a Grid credential to the Web without assuming mutual trust. In the service, the X.509 proxy delegation process is added to OAuth protocol for credential exchange, and authentication can be done by an external service such as OpenID. So, users can login onto the Grid web application in a single sign-on manner, and are allowed to securely delegate and retrieve multiple credentials for one or more Virtual Organizations.

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

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.9
• /
• pp.1011-1018
• /
• 2014

Because of the proliferation of web services through web site, web hacking attempts are increasing using vulnerabilities of the web application. In order to improve the security of web applications, we have to find vulnerabilities in web applications and then have to remove. This paper addresses a vulnerability in a web application on existing problems and analyze and propose solutions to the vulnerability. This paper have checked the stability of existing web security solutions and evaluated its suitability through analysis of vulnerability. Also, we have implemented the vulnerability analysis tools for web Proxy system and proposed methods to optimize for resolution of web vulnerabilities.

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

• Journal of Information Technology and Architecture
• /
• v.10 no.2
• /
• pp.159-167
• /
• 2013

Web Services offer many benefits over other types of middleware in distributed computing. However, usage of Web Services results in large network bandwidth since Web Services use XML-based protocol which is heavier than binary protocols. Even though there have been many researches to minimize the network traffic and bandwidth usages of Web Services messages, none of them are solving problem clearly yet. In this paper, we propose a transparent proxy with cache to avoid transfer of repeated SOAP data, sent by Web Service to an application. To maintain the cache consistency, we introduce publish/subscribe paradigm using WS-Eventing between the proxy and Web Service. The implemented system based on our proposed architecture will not compromise the standards of Web Service. The evaluation of our system shows that caching SOAP messages not only reduces the network traffic but also decreases the request delays.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.346-353
• /
• 2002

The explosive increase of World Wide Web usage has incurred significant amount of network traffic and server load. To overcome these problems, web proxy caching replicates frequently requested documents in the web proxy closer to the users. Cache utilization depends on the replacement policy which tries to store frequently requested documents in near future. Temporal locality and Zipf frequency distribution, which are commonly observed in web proxy workloads, are considered as the important properties to predict the popularity of documents. In this paper, we propose a novel cache replacement policy, called Adaptive LFU (ALFU), which incorporates 1) Zipf frequency distribution by utilizing LFU and 2) temporal locality adaptively by measuring the amount of the popularity reduction of documents as time passed efficiently. We evaluate the performance of ALFU by comparing it to other policies via trace-driven simulation. Experimental results show that ALFU outperforms other policies.

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