Title :
Capacity expansion of least busy alternate routing with shadow price
Author :
Rayes, A. ; Min, P.S.
Author_Institution :
Bellcore, Piscataway, NJ, USA
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
Keywords :
channel capacity; stochastic processes; telecommunication network routing; Poisson process; arriving call; capacity expansion algorithm; fixed point algorithm; least busy alternate routing; least busy two-link path; one-link path; shadow price; trunk reservation; Capacity planning; Circuits; Computational complexity; Computer networks; Constraint optimization; Costs; Distributed computing; Probability; Routing; Shape;
Conference_Titel :
Global Telecommunications Conference, 1995. GLOBECOM '95., IEEE
Print_ISBN :
0-7803-2509-5
DOI :
10.1109/GLOCOM.1995.502626
