HackerPapers

arXiv:0909.2859cs.DM

Electric routing and concurrent flow cutting

Jonathan Kelner, Petar Maymounkov

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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 L1->L1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing.

arXiv comments
21 pages, 0 figures. To be published in Springer LNCS Book No. 5878, Proceedings of The 20th International Symposium on Algorithms and Computation (ISAAC'09)
Journal reference
DOI
Subjects
cs.DMDiscrete Mathematics cs.DCDistributed, Parallel, and Cluster Computing

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jan 2020 to Jan 2020. Found in 1 HN submission from Apr 2020 to Apr 2020. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Ask HN: Thoughts on censorship resistance vs. offensive content? 1 comment

    • I don't think the risk of child porn is why FreeNet hasn't really taken off; I think it's due to the fact that it's slow and its content is incredibly limited, largely existing for hobbyists. I'm not 100% sure how you'd be able to evict offensive/illegal content in a fully…

      tombertView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.