Cost-sensitive Analysis of Communication Protocols
Author(s)
Awerbuch, Baruch; Baratz, Alan; Peleg, David
DownloadMIT-LCS-TM-453.pdf (8.296Mb)
Metadata
Show full item recordAbstract
This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchornization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., contructing a minimymn spanning tree, constructing a shortest path tree.
Date issued
1991-06Series/Report no.
MIT-LCS-TM-453