TY - GEN
T1 - P2P traffic identification based on the signatures of key packets
AU - Wang, Pinghui
AU - Guan, Xiaohong
AU - Qin, Tao
PY - 2009
Y1 - 2009
N2 - Peer-to-Peer (P2P) protocol is widely used in many network applications and P2P traffic is becoming dominating in the current Internet and may cause serious congestion. Recently, P2P applications tend to intentionally disguise their traffic flows by using arbitrary ports, which leads the accurate identification of P2P traffic to become a very difficult job and hot research topic in network traffic control. In this paper, we employ the longest common subsequence to identify the key packets from the traffic flows, and present a new method to identify the P2P flows based on the signatures of key packets with only direction and payload length in the first few packets of a flow. We test the new method with four popular P2P applications in the actual network environment and the results show that the new method has high accuracy and efficiency since only a few packets in each flow needs to be analyzed. The new method is suitable for real time traffic management and monitoring.
AB - Peer-to-Peer (P2P) protocol is widely used in many network applications and P2P traffic is becoming dominating in the current Internet and may cause serious congestion. Recently, P2P applications tend to intentionally disguise their traffic flows by using arbitrary ports, which leads the accurate identification of P2P traffic to become a very difficult job and hot research topic in network traffic control. In this paper, we employ the longest common subsequence to identify the key packets from the traffic flows, and present a new method to identify the P2P flows based on the signatures of key packets with only direction and payload length in the first few packets of a flow. We test the new method with four popular P2P applications in the actual network environment and the results show that the new method has high accuracy and efficiency since only a few packets in each flow needs to be analyzed. The new method is suitable for real time traffic management and monitoring.
KW - Longest common subsequence
KW - Peer-to-peer
KW - Traffic identification
UR - https://www.scopus.com/pages/publications/85086810472
U2 - 10.1109/camad.2009.5161471
DO - 10.1109/camad.2009.5161471
M3 - 会议稿件
AN - SCOPUS:85086810472
SN - 9781424435333
T3 - 2009 IEEE 14th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2009
BT - 2009 IEEE 14th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2009
PB - IEEE Computer Society
T2 - 2009 IEEE 14th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2009
Y2 - 12 June 2009 through 12 June 2009
ER -