Task #3862
open
Investigate unordered CS
0%
Description
Investigate ContentStore implementation based on unordered container.
CS is a major bottleneck of forwarding performance, as shown in benchmarks. It's believed that CS is slow because it uses an ordered container.
Note that CS must still support Interest name being a prefix of Data name for Interests with CanBePrefix element, and cannot require exact matching only.
Possible data structures include but are not limited: tree, hashtable, Bloom filters.
Updated by Junxiao Shi over 5 years ago
- Description updated (diff)
These requirements are removed because Selectors are gone:
CS maintains an order in order to support ChildSelector. Suppose ChildSelector is not needed in a certain network environment, forwarding performance might be improved by implementing the CS based on unordered containers.
Note that CS must still support Interest name being a prefix of Data name, and cannot require exact matching only; support of other selectors can be optional.