DOI QR코드

DOI QR Code

Hashing Method with Dynamic Server Information for Load Balancing on a Scalable Cluster of Cache Servers

확장성 있는 캐시 서버 클러스터에서의 부하 분산을 위한 동적 서버 정보 기반의 해싱 기법

  • 곽후근 (숭실대학교 IT 대학 정보통신전자공학부) ;
  • 정규식 (숭실대학교 IT 대학 정보통신전자공학부)
  • Published : 2007.10.31

Abstract

Caching in a cache sorrel cluster environment has an advantage that minimizes the request and response tine of internet traffic and web user. Then, one of the methods that increases the hit ratio of cache is using the hash function with cooperative caching. It is keeping a fixed size of the total cache memory regardless of the number of cache servers. On the contrary, if there is no cooperative caching, the total size of cache memory increases proportional to the number of cache sowers since each cache server should keep all the cache data. The disadvantage of hashing method is that clients' requests stress a few servers in all the cache servers due to the characteristics of hashing md the overall performance of a cache server cluster depends on a few servers. In this paper, we propose the method that distributes uniformly client requests between cache servers using dynamic server information. We performed experiments using 16 PCs. Experimental results show the uniform distribution o

캐시 서버 클러스터에서의 캐싱은 인터넷 트래픽 및 웹 유저의 요청 및 응답 시간을 줄여주는 효과를 가진다. 이때, 캐시의 히트율(Hit ratio)을 증가시키는 한 가지 방법은 해시 함수를 이용하여 캐시가 협동성(Cooperative Caching)을 가지도록 하는 것이다. 캐시가 협동성을 가진다는 것은 캐시 서버 수와 무관하게 캐시 메모리 전체 크기를 일정하게 할 수 있다는 것을 의미한다. 반면에 캐시가 협동성을 가지지 않는다면 각 캐시 서버가 모든 캐시 데이터를 가져야 하므로 캐시 메모리 전체 크기가 캐시 서버 수에 비례하여 증가한다. 해싱을 이용한 방법의 문제점은 해시의 특성으로 인해 클라이언트의 요청이 일부 캐시 서버로 집중되고 전체 캐시 서버 클러스터의 성능이 일부 캐시 서버에 종속된다는 점이다. 이에 본 논문에서는 동적 서버 정보를 이용하여 클라이언트의 요청을 일부 캐시 서버가 아닌 전체 캐시 서버에 균일하게 분포시키는 방법을 제안한다. 16대의 컴퓨터를 이용하여 실험을 수행하였고 실험 결과는 기존 방법에 비해 클라이언트의 요청을 캐시 서버들 사이로 균일하게 분포시키고 이에 따라 전체 캐시 서버 클러스터의 성능이 향상됨을 확인하였다.

Keywords

