Content-based routing using subpart orthogonal codes

We study the use of orthogonal codes as alternative to Bloom filters in content-based routing. In particular we explore the trade-off between centralized solutions using regular orthogonal codes and generating codes locally by hashing. We demonstrate that introduction of subpart orthogonal codes allows distributed operation while leading to shorter key lengths than Bloom filters with the same probability of data localization. We study the performance of sub-part orthogonal codes by both analytical means and in a simulation environment. Results show that the use of sub-part orthogonal codes reduces overhead without sacrificing performance in both tree and grid topologies.