Improved Compression-Latency Trade-Off via Delayed-Dictionary Compression

نویسندگان

  • Yossi Matias
  • Raanan Refua
چکیده

We have recently introduced a novel compression algorithm for packet networks: delayed-dictionary compression, which enables an improved compression-latency trade-off. By allowing delay in the dictionary construction, the algorithm handles effectively the problems of packet drops and packet reordering: Its compression quality is close to that of streaming compression (and is substantially better than that of standard stateless packet compression) while its decoding latency is close to that of stateless compression (and is substantially smaller than that of streaming compression). In this Demo, we demonstrate the key ingredients of the new compression technique and show the effect of the dictionary delay on the effective bandwidth and on the decoding latency. We also demonstrate an effective filetransfer with a UDP carrier over the internet, using the PlanetLab platform.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

JBIG2 Symbol Dictionary Design Based on Minimum Spanning Trees

The JBIG2 standard is a very flexible bi-level image coding strategy based on pattern matching. The encoder collects a set of symbols in a dictionary and encodes a page by reference to the dictionary symbols. JBIG2 allows the encoder to view all symbols and choose a good set for the dictionary. In this paper, we examine the bit rate trade-off that arises in choosing different dictionary sizes. ...

متن کامل

Adaptive String Dictionary Compression in In-Memory Column-Store Database Systems

Domain encoding is a common technique to compress the columns of a column store and to accelerate many types of queries at the same time. It is based on the assumption that most columns contain a relatively small set of distinct values, in particular string columns. In this paper, we argue that domain encoding is not the end of the story. In real world systems, we observe that a substantial amo...

متن کامل

Area and Timing Analysis of Different PSU's in P-Match Algorithm for Data Compression in Cache Memories

Microprocessors speeds have been increasing faster than the speed of off-chip memory. In a multi-processor system, if the processor number is increased, then the access time of the memory is also high. Thus a 'wall' is raised between processor number and memory access time. When compared with on chip cache, to access the data, off-chip cache takes one order of magnitude more time. Off...

متن کامل

Dictionary design for text image compression with JBIG2

The JBIG2 standard for lossy and lossless bi-level image coding is a very flexible encoding strategy based on pattern matching techniques. This paper addresses the problem of compressing text images with JBIG2. For text image compression, JBIG2 allows two encoding strategies: SPM and PM&S. We compare in detail the lossless and lossy coding performance using the SPM-based and PM&S-based JBIG2, i...

متن کامل

Browsing and Searching Compressed Documents

Compression and information retrieval are two areas of document management that exist separately due to the conflicting methods of achieving their goals. This research examines a mechanism which provides lossless compression and phrase-based browsing and searching of large document collections. The framework for the investigation is an existing off-line dictionary-based compression algorithm. A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005