Re: Re: allocating 14KB memory per packet compression/decompression results in v

From: Sergey Babkin (babkin_at_verizon.net)
Date: 11/04/05

  • Next message: Giorgos Keramidas: "Re: Re: allocating 14KB memory per packet compression/decompression results in v" 
    Date: Fri, 04 Nov 2005 11:14:28 -0600 (CST)
To: Giorgos Keramidas <keramida@ceid.upatras.gr>, kamal kc <kamal_ckk@yahoo.com>

    >From: Giorgos Keramidas <keramida@ceid.upatras.gr>

    >On 2005-11-03 22:56, kamal kc <kamal_ckk@yahoo.com> wrote:

    >> since i am using the adaptive LZW compression scheme it
    >> requires construction of string table for
    >> compression/decompression. So an ip packet of size 1500 bytes
    >> requires a table of size (4KB + 4KB + 2KB = 12KB).
    >
    >I may be stating the obvious or something totally wrong, but
    >couldn't the string table be constructed once instead of each
    >time a packet goes down? It is my intuition that this would
    >perform much much better than re-doing the work of the string
    >table each time a packet goes out.

    No, the table changes as data is compressed. It records
    the knowledge about the strings that have already
    occured in the data.

    Keeping the table between the packets would improve the
    compression but the packets would have to be transmitted
    through a reliable medium since to decompress a packet
    you would have to decompress all the preceding packets
    first (essentially you get a stream compression).
    To keep the packets separate, the compression state
    must be reset between them.

    But of course resetting the compression state does not
    mean that the memory should be deallocated.

    -SB

    _______________________________________________
    freebsd-net@freebsd.org mailing list
    http://lists.freebsd.org/mailman/listinfo/freebsd-net
    To unsubscribe, send any mail to "freebsd-net-unsubscribe@freebsd.org"

  • Next message: Giorgos Keramidas: "Re: Re: allocating 14KB memory per packet compression/decompression results in v"

    Relevant Pages

    • Re: Re: allocating 14KB memory per packet compression/decompression results in v
      ... >couldn't the string table be constructed once instead of each ... Keeping the table between the packets would improve the ... first (essentially you get a stream compression). ...
      (freebsd-hackers)
    • Re: =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
      ... >>>of the string. ... >> universal computing device, say an universal Turing machine, which IS ... K.C. is defined to require an universal computer, ... >These are different forms of potential compression. ...
      (talk.origins)
    • =?iso-8859-1?q?Re:_Kolmorgorov_Complexity_and_Kim_=D8yhus?=
      ... >>of the string. ... These are different forms of potential compression. ... >>functional system may not be able to sustain such sequence compression ... Chaos theory is about DETERMINISTIC systems which amplify small ...
      (talk.origins)
    • Re: Attention Sean - question about CSI
      ... Maybe the degree of compression can serve as a measure ... If I am allowed to choose the compression algorithm *after* ... which compresses that string to a single bit. ... If you are allowed to transmit the data separately, ...
      (talk.origins)
    • Re: Just for fun...
      ... complexity in practical scenarios... ... corresponding complexities for a given string can differ at most by a constant ... When I first learned about the concept of compression, ... surprise in the questions/issues being discussed, ...
      (comp.lang.ruby)