[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1109/GLOCOM.2016.7841985guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article

Minimizing Bandwidth Requirements for VoD Services with Client Caching

Published: 04 December 2016 Publication History

Abstract

Due to the explosive growth in multimedia traffic demand, scalability and delivery efficiency of video-on-demand (VoD) services have become important issues. In this paper, we develop a joint cache allocation and multicast delivery scheme to minimize the average bandwidth consumption of VoD services with client caching under the zero-delay constraint. Specifically, we first propose a client caching enabled multicast patching (CCE-MP) mechanism which achieves the minimum bandwidth consumption given a certain cache allocation. Then we formulate the cache allocation problem into a convex problem, which can be effectively solved by a water-filling algorithm. In addition to the traditional full access pattern where clients watch the video entirely, we further consider the interval access patterns with uniformly distributed endpoints and fixed-size intervals. The impact of different access patterns on the cache allocation algorithm is also investigated. Simulation results indicate that the proposed scheme significantly outperforms other existing approaches, e.g., more than 50% bandwidth saving under a certain setting.

References

[1]
H. Liu, Z. Chen, and L. Qian, “The three primary colors of mobile systems,” to appear in IEEE Commun. Mag., 2016.
[2]
H. Liu, Z. Chen, X. Tian, X. Wang, and M. Tao, “On content-centric wireless delivery networks,” IEEE Wireless Commun., vol. 21, no. 6, pp. 118–125, Jan. 2014.
[3]
C. Yang, Y. Yao, Z. Chen, and B. Xia, “Analysis on cache-enabled wireless heterogeneous networks,” IEEE Trans. Wireless Commun., vol. 15, no. 1, pp. 131–145, Jan. 2016.
[4]
W.-F. Poon, K. Lo, and J. Feng, “Adaptive batching scheme for multicast video-on-demand systems,” IEEE Trans. Broadcast., vol. 47, no. 1, pp. 66–70, Mar. 2001.
[5]
L. Gao and D. Towsley, “Supplying instantaneous video-on-demand services using controlled multicast,” in Proc. IEEE Int. Conf. Multimedia Comupt. Syst., vol. 2, Jul. 1999, pp. 117–121.
[6]
D. Eager, M. Vernon, and J. Zahorjan, “Minimizing bandwidth requirements for on-demand data delivery,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 5, pp. 742–757, Sep. 2001.
[7]
K. Wang, Z. Chen, and H. Liu, “Push-Based Wireless Converged Networks for Massive Multimedia Content Delivery,” IEEE Trans. Wireless Commun., vol. 13, no. 5, pp. 2894–2905, May 2014.
[8]
A. Mahanti, D. Eager, M. Vernon, and D. Sundaram-Stukel, “Scalable on-demand media streaming with packet loss recovery,” IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 195–209, Apr. 2003.
[9]
S. Azad and M. Murshed, “An efficient transmission scheme for minimizing user waiting time in video-on-demand systems,” IEEE Commun. Lett., vol. 11, no. 3, pp. 285–287, Mar. 2007.
[10]
J. M. Lee, H.-J. Park, S. G. Choi, and J. K. Choi, “Adaptive hybrid transmission mechanism for on-demand mobile ipty over wimax,” IEEE Trans. Broadcast., vol. 55, no. 2, pp. 468–477, Jun. 2009.
[11]
Y. Bao, X. Wang, S. Zhou, and Z. Niu, “An energy-efficient client pre-caching scheme with wireless multicast for video-on-demand services,” in Proc. IEEE APCC, Oct. 2012, pp. 566–571.
[12]
C. Jayasundara, M. Zukerman, T. Nirmalathas, E. Wong, and C. Ranaweera, “Improving scalability of vod systems by optimal exploitation of storage and multicast,” IEEE Trans. Circuits Syst. Video Technol. vol. 24, no. 3, pp. 489–503, Mar. 2014.
[13]
M. Maddah-Ali and U. Niesen, “Fundamental Limits of Caching,” IEEE Trans. Inf. Theory, vol. 16, no. 1, pp. 125–139, May 2014.
[14]
H. Tan, D. L. Eager, and M. K. Vernon, “Delimiting the range of effectiveness of scalable on-demand streaming,” Perform. Eval. vol. 49 no. 1, pp. 387–410, 2002.
[15]
S. Jin and A. Bestavros, “Scalability of multicast delivery for non-sequential streaming access,” ACM SIGMETRICS, vol. 30, no. 1, pp. 97–107, Jun. 2002.
[16]
H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack problems. Springer 2004.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
2016 IEEE Global Communications Conference (GLOBECOM)
Dec 2016
5586 pages

Publisher

IEEE Press

Publication History

Published: 04 December 2016

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 31 Dec 2024

Other Metrics

Citations

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media