On efficient distributed construction of near optimal routing schemes: [Extended Abstract]

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

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).

Original languageEnglish
Title of host publicationPODC 2016 - Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages235-244
Number of pages10
ISBN (Electronic)9781450339643
DOIs
StatePublished - 25 Jul 2016
Event35th ACM Symposium on Principles of Distributed Computing, PODC 2016 - Chicago, United States
Duration: 25 Jul 201628 Jul 2016

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume25-28-July-2016

Conference

Conference35th ACM Symposium on Principles of Distributed Computing, PODC 2016
Country/TerritoryUnited States
CityChicago
Period25/07/1628/07/16

Keywords

  • CONGEST model
  • Routing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'On efficient distributed construction of near optimal routing schemes: [Extended Abstract]'. Together they form a unique fingerprint.

Cite this