DMCA
Steady State Analysis of Balanced-Allocation Routing (2005)
Cached
Download Links
| Venue: | RANDOM STRUCT. ALG., 26, 446--467, 2005 |
| Citations: | 4 - 1 self |
BibTeX
@MISC{Anagnostopoulos05steadystate,
author = {Aris Anagnostopoulos and Ioannis Kontoyiannis and Eli Upfal},
title = {Steady State Analysis of Balanced-Allocation Routing},
year = {2005}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the "balanced-allocation" principle [Y. Azer, A. Z. Broder, A. R. Karlin, and E. Upfal, SIAM J Comput 29(1) (2000), 180--200; M. Mitzenmacher, Ph.D. Thesis, University of California, Berkeley, August 1996]; we refer to this new algorithm as the Balanced Dynamic Alternative Routing (BDAR) algorithm. While DAR 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 algorithm gives a substantial improvement in network performance, in terms both of network congestion and of bandwidth requirement.
Keyphrases
balanced-allocation routing steady state analysis available bandwidth bandwidth requirement balanced dynamic alternative routing substantial improvement steady-state performance random struct standard dynamic alternative routing balanced-allocation principle siam comput bdar algorithm wiley periodical minor increase atm network network congestion path-selection algorithm small number network performance bdar algorithm compare dar check new algorithm
