Enterasys 6000 User Guide
Appendix B
Hunt Group Example
Here is an example of how the hunt group function works, using the algorithm
Least
LCN With Thruput
. The routing path process will calculate a loading factor based on
the number of LCNs in use and the line speeds for each Call Request received. The
method is proprietary, but is described generally here.
method is proprietary, but is described generally here.
Ports and letter symbols in the example are:
Line
Speed
LP 0, port 0
2400 bps
LP 1, port 0
4800 bps
LP 1, port 1
in failed state, but is defined as a routing path
LP 1, port 2
9600 bps
M
= The maximum bps of any operational line in this routing path group.
w
= The bps of an individual line.
U
= A proprietary line utilization factor, taking into account the number of
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:
on any line. The lines will have the following process variables:
Line
Speed
M/w
U
0,0
2400
4
4
1,0
4800
2
2
1,1
failed
1,2
9600
1
1
A Call Request will be routed on line 1,2, since it has the lowest
U
. The next Call
Request will produce a new calculation for
U
for all lines, and will again be routed on
the lowest
U
line:
Line
U
0,0
4
1,0
2
1,1
failed
1,2
2
In this case, other system factors will determine whether line 1,0 or line 1,2 will be
selected. If we assume 1,0 is selected, the new values of
selected. If we assume 1,0 is selected, the new values of
U
will be as follows, giving
line 1,2 the next call:
Line
U
0,0
4
1,0
4