Hello, I was wondering about how to achieve some kind of weighted round-robin with OpenBSD...
So far, we can achieve some limited weighted round-robin by using rdr's with lists, and repeating the stronger nodes in the list. (Is there a limit to the number of nodes in a list??) This is what we use on our webserver pool. Having this kind of control is necessary, since pretty much every unused machine we have ends up in the webserver pool to meet growing demand. The only sad thing is that we can't use relayd to automate removal of failed nodes, because we don't use tables. We're planning to resort on a scripted solution to generate a ruleset based on our own host checks (using rdr lists, anchors, etc.) . But before taking this path, I was wondering if people on misc@ had found clever ways of achieving the same result without too much scripting. Thanks in advance, -- Pascal
