Electric routing and concurrent flow cutting
Author(s)Adam, Jonathan Adam; Maymounkov, Petar Borissov
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Mathematics
Algorithms and Computation, Proceedings of the 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009
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.
Author's final manuscript