Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Dynamic Bandwidth Allocation for Stored Video Under Renegotiation Frequency Constraint

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

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4261))

Included in the following conference series:

Abstract

In this paper, a dynamic bandwidth allocation algorithm is proposed for stored video transmission with renegotiation interval constraint. It is to handle the problem of short renegotiation intervals in optimal smoothing algorithms[4,5], which may increase the renegotiation cost or cause renegotiation failures. Based on the transmission rate bounds derived from buffer constraints, a transmission segment is calculated based on the optimal smoothing algorithm [5]. If the length of the segment is less than the minimum renegotiation interval, it is merged to the neighboring segment considering the relation between the transmission rates of neighboring segments by allowing encoder buffer underflows. From the simulation results, the proposed algorithm is shown to keep the renegotiation intervals larger than the minimum and the renegotiation cost is greatly reduced with slight decrease in the channel utilization.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Lakshman, T.V., Ortega, A., Reibman, A.R.: VBR Video: Tradeoffs and Potentials. Proceedings of the IEEE 86(5), 952–973 (1998)

    Article  Google Scholar 

  2. Grossglauser, M., et al.: RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic. IEEE/ACM Trans. Networking 5(6), 741–755 (1997)

    Article  Google Scholar 

  3. Rose, O.: Statistical Properties of MPEG Video Traffic and Their Impact on Traffic Modeling in ATM Systems. In: 20th Conference on Local Computer Networks (October 1995)

    Google Scholar 

  4. Jiang, Z., Kleinrock, L.: A General Optimal Video Smoothing Algorithm. In: IEEE Infocomm (1998)

    Google Scholar 

  5. Salehi, J., Zhang, Z., Kurose, J., Towsley, D.: Supporting stored video: reducing rate variability and End-to-End Resource requirements through optimal smoothing. IEEE/ACM Trans. Networking 6(4) (August 1998)

    Google Scholar 

  6. Lee, M.: Video Traffic Prediction Based on Source Information and Preventive Channel Rate Decision for RCBR. IEEE Trans. Broadcasting 52(2), 173–183 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, Mj., Yoo, Ky., Lee, Dj. (2006). Dynamic Bandwidth Allocation for Stored Video Under Renegotiation Frequency Constraint. In: Zhuang, Y., Yang, SQ., Rui, Y., He, Q. (eds) Advances in Multimedia Information Processing - PCM 2006. PCM 2006. Lecture Notes in Computer Science, vol 4261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922162_62

Download citation

  • DOI: https://doi.org/10.1007/11922162_62

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48769-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics