Lesson 2: Fullavailability group.
Fullavailability group
The fullavailability group is a discrete link model that uses complete sharing
policy [COST96]. This system is an example of stateindependent system in which the
passage between two adjacent states of the process associated with a givenclass
stream does not depend on the number of busy bandwidth units in the
system.
Thus, the probabilities of passing _{i}(n) are equal to one for all states and
consequently, Equation (10) is reduced to the KaufmanRoberts recursion
[Kauf81, Robe81]:
 (16) 
Formula (16) determines the occupancy distribution in the fullavailability group
with different multirate traffic streams.
The blocking state in the fullavailability group for class i calls occurs only
when the group has less than t_{i} free BBU's required for setting up a connection.
The blocking probability for the class i stream in this case can be expressed by
the formula:
 (17) 
