Delay-bounded Dispatching Mechanism for Supporting Multiple Priorities
Zengzhi Li · Jisuanji fangzhen · 2007
To guarantee different priorities'users to have pre-specified delay under varying the number of accessing users,a new probability-based dispatching mechanism in cluster-based web servers was proposed.In this mechanism,the choice probability of each priority users'requests was formulized according to queue theory,and was solved by bisearch;the choice probability of each priority's requests was adapted to the varying number of accessing users by predicting parameters.The simulation results show probability-based dispatching mechamism can succeed in ensuring users of the priority with pre-specified delay under the different number of accessing users.