Loss formulas for homogeneous gradings of the second order in telephone switching employing random hunting

In such a grading (with s groups and n trunks per "sub-group") Longley's coefficients do not differ appreciably from their limiting values for infinite traffic per group. This allows the separation of basic equations of state (random input, exponential holding time), and expressions for the loss W (in the limiting case) have the same general form, governed by a recurrence relation for (n,s) and (n,s+1). The evaluation of W is illustrated by several examples, and extensive tables giving traffic offered per group for fixed values of loss, n and s are provided.