Electric routing and concurrent flow cutting

Author(s)
Kelner, Jonathan Adam; Maymounkov, Petar Borissov
Thumbnail
Download0909.2859v1.pdf (246.0Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing. Keywords: Oblivious routing; Spectral graph theory; Laplacian operator
Date issued
2010-06
URI
http://hdl.handle.net/1721.1/115843
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
Theoretical Computer Science
Publisher
Elsevier
Citation
Kelner, Jonathan and Petar Maymounkov. “Electric Routing and Concurrent Flow Cutting.” Theoretical Computer Science 412, 32 (July 2011): 4123–4135 © 2010 Elsevier B.V.
Version: Original manuscript
ISSN
0304-3975
Collections