Survey on Oblivious Routing Strategies

DOI10.1007/978-3-642-03073-4_43zbMath1268.68169OpenAlexW2122870665MaRDI QIDQ3576074

Harald Räcke

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_43

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15) Internet topics (68M11)

Related Items (11)

Packing a Knapsack of Unknown Capacity ⋮ Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles ⋮ Randomized oblivious integral routing for minimizing power cost ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Bayesian generalized network design ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Constrained routing between non-visible vertices ⋮ Unnamed Item ⋮ Oblivious algorithms for the maximum directed cut problem ⋮ Routing on the visibility graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing, merging, and sorting on parallel models of computation
• On-line routing in all-optical networks
• Tight bounds for oblivious routing in the hypercube
• Improved bounds for the unsplittable flow problem
• The all-or-nothing multicommodity flow problem
• Efficient Schemes for Parallel Communication
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Optimal Oblivious Path Selection on the Mesh
• A packet routing protocol for arbitrary networks
• Almost optimal permutation routing on hypercubes
• Optimal oblivious routing in polynomial time
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Survey on Oblivious Routing Strategies