Annals of Operations Research

, Volume 35, Issue 1, pp 3–30

State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design


  • Debasis Mitra
    • AT&T Bell Laboratories
  • Richard J. Gibbens
    • AT&T Bell Laboratories
Loss Networks

DOI: 10.1007/BF02023088

Cite this article as:
Mitra, D. & Gibbens, R.J. Ann Oper Res (1992) 35: 3. doi:10.1007/BF02023088


We investigate a distributed, state-dependent, dynamic routing strategy for circuit-switched loss networks which we have called Aggregated-Least-Busy-Alternative (ALBA). The networks considered are symmetric and fully connected, the offered calls form Poisson streams and routes have at most two links. In ALBA(K), the states of each link are lumped intoK (K ≥ 2) aggregates and the route of each call is determined by local information on the aggregate-states of the links of the alternate routes. The last aggregate is always the set of states reserved for direct traffic and defined by the trunk reservation parameter. The particular case of ALBA in which there is no aggregation is Least-Busy-Alternative (LBA); ALBA(2) represents the other extreme of aggregation. We consider two separate asymptotic scalings based on Fixed Point Models for ALBA(K) which were obtained and investigated in an earlier paper. In the first, it is assumed that the number of network nodes, the offered traffic and trunk group size are all large; their ratios have been chosen to reflect practical interest. The results show that there exists a threshold which delineates fundamentally different behavior: for offered traffic below the threshold, the network loss probability decreases exponentially with increasing network size, while above the threshold the decrease is only polynomial. In the related second asymptotic scaling, the asymptotically optimum trunk reservation parameter is obtained as the solution of a simple equation. Such asymptotically optimal designs are compared to the outputs of exhaustive numerical searches for some realistically sized networks and found to perform very well.

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1992