DocumentCode
1991510
Title
HMC: A Novel Mechanism for Identifying Encrypted P2P Thunder Traffic
Author
Li, Chenglong ; Xue, Yibo ; Dong, Yingfei ; Wang, Dongsheng
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
fYear
2010
fDate
6-10 Dec. 2010
Firstpage
1
Lastpage
5
Abstract
Thunder (also called Xunlei) is the most popular P2P file sharing application in China and probably the most popular P2P software in term of traffic volume and number of users. Precisely identifying Thunder traffic can help network administrators to efficiently manage their networks. Traditional methods of identifying P2P traffic such as port-based or content-based approaches are ineffective to Thunder traffic, because of its dynamic packet format, flexible port numbers, and payload encryption. In this paper, we developed a novel Heuristic Message Clustering approach (HMC) to identify Thunder traffic, and obtain its state machine and key transaction cycles, thus identifying Thunder traffic fast and accurately. We first evaluate our method in a controlled environment and then with real campus traces. The results show that HMC is able to identify Thunder flows with high precision and low error rate.
Keywords
peer-to-peer computing; telecommunication network management; telecommunication traffic; China; encrypted P2P thunder traffic; file sharing application; heuristic message clustering approach; traffic volume; Cryptography; Internet; Local area networks; Payloads; Peer to peer computing; Protocols; Servers;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Conference_Location
Miami, FL
ISSN
1930-529X
Print_ISBN
978-1-4244-5636-9
Electronic_ISBN
1930-529X
Type
conf
DOI
10.1109/GLOCOM.2010.5683651
Filename
5683651
Link To Document