Efficient embedding of service function chains in space-division multiplexing elastic optical networks

Abstract

Virtual Network Functions (VNFs) are implemented as software instances on generic servers in Data Centers (DCs). A network service is implemented by an ordered list of VNFs, called Service Function Chain (SFC). SFC embedding decides which DC to place/instantiate a VNF, and how to route traffic through the instantiated VNFs/DCs. Benefits from its high capacity and flexibility, the Space-Division Multiplexing Elastic Optical Networks (SDM-EONs) have been proposed as a promising solution to provide connection service between DCs. In this paper, the problem of SFC embedding in SDM-EONs is studied. We first formulate an Integer Linear Programming (ILP) to minimize the Maximum Index of the Utilized Frequency Slot (MIUFS) for a given set of SFC requests. To achieve scalability, a greedy algorithm is proposed to embed SFCs separately. For each SFC, the lowest cost embedding solution can be found by enumeration would be selected for service embedding. A novel stretch algorithm is then designed to reduce the computing complexity further. The key idea is to place VNFs close to the least-cost path between the source and destination of a request. Three strategies to measure the path cost are evaluated. Simulation results show that our stretch algorithm gives the best overall performance in terms of running time, bandwidth consumption, MIUFS and request blocking probability.