Loading...

A new protocol for asymmetric communication channels: Reaching the lower bounds

Ghazizadeh, S ; Sharif University of Technology | 2001

14 Viewed
  1. Type of Document: Article
  2. Publisher: Sharif University of Technology , 2001
  3. Abstract:
  4. In this paper, the problem of sending n-bit of data from a client to a server using an asymmetric communication channel is discussed where the line bandwidth from server to client is much higher than that of client to server. The goal is to provide a protocol for this problem so that the average number of actual bits sent by client to server becomes as low as possible. Assuming that data is drawn from an arbitrary distribution D, the average number of bits sent by client to server cannot be less than H(D), where H(D) is the binary entropy of D. This problem was first considered by Adler and Maggs [1]. They assumed that the distribution of D is known only by the server and introduced a protocol in which the number of bits sent from client to server is 1.71H(D) + 1. In this paper, this work has been extended and a protocol is proposed which reduces the constant factor 1.71 to 1 + ε (ε > 0) in a way that the computation performed by the server is still reasonable
  5. Keywords:
  6. Telecommunication
  7. Source: Scientia Iranica ; Volume 8, Issue 4 , 2001 , Pages 297-302 ; 10263098 (ISSN)
  8. URL: http://scientiairanica.sharif.edu/article_2739.html