[SR-Users] Query regd the dispatcher algorithm support
miconda at gmail.com
Thu Nov 14 10:21:14 CET 2013
there is no such algorithm done internally. But you can get it via
- use two set ids, first with the 3 nodes and then the second with the
other 2 nodes
- first to ds_select_*(setid1, 4) and ds_next_*() utill you consume all
- if no answer yet and no more addresses with setid1, then call
ds_select_*(setid2, 4) and ds_next_*()
You can also look to see if weight based distribution fits your needs,
so you can have the 3 good nodes with high weight and the other with
something lower. But it won't try first the 3 good ones, it will
distribute across all of them based on their weight.
On 11/14/13 2:54 AM, santosh satapathy wrote:
> Any input for the below query is highly appreciated.
> Does the dispatcher module allow combination like "weighted round
> robin" algorithm. Or Do we have any similar algorithm ?
> 3 of 5 nodes are in better condition so I set them as weight 1 and the
> other two as weight 2.
> Then the dispatcher will round robin between the 3 nodes with weight 1
> until all 5 are with the same weight.
> That also means that the weight should be dynamic and updated as
> conditions of the node changes.
> SIP Express Router (SER) and Kamailio (OpenSER) - sr-users mailing list
> sr-users at lists.sip-router.org
Daniel-Constantin Mierla - http://www.asipto.com
http://twitter.com/#!/miconda - http://www.linkedin.com/in/miconda
Kamailio Advanced Trainings - Berlin, Nov 25-28
- more details about Kamailio trainings at http://www.asipto.com -
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the sr-users