Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Randomized Local Fast Rerouting for Datacenter Networks with Almost
  Optimal Congestion   To ensure high availability, datacenter networks must rely on local fast
rerouting mechanisms that allow routers to quickly react to link failures, in a
fully decentralized manner. However, configuring these mechanisms to provide a
high resilience against multiple failures while avoiding congestion along
failover routes is algorithmically challenging, as the rerouting rules can only
depend on local failure information and must be defined ahead of time. This
paper presents a randomized local fast rerouting algorithm for Clos networks,
the predominant datacenter topologies. Given a graph $G=(V,E)$ describing a
Clos topology, our algorithm defines local routing rules for each node $v\in
V$, which only depend on the packet's destination and are conditioned on the
incident link failures. We prove that as long as number of failures at each
node does not exceed a certain bound, our algorithm achieves an asymptotically
minimal congestion up to polyloglog factors along failover paths. Our lower
bounds are developed under some natural routing assumptions.

0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
13
The categories of this paper are: quant-ph
2
The categories of this paper are: math
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
28
The categories of this paper are: alg-geom