Certain investigations on distributed node clustering in peer to peer networks using meta heuristic algorithms

Abstract

Peer to Peer P2P networks link various peers in an ad hoc manner They are particularly made use of in applications of file sharing that enables the peers to share all the digitalized files like audio video and electronic books The traditional networks that have server client topology and the files available in the data center every peer in a P2P network is a client and also a server This model is very convenient owing to the classical ability to search for the files throughout the network through the use of semi centralized servers shown as a centralized node that leaves the networks vulnerable In the case of a Peer to Peer network the nodes have the ability to communicate with neighbors resultant any central coordination By means of exchanging the data this network performs a cooperative positioning, where each node gets benefitted by the neighbors for computing position K means clustering is a well studied and popular technique of data analysis This technique completely depends on the Euclidian distances This technique distributes the dataset into different clusters having similar features A standard version assumes an easy availability of the data in a particular location newline