[SR-Users] High performance routing options
Henning Westerholt
henning.westerholt at 1und1.de
Tue Sep 7 17:22:37 CEST 2010
On Monday 06 September 2010, Alex Balashov wrote:
> We use this in our solutions and search hundreds of millions of routes
> with it in 2-3 ms. It works very well, to say the least, because it
> is an approach that allows application of complex business logic
> (using stored procedures) to the results, something which is much
> harder with a more primitive (if faster) in-memory structure. Best of
> all, it is specifically designed to deal with the problem of variable-
> length prefixes, so many of the prefix length constraints and/or
> homogeneity requirements of other routing and LCR engines are
> eliminated.
Hi Alex,
thanks for the interesting informations.
> It is not possible to say whether a database-backed structure is
> loaded "from memory"; this is a gross oversimplification of a very
> complex issue.
> [..]
Of course i was overly simplifying here. But if you have a sufficient small
database with a proper configuration and enough memory you could actually
reach a performance in this area.
Henning
More information about the sr-users
mailing list