Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2006.13A.7.615

A Hashing Scheme using Round Robin in a Wireless Internet Proxy Server Cluster System  

Kwak, Huk-Eun (숭실대학교 전자공학과 대학원)
Chung, Kyu-Sik (숭실대학교 정보통신전자공학부)
Abstract
Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.
Keywords
Wireless internet; Proxy server; Cluster; Load Balancing; Hashing; Round Robin;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 B. A. Mah, 'An Empirical Model of HTTP Network Traffic,' Proceedings of INFOCOM, pp. 592-600, 1997   DOI
2 P. Barford and M. Crovella, 'Generating Representative Web Workloads for Network and Server Performance Evaluation,' In Proc. ACM SIGMETRICS Conf., Madison, WI, Jul. 1998   DOI
3 H. Felix, K. Jeffay, and F. Smith, 'Tracking the Evolution of Web Traffic,' Proceedings of the 11th IEEE/ACM International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pp.16-25, 2003   DOI
4 LVS(Linux Vitual Server), http://www.linuxvirtualsever.org
5 D. Rivest, 'The MD5 Message Digest Algorithm,' RFC 1321, 1992
6 David Karger and al. 'Web Caching with consistent hashing,' In WWW8 conference, 1999
7 Mindcraft, Inc., 'WebStone : The Benchmark for Web Server,' http://www.mindcraft.com/web-stone
8 F. Baboescu, 'Proxy Caching with Hash Functions,' Technical Report CS2001-0674, 2001
9 AB(Apache Bench), http://www.apache.org
10 Squid Web Proxy Cache, http://www.squid-cache.org
11 A. Feldmann, R. Caceres, F. Douglis, G. Glass and M. Rabinovich, 'Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments,' In Proceedings of the INFOCOM Conference, 1999   DOI
12 F. Baboescu, 'Proxy Caching with Hash Functions,' Technical Report CS2001-0674, 2001
13 A. Savant, N. Memon and T. Suel, 'On the Scalability of an Image Transcoding Proxy Server,' In IEEE International Conference on Image Processing, Barcelona, Spain, 2003   DOI
14 A. Fox, 'A Framework For Separating Server Scalability and Availability From Internet Application Functionality,' Ph. D. dissertation, U. C. Berkeley, 1998
15 곽후근, 정규식, '무선 인터넷 프록시 서버 클러스터 성능 개선', 한국정보과학회:정보통신, Vol.32, No.3, pp.415-426, 2005   과학기술학회마을