loading...
A Fuzzy Adaptive Request Distribution Algorithm for Cluster-based Web Systems
Genova, Italy February 05-February 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMPDP.2003.1183576Eleventh Euromicro Conference on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Leszek Borzemski, Wroclaw University of Technology
Krzysztof Zatwarnicki, Technical University of Opole
This paper presents a novel algorithm for distribution of user requests sent to a Web-server cluster driven by a Web switch. Our algorithm called FARD (Fuzzy Adaptive Request Distribution) is a client-and-server-aware, dynamic and adaptive dispatching policy. It assigns each incoming request to the server with the least expected response time, estimated for that individual request. To estimate the expected response times FARD uses the fuzzy estimation mechanism. With respect to the requirement of modifiability of the model, FARD uses a neural network provided with innate abilities for learning and adaptation. We implemented a prototype FARD-based Web switch that was used in experiments carried out to compare its performance to well known representative request distribution algorithms. The measurements show that FARD benefits can be significant, especially for heterogeneous Web clusters.
Citation:
Leszek Borzemski, Krzysztof Zatwarnicki, "A Fuzzy Adaptive Request Distribution Algorithm for Cluster-based Web Systems," pdp, pp.119, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003
Usage of this product signifies your acceptance of the Terms of Use.