Packet header compression using which manages template dictionary using evolutionary mutation, strengthening and death

摘要

Packet header compression wherein static and predictably changing bytes are replaced with references to a dictionary of templates are well known. The invention compares packets to the dictionary in the conventional wayA1/A2. If no match is found a new conception template is startedA9with 0 static bytes and an initial strength. If a partial match is foundA7a mutant template with less static bytes and an initial strength value is createdA8. If a full match is found it used for compression and its strength is increasedA3.When repeated matches are madeA5a mutant with more static bytes and an initial strength value is createdA6. New conception and mutant template can have differing initial strengths. After each packet strength values are reducedA0and 0 strength templates killed and deleted (similar to a time out). The technique does not require knowledge of the packet structure and can therefore be used with multiple protocols.