[OpenSIPS-Users] Dispatcher algorithm question

[Gunjan Korlekar]

Hello,

I have a dispatcher table with about 10 destinations and was using the
round-robin algorithm to route to destinations since we wanted to have an
even spread of traffic across the destinations. However I recently observed
that with the round-robin, re-INVITEs with the same call id get routed to
different destinations which we thought the dispatcher would handle. So we
figured that if we want to circumvent this problem we need to use the hash
over call-id algorithm.

Does the 'hash over call-id' give a fair way of distributing the calls over
different destinations in the dispatcher like the round robin so that the
traffic is spread evenly over the destinations?
Is there a way we can combine the two algorithms for one set of
destinations?

-- 
Thanks,
Gunjan
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.opensips.org/pipermail/users/attachments/20160229/deb8c68e/attachment.htm>