Reducing Network Congestion and Blocking Probability Through Balanced Allocation

We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that is based on the balanced allocations principle [4, 18] - the Balanced Dynamic Alternative Routing (BDAR) algorithm. While the standard technique checks alternative routes sequentially until available bandwidth is found, the BDAR algorithm compares and chooses the best among a small number of alternatives. We show that, at the expense of a minor increase in routing overhead, the BDAR gives a substantial improvement in network performance in terms of both network congestion and blocking probabilities.

• Type: Conference
• Year: 1999
• Where: FOCS
• Authors: Malwina J. Luczak, Eli Upfal
• Keywords: Balanced Dynamic Alternative, Dynamic Alternative, FOCS 1999, Standard Dynamic Alternative, Theoretical Computer Science