M. Adler, B.M. Maggs, Protocols for asymmetric communication channels, J. Comput. System Sci. 63 (2001) 573--596.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....serves many Infranet users requests for hidden content, it can maintain the frequency distribution of hidden messages, C. A requester wants to send a message, URL, from the distribution C. This communication model is essentially the asymmetric communication model presented by Adler and Maggs [1]. We leverage their work to produce an iterative modulation function based on range mapping of the distribution of lexicographically ordered URLs, C. In each round, the responder sends the requester a set S of tuples (s i ; r i ) where s i is a string in the domain of C and r i is the visible ....

M. Adler and B. Maggs. Protocols for asymmetric communication channels. In Proceedings of 39th IEEE Symposium on Foundations of Computer Science (FOCS), Palo Alto, CA, 1998.

....is intrinsic to the technology being used. An example of the latter case is home satellite Internet connections in which downloads are received through a satellite dish, but uploads take place over the telephone line. This work was partly supported by NSERC, CRM, FCAR and MITACS. Ref. s f l r [1] 3n 1:71H 1 3n 1:71H 1 [1] O(n) O(H 1) 2 O(1) 1] O(n) O(H 1) n2 =k O(minfn=k;H 1g) 6] n(H 2) H 2 n(H 3) H 2 [6] O(2 nH) H 2 O(2 nH) H 1) k 2 [4] nHk 1 H log k 1 k 1 O(nk) H=logk 1 Here n(k 2) H log(k 2) log(k 2) n(k 2) Motivated by this, Adler and Maggs [1] ....

....being used. An example of the latter case is home satellite Internet connections in which downloads are received through a satellite dish, but uploads take place over the telephone line. This work was partly supported by NSERC, CRM, FCAR and MITACS. Ref. s f l r [1] 3n 1:71H 1 3n 1:71H 1 [1] O(n) O(H 1) 2 O(1) 1] O(n) O(H 1) n2 =k O(minfn=k;H 1g) 6] n(H 2) H 2 n(H 3) H 2 [6] O(2 nH) H 2 O(2 nH) H 1) k 2 [4] nHk 1 H log k 1 k 1 O(nk) H=logk 1 Here n(k 2) H log(k 2) log(k 2) n(k 2) Motivated by this, Adler and Maggs [1] describe a model of an ....

[Article contains additional citation context not shown here]

ADLER, M., AND MAGGS, B. Protocols for asymmetric communication channels. In Proceedings of 39th IEEE Symposium on Foundations of Computer Science (FOCS) (1998), pp. 522--533.

....by client to server is as low as possible. Assuming that data is drawn from an arbitrary distribution D, it is known that 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 rst considered by Adler and Maggs [1]. They assume that the distribution of D is known only by the server. They introduced a protocol in which the number of bits sent from client to server is 1:71H(D) 1. In this paper, we extend this work and propose a protocol which reduces the constant factor 1.71 to 1 ( 0) in a way ....

....with the protocol introduced in this paper. In this paper, we present a protocol that allows the client to send x, an n bit string, to the server on an asymmetric channel, by sending a nearly optimal number actual bits across the low speed channel. The protocol is an extension of the protocol in [1] in which the average number of bits sent by the client is 1:71H(D) 1, where H(D) is the binary entropy of D, the distribution of x. Our rst protocol solves this problem in 1:47H(D) 4 on the average. We then improve the protocol and reduce the factor 1.47 to 1 for an arbitrary small value ....

[Article contains additional citation context not shown here]

Micah Adler, Bruce M. Maggs. \Protocols for Asymmetric Communication Channels." Proceedings of FOCS'98, November 1998.

.... 1 2 Proceedings of SIROCCO 2001 These new networking technologies lead to the following question: what is the best way to use the high bandwidth direction of an asymmetric communication channel to improve the performance of the low bandwidth direction This question was first addressed in [1]. That work assumes that two parties, called the client and the server, are connected by a channel with much higher bandwidth from the server to the client than from the client to the server. They present a number of protocols that use the high speed link to reduce the number of bits that the ....

....They present a number of protocols that use the high speed link to reduce the number of bits that the client must send on the slower link. Specifically, in many situations, the client is able to inform the server of an n bit string x by sending significantly fewer than n bits. The protocols from [1] are within a constant factor of optimal in terms of the number of bits sent by the client, as well as the total number of bits sent by both parties. In this paper, we address the following question: How small can we make the number of bits sent by the client, without significantly increasing the ....

[Article contains additional citation context not shown here]

M. Adler and B. M. Maggs. Protocols for asymmetric communication channels. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, November 1998, pages 522--533.

....asymmetric communication complexity. The problem we study is similar to that studied in the interactive communication literature, and the model we use is similar to that used in the asymmetric communication complexity model. Subsequent to the appearance of a preliminary version of this paper in [1], there has been further work on the problem considered here. Eduardo Sany Laber has shown [11] that the expected number of bits used by the client in the protocol Computation ecient is even better than we show in this paper. In particular, for any distribution D, the expected number of bits used ....

M. Adler and B. Maggs. Protocols for asymmetric communication channels. In 39 th IEEE Symposium on Foundations of Computer Science, pages 522-533, 1998.

No context found.

M. Adler, B.M. Maggs, Protocols for asymmetric communication channels, J. Comput. System Sci. 63 (2001) 573--596.

No context found.

M. Adler and B.M. Maggs. Protocols for asymmetric communication channels. Journal of Computer and System Sciences, 64(4):573--596, 2001.

No context found.

M. Adler and B. M. Maggs. Protocols for asymmetric communication channels. Journal of Computer and System Sciences, 64(4):573--596, 2001.

No context found.

M. Adler and B. M. Maggs. Protocols for asymmetric communication channels. Journal of Computer and System Sciences, 63:573--596, 2001.

No context found.

Micah Adler and Bruce Maggs. Protocols for asymmetric communication channels. In Proceedings of 39th IEEE Symposium on Foundations of Computer Science (FOCS), pages 522-533, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC