Hi. You could use prefix_range indexing in postgresql for fast longest match lookup
works pretty fast on millions routes for us.
On 9/5/17 3:02 AM, Patrick Wakano wrote:
Hello list,
Hope you all doing well!
I am trying to ease the management of LCR routing rules, since once we begin to have
multiple prefixes, multiple GWs and so on, the visualization and management of the rules
priorities becomes exponentially hard to do.
So first thing I am trying to achieve is an easy way of retrieving the rules in an
ordered manner. I couldn't find any tool to do such thing and source code was not very
friendly.... so I've come up with this Postgresql query that I think retrieves all
rules in the same order I expect LCR to select
the GWs.
SELECT lr.lcr_id, lr.prefix, lrt.priority, lg.gw_name, lg.ip_addr
FROM lcr_rule lr
JOIN lcr_rule_target lrt ON lrt.lcr_id = lr.lcr_id AND lrt.rule_id = lr.id
<http://lr.id>
JOIN lcr_gw lg ON lg.lcr_id = lr.lcr_id AND lg.id <http://lg.id> = lrt.gw_id
WHERE lr.enabled = 1 AND lg.defunct = 0 AND lr.lcr_id = ID AND lr.prefix SIMILAR TO
'(|PREFIX%)'
ORDER BY lr.lcr_id, LENGTH(lr.prefix) DESC, lrt.priority;
It is missing the weights calculation, but it is rather complex and I am not using it
anyway.... Other than that does anyone did something similar to check if my query really
matches what LCR engine does?
Thanks,
Patrick Wakano
_______________________________________________
Kamailio (SER) - Users Mailing List
sr-users(a)lists.kamailio.org
https://lists.kamailio.org/cgi-bin/mailman/listinfo/sr-users