Learn More
This paper considers compression in packet networks. Since data packets may be dropped or arrive reordered, streaming compression algorithms result in a considerable decoding latency. On the other hand, standard stateless packet compression algorithms that compress each packet independently, give a relatively poor compression ratio. We introduce a novel(More)
I have organized the talk in two parts. The first is about the years before the algorithm was published, and the second looks forward to the next ten years. Unfortunately, my co-author (and the algorithm's inventor) David Wheeler is unable to come to the workshop. However, he has given me some notes about the invention of the algorithm. I will begin by(More)
— 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(More)
  • 1