Steady state analysis of balanced-allocation routing

Details Steady state analysis of balanced-allocation routing Steady state analysis of balanced-allocation routing

2002-09-25

arxiv.org/abs/math/0209357v1

Mathematics

Probability

22 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Steady state analysis of balanced-allocation routing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Steady state analysis of balanced-allocation routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Steady state analysis of balanced-allocation routing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-366942