Identification Method of Streaming Media Based on Queuing Theory

  • Shuliang Pan
  • Ye Liang
  • Jingzhang Liang
  • Cui Teng
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 204)


In the network supervision management, identification of streaming media is an important technology for the online linkage and real-time application. In this paperof streaming media, we analyze the behaviour characteristics of some real-time protocols and find out a novel identification method through extracting the streaming media attribute within P2P working mechanism. Using the queuing theory, the identification method of streaming media in this paper can reduce the complexity of algorithm on timing, insure high identification accuracy rate and fulfil the real-time quality. Experiment shows that this method has good performance.


Identification Streaming media P2P Queuing theory 


  1. 1.
    Moulynox C (2008) Iptv bandwidth growth—bandwidth—growth-60-of-all-consumer-ip- traffic-in/
  2. 2.
    Azzouna NB, Guillemin F (2004) Impact of peer-to-peer applications on wide area network traffic. Exp Approach Globecom Dallas: IEEE 232(4):1544–1548Google Scholar
  3. 3.
    Kamei S, Kimura T (2003) Practicable network design for handling growth in the volume of peer-to-peer traffic. In: IEEE Pacific rim conference on communications, computers and signal processing, vol 31, pp 597–600Google Scholar
  4. 4.
    Scherf K, Wang H, Jiang Y (2007) Iptv: from quadruple play to multiplay. Ind Rep Parks Associates 8(2):293–299Google Scholar
  5. 5.
    Sen S, Wang J (2004) Analyzing peer-to-peer traffic across large networks. IEEE/ACM Trans Networking. IEEE Press, NJ, 12:219–232Google Scholar
  6. 6.
    Gerber A, Houle J, Nguyen H, et al (2003) P2P the gorilla in the cable. Nat Cable Telecomm Assoc (NCTA) Nat Show. IL, Chicago 14(3):45–51Google Scholar
  7. 7.
    Sen S, Spatscheck O, Wang DM (2004) Accurate, scalable in-network identification of P2P traffic using application signatures. New York, USA 32(4):290–298Google Scholar
  8. 8.
    Gong J, Sun Z, Qiang G (2007) Research of identification method based on P2P flow behavior characterization. J Chin Comput Syst 28(1):23–29Google Scholar
  9. 9.
    Chen-Chi W, Kuan-Ta C, Yu-Chun C, Chin-Lauang L (2008) Detecting Peer-to-Peer activity by signaling packet counting. sigcomm’08, Washington, USA 32(5):398–403Google Scholar
  10. 10.
    Liu H, Feng W, Huang Y, Li X (2007) A Peer-To-Peer traffic identification method using machine learning. In: International conference on networking, architecture, and storage (NAS) 22(5):9–16Google Scholar
  11. 11.
    Willig A (1999) A short introduction to queueing theory. Available
  12. 12.
    Chen H-P, Zhang C (2007) A fault detection mechanism for service-oriented architecture based on queuing theory. In: 7th IEEE international conference on computer and information technology (CIT) 29(3):47–54Google Scholar
  13. 13.
    Willig A (1999) A short introduction to queuing theory, technical University Berlin, telecommunication networks group Sekr. FT5-2, Einsteinufer 25, 10587 BerlinGoogle Scholar
  14. 14.
    Alanyali M (2011) Occupancy distributions of homogeneous queuing systems under opportunistic scheduling. Inf Theor 57:256–266Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  • Shuliang Pan
    • 1
  • Ye Liang
    • 2
  • Jingzhang Liang
    • 2
  • Cui Teng
    • 3
  1. 1.School of Computer, Electronics and InformationGuangxi UniversityNanningChina
  2. 2.Information Network CenterGuangxi UniversityNanningChina
  3. 3.Department of Math, Computer and Electronics InformationBaise UniversityBaiseChina

Personalised recommendations