Browse > Article

Effective Prioritized HRW Mapping in Heterogeneous Web Server Cluster  

김진영 (LG전자 전자기술원)
김성천 (서강대학교 컴퓨터학과)
Abstract
For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.
Keywords
cluster; content-based; mapping; heterogeneous; priority;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 David G. Thaler, Chinya V. Ravishankar, 'Using Name-Based Mappings to Increase Hit Rates,' EEE/ ACM Transactions on Networking, Vol. 6 No.1, pp. 1-14, Feb. 1998   DOI   ScienceOn
2 Robert Elsasser, Burkhard Monien, Robert Preis, 'Diffusive Load Balancing Schemes on Heterogeneous Networks,' Twelfth annual ACM symposium on Parallel algorithms and architectures, pp. 30-38, Jul. 2000
3 Pangfeng Liu, Tzu-Hao Sheng, 'Broadcast Scheduling Optimization for Heterogeneous Cluster Systems,' Twelfth annual ACM symposium on Parallel algorithms and architectures, pp. 129-136, Jul. 2000
4 P. Barford and M. Crovella. 'Generating representative workloads for network and server performance evaluation,' Proceedings of ACM SIGMETRICS'98, pp. 151-160, June 1998   DOI
5 Chris Faisstnauer, dieter Schmalstieg, Werner Purgathofer, 'Priority Round-Robin Scheduling for Very Large Virtual Environments,' Proceedings of the IEEE Virtual Reality 2000 Conference, pp. 135-142, Mar. 2000
6 Paul Barford, Mark Crovella, 'Measuring Web Performance in the Wide Area,' Special Issue on Network Traffic Measurement and Workload Characterization, Aug. 1999
7 'SPECweb99 Release 1.02,' http://www.spec.org. Jul. 2000
8 'Layer 2 Traffic Prioritization,' http//www.intel.com/network/white_papers/
9 Fred A. Maymir-Ducharme, 'Dynamic Priorities, Priority Scheduling and Priority Inheritance,' Proceedings of the fourth international workshop on Real-time Ada issues, pp. 39-45, Jul. 1990   DOI
10 Ron Cocchi, Deborah Estrin, Scott Shenker, Lixia Zhang, 'A Study of Priority Pricing in Multiple Service Class Networks,' Proceedings of the conference on Communications architecture & protocols, pp. 123-130, Sep, 1991   DOI
11 Vivek S. Pai, Mohit Aron, Erich Nahum, 'Locality-Aware Request Distribution in Clusterbased Network Servers,' Proceedings of the 8th international conference on Architectural support for programming languages and operating systems, pp. 205-216, 1998
12 Chu-Sing Yang, Mon-Yen Luo, 'International Conference on Parallel Processing, pp. 240-245, 1999   DOI
13 Mohammad Banikazemi, Vijay Moorthy, Dhabaleswar K. Panda, 'Efficient Collective Communication on Heterogeneous Networks of Workstations,' National Science Foundation, Jun. 2000