TY - GEN
T1 - Online revenue maximization in NFV-Enabled SDNs
AU - Ma, Yu
AU - Liang, Weifa
AU - Xu, Zichuan
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/27
Y1 - 2018/7/27
N2 - Traditional networks employ expensive dedicated hardware devices as middleboxes to implement Service Chains (SC) of user requests by steering data traffic along the middleboxes in the service chains. Network Function Virtualization (NFV) is a promising virtualization technique by implementing network functions as pieces of software in servers or data centers. By leveraging the technique of Software Defined Networking (SDN), NFV can be further enabled in a flexible and dynamic way. In this paper, we consider dynamic admissions of delay-aware NFV-enabled requests in SDNs by leveraging pre-installed NFV instances in data centers. We first formulate a novel revenue maximization problem, and show that the problem is NP-hard. We then 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 requests can be neglected. We finally evaluate the performance of the proposed algorithms through experimental simulations. The simulation results demonstrate that the proposed algorithms are promising.
AB - Traditional networks employ expensive dedicated hardware devices as middleboxes to implement Service Chains (SC) of user requests by steering data traffic along the middleboxes in the service chains. Network Function Virtualization (NFV) is a promising virtualization technique by implementing network functions as pieces of software in servers or data centers. By leveraging the technique of Software Defined Networking (SDN), NFV can be further enabled in a flexible and dynamic way. In this paper, we consider dynamic admissions of delay-aware NFV-enabled requests in SDNs by leveraging pre-installed NFV instances in data centers. We first formulate a novel revenue maximization problem, and show that the problem is NP-hard. We then 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 requests can be neglected. We finally evaluate the performance of the proposed algorithms through experimental simulations. The simulation results demonstrate that the proposed algorithms are promising.
UR - http://www.scopus.com/inward/record.url?scp=85049442376&partnerID=8YFLogxK
U2 - 10.1109/ICC.2018.8422333
DO - 10.1109/ICC.2018.8422333
M3 - Conference contribution
SN - 9781538631805
T3 - IEEE International Conference on Communications
BT - 2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Conference on Communications, ICC 2018
Y2 - 20 May 2018 through 24 May 2018
ER -