Cost-sensitive analysis of communication protocols

Baruch Awerbuch, Alan Baratz, David Peleg

Research output: Contribution to conferencePaperpeer-review

87 Scopus citations

Abstract

This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchronization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., constructing a minimum spanning tree, constructing a shortest path tree.

Original languageEnglish
Pages177-187
Number of pages11
DOIs
StatePublished - 1990
Externally publishedYes
EventProceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing - Quebec City, Que, Can
Duration: 22 Aug 199024 Aug 1990

Conference

ConferenceProceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing
CityQuebec City, Que, Can
Period22/08/9024/08/90

Fingerprint

Dive into the research topics of 'Cost-sensitive analysis of communication protocols'. Together they form a unique fingerprint.

Cite this