Cost-Sensitive Analysis of Communication Protocols (Extended Abstract)
Baruch Awerbuch, Alan E. Baratz, David Peleg · 1990
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.