Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.