A Bloom Filter-Based Dual-Layer Routing Scheme in Large-Scale Mobile Networks

The efficiency of inter-domain routing in large-scale mobile network environments is a critical issue, as traditional prefixed addresses may fail due to the dynamic topologies of mobile networks, where devices would be required to maintain massive routing tables. To address this issue, in this paper we leverage the principles of probabilistic data structures in the inter-domain routing scheme, and propose a novel Bloom Filter-based dual-layer inter-domain routing scheme. In particular, we first compare several representative structures and develop a strategy to integrate bloom filters. We then propose our novel Bloom Filter-based dual-layer inter-domain routing scheme. In the design of the routing scheme, we address issues related to the overall space cost and routing loop prevention, and present the corresponding solutions. We also present detailed descriptions of the structures and algorithms in our routing scheme. Finally, we conduct a performance evaluation to validate the effectiveness of our proposed scheme. Our experimental results demonstrate the effectiveness and efficiency of our proposed scheme.