Electric routing and concurrent flow cutting

Details Electric routing and concurrent flow cutting Electric routing and concurrent flow cutting

2009-09-15

arxiv.org/abs/0909.2859v1

Computer Science

Discrete Mathematics

21 pages, 0 figures. To be published in Springer LNCS Book No. 5878, Proceedings of The 20th International Symposium on Algori

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Electric routing and concurrent flow cutting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Electric routing and concurrent flow cutting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Electric routing and concurrent flow cutting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556382