Hunt Group Example - Cabletron Systems Netlink FRX4000 User Manual

Search Order for Subscriber Addresses

Hunt Group Example

A subscriber address that includes a wildcard potentially matches more addresses than
one with no wildcards. For example, the address
Without a checking mechanism an address with no wildcards could be read as a match
for an address with a wildcard, and sent to the wrong place. To avoid this, a search
order has been established for performing call routing:
Addresses with no wildcards will be searched first.
Addresses with only
Addresses with
*
Within each wildcard group, addresses with the most non-wildcard digits will be
checked first. For example,
Here is an example of how the hunt group function works, using the algorithm
. The routing path process will calculate a loading factor based on
LCN With Thruput
the number of LCNs in use and the line speeds for each Call Request received. The
method is proprietary, but is described generally here.
Ports and letter symbols in the example are:
Line Speed
RLP 0, port 0 2400 bps
RLP 1, port 0 4800 bps
RLP 1, port 1 in failed state, but is defined as a routing path
RLP 1, port 2 9600 bps
= The maximum bps of any operational line in this routing path group.
M
= The bps of an individual line.
w
= A proprietary line utilization factor, taking into account the number of
U
active VCs on the line, and the line's speed.
To illustrate how calls will be distributed among these lines, assume there are no calls
on any line. The lines will have the following process variables:
Line Speed
M/w
0,0 2400 4
1,0 4800 2
1,1 failed
1,2 9600 1
A Call Request will be routed on line 1,2, since it has the lowest
Request will produce a new calculation for
the lowest line:
U
Line
U
0,0 4
1,0 2
1,1 failed
1,2 2
wildcards will be checked next.
?
will be checked last.
will be checked before
311012345678*
U
4
2
1
for all lines, and will again be routed on
U
matches all other addresses.
*
3110*
. The next Call
U
.
Least