Steady state analysis of balanced-allocation routing
| dc.creator | Anagnostopoulos, Aris | |
| dc.creator | Kontoyiannis, Ioannis | |
| dc.creator | Upfal, Eli | |
| dc.date | 2002-09-25 | |
| dc.date.accessioned | 2026-07-07T04:51:16Z | |
| dc.date.available | 2026-07-07T04:51:16Z | |
| dc.description | 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; 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. | |
| dc.description | 22 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0209357 | |
| dc.identifier | http://arxiv.org/abs/math/0209357 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65083 | |
| dc.subject | Probability | |
| dc.title | Steady state analysis of balanced-allocation routing | |
| dc.type | text |