Skip to main content

A Heuristic Packet Scheduling Algorithm for Media Streaming with Server Diversity

  • Conference paper
Advances in Multimedia Information Processing - PCM 2004 (PCM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3331))

Included in the following conference series:

  • 921 Accesses

Abstract

This paper studies the streaming of packetized media from multiple servers to a receiver over a lossy network with retransmissions. Considering these factors such as packet decoding interdependencies, decoding deadline requirements and diversified network/server conditions, we propose a receiver-driven heuristic packet scheduling algorithm to decide which packet(s) to be requested from which server(s) at each given request opportunity in order to minimize the end-to-end distortion while conforming to rate constraints on the paths that from the servers to the receiver. Simulation results demonstrate the benefit of exploiting server diversity with our proposed packet scheduling algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Miao, Z., Ortega, A.: Expected run-time distortion based scheduling for delivery of scalable media. In: Proc. PVW 2002, Pittsburgh, PA (April 2002)

    Google Scholar 

  2. Majumdar, A., Puri, R., Ramchandran, K.: Rate-distortion efficient video transmission from multiple servers. In: IEEE ICME (2002)

    Google Scholar 

  3. Nguyen, T., Zakhor, A.: Distributed video streaming with forward error correction. In: Proc. Int’l Packet Video Workshop, Pittsburg, PA (April 2002)

    Google Scholar 

  4. Begen Ali, C., Altunbasak, Y., Begen Mehmet, A.: Rate-distortion optimized ondemand streaming with server diversity. In: IEEE ICIP (September 2003)

    Google Scholar 

  5. Yajnik, M., Moon, S., Kurose, J., Towsley, D.: Measurement and modeling of the temporal dependence in packet loss. In: Proc. INFOCOM, vol. 1, pp. 345–352 (1999)

    Google Scholar 

  6. Wenyu, J., Schulzrinne, H.: Modeling of packet loss and delay and their effects on real-time multimedia service quality. In: ACM NOSSDAV (2000)

    Google Scholar 

  7. Radha, H., van der Schaar, M., Chen, Y.: The MPEG-4 fine-grained scalable video coding method for multimedia streaming over IP. IEEE Transaction Multimedia 3(1) (March 2001)

    Google Scholar 

  8. Mukherjee, A.: On the dynamics and significance of low frequency components of internet load. Internetworking: Res. Experience 5, 163–205 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Dou, W., Zhang, H. (2004). A Heuristic Packet Scheduling Algorithm for Media Streaming with Server Diversity. In: Aizawa, K., Nakamura, Y., Satoh, S. (eds) Advances in Multimedia Information Processing - PCM 2004. PCM 2004. Lecture Notes in Computer Science, vol 3331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30541-5_74

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30541-5_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23974-1

  • Online ISBN: 978-3-540-30541-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics