[SR-Users] Dispatcher Failover algorithm

[Daniel-Constantin Mierla]

It is 8. I added a bit more clear phrasing on the description:

-
http://kamailio.org/docs/modules/devel/modules/dispatcher.html#dispatcher.f.ds_select_dst

Cheers,
Daniel

On 10/01/15 00:31, Yuriy Gorlichenko wrote:
> Priority bassed? I've read about all algorithms of disatcher and can
> not find that anone use priority... 
>
>  *
>
>     “0” - hash over callid
>
>  *
>
>     “1” - hash over from URI.
>
>  *
>
>     “2” - hash over to URI.
>
>  *
>
>     “3” - hash over request-URI.
>
>  *
>
>     “4” - round-robin (next destination).
>
>  *
>
>     “5” - hash over authorization-username (Proxy-Authorization or
>     "normal" authorization). If no username is found, round robin is used.
>
>  *
>
>     “6” - random (using rand()).
>
>  *
>
>     “7” - hash over the content of PVs string. Note: This works only
>     when the parameter hash_pvar is set.
>
>  *
>
>     “8” - use first destination (good for failover).
>
>  *
>
>     “9” - use weight based load distribution. You have to set the
>     attribute 'weight' per each address in destination set.
>
>  *
>
>     “10” - use call load distribution. You have to set the attribute
>     'duid' (as an unique string id) per each address in destination
>     set. Also, you must set parameters 'dstid_avp' and 'ds_hash_size'.
>
>     The algorithm can be used even with stateless proxy mode, there is
>     no SIP dialog tracking depending on other modules, just an
>     internal lightweight call tracking by Call-Id, thus is fast and
>     suitable even for embedded systems.
>
>     The first destination selected by this algorithm is the one that
>     has the least number of calls associated. The rest of the
>     destination list is taken in order of the entries in set - anyhow,
>     until a re-route to next destination happens, the load on each
>     address can change.
>
>     This algorithm can be used only for dispatching INVITE requests as
>     it is the only SIP method creating a SIP call.
>
>  *
>
>     “X” - if the algorithm is not implemented, the first entry in set
>     is chosen.
>
>
> 2015-01-09 20:23 GMT+03:00 Daniel-Constantin Mierla <miconda at gmail.com
> <mailto:miconda at gmail.com>>:
>
>     You probably look for priority based routing -- see the readme of
>     dispatcher module.
>
>     Cheers,
>     Daniel
>
>
>     On 09/01/15 17:52, Yuriy Gorlichenko wrote:
>>     I as wrote before - we find dispatcher algorithm than can do
>>     mechanism something like this:
>>     Try call to fist server with max priority or weight. OIf this
>>     server unavailible then call second server with less weight and etc.
>>
>>     Does anyone know what ling of algorithm we can use for this?
>>
>>
>>     _______________________________________________
>>     SIP Express Router (SER) and Kamailio (OpenSER) - sr-users mailing list
>>     sr-users at lists.sip-router.org <mailto:sr-users at lists.sip-router.org>
>>     http://lists.sip-router.org/cgi-bin/mailman/listinfo/sr-users
>
>     -- 
>     Daniel-Constantin Mierla
>     http://twitter.com/#!/miconda <http://twitter.com/#%21/miconda> - http://www.linkedin.com/in/miconda
>
>
>     _______________________________________________
>     SIP Express Router (SER) and Kamailio (OpenSER) - sr-users mailing
>     list
>     sr-users at lists.sip-router.org <mailto:sr-users at lists.sip-router.org>
>     http://lists.sip-router.org/cgi-bin/mailman/listinfo/sr-users
>
>

-- 
Daniel-Constantin Mierla
http://twitter.com/#!/miconda - http://www.linkedin.com/in/miconda

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.sip-router.org/pipermail/sr-users/attachments/20150112/c6b1f709/attachment.html>