Compact oblivious routing

DOI10.4230/LIPICS.ESA.2019.75MaRDI QIDQ5075823FDOQ5075823

Authors: Harald Räcke, Stefan Schmid 

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1812.09887

Recommendations

• Compact oblivious routing in weighted graphs
• Survey on oblivious routing strategies
• Oblivious routing in directed graphs with random demands
• Oblivious routing on node-capacitated and directed graphs
• Oblivious routing on node-capacitated and directed graphs

zbMATH Keywords

competitive analysisoblivious routingcompact routing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Routing, merging, and sorting on parallel models of computation
• Designing networks with compact routing tables
• Title not available (Why is that?)
• Min-max Graph Partitioning and Small Set Expansion
• Compact routing with minimum stretch
• Cut Problems in Graphs with a Budget Constraint
• Simultaneous source location
• A general approach to online network optimization problems
• Title not available (Why is that?)
• The all-or-nothing multicommodity flow problem
• Memory requirement for routing in distributed networks
• Title not available (Why is that?)
• On the advantage of overlapping clusters for minimizing conductance
• A Unified Approach to Approximating Partial Covering Problems
• Tight bounds for oblivious routing in the hypercube
• Memory requirement for universal routing schemes
• On-line routing in all-optical networks
• Survey on oblivious routing strategies
• Optimal oblivious routing in polynomial time
• Graph partitioning using single commodity flows
• Computing cut-based hierarchical decompositions in almost linear time
• Approximate undirected maximum flows in \(O(m\operatorname{polylog}(n))\) time
• Compact policy routing

Cited In (6)

• Title not available (Why is that?)
• Bounds on oblivious multiparty quantum communication complexity
• Compact routing with slack
• Sparse Semi-Oblivious Routing: Few Random Paths Suffice
• Oblivious routing with limited buffer capacity
• Optimal oblivious routing in polynomial time

This page was built for publication: Compact oblivious routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075823)