z-logo
open-access-imgOpen Access
Popularity–Based Adaptive Content Delivery Scheme with In‐Network Caching
Author(s) -
Kim Jeong Yun,
Lee Gyu Myoung,
Choi Jun Kyun
Publication year - 2014
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.14.0113.0090
Subject(s) - multicast , computer network , computer science , unicast , router , content delivery , scheme (mathematics) , content delivery network , enhanced data rates for gsm evolution , overlay network , source specific multicast , xcast , underlay , the internet , distributed computing , server , telecommunications , world wide web , signal to noise ratio (imaging) , mathematical analysis , mathematics
To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in‐network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content's popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in‐network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here