Electric routing and concurrent flow cutting
Name
0909.2859v1.pdf
Size
246.02 KB
Format
Adobe PDF
Checksum (MD5)
f0d73436b62e0fafc4e4209ad5d173fb
Author(s)
Kelner, Jonathan Adam
Maymounkov, Petar Borissov
Date Issued
June 2010
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
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
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.tcs.2010.06.013
