{'fraction_non_alphanumeric': 0.019559902200488997, 'fraction_numerical': 0.006519967400162999, 'mean_word_length': 4.990243902439024, '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}}
Performance Analysis of Chord Protocol for Peer to Peer Overlay Topology in Wireless Mesh Network

to-Peer (P2P) applications have been extensively used for file sharing and accounts for more than 70% of the traffic in the internet. The inherent characteristics of P2P make it advantageous in content distribution when compared to client- server architecture. In a P2P network, there is no clear distinction between client and server nodes, as every peer is both a client and a server at the same time. Thus, the time required to distribute data is lesser when compared to the client-server method. Due to the distributed and scalability of P2P, structured P2P approaches have also been proposed for ad-hoc networks. The potential for distributed P2P networking applications using a structured lookup algorithm such as Chord is enormous. However, whilst it has been proven that a structured approach improves lookup performance in a high bandwidth wired network; overlay networks may create unnecessary overhead that could negatively impact performance given an unstable environment such as a Wireless Mesh Network (WMN). In this paper, it is proposed to study existing CHORD protocols on WMN when nodes are static and dynamic.