|
hai....
i want ask about weight least connection scheduling
method, can anyone help me expalin about this formaula
?
Supposing there is n real servers, each server i has
weight Wi (i=1,..,n), and alive connections Ci
(i=1,..,n), ALL_CONNECTIONS is the sum of Ci
(i=1,..,n), the next network connection will be
directed to the server j, in which
(Cj/ALL_CONNECTIONS)/Wj = min {
(Ci/ALL_CONNECTIONS)/Wi } (i=1,..,n)
Since the ALL_CONNECTIONS is a constant in this
lookup, there is no need to divide Ci by
ALL_CONNECTIONS, it can be optimized as
Cj/Wj = min { Ci/Wi } (i=1,..,n)
thank You so much
alex
__________________________________________________
Do You Yahoo!?
Yahoo! Finance - Get real-time stock quotes
http://finance.yahoo.com
|
