学术报告信息

 题名:  Profit Maximization for Admitting Requests with Network Function Services in Distributed Clouds 
 报告人:  Weifa Liang教授(澳洲国立大学计算机科学研究院) 
 报告人简介:    
 时间:  2018年12月7日(周五)上午10:00 
 地点:  九龙湖校区计算机楼413会议室 
 内容简介:  The integration of NFV and Software Defined Networking (SDN) simplifies service function chain provisioning, making its implementation simpler and cheaper. We consider dynamic admissions of delay-aware requests with service function chain requirements in a distributed cloud with the objective to maximize the profit collected by the service provider, assuming that the distributed cloud is an SDN that consists of data centers located at different geographical locations and electricity prices at different data centers are different. We first formulate this novel optimization problem as a dynamic profit maximization problem. We then show that the offline version of the problem is NP-hard and formulate an integer linear programming solution to it. We thirdly propose an online heuristic for the problem. We also devise an online algorithm with a provable competitive ratio for a special case of the problem where the end-to-end delay requirement of each request is negligible. We finally evaluate the performance of the proposed algorithms through experimental simulations. The simulation results demonstrate that the proposed algorithms are promising. 
 暂不提供下载资源