DocumentCode :
2474273
Title :
A fast identification method for P2P flow based on nodes connection degree
Author :
Xing, Ling ; Zheng, Wei-Wei ; Ma, Jian-Guo ; Ma, Wei-Dong
Author_Institution :
Sch. of Inf. Eng., Southwest Univ. of Sci. & Technol., Mianyang, China
fYear :
2010
fDate :
17-19 Dec. 2010
Firstpage :
225
Lastpage :
228
Abstract :
P2P traffic has taken up the most significant portion of the network traffic. Effective identification of P2P traffic becomes an important role for network traffic management. However, with the wide application of dynamic port and content encrypted techniques, traditional P2P identification methods are powerless. To address the issues of port hopping and unconspicuous application characters, a fast identification method of P2P flow is proposed in this study, in which the connection degree distribution of network nodes is used to judge the effective character of P2P flow. At the same time, some common P2P protocols are tested with the method, including HTTP, OICQ, DNS and Edonkey. Experimental results show that using this identification method can quickly and effectively judge P2P flow. The method can also deal with network congestion to a certain extent by identifying and monitoring P2P traffic.
Keywords :
peer-to-peer computing; routing protocols; telecommunication traffic; P2P protocols; P2P traffic; content encrypted techniques; network traffic management; nodes connection degree; Accuracy; Classification algorithms; IP networks; Machine learning; Machine learning algorithms; Peer to peer computing; Protocols; P2P; complex networks; connection degree; traffic identification;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Apperceiving Computing and Intelligence Analysis (ICACIA), 2010 International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-8025-8
Type :
conf
DOI :
10.1109/ICACIA.2010.5709888
Filename :
5709888
Link To Document :
بازگشت