Electric routing and concurrent flow cutting

Author(s)
Adam, Jonathan Adam; Maymounkov, Petar Borissov
Thumbnail
DownloadKelner_Electric Routing.pdf (246.0Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.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 L[subscript 1]-->L[subscript 1] operator norm of the inverse graph Laplacian.
Date issued
2009-12
URI
http://hdl.handle.net/1721.1/71604
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
Algorithms and Computation, Proceedings of the 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009
Publisher
Springer-Verlag
Citation
Kelner, Jonathan, and Petar Maymounkov. “Electric Routing and Concurrent Flow Cutting.” Algorithms and Computation. Ed. Yingfei Dong, Ding-Zhu Du, & Oscar Ibarra. (Lecture Notes in Computer Science ; Vol. 5878). Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. 792–801. Web.
Version: Author's final manuscript
ISBN
9783642106309
ISSN
0302-9743
Collections