数字电影内容分发请求路由算法的定义和性能评估

D. D. Sorte, M. Femminella, G. Reali, L. Rosati
{"title":"数字电影内容分发请求路由算法的定义和性能评估","authors":"D. D. Sorte, M. Femminella, G. Reali, L. Rosati","doi":"10.1109/ITNEWS.2008.4488125","DOIUrl":null,"url":null,"abstract":"In this work, carried out in the framework of the IST Project EDCINE, we deal with the network distribution of Digital Cinema contents, through a Content Delivery Network, towards theatres. One of the main criticalities of the system is the very large size of the contents to be transferred while respecting the maximum download time requirements. From the operator perspective, this criticality translates into the objective of optimizing the usage of network resources while complying with QoS constraints. The goal of this paper is first to present the network architecture and procedures relevant to the distribution service, and to specifically analyse the problem of service request routing (4-7 routing), whose objective is to select a set of servers to satisfy a content request efficiently. In particular, we focus on the definition of the mathematical model of the problem of minimising the network operational cost of the content distribution. Since some known professional, optimisation tools are not able to find the global optimum even in very simple configurations, we propose a heuristic approach based on the min-plus convolution. Preliminary numerical results show that such an algorithm outperforms the selected professional tools, while maintaining an affordable computation time.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Definition and performance evaluation of a request routing algorithm to distribute digital cinema contents\",\"authors\":\"D. D. Sorte, M. Femminella, G. Reali, L. Rosati\",\"doi\":\"10.1109/ITNEWS.2008.4488125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, carried out in the framework of the IST Project EDCINE, we deal with the network distribution of Digital Cinema contents, through a Content Delivery Network, towards theatres. One of the main criticalities of the system is the very large size of the contents to be transferred while respecting the maximum download time requirements. From the operator perspective, this criticality translates into the objective of optimizing the usage of network resources while complying with QoS constraints. The goal of this paper is first to present the network architecture and procedures relevant to the distribution service, and to specifically analyse the problem of service request routing (4-7 routing), whose objective is to select a set of servers to satisfy a content request efficiently. In particular, we focus on the definition of the mathematical model of the problem of minimising the network operational cost of the content distribution. Since some known professional, optimisation tools are not able to find the global optimum even in very simple configurations, we propose a heuristic approach based on the min-plus convolution. Preliminary numerical results show that such an algorithm outperforms the selected professional tools, while maintaining an affordable computation time.\",\"PeriodicalId\":255580,\"journal\":{\"name\":\"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITNEWS.2008.4488125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEWS.2008.4488125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在IST项目EDCINE的框架内进行的这项工作中,我们通过内容交付网络向影院处理数字电影内容的网络分发。该系统的主要缺点之一是要传输的内容非常大,同时又符合最大下载时间要求。从运营商的角度来看,这种重要性转化为在遵守QoS约束的同时优化网络资源使用的目标。本文的目标是首先介绍与分发服务相关的网络体系结构和流程,并具体分析服务请求路由问题(4-7路由),其目的是选择一组服务器来有效地满足内容请求。特别地,我们关注于最小化内容分发的网络运营成本问题的数学模型的定义。由于一些已知的专业优化工具即使在非常简单的配置中也无法找到全局最优,我们提出了一种基于最小加卷积的启发式方法。初步的数值结果表明,该算法在保持可承受的计算时间的同时,优于所选的专业工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Definition and performance evaluation of a request routing algorithm to distribute digital cinema contents
In this work, carried out in the framework of the IST Project EDCINE, we deal with the network distribution of Digital Cinema contents, through a Content Delivery Network, towards theatres. One of the main criticalities of the system is the very large size of the contents to be transferred while respecting the maximum download time requirements. From the operator perspective, this criticality translates into the objective of optimizing the usage of network resources while complying with QoS constraints. The goal of this paper is first to present the network architecture and procedures relevant to the distribution service, and to specifically analyse the problem of service request routing (4-7 routing), whose objective is to select a set of servers to satisfy a content request efficiently. In particular, we focus on the definition of the mathematical model of the problem of minimising the network operational cost of the content distribution. Since some known professional, optimisation tools are not able to find the global optimum even in very simple configurations, we propose a heuristic approach based on the min-plus convolution. Preliminary numerical results show that such an algorithm outperforms the selected professional tools, while maintaining an affordable computation time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信