Electric Routing and Concurrent Flow Cutting

Authors:
Jonathan Kelner;Petar Maymounkov
Affiliations:
Massachusetts Institute of Technology,;Massachusetts Institute of Technology,
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 9
Cited 0

Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Approximate distance oracles

Journal of the ACM (JACM)
New lower bounds for oblivious routing in undirected graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On space-stretch trade-offs: lower bounds

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Minimizing average latency in oblivious routing

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal hierarchical decompositions for congestion minimization in networks

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Noise Tolerance of Expanders and Sublinear Expander Reconstruction

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Expanders via random spanning trees

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

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 L 1驴L 1 operator norm of the inverse graph Laplacian.