• DocumentCode
    2488758
  • Title

    P2P Traffic Identification Based on the Signatures of Key Packets

  • Author

    Wang, Pinghui ; Guan, Xiaohong ; Qin, Tao

  • Author_Institution
    MOE Key Lab. for Intell. Networks & Network Security, Xian Jiaotong Univ., Xi´´an, China
  • fYear
    2009
  • fDate
    12-12 June 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    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.
  • Keywords
    Internet; peer-to-peer computing; telecommunication congestion control; telecommunication traffic; Internet; key packets signatures; network traffic control; peer-to-peer networks; real time traffic management; traffic identification; Communication system traffic control; Decision trees; IP networks; Network servers; Pattern recognition; Payloads; Protocols; Statistics; Telecommunication traffic; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Aided Modeling and Design of Communication Links and Networks, 2009. CAMAD '09. IEEE 14th International Workshop on
  • Conference_Location
    Pisa
  • Print_ISBN
    978-1-4244-3532-6
  • Electronic_ISBN
    978-1-4244-3533-3
  • Type

    conf

  • DOI
    10.1109/CAMAD.2009.5161471
  • Filename
    5161471