{'fraction_non_alphanumeric': 0.026200873362445413, 'fraction_numerical': 0.002911208151382824, 'mean_word_length': 4.5894308943089435, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient Routing in Multi-ring Content Addressable Network

RCAN [1] is a novel multi-ring content addressable peer-to-peer system. RCAN was proposed in the aim of improving the routing performance of CAN [4] overlays while minimizing the maintenance overhead during nodes churn in large networks. The key idea of RCAN is to equip each node with few long-links towards some distant nodes. Long-links are clockwise directed and wrap around to form small rings along each dimension. The number of rings and their sizes self-adjust as nodes join and leave the systems. RCAN is a pure P2P design, where all nodes assume the same responsibility. Unlike some existing P2P overlays, RCAN is self-organizing and does not assume any a-priori fixed limits for the network size or the routing state per node. Each node auto-adapts its routing state to cope with network changes. We present in this paper an extensive study of the routing performance of RCAN under uniform and non-uniform data distributions. Experimental results show that in an overlay of n nodes, a node maintains a routing state of O(log n) long-links in average, and is able to reach any other nodes within O(log n) routing hops even in the presence of non-uniform space partitioning. Using simulation we demonstrate the full scalability and efficiency of our design and its advantages over other existing methods.