Electric routing and concurrent flow cutting

TL;DR

This paper introduces an electrical flow-based oblivious routing scheme that is suitable for distributed implementation and resilient to graph modifications, with a novel rounding method to analyze its performance.

Contribution

The paper presents a new rounding technique and analyzes the L1->L1 operator norm of the inverse Laplacian, linking it to latency and congestion in electric routing.

Findings

Bound on the L1->L1 operator norm of the inverse Laplacian

Analysis of latency and congestion in electric routing

Resilience of the routing scheme to graph changes

Abstract

We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the L1->L1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing.