Capacity expansion of least busy alternate routing with shadow price

In this paper, we develop a capacity expansion algorithm for least busy alternate routing (LBAR). In LBAR, an arriving call is attempted first on the one-link path (if it exists), and it is carried if the link has an idle circuit. Otherwise, the call is attempted on a least busy two-link path. The use of two-link paths is governed by the trunk reservation, which is defined by parameter r. For the least busy two-link path chosen, if each of the two links in the path has at least r+l idle circuits, then the call is carried. Otherwise, it is rejected from the network.