Using latency to evaluate interactive system performance
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Modeling communication pipeline latency
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The interactive performance of SLIM: a stateless, thin-client architecture
Proceedings of the seventeenth ACM symposium on Operating systems principles
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
IEEE Internet Computing
A Streaming Piecewise-Constant Model
DCC '99 Proceedings of the Conference on Data Compression
Content Layer Progressive Coding of Digital Maps
DCC '00 Proceedings of the Conference on Data Compression
The Skip-Innovation Model for Sparse Images
DCC '00 Proceedings of the Conference on Data Compression
A Novel Codec for Thin Client Computing
DCC '00 Proceedings of the Conference on Data Compression
Context Models for Palette Images
DCC '98 Proceedings of the Conference on Data Compression
A Lossless 2-D Image Compression Technique for Synthetic Discrete-Tone Images
DCC '98 Proceedings of the Conference on Data Compression
Evaluating windows NT terminal server performance
WINSYM'99 Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3
THINC: a virtual display architecture for thin-client computing
Proceedings of the twentieth ACM symposium on Operating systems principles
Analysis and reduction of data spikes in thin client computing
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Abstract: Thin client compression (TCC) achieves the best compression efficiency for sequences of synthetic images. This paper presents a streaming version of TCC (STCC) that almost fully retains the excellent compression efficiency of the original algorithm. When sending images over low-bandwidth networks, STCC dramatically reduces end-to-end latency by pipelining rows and overlapping the compression, transmission and decompression stages. We describe a streaming boundary tracing algorithm and tree-structured codebook that allow inherently two-dimensional pattern matching and substitution methods to be implemented efficiently in a streaming manner. We found that streaming and pipelining reduce end-to-end latency by up to 40.6% over the original TCC method.