|
Hi,
On Wed, 7 May 2003, Marko Buuri wrote:
> >In the WLC algorithm, a new incoming job will not be counted in the
> >comparison of jobs/weight. So, in your example, the former
> >server has the
> >value (0/1) and the latter one has the value (1/3), then the
> >former server
> >is selected for the new job.
>
> Hi,
>
> Actually according to the URL below, alive connections Ci for each
> server i is always 1 or more in WLC scheduling. Therefore I assume the
I read the document of LVS scheduling algorithms again, there is no such
assumption that the alive connection number for each server is always 1 or
more in the WLC.
In the implementation, the number of connections per each server can be
any value in the interval of [0, 2^32].
> scheduling works like classic SED policy which is defined for server i
> as SED(i) = (ni + 1) / ui, where ni is number of current jobs in server
> i, and ui is service rate for server i. Note that because of the
> incrementation by 1, the dividend is never less than 1. Just like it
> appears to be for WLC scheduling as well.
>
>
> URL: http://www.linuxvirtualserver.org/docs/scheduling.html
>
Regards,
Wensong
|
