Classification-based Dynamic Requests Scheduling Policy in Web Clusters
Hong Ni · Microcomputer applications · 2008
Current requests scheduling policies will cause load imbalance among cluster back-end nodes when applying to dynamic requests.Proposes a classification based dynamic requests policy,CBDRP for short:arranges requests into different classes based on URL patterns,makes requests in each class have the same load characteristic,and dispatches requests in every class with Round-Robin strategy,so we can balance load without any assumption of each request's load.Experiment shows that the throughput of cluster will increase by 51.9% after adopting proposed policy.