Dynamic asymmetric communication

Summary form only given. Internet users usually download more than they upload and many technologies have asymmetric bandwidth. Suppose some clients want to send messages to a server. At any point, the server knows all the messages it has received so far; each client only knows its own message or messages and does not overhear communication between other clients and the server. Thus, the server may be able to compress the messages but the clients individually cannot. By assuming the server, after receiving a sample of messages, can accurately estimate the distribution of all the messages, a multi-round asymmetric communication protocol can be provided in which the server uses its greater bandwidth to help a single client send a message drawn from a distribution known to the server. The server can just repeat their protocol to help any number of clients, provided it starts with a representative sample. This paper propose a new protocol inspired by an everyday act: placing a call on a cell phone. While the protocol needs no assumptions and is nearly optimal with respect to the number of bits the clients send, the server sends a relatively large number of bits, which is necessary in order to use only one round of communication for each message

[1]  Travis Gagie.  Sorting a Low-Entropy Sequence , 2005, ArXiv.

[2]  Donald E. Knuth,et al.  Dynamic Huffman Coding , 1985, J. Algorithms.

[3]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[4]  Travis Gagie,et al.  Compressing probability distributions , 2005, Inf. Process. Lett..

[5]  Robert E. Tarjan,et al.  Self-adjusting binary search trees , 1985, JACM.

[6]  Bruce M. Maggs,et al.  Protocols for Asymmetric Communication Channels , 2001, J. Comput. Syst. Sci..

[7]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[8]  Eduardo Sany Laber,et al.  Improved bounds for asymmetric communication protocols , 2002, Inf. Process. Lett..

[9]  Ruy Luiz Milidiú,et al.  Bounding the Compression Loss of the FGK Algorithm , 1999, J. Algorithms.

[10]  Micah Adler.  Collecting correlated information from a sensor network , 2005, SODA '05.

[11]  Faith Ellen,et al.  New Protocols for Asymmetric Communication Channels , 2001, SIROCCO.

[12]  Jeffrey Scott Vitter,et al.  Design and analysis of dynamic Huffman codes , 1987, JACM.

[13]  Robert E. Tarjan,et al.  A Locally Adaptive Data , 1986 .

[14]  Kurt Mehlhorn,et al.  A Best Possible Bound for the Weighted Path Length of Binary Search Trees , 1977, SIAM J. Comput..

[15]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[16]  Nick Feamster,et al.  Thwarting Web Censorship with Untrusted Messenger Discovery , 2003, Privacy Enhancing Technologies.

[17]  Travis Gagie,et al.  Dynamic Shannon coding , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[18]  Prosenjit Bose,et al.  Asymmetric Communication Protocols via Hotlink Assignments , 2003, Theory of Computing Systems.

[19]  Mohammad Ghodsi,et al.  A New Protocol for Asymmetric Communication Channels: Reaching the Lower Bounds , 2001 .

[20]  Winston Wang,et al.  Implementation and Security Analysis of the Infranet Anti-Censorship System by Winston Wang , 2014 .

[21]  Erik D. Demaine,et al.  Lower bounds for asymmetric communication channels and distributed source coding , 2006, SODA '06.

[22]  Nick Feamster,et al.  Infranet: Circumventing Web Censorship and Surveillance , 2002, USENIX Security Symposium.

[23]  E. F. Moore,et al.  Variable-length binary encodings , 1959 .