A Peer to Peer Traffic Identification Method Using K-means Clustering, Svm & Genetic Algorithm
نویسندگان
چکیده
The utilization of shared (P2P) applications is developing significantly, which brings about a few major issues, for example, the system clog and traffic obstruction. Consequently P2P traffic identification is the most blazing theme of P2P traffic administration. Support vector machine (SVM) has points of interest with settling little examples for P2P characterization issues. However, the execution of SVM is basically reliant on its parameters. In this paper we propose Genetic Algorithm and K-Means with SVM to streamline the parameters of SVM and have been connected to P2P traffic identification. The curiosity of the proposed strategy is that it uses just the extent of parcels traded between IPs inside seconds. The recognized components of the proposed technique lie in that quick calculation, high identification precision, and asset sparing capacity. At last, experiment results demonstrate the satisfactory performance of the proposed method. KeywordsP2P, SVM, Genetic Algorithm, K-Means Algorithm
منابع مشابه
A P2P Traffic Identification Approach Based on SVM and BFA
Nowadays new peer to peer (P2P) traffic with dynamic port and encrypted technology makes the identification of P2P traffic become more and more difficult. As one of the optimal classifiers, support vector machine (SVM) has special advantages with avoiding local optimum, overcoming dimension disaster, resolving small samples and high dimension for P2P classification problems. However, to employ ...
متن کاملA Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS
Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...
متن کاملModification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis
Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...
متن کاملData Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach
Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...
متن کاملIdentification and Analysis of Peer-to-Peer Traffic
Recent measurement studies report that a significant portion of Internet traffic is unknown. It is very likely that the majority of the unidentified traffic originates from peer-to-peer (P2P) applications. However, traditional techniques to identify P2P traffic seem to fail since these applications usually disguise their existence by using arbitrary ports. In addition to the identification of a...
متن کامل