Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation

Miriam Allalouf*, Yuval Shavitt

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths (e.g., MPLS tunnels). This paper presents an algorithm for finding an optimal and global per-commodity max-min fair rate vector in a polynomial number of steps. In addition, we present a fast and novel distributed algorithm where each source router can find the routing and the fair rate allocation for its commodities while keeping the locally optimal max-min fair allocation criteria. The distributed algorithm is a fully polynomial epsilon-approximation (FPTAS) algorithm and is based on a primal-dual alternation technique. We implemented these algorithms to demonstrate its correctness, efficiency, and accuracy.

Original languageEnglish
Pages (from-to)1015-1024
Number of pages10
JournalIEEE/ACM Transactions on Networking
Volume16
Issue number5
DOIs
StatePublished - 2008

Keywords

  • Bandwidth allocation
  • Distributed algorithm
  • Max-min fairness criteria
  • Maximum concurrent multi-commodity flow problem

Fingerprint

Dive into the research topics of 'Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation'. Together they form a unique fingerprint.

Cite this