David Peleg, Eli Upfal

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

10 Scopus citations


The problem of routing simultaneously many packets on bounded-degree interconnection networks is fundamental to the theory of parallel and distributed computation. In the first part of this work we give an optimal solution for the general communication problem on bounded-degree networks. In the second part we attempt to achieve a similarly wide result for the exact K token distribution problem. We present a probabilistic algorithm that solves the (n, 1, 1)-routing problem, i. e. , executes any (n, 1, 1)-communication request in O(log n) steps on any d-regular expander. The algorithm is a variant of Valiant's two phase routing algorithm.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
Number of pages10
ISBN (Print)0818607408, 9780818607400
StatePublished - 1986
Externally publishedYes

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428


Dive into the research topics of 'TOKEN DISTRIBUTION PROBLEM.'. Together they form a unique fingerprint.

Cite this