Balanced routing of random calls
Malwina J. Luczak, Colin McDiarmid

TL;DR
This paper compares two dynamic routing algorithms for network calls, showing that the balanced approach requires significantly less capacity to successfully route calls in a stochastic network model.
Contribution
It introduces and analyzes a balanced dynamic routing algorithm, demonstrating its efficiency over the first-fit method in terms of capacity requirements.
Findings
Balanced algorithm requires smaller capacity than first-fit.
The study provides capacity thresholds for successful routing.
Develops new tools for analyzing interacting random processes.
Abstract
We consider an online network routing problem in continuous time, where calls have Poisson arrivals and exponential durations. The first-fit dynamic alternative routing algorithm sequentially selects up to 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 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. In order to handle such interacting random processes on networks, we develop appropriate tools such as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