References

  1. D. Zeng, F. Wang, and M. Liu, 'Efficient web content delivery using proxy caching techniques', IEEE Transactions on Systems, Man and Cybernetics, Vol. 34, No.3, pp. 270-280, 2004 https://doi.org/10.1109/TSMCC.2004.829261
  2. J. Challenger, P. Dantzig, A. Iyengar, M. Squillante, and L. Zhang, 'Efficient serving dynamic data at highly accessed web sites', IEEE/ACM Transactions on Networking, Vol. 12, No.2, pp. 233-246, 2004 https://doi.org/10.1109/TNET.2004.826289
  3. P. Trianfillou and I. Aekaterinidis, 'ProxyTeller: a proxy placement tool for content delivery under performance constraints', Proceedings of the 4th International Web Information Systems Engineering, pp. 62-71, 2003
  4. L. Yin and G. Cao, 'Supporting cooperative caching in ad hoc networks', IEEE Transactions on Mobile Computing, Vol. 5, No.1, pp. 77-89, 2006 https://doi.org/10.1109/TMC.2006.15
  5. J. Ni and D. Tsang, 'Large-scale cooperative caching and application-level multicast in multimedia content delivery networks', IEEE Communications Magazine, Vol. 43, No. 5, pp. 98-105, 2005 https://doi.org/10.1109/MCOM.2005.1453429
  6. G. Cao, L. Yin, and C. Das, 'Cooperative cache-based data access in ad hoc networks', IEEE Computer, Vol. 37, No.2, pp. 32-39, 2004 https://doi.org/10.1109/MC.2004.1266293
  7. L. Ramaswamy and L. Liu, 'An expiration age-based document placement scheme for cooperative Web caching', IEEE Transactions on Knowledge and Data Engineering, Vol. 16, No.5, pp. 585-600, 2004 https://doi.org/10.1109/TKDE.2004.1277819
  8. X. Fu and L. Yang, 'Improvement to HOME based Internet caching protocol', IEEE 18th Annual Workshop on Computer Communications, pp. 159-165, 2003 https://doi.org/10.1109/CCW.2003.1240805
  9. H. Mei, C. Lu, and C. Lai, 'An automatic cache cooperative environment using ICP', International Conference on Information Technology: Coding and Computing, pp. 144-149, 2002 https://doi.org/10.1109/ITCC.2002.1000376
  10. C. Chan, S. Huang, andJ. Wang, 'Cooperative cache framework for video streaming applications', International Conference on Multimedia and Expo, pp. 313-316, 2003 https://doi.org/10.1109/ICME.2003.1221616
  11. L. Ramaswamy and L. Liu, 'A new document placement scheme for cooperative caching on the internet', Proceedings of 22nd International Conference on Distributed Computing Systems, pp. 95-103, 2002 https://doi.org/10.1109/ICDCS.2002.1022246
  12. D. Rivest, 'The MD5 Message Digest Algorithm', RFC 1321, 1992
  13. David Karger and al. 'Web Caching with consistent hashing', In WWW8 conference, 1999
  14. Micorsoft Corp., 'Cache Array routing protocol and microsoft proxy server 2.0', White Paper, 1999
  15. F. Baboescu, 'Proxy Caching with Hash Functions', Technical Report CS2OO1-0674, 2001
  16. Toyofumi Takenaka, Satosi Kato, and Hidetosi Okamoto, 'Adaptive load balancing content address hashing routing for reverse proxy servers', IEEE International Conference on Communications, Vol. 27, No.1, pp. 1522-1526, 2004 https://doi.org/10.1109/ICC.2004.1312765
  17. S. Lei and A. Grama, 'Extended consistent hashing: an efficient framework for object location', Proceeding of 24th International Conference on Distributed Computing Systems, pp. 254-262, 2004 https://doi.org/10.1109/ICDCS.2004.1281590
  18. L. Ramaswamy, Ling Liu, and A. Iyengar, 'Cache Clouds: Cooperative Caching of Dynamic Documents in Edge Networks', Proceedings of 25th IEEE International Conference on Distributed Computing Systems', pp. 229-238, 2005 https://doi.org/10.1109/ICDCS.2005.16
  19. Mindcraft, Inc., 'WebStone : The Benchmark for Web Server', http://www.mindcraft.com/web- stone
  20. J. J. Nakano, P. Montesinos, K. Gharachorloo, and J. Torrellas, 'Revivel/O: efficient handling of VO in highly-available rollback-recovery servers', The 12th Internation Symposium on High-Performance Computer Architecture, pp. 200-211, 2006
  21. P. Barford and M. Crovella, 'Generating Representative Web Workloads for Network and Server Performance Evaluation', In Proc. ACM SIGMETRICS Conf., Madison, WI, Jul. 1998 https://doi.org/10.1145/277858.277897
  22. R. Zhang, T. Abdelzaher, and J. Stankovic, 'Efficient TCP connection failover in Web serer clusters', 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1219-1228, March 2004
  23. Squid Web Proxy Cache, http://www.squid-cache.org
  24. W. Liao and P. Shih, Architecture of proxy partial caching using HTTP for supporting interactive video and cache consistency, 11th International Conference Computer Communications and Networks, 2002, pp, 216-221 https://doi.org/10.1109/ICCCN.2002.1043069
  25. 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
  26. D. Lu, Y. Qiao, P. Dinda and F. Bustamante, 'Modeling and Taming Parallel TCP on the Wide Area Network', Proceedings of 19th IEEE International Parallel and Distributed Processing Symposium, April 2005 https://doi.org/10.1109/IPDPS.2005.291
  27. B. A. Mah, 'An Empirical Model of HTTP Network Traffic', Proceedings of INFOCOM, pp. 592-600, 1997 https://doi.org/10.1109/INFCOM.1997.644510
  28. J. Xu and W. Lee, 'Sustaining availability of Web services under distributed denial of service attacks', IEEE Transactions on Computers, Vol. 52, No.2, pp. 195-208, Feb. 2003 https://doi.org/10.1109/TC.2003.1176986