Network Monitoring Mechanism For High Quality Real-Time Streaming Service 


Vol. 31,  No. 11, pp. 969-978, Nov.  2006


PDF
  Abstract

Recently, there has been explosive growth in Internet service contents, and we have witnessed the emergence of many real-time applications on the Internet. These types of applications require special support from the underlying network such as reliability, timeless, and guaranteed delivery, as well as different levels of service quality. Estimation network status and transcoding data rate are researching for QoS of multimedia service by using the RTP/RTCP. We propose two schemes that the way to calculate the one-way delay by expanding the structure of RTP/RTCP in Internet that provides us “best effort” service and to estimate the network condition by using this in this paper. And we propose the dynamic RTCP mechanism based on one-way delay to deal with rapidly changed network situation immediately. In simulation, proposed monitoring schemes using the one-way delay has similar in performance to monitoring schemes using the GPS, proposed dynamic RTCP scheme obtain the desired result of decreased packet loss rate by sending RTCP RR packet lower than other schemes.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Kim and H. Kim, "Network Monitoring Mechanism For High Quality Real-Time Streaming Service," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 969-978, 2006. DOI: .

[ACM Style]

Yong-sul Kim and Hwa-sung Kim. 2006. Network Monitoring Mechanism For High Quality Real-Time Streaming Service. The Journal of Korean Institute of Communications and Information Sciences, 31, 11, (2006), 969-978. DOI: .

[KICS Style]

Yong-sul Kim and Hwa-sung Kim, "Network Monitoring Mechanism For High Quality Real-Time Streaming Service," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 11, pp. 969-978, 11. 2006.