ReceivedMarch3,1999revisedJuly4,.pdf

573? 0022-0000/01 $35.00? 2001 Elsevier Science (USA)All rights reserved. Journal of Computer and System Sciences 63, 573–596 (2001) doi:10.1006/jcss.2001.1779, available online at on Protocols for Asymmetric Communication Channels Micah Adler1 1 This research was conducted in part while Micah Adler was at the Computer Science Department of the University of Toronto (supported by an operating grant from the Natural Sciences and Engineering Research Council of Canada, and by ITRC, an Ontario Centre of Excellence), and in part while he was at the Heinz Nixdorf Institute Graduate College, Paderborn, Germany. Department of Computer Science, University of Massachusetts, Amherst, Massachusetts 01003-4610 E-mail: micah@ and Bruce M. Maggs2 2 Bruce Maggs is supported in part by the Air Force Materiel Command (AFMC) and ARPA under Contracts F196828-93-C-0193 and F19623-96-C-0061, by ARPA Contract N00014-95-1-1246, and by an NSF National Young Investigator Award, No. CCR-94-57766, with matching funds provided by NEC Research Institute and Sun Microsystems. This research was conducted in part while he was visiting the Heinz Nixdorf Institute, with support provided by DFG-Sonderforschungsbereich 376 ‘‘Massive Parallelit?t: Algorithmen, Entwurfsmethoden, Anwendungen’’. The views and conclusions contained here are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either express or implied, of AFMC, ARPA, CMU, or the U.S. Government. School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, Pennsylvania 15213 E-mail: bmm@ Received March 3, 1999; revised July 4, 2000 In this paper we examine the problem of sending an n-bit data item from a client to a server across an asymmetric communication channel. We demon- strate that there are scenarios in which a high-speed link from the server to the client can be used to greatly reduce the number of bits sent from the client to the server acr