Electric routing and concurrent flow cutting
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2009
- DOI:
- 10.48550/arXiv.0909.2859
- arXiv:
- arXiv:0909.2859
- Bibcode:
- 2009arXiv0909.2859K
- Keywords:
-
- Computer Science - Discrete Mathematics;
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing;
- F.2.2;
- G.2.2
- E-Print:
- 21 pages, 0 figures. To be published in Springer LNCS Book No. 5878, Proceedings of The 20th International Symposium on Algorithms and Computation (ISAAC'09)