Bloom Filters in a Landmark-Based Flat Routing

Flat routing is subject of many proposals found in the literature. One challenging task in this scenario is the flat identity space management since aggregation is not possible. The Landmark-based Flat Routing (LFR) proposal is an alternative to address the routing tables' growth in a scenario which (1) organizes the network in regions represented by landmarks and (2) adopts an XOR-based routing mechanism inside regions. In this work, Bloom filters are introduced to LFR as an effective mechanism to deal with two main aspects of flat routing. The first one is to advertise aggregated reachability information between landmark regions and the second combines the intra-region XOR-based mechanism with Bloom filters in order to reduce unnecessary walk at the flat binary space, opening up many possibilities for the Flat Routing scenario, especially for stretch reduction and scalability for disseminating ``reachability'' information. The evaluations were done in a regular mesh network topology with 256 nodes and the results show the advantages of having Bloom filters in both scenarios, highlighting the effectiveness of such mechanism for flat identifiers aggregation.