{'fraction_non_alphanumeric': 0.02425876010781671, 'fraction_numerical': 0.006289308176100629, 'mean_word_length': 5.6706586826347305, '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}}
FAN: A Scalable Flabellate P2P Overlay Supporting Multi-Dimensional Attributes

Peer-to-peer (P2P) technology provides an efficient way for resource distribution, and sharing. While most current P2P systems only support queries over a single attribute which limits the popularity of the P2P technology. Full-blown P2P applications require the efficient resource searching supporting multi-dimensional attributes. In this paper, we propose flabellate overlay network (FAN), a scalable P2P overlay supporting multi-dimensional attributes. In FAN, the peers are mapped into a d-dimensional Cartesian space. The resource management and searching are based on the peer's second moment to the origin of coordinates. The theoretical analyses and experimental results demonstrate that FAN has high routing efficiency and low network maintenance cost over the existing structured P2P systems by storing logarithmic routing messages in peers and achieving logarithmic-hop resource searching. And many improved routing algorithms supporting multi-attribute queries can be implemented over FAN and achieve better performance.