• DocumentCode
    3295031
  • Title

    Fine-Grain Adaptive Compression in Dynamically Variable Networks

  • Author

    Pu, Calton ; Singaravelu, Lenin

  • Author_Institution
    CERCS, Georgia Inst. of Technol., Atlanta, GA
  • fYear
    2005
  • fDate
    10-10 June 2005
  • Firstpage
    685
  • Lastpage
    694
  • Abstract
    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, BZ1P2), workload compression ratios (from 1 to 4), and network bandwidth (from 0 to 400 Mbps)
  • Keywords
    bandwidth compression; computer networks; data compression; dynamically variable networks; fine-grain adaptive compression; fine-grain mixing strategy; network bandwidth; workload compression; Adaptive systems; Bandwidth; Compression algorithms; Gain measurement; Intelligent networks; Middleware; Particle measurements; Robustness; Throughput; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Distributed Computing Systems, 2005. ICDCS 2005. Proceedings. 25th IEEE International Conference on
  • Conference_Location
    Columbus, OH
  • ISSN
    1063-6927
  • Print_ISBN
    0-7695-2331-5
  • Type

    conf

  • DOI
    10.1109/ICDCS.2005.37
  • Filename
    1437129