Dynamic Asymmetric Communication

TL;DR

This paper introduces a method to convert dynamic instantaneous compression algorithms into asymmetric communication protocols, enabling high-bandwidth servers to assist low-bandwidth clients efficiently with single-round communication, without prior distribution knowledge.

Contribution

It presents the first protocols that use only one round of communication and do not require server knowledge of message distribution.

Findings

Protocols enable efficient asymmetric communication with one round

No prior distribution knowledge needed for server

Applicable to dynamic instantaneous compression algorithms

Abstract

We show how any dynamic instantaneous compression algorithm can be converted to an asymmetric communication protocol, with which a server with high bandwidth can help clients with low bandwidth send it messages. Unlike previous authors, we do not assume the server knows the messages' distribution, and our protocols are the first to use only one round of communication for each message.