{'fraction_non_alphanumeric': 0.02631578947368421, 'fraction_numerical': 0.0013850415512465374, 'mean_word_length': 4.926229508196721, '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}}
A Case for Lightweight SuperPeer Topologies

The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware class of Lightweight SuperPeer Topologies (LSTs). The proposed LST is based on the geometric principle of Yao-Graphs, a class of graphs allowing the development of simple and efficient broadcast algorithms. The pre-requisite of the LST approach is a function for mapping nodes in a network into a geometric space. In this paper we use the ”Highways” proximity clustering and geometric placement model, introduced by one of the authors for this purpose. LST is evaluated based on PlanetLab measurements.