A use case for the above request is where contacts for an AOR are distributed in a system. The UA's come up with qvalue based on there utilization etc. The idea is to send the call to the contact who has been least used. I cannot enforce that the qvalues generated by the UA's are unique unless I use a sequencing mechanism between the UA's.

On 2/27/08, Bogdan-Andrei Iancu <bogdan@voice-system.ro> wrote:

Hi Amit,

First of all, the behaviour you want to achieve is against RFC3261
(forking based on q value), but for sure you know better what you try to
get ;)

Now, depending where you take the list of destinations from, let's
assume you can get them into AVPs. For how to do serial forking from
AVPs, see:
   http://www.voice-sistem.ro/docs/avpops/ar01s08.html#ex_serial_forking

Regards,
Bogdan

Amit Sharma wrote:
>  Hi All,
>
>  I am a newbie to this list so please forgive me if the question below
> has been discussed before. I could not find anything related so i am
> sending my query.
>
>  I have been looking at the LCR module to do serial forking since we
> want to prioritize contacts based on q values. However, we do not want
> to fork in parallel to contacts even if they share the same q value.
> AFAIK,this is currently not possible with the LCR module.
>
>  Would it be a good idea to have a parameter (e.g "append-branches")
> in the LCR module which can control the forking behavior when q value
> of contacts is the same?
>
>  Thanks,
>  Amit
>
> ------------------------------------------------------------------------
>
> _______________________________________________
> Users mailing list
> Users@lists.openser.org
> http://lists.openser.org/cgi-bin/mailman/listinfo/users
>