Asymptotically optimal loss network control
Mathematics of Operations Research
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Routing in communications networks
Balanced allocations for tree-like inputs
Information Processing Letters
On the analysis of randomized load balancing schemes
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Load balancing and density dependent jump Markov processes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
The power of two choices in randomized load balancing
The power of two choices in randomized load balancing
Infinite parallel job allocation (extended abstract)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
How asymmetry helps load balancing
Journal of the ACM (JACM)
Steady state analysis of balanced-allocation routing
Random Structures & Algorithms
| Hi-index | 0.00 |
We compare the performance of a variant of the standard {\it 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 - 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.