Efficient end to end data exchange using configurable compression
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We explore the use of compression methods to improve the middleware-based exchange of information in interactive or collaborative distributed applications. In such applications, good compression factors must be accompanied by compression speeds suitable for the data transfer rates sustainable across network links. Our approach combines methods that continuously monitor current network and processor resources and assess compression effectiveness, with techniques that automatically choose suitable compression techniques. The resulting network- and user-aware compression methods are evaluated experimentally across a range of network links and application data, the former ranging from low end links to homes, to wide-area Internet links, to high end links in intranets, the latter including both scientific (binary molecular dynamics data) and commercial (XML) data sets. Results attained demonstrate substantial improvements of this adaptive technique for data compression over non-adaptive approaches, where better compression methods are used when CPU loads are low and/or network links are slow, and where less effective and typically, faster compression techniques are used in high end network infrastructures.Keywords
This publication has 11 references indexed in Scilit:
- End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughputIEEE/ACM Transactions on Networking, 2003
- Parallel Huffman Decoding with Applications to JPEG FilesThe Computer Journal, 2003
- End-to-end available bandwidthACM SIGCOMM Computer Communication Review, 2002
- Adaptive online data compressionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- From interactive applications to distributed laboratoriesIEEE Concurrency, 1998
- Arithmetic coding for data compressionProceedings of the IEEE, 1994
- Is Huffman coding dead?Computing, 1993
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952