Joint backhaul and access optimization for service-segment-based VN admission control
In this paper, we consider the problem of admission control of wireless virtual network (VN) service requests in a multi-service network with service-specific service function chains (SFC). SFC imposes traversal constraints on flows, i.e., each flow must visit certain service-specific nodes in a specific order. We leverage the fact that all flows within a service have common traversal constraints and propose a 'service-based' admission control approach. For both of the service-based and flow-based approaches, we propose novel joint optimizations of backhaul and access networks for the admission control of VN service requests. We show that our optimization formulation is convex, hence computationally efficient and tractable. We also show that the proposed method is applicable to general backhaul and access networks. The simulation results show that the service-based approach incurs no loss in optimality while greatly reducing problem complexity compared to the flow-based counterpart.
|Keywords||Admission Control, Convex Optimization, Service Segments, Wireless Virtual Networks|
|Conference||2017 IEEE International Conference on Communications, ICC 2017|
Mirahsan, M. (Meisam), Farmanbar, H. (Hamid), & Yanikomeroglu, H. (2017). Joint backhaul and access optimization for service-segment-based VN admission control. In IEEE International Conference on Communications. doi:10.1109/ICC.2017.7997298