CDAM: Computational, Discrete and Applicable Mathematics@LSE

 CDAM Research Report, LSE-CDAM-2007-36

February 2008

Balanced routing of random calls

Malwina J. Luczak and Colin McDiarmid

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.

A PDF file (294 kB) with the full contents of this report can be downloaded by clicking here.

Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2007-36, together with your name and postal address to:
CDAM Research Reports Series
Centre for Discrete and Applicable Mathematics
London School of Economics
Houghton Street
London WC2A 2AE, U.K.
Phone: +44(0)-20-7955 7494.
Fax: +44(0)-20-7955 6877.

Introduction to the CDAM Research Report Series.
CDAM Homepage.

Copyright © London School of Economics & Political Science 2007