Substream-based out-of-sequence packet scheduling for streaming stored media 


Vol. 29,  No. 10, pp. 1469-1483, Oct.  2004


PDF
  Abstract

We propose a packet scheduling algorithms for streaming media We assume that the receiver periodically reports back the channel throughput From the original video data, the Importance level of a video packet is determined by its relative position within its group of pictures, taking into account the motion-texture discrimination and temporal scalability. Thus, we generate a number of nested substreams Using feedback information from the receiver and statistical characteristics of the video, we model the streaming system as a queueing system, compute the run-time decoding failure probability of a frame In each substream based on effective bandwidth approach, and determine the optimum substream to be sent at that moment ill time Since the optimum substream is updated periodically, the resulting sending order is different from the orignal playback 。 ider From experiments with real video data, we show that our proposed scheduling scheme outperforms the conventional sequential sending scheme.

  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]

S. Choi, H. Ahn, S. H. Kang, "Substream-based out-of-sequence packet scheduling for streaming stored media," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 10, pp. 1469-1483, 2004. DOI: .

[ACM Style]

Sujeong Choi, Heejune Ahn, and Sang Hyuk Kang. 2004. Substream-based out-of-sequence packet scheduling for streaming stored media. The Journal of Korean Institute of Communications and Information Sciences, 29, 10, (2004), 1469-1483. DOI: .

[KICS Style]

Sujeong Choi, Heejune Ahn, Sang Hyuk Kang, "Substream-based out-of-sequence packet scheduling for streaming stored media," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 10, pp. 1469-1483, 10. 2004.