电动走线和顺流切割
Electric routing and concurrent flow cutting
摘要：
我们调查了一个不经意的路由方案，服从分布式计算和弹性图的变化，基于电流。我们的主要技术贡献是一个新的舍入方法，我们使用它来获得的逆图Laplacian的L1->L1算子范数的界。我们展示了这个规范如何反映电力路由的延迟和拥塞。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
