TY - GEN

T1 - Near-optimal distributed routing with low memory

AU - Elkin, Michael

AU - Neiman, Ofer

N1 - Funding Information:
∗This research was supported by the ISF grant No. (724/15). †Supported in part by ISF grant 1817/17, and by BSF Grant 2015813.
Publisher Copyright:
© 2018 Association for Computing Machinery.

PY - 2018/7/23

Y1 - 2018/7/23

N2 - Distributed routing is one of the most central and fundamental problems in the area of Distributed Graph Algorithms. It was extensively studied for almost thirty years. Nevertheless, the currently existing solutions for this problem require either prohibitively large construction (aka preprocessing) time, or prohibitively large memory usage either during the construction or during the routing phase, and suffer from suboptimal labels and tables' sizes. We devise a distributed routing scheme that enjoys the best of all worlds. Specifically, its construction time and memory requirements during the construction phase are near-optimal, and so is also the tradeoff between the sizes of routing tables and labels on the one hand, and the stretch on the other. On the way to this result, we also improve upon existing solutions for the distributed exact tree routing problem. Previous solutions require Ω(n) memory, and provide tables and labels of size O(log n) and O(log2 n), respectively. Our solution, on the other hand, requires just O(log n) memory, and has tables of size O(1), and labels of size O(log n). These bounds match the bounds of the best-known centralized solution.

AB - Distributed routing is one of the most central and fundamental problems in the area of Distributed Graph Algorithms. It was extensively studied for almost thirty years. Nevertheless, the currently existing solutions for this problem require either prohibitively large construction (aka preprocessing) time, or prohibitively large memory usage either during the construction or during the routing phase, and suffer from suboptimal labels and tables' sizes. We devise a distributed routing scheme that enjoys the best of all worlds. Specifically, its construction time and memory requirements during the construction phase are near-optimal, and so is also the tradeoff between the sizes of routing tables and labels on the one hand, and the stretch on the other. On the way to this result, we also improve upon existing solutions for the distributed exact tree routing problem. Previous solutions require Ω(n) memory, and provide tables and labels of size O(log n) and O(log2 n), respectively. Our solution, on the other hand, requires just O(log n) memory, and has tables of size O(1), and labels of size O(log n). These bounds match the bounds of the best-known centralized solution.

KW - Compact routing

KW - Congest

UR - http://www.scopus.com/inward/record.url?scp=85052479027&partnerID=8YFLogxK

U2 - 10.1145/3212734.3212761

DO - 10.1145/3212734.3212761

M3 - Conference contribution

AN - SCOPUS:85052479027

SN - 9781450357951

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 207

EP - 216

BT - PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018

Y2 - 23 July 2018 through 27 July 2018

ER -