Cost-Sensitive Analysis of Communication Protocols
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. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1991
- Accession Number
- ADA237356
Entities
People
- Alan Baratz
- Baruch Awerbuch
- David Peleg
Organizations
- Massachusetts Institute of Technology