Balanced routing of random calls

Details Balanced routing of random calls Balanced routing of random calls

2008-01-08

arxiv.org/abs/0801.1260v2

Mathematics

Probability

52 pages, 2 figures

Scientific paper

We consider an online routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to $d$ random two-link routes between the two endpoints of a call, via an intermediate node, and assigns the call to the first route with spare capacity on each link, if there is such a route. The balanced dynamic alternative routing algorithm simultaneously selects $d$ random two-link routes; and the call is accepted on a route minimising the maximum of the loads on its two links, provided neither of these two links is saturated. We determine the capacities needed for these algorithms to route calls successfully, and find that the balanced algorithm requires a much smaller capacity.

Affiliated with

Also associated with

No associations

Rating

Balanced routing of random calls 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 Balanced routing of random calls, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Balanced routing of random calls will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-669022