Compact oblivious routing in weighted graphs

Philipp Czerner, Harald Räcke

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The space-requirement for routing-tables is an important characteristic of routing schemes. For the cost-measure of minimizing the total network load there exist a variety of results that show tradeoffs between stretch and required size for the routing tables. This paper designs compact routing schemes for the cost-measure congestion, where the goal is to minimize the maximum relative load of a link in the network (the relative load of a link is its traffic divided by its bandwidth). We show that for arbitrary undirected graphs we can obtain oblivious routing strategies with competitive ratio Õ(1) that have header length Õ(1), label size Õ(1), and require routing-tables of size Õ(deg(v)) at each vertex v in the graph. This improves a result of Räcke and Schmid who proved a similar result in unweighted graphs.

Original languageEnglish
Title of host publication28th Annual European Symposium on Algorithms, ESA 2020
EditorsFabrizio Grandoni, Grzegorz Herman, Peter Sanders
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771627
DOIs
StatePublished - 1 Aug 2020
Event28th Annual European Symposium on Algorithms, ESA 2020 - Virtual, Pisa, Italy
Duration: 7 Sep 20209 Sep 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume173
ISSN (Print)1868-8969

Conference

Conference28th Annual European Symposium on Algorithms, ESA 2020
Country/TerritoryItaly
CityVirtual, Pisa
Period7/09/209/09/20

Keywords

  • Compact Routing
  • Competitive Analysis
  • Oblivious Routing

Fingerprint

Dive into the research topics of 'Compact oblivious routing in weighted graphs'. Together they form a unique fingerprint.

Cite this