TY - GEN

T1 - On efficient distributed construction of near optimal routing schemes

T2 - 35th ACM Symposium on Principles of Distributed Computing, PODC 2016

AU - Elkin, Michael

AU - Neiman, Ofer

N1 - Funding Information:
This research was supported by the ISF grant 724/15. Supported in part by ISF grant No. (523/12) and by the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement no303809.
Publisher Copyright:
© 2016 ACM.

PY - 2016/7/25

Y1 - 2016/7/25

N2 - Given a distributed network represented by a weighted undirected graph G = (V;E) on n vertices, and a parameter k, we devise a distributed algorithm that computes a routing scheme in O(n1/2+1/k+D)·no(1) rounds, where D is the hopdiameter of the network. The running time nearly matches the lower bound of ω(n1/2 + D) rounds (which holds for any scheme with polynomial stretch). The routing tables are of size ω(n1/k), the labels are of size O(k log2 n), and every packet is routed on a path suering stretch at most 4k..5+o(1). Our construction nearly matches the state-ofthe- art for routing schemes built in a centralized sequential manner. The previous best algorithms for building routing tables in a distributed small messages model were by [LP13a, STOC 2013] and [LP15, PODC 2015]. The former has similar properties but suers from substantially larger routing tables of size O(n1/2+1/k), while the latter has sub-optimal running time of ω(min{(nD)1/2 · n1/k, n2/3+2/(3k) + Dg).

AB - Given a distributed network represented by a weighted undirected graph G = (V;E) on n vertices, and a parameter k, we devise a distributed algorithm that computes a routing scheme in O(n1/2+1/k+D)·no(1) rounds, where D is the hopdiameter of the network. The running time nearly matches the lower bound of ω(n1/2 + D) rounds (which holds for any scheme with polynomial stretch). The routing tables are of size ω(n1/k), the labels are of size O(k log2 n), and every packet is routed on a path suering stretch at most 4k..5+o(1). Our construction nearly matches the state-ofthe- art for routing schemes built in a centralized sequential manner. The previous best algorithms for building routing tables in a distributed small messages model were by [LP13a, STOC 2013] and [LP15, PODC 2015]. The former has similar properties but suers from substantially larger routing tables of size O(n1/2+1/k), while the latter has sub-optimal running time of ω(min{(nD)1/2 · n1/k, n2/3+2/(3k) + Dg).

KW - CONGEST model

KW - Routing

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

U2 - 10.1145/2933057.2933098

DO - 10.1145/2933057.2933098

M3 - Conference contribution

AN - SCOPUS:84984714305

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

SP - 235

EP - 244

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

PB - Association for Computing Machinery

Y2 - 25 July 2016 through 28 July 2016

ER -