| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To improve the performance of a protocol, by recognizing a change in contents of elements without wastefully deleting old elements. <P>SOLUTION: Each node accepts as input a list of pointers to elements that are representations of a parsed TLV (type length value) encoded packet elements and a tree for duplicate lists of pointers to these elements. Each of the elements of the list pointed to contains a list of pointers to embedded elements and a tree of pointers to these elements. The tree allows for fast searches for finding elements that did not change. Each node further accepts as input, a list of pointers to elements representing the new, unparsed packet. Each node generates, from the list of pointers to elements that representation of the parsed TLV encoded packet, a new version of the list of pointers to elements that are the representations of the non-parsed packets. <P>COPYRIGHT: (C)2008,JPO&INPIT</p> |
