Ok, another 2ct from me.
1st of all we could addopt Netikos keyword matching logic, they have
enhanced it and code can be derived from their tree.
2nd, PCRE or regexp support would be definetly nice to have and mostly
easy to implement I guess. Any volonteers?
3rd, keyword dependency matching should be done (IMO) via an OpenLDAP
tree. This solves also the issues of restarting Kannel for service
group changes.
So your LDAP tree would look like
services
|
-- service A
|
-- keyword 1.A
keyword 2.A
keyword 2.B
-- keyword 1.B
which means smsbox would match the first keyword (keyword 1.A) and
then traverse the node for more dependency matchings (if available),
hence match for keyword 2.B and execute the defined action (get-url,
exec, or whatever)
Does anyone know if OpenLDAP supports client side caching? Ideally the
OpenLDAP client code would hold the tree in memory (without issueing
lookup request to the server) until the server "signals" clients to
update their table because updates in the tree have happened. Any LDAP
gurus arround?
@Alex: can you have a deeped look at Netikos version for the keyword
matching features they implemented in their Kannel tree?!
Stipe
[EMAIL PROTECTED]
-------------------------------------------------------------------
Wapme Systems AG
Vogelsanger Weg 80
40470 D�sseldorf
Tel: +49-211-74845-0
Fax: +49-211-74845-299
E-Mail: [EMAIL PROTECTED]
Internet: http://www.wapme-systems.de
-------------------------------------------------------------------
wapme.net - wherever you are
