Electric routing and concurrent flow cutting
Author(s)
Adam, Jonathan Adam; Maymounkov, Petar Borissov
DownloadKelner_Electric Routing.pdf (246.0Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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-12Department
Massachusetts Institute of Technology. Department of MathematicsJournal
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