On efficient distributed construction of near optimal routing schemes

Given a distributed network represented by a weighted undirected graph G = ( V , E ) on n vertices, and a parameter k , we devise a randomized distributed algorithm that whp computes a routing scheme in O ( n 1 / 2 + 1 / k + D ) · n o ( 1 ) rounds, where D is the hop-diameter of the network. Moreove...

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 31; no. 2; pp. 119 - 137
Main Authors:	Elkin, Michael, Neiman, Ofer
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2018 Springer Nature B.V
Subjects:	Algorithms Computation Computer Communication Networks Computer Hardware Computer networks Computer Science Computer Systems Organization and Communication Networks Distributed processing Graph theory Graphical representations Lower bounds Routing Routing (telecommunications) Run time (computers) Software Engineering/Programming and Operating Systems Tables Tables (data) Theory of Computation
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!