{'fraction_non_alphanumeric': 0.023702031602708805, 'fraction_numerical': 0.004514672686230248, 'mean_word_length': 5.2027972027972025, '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}}
File Consistency Maintenance Through Virtual Servers in P2P Systems

As the tremendous growth in peer-to-peer (P2P) applications, the issues related to file consistency become critical. In this paper, an algorithm for file Consistency Maintenance through Virtual servers (CMV) is proposed for unstructured and decentralized P2P systems. In CMV, consistency of each dynamic file is maintained by a virtual server (VS). A file update can only be accepted through the VS to ensure the one-copy serializability. The VS of a file is a logical network composed of multiple replica peers (RPs) that have replicas of the file. Mathematical analysis is performed to determine the optimal parameter selections that achieve minimum overhead messages for maintaining file consistency. The numerical results indicate that CMV is well suited for efficient file consistency maintenance in P2P systems.