Label Routing: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
Routeset routing is an algorithm that combines [[ | Routeset routing is an algorithm that combines [[Digit Analyzer|Digit Analyzer]] and the concept of [[RouteSet|RouteSet]]. It is implemented as a [[Scriptable Routing Engine|RoutingScript]] in Toolpack Gateway. This algorithm allows complex routing rules, as normally available with [[Scriptable Routing Engine|RoutingScript]], but on a very large number of destination numbers. | ||
== Functionality == | |||
The concept is very simple. | |||
#A list of numbers for a specific destination is given a [[RouteSet|RouteSet]] name. This list can be very large.<br>ie: 514201,514202,514203, ... -> "Montreal, Qc" | |||
#The list of routes for the destination is given the same [[RouteSet|RouteSet]] name. This list usually limits to the number of [[NAP|NAP]] in the system.<br>ie: Bell, Rogers, Videotron -> "Montreal, Qc" | |||
No matter how many destination number leading to a specific destination, only a limited list of routes gets selected. Then complex routing rules can takes places, efficiently.<br> | |||
Revision as of 10:33, 18 March 2010
Routeset routing is an algorithm that combines Digit Analyzer and the concept of RouteSet. It is implemented as a RoutingScript in Toolpack Gateway. This algorithm allows complex routing rules, as normally available with RoutingScript, but on a very large number of destination numbers.
Functionality
The concept is very simple.
- A list of numbers for a specific destination is given a RouteSet name. This list can be very large.
ie: 514201,514202,514203, ... -> "Montreal, Qc" - The list of routes for the destination is given the same RouteSet name. This list usually limits to the number of NAP in the system.
ie: Bell, Rogers, Videotron -> "Montreal, Qc"
No matter how many destination number leading to a specific destination, only a limited list of routes gets selected. Then complex routing rules can takes places, efficiently.