Layered Hashing Algorithm for Real-time Systems

We present a hashing mechanism designated for real-time systems. As such, it is faster than standard hashing techniques, yet remains low-cost and uses a relatively small amount of resources. We study a mathematical model of the proposed mechanism, and compare the theoretical results to statistics obtained from simulations. The main contribution of this work is a procedure to determine the appropriate dimensions of the Hash-Table as a function of the required load, and a long-run analysis of the distribution of elements in the table.