检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杜文龙 黄余 DU Wen-long;HUANG Yu(School of Computer and Communication,Jiangsu Vocational College of Electronics and Information,Huai’an 223003,China;School of Advanced Students,Saint Louis University,Baguio 2600,Philippines)
机构地区:[1]江苏电子信息职业学院计算机与通信学院,江苏淮安223003 [2]圣路易斯大学研究生院,菲律宾碧瑶2600
出 处:《计算机工程与设计》2021年第11期3026-3033,共8页Computer Engineering and Design
基 金:江苏省“333工程”科研基金项目(BRA2018315);淮安金鑫传动机械有限公司基金项目(KB200302)。
摘 要:针对媒体内容提供商采用网络编码的多播最优化容量供应问题,提出一种基于2-阶段的成本优化方案。在第一阶段,网络容量购买基于对未来客户集的预测,这相当于内容提供商在与因特网服务提供商进行初始服务级协议谈判期间预定的容量;在第二阶段,一旦明确知道客户集,就追加购买服务所有客户所要求的额外容量;为指导第一阶段的容量购买决策,提出2种有效的近似算法,使两个阶段的总体成本在预期中最小化。仿真结果表明,该成本优化算法有效,且非常接近甚至优于最优解。Aiming at the problems of the multicast optimal capacity provision when media content providers adopt network coding multicast,and a cost optimization scheme based on 2-stage was proposed.In the first stage,the network capacity purchase was based on the prediction of future customer sets,which was equivalent to the capacity reserved by the content provider during the initial service-level agreement negotiations with the Internet service provider.In the second stage,once the set of customers was known unambiguously,the recourse action at this stage was to purchase the additional capacity required to serve all customers.To guide the capacity purchase decisions in the first stage,two effective approximation algorithms were proposed to minimize the total cost of the two stages in expectation.The simulation results show that the proposed cost optimization algorithm is not only effective,but also very close to,even superior to the optimal solution.
关 键 词:网络图 容量供应 网络编码 多播路由 线性规划 客户集 成本优化
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28