[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Tree construction algorithm for virtual content distribution network

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Recently, the technology of multimedia content delivery is spotlighted due to many multimedia services. Specially, the needs of a huge content delivery technology is increasing because the period of huge multimedia content creation becomes shorter. The content delivery network (CDN) is a popular solution for distributing a multimedia content using physical resources. However, the CDN cannot provide a flexible service to content providers because of cost issue. In this paper, we aim to build a virtual content delivery network (VCDN) that each service provider own their independent service delivery and distribution network virtually. The proposed VCDN system uses a rateless codes for avoiding computational overhead and limits increase of the streaming delay. The proposed VCDN system builds a hierarchical tree structure that minimizes the time complexity of source nodes and reduces content distribution time by using rateless codes. The proposed VCDN system can support variety of social media services because its flexibility.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.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

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Adler M, Sitaraman RK, Venkataramani H (2011) Algorithms for optimizing the bandwidth cost of content delivery. Comput Netw

  2. Andreev K, Maggs B, Meyerson A, Saks J, Sitaraman R (2011) Algorithms for constructing overlay networks for live streaming. CoRR

  3. Barla B, Schupke DA, Carle G (2012) Delay performance of resilient cloud services over networks. Parallel and distributed processing with applications (ISPA), 2012 I.E. 10th International Symposium on. IEEE

  4. Barla IB et al (2013) Optimal design of virtual networks for resilient cloud services. Design of reliable communication networks (DRCN), 2013 9th international conference on the. IEEE

  5. Cho K et al (2011) How can an ISP merge with a CDN? IEEE Commun Mag 49(10):156–162

    Article  Google Scholar 

  6. Chuan W, Li B (2008) rStream: resilient and optimal peer-to-peer streaming with rateless codes. IEEE Trans Parallel Distrib Syst 19(1):77–92

    Article  Google Scholar 

  7. Gibbs R (2012) A new approach to publishing and caching video. Technical report, Alcatel-Lucent

  8. Grangetto M, Gaeta R, Sereno M (2009) Rateless codes network coding for simple and efficient P2P video streaming. Multimedia and Expo, 2009. ICME

  9. Grangetto M, Gaeta R, Sereno M (2009) Rateless codes network coding for simple and efficient P2P video streaming. Proceedings of the multimedia and expo

  10. Krohn MN, Freedman MJ, Mazieres D (2004) On-the-fly verification of rateless erasure codes for efficient content distribution. Security and privacy, 2004. Proceedings. 2004 I.E. symposium on. IEEE

  11. Liu C, Bouazizi I, Hannuksela MM, Gabbouj M (2012) Rate adaptation for dynamic adaptive streaming over HTTP in content distribution network. Signal Process Image Commun

  12. Mladenov T, Nooshabadi S, Kim K (2010) MBMS raptor codes design trade-offs for IPTV. IEEE Trans Consum Electron

  13. Oh HR, Wu DO, Song H (2011) An effective mesh-pull-based p2p video streaming system using fountain codes with variable symbol sizes. Comput Netw

  14. Um T-W et al (2013) Dynamic resource control mechanism for multimedia overlay transport in NGN. Multimedia Tool Appl 65(2):187–199

    Article  Google Scholar 

  15. Zhou F, Ahmad S, Buyukkaya E, Simon G, Hamzaoui R (2012) Minimizing server throughput for low-delay live streaming in content delivery networks. ACM NOSSDAV

Download references

Acknowledgments

This research was supported in part by the Korea Communications Agency (KCA) in Korea under the title of “The development of Computing-Embedded Media Integrated Delivery System which supporting High Definition Media Services”.

Author information

Authors and Affiliations

  1. Electronics and Telecommunications Research Institute, University of Science and Technology, 218 Gajeong-ro Yuseong-gu, Daejeon, 305-700, South Korea

    Kyoungwoo Heo & Changwoo Yoon

  2. Department of Electronics and Computer Engineering, Chonnam National University, Gwangju, 500-757, Republic of Korea

    Jinsul Kim

Authors
  1. Kyoungwoo Heo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinsul Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Changwoo Yoon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kyoungwoo Heo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Heo, K., Kim, J. & Yoon, C. Tree construction algorithm for virtual content distribution network. Multimed Tools Appl 75, 131–144 (2016). https://doi.org/10.1007/s11042-014-2277-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-014-2277-7

Keywords

Search

Navigation