Installation guide

Table Of Contents
Quadro2x Manual II: Administrator's Guide Administrator’s Menu
Quadro2x, Quadro2xi; SW Version 3.1.x 64
Best Matching Algorithm
The Best Matching Algorithm is used by the Routing Agent (RA) to sort the list of the patterns that match a dialed number. Sorting is done by the
following principle: the more the pattern matches the dialed number, the higher its priority.
To decide which of the selected patterns matches the dialed number more in comparison with the others, the following list of criteria is used (List 1).
The criteria are ordered by their priorities: that is Criterion 2 is calculated only if more than one pattern takes the same value for Criterion 1, Criterion
3 is calculated only if more than one pattern takes the same value for Criterion 2 (obviously for Criterion 1 as well) etc. Each consecutive criterion
is calculated only if more than one pattern takes the same value for the preceding criteria.
List 1
Criterion 1 The presence of asterisks (“*”) in a pattern
The patterns without “*” have higher priority.
Criterion 2 The number of matching digits/symbols
The more matching digits a pattern has, the higher its priority.
Criterion 3 The number of square brackets (“[]”)
The more ranges a pattern has, the higher its priority.
Criterion 4 The number of question marks (“?”)
The more question marks a pattern has, the higher its priority.
Criterion 5 The number of braces (“{}”)
The more ranges a pattern has, the higher its priority.
Criterion 6 The number of asterisks (“*”)
The fewer asterisks a pattern has, the higher its priority.
Criterion 7 The value of the metric
The lower the metric of a pattern is, the higher its priority.
Criterion 8 The position in the routing table
The higher the position of a pattern in the routing table is, the higher its
priority.
The algorithm is discussed in the example below.
Example The user has dialed 1231 and Routing Agent has found the following list of matching patterns.
1. The list of
matching patterns
found by RA
2. *1*
3. 123*
4. {11-15}3*
5. ?2?1
6. 123?
7. [1-3]*
8. [1-3]???
9. {100-150, asd,
\*\?}1
10. 12*31
11. 1[1-3]3[0-8]
12. 1231
13. *2*1
14. *
The step by step discussion of the Best Matching Algorithm is as follows.
Step 1: The list is split into two groups separating the patterns with “*” from the ones without (Criterion 1). The patterns with “*” form a group with
lower priority and are pushed back to the end of the list (Table 1).