Cost-sensitive Analysis of Communication Protocols

Awerbuch, Baruch; Baratz, Alan; Peleg, David

Cost-sensitive Analysis of Communication Protocols

Download

Name

MIT-LCS-TM-453.pdf

Size

8.3 MB

Format

Adobe PDF

Checksum (MD5)

c187dd4cbf71e6e4ebc2d07f05464d13

Author(s)

Awerbuch, Baruch

•

Baratz, Alan

•

Peleg, David

Date Issued

June 1991

Series/Report no.

MIT-LCS-TM-453

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 synchornization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., contructing a minimymn spanning tree, constructing a shortest path tree.

Persistent DSpace Link

https://hdl.handle.net/1721.1/149180