Algorithm For Trunks Required - Lucent Technologies CentreVu Release 3 Version 5 Forecast User Manual

How the Forecast System Generates Data
Requirement Reports
Algorithm for
Trunks Required
f. If any of the new objectives exceeds or falls below the
objectives in the Call Handling Profile, set upper bound =
midpoint. Otherwise, set lower bound = midpoint.
g. Compute the new midpoint.
h. If the new midpoint changed less than 0.001 from the previous
midpoint, end the search. Return the midpoint as the load.
Otherwise, repeat Steps d through h using the new midpoint.
3. Convert the load into calls carried.
When you enter a range of numbers, you can set graduations to yes
or no. With no graduations, the algorithm does its computations for
every number in the range. With graduations, the algorithm starts its
computations with the closest number in the following set and
proceeds as follows: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20,
25, 30, 35, 40, 45, 50, 60, 70, 80, 90, 100...(continuing by tens).
This algorithm computes how many calls a given number of trunks can
handle per intrahour interval. The number of trunks can be a number or a
6
range of numbers. The results of the algorithm are within the trunk
blocking probability and the average trunk holding time you specify in the
report.
1. Determine the number of trunks for which the calls carried is to be
computed.
2. For each number of trunks, compute the load.
The following search computes the load using an upper and lower
bound:
a. Set the lower bound for the load to 0.
b. Set the upper bound for the load to the number of trunks, and,
while the blocking probability produced by the number of trunks
and the high load is
bound.
c. Compute the midpoint.
Midpoint
d. Calculate the blocking probability using the midpoint as the
load.
CentreVu CMS R3V5 Forecast 585-215-825
blocking objective, double the upper
lower bound + upperbound
= ---------------------------------------------------------------------- -
2
6-17