25th IEEE International Conference on Distributed Computing Systems (ICDCS'05) (2005)
Columbus, Ohio, USA
June 6, 2005 to June 10, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2005.37
Calton Pu , Georgia Institute of Technology
Lenin Singaravelu , Georgia Institute of Technology
Despite voluminous previous research on adaptive compression, we found significant challenges when attempting to fully utilize both network bandwidth and CPU. We describe the Fine-Grain (FG) Mixing strategy that compresses and sends as much data as possible, and then uses any remaining bandwidth to send uncompressed packets. Experimental measurements show that FG Mixing achieves significant gains in effective throughput, particularly at higher network bandwidths. However, non-trivial interactions between system components and layers (e.g., compression algorithms and middleware settings such as block size and buffer size) have significant impact on the overall system performance. Finally, the trade-offs and performance profiles of FG Mixing are measured, observed, and found to be consistent over a wide range of combinations of compression algorithms (GZIP, LZO, BZIP2), workload compression ratios (from 1 to 4), and network bandwidth (from 0 to 400 Mbps).
L. Singaravelu and C. Pu, "Fine-Grain Adaptive Compression in Dynamically Variable Networks," 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)(ICDCS), Columbus, Ohio, USA, 2005, pp. 685-694.