Skip to main content
Article thumbnail
Location of Repository

Balanced routing of random calls

By Malwina Luczak and C McDiarmid

Abstract

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

Topics: H Social Sciences (General)
Publisher: London school of economics and political science
Year: 2007
OAI identifier: oai:eprints.lse.ac.uk:6800
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.cdam.lse.ac.uk/Repo... (external link)
  • http://eprints.lse.ac.uk/6800/ (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.