Client CIDR filter system with polling centralized TCP polling server.
- Current relational structure dependence of CIDR Blocker requires full-row scan and value operation in order to determine potential candidate
- Relational structure stores have O(n) storage instead and compute complexity.
- Radix tree cannot be sanely implemented in such relational dependency, much less providing continuous updates.
- Radix tree provides O(log n) storage and a worst-case of O(4) access, with the worst storage space cost of 256^4 bytes with every IPv4 address within the filter, with a mean cost of 256^3 bytes.