《Profit Maximization for Admitting Requests with Network Function Services in Distributed Clouds》

Publisher:网络空间安全学院Release Time:2018-12-06Times Views:39

Lecturer: Prof. Weifa Liang (Research School of Computer Science, Australian National University)

Date and Time: Fri, December 7, 2018 10:00 AM

Location: Conference Room 413, Computer Building, SEU Jiulonghu Campus

TITLE: Profit Maximization for Admitting Requests with Network Function Services in Distributed Clouds

Abstract:  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.