Maximum Bipartite Matching Size and Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust multiple choice hashing scheme with high memory utilization that can be used in many network device applications. Unfortunately, for memory loads beyond 0.5, little is known on its performance. In this paper, the authors analyze its average performance over such loads. They tackle this problem by recasting the problem as an analysis of the expected maximum matching size of a given random bipartite graph. They provide exact results for any finite system, and also deduce asymptotic results as the memory size increases. They further consider other variants of this problem, and finally evaluate the performance of their models on Internet backbone traces.