Abstract.
We consider a random sequence of calls between nodes in a complete network with link capacities. Each call first tries the direct link. If that link is saturated, then the `first-fit dynamic alternative routing algorithm' sequentially selects up to d random two-link alternative routes, 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 alternative 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 second `balanced' algorithm requires a much smaller capacity. Our results strengthen and extend the discrete-time results presented in [10].
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 10 January 2002 / Revised version: 7 July 2002 / Published online: 28 March 2003
Rights and permissions
About this article
Cite this article
Luczak, M., McDiarmid, C. & Upfal, E. On-line routing of random calls in networks. Probab. Theory Relat. Fields 125, 457–482 (2003). https://doi.org/10.1007/s00440-002-0242-2
Issue Date:
DOI: https://doi.org/10.1007/s00440-002-0242-2