CD-GAIN: Content Delivery Using Graph-based Analysis of Interest Networks

CD-GAIN：使用基于图形的兴趣网络分析进行内容交付

• 批准号: EP/K024914/1
• 负责人: Nishanth Sastry
• 金额: $ 12.78万
• 依托单位: King's College London
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2013
• 资助国家: 英国
• 起止时间: 2013 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FK024914%2F1
• 关键词: CD; GAIN; Content; Delivery; Using

Recent years have seen a sea change in the Internet traffic mix, with the Web moving from primarily text-based content towards rich-media such as video and audio streaming. This has imposed significant additional costs both on content providers as well as on Internet Service Providers (ISPs). This project proposes a novel approach that saves costs by identifying and actively enhancing ISP-local content availability. The core idea is that requests for content items can be served from ISP-local copies, where one is available. ISP-local access creates a synergy, with content providers saving on streaming costs, ISPs decreasing their cross-border transit traffic, and users obtaining local copies, isolating them from effects beyond the ISP such as packet losses, route failures or congestion in the network core.Interest-based social networks, which are increasingly available on many content provider sites, provide an ideal framework to engineer the availability of ISP-local copies. Using the interest-based network, communities of users who are interested in similar items can be identified within each ISP. Such communities can serve as repositories of ISP-local copies of items they are interested in, and can support different access rates by pushing additional copies of items among themselves as required. Because members of the community have a high affinity for items they are responsible for, they might have a local copy available, having accessed the item in the past. Alternately, they might be likely to access the item in the future, so if a copy is pushed to them, the expected overhead of the push could be balanced against the future access. Methods will be developed to identify high quality communities useful for sharing content, by weighting or ranking links based on shared content consumption, predicting additional ISP-local links that have not yet been self-identified by users, and adapting community detection methods to create multi-resolution communities with "core" and "peripheral" members, to support fewer or additional ISP-local copies, as required, to sustain different rates of simultaneous content access from the ISP's userbase.The project will take a data-driven approach, using extensive real-world traces from leading content providers both to derive new patterns in the interest network that can be exploited for content delivery, and also to evaluate the benefits of proposed content delivery architectures under realistic workloads. In analysing the traces, the project will develop new characterisations of interest-based social networks using content consumption histories and chart ISP-level content availability from a content provider's viewpoint, both of which would be of independent academic and commercial value.

近年来，互联网流量组合发生了翻天覆地的变化，Web从主要基于文本的内容转向视频和音频流等富媒体。这给内容提供商和互联网服务提供商带来了大量额外成本。 该项目提出了一种新的方法，通过识别和积极提高ISP本地内容的可用性来节省成本。其核心思想是，内容项的请求可以从ISP本地副本（如果有）提供。互联网服务提供商本地接入创造了一种协同效应，内容提供商节省了流媒体成本，互联网服务提供商减少了其跨境过境流量，用户获得了本地副本，使其免受互联网服务提供商以外的影响，如数据包丢失，路由故障或网络核心拥塞。基于网络的社交网络，在许多内容提供商网站上越来越多地可用，提供了一个理想的框架来设计ISP本地副本的可用性。使用基于兴趣的网络，可以在每个ISP内识别对类似项目感兴趣的用户社区。这样的社区可以作为他们感兴趣的项目的ISP本地副本的存储库，并且可以通过根据需要在它们之间推送项目的附加副本来支持不同的访问速率。由于社区成员对他们负责的项目具有很高的亲和力，因此他们可能有一个本地副本可用，因为他们过去访问过该项目。或者，他们可能在将来访问该项目，因此如果向他们推送副本，则推送的预期开销可以与将来的访问相平衡。将制定方法，通过根据共享内容消费对链接进行加权或排名，预测用户尚未自我识别的其他ISP本地链接，以及调整社区检测方法，以创建具有“核心”和“外围”成员的多分辨率社区，以支持更少或更多的ISP本地副本，该项目将采用数据驱动的方法，利用领先内容提供商的广泛真实世界跟踪，在兴趣网络中得出可用于内容交付的新模式，并评估拟议内容交付架构在实际工作负载下的好处。在分析痕迹时，该项目将使用内容消费历史和从内容提供商的角度绘制ISP级内容可用性图表来开发基于兴趣的社交网络的新特征，这两者都将具有独立的学术和商业价值。

项目成果

Provisioning cost-effective mobile video caching

• DOI: 10.1109/icc.2016.7511549
• 发表时间: 2016-05
• 期刊: 2016 IEEE International Conference on Communications (ICC)
• 作者: Seyed Ehsan Ghoreishi;V. Friderikos;Dmytro Karamshuk;Nishanth R. Sastry;H. Aghvami

SCORE: Exploiting Global Broadcasts to Create Offline Personal Channels for On-Demand Access

SCORE：利用全球广播创建离线个人频道以供点播访问

• DOI: 10.1109/tnet.2015.2456186
• 发表时间: 2016
• 期刊: IEEE/ACM Transactions on Networking
• 作者: Nencioni G

ISP-friendly peer-assisted on-demand streaming of long duration content in BBC iPlayer

• DOI: 10.1109/infocom.2015.7218393
• 发表时间: 2015-04
• 期刊: 2015 IEEE Conference on Computer Communications (INFOCOM)
• 作者: Dmytro Karamshuk;Nishanth R. Sastry;Andrew Secker;Jigna Chandaria

Take-Away TV: Recharging Work Commutes With Predictive Preloading of Catch-Up TV Content

外卖电视：通过预测性预加载电视内容为工作通勤充电

• DOI: 10.1109/jsac.2016.2577298
• 发表时间: 2016
• 期刊: IEEE Journal on Selected Areas in Communications
• 影响因子: 16.4
• 作者: Karamshuk D

Performance of Caching-Based D2D Video Distribution with Measured Popularity Distributions

• DOI: 10.1109/globecom38437.2019.9013504
• 发表时间: 2018-06
• 期刊: 2019 IEEE Global Communications Conference (GLOBECOM)
• 作者: Ming-Chun Lee;Mingyue Ji;A. Molisch;Nishanth R. Sastry