A General Distributed Approach to Slice Embedding with Guarantees

To provide wide-area network services, resources from different infrastructure providers are needed. Leveraging the consensus-based resource allocation literature, we propose a general distributed auction mechanism for the (NP-hard) slice embedding problem. Under reasonable assumptions on the bid-ding scheme, the proposed mechanism is proven to converge, and it is shown that the solutions guarantee a worst-case efficiency of (1 − 1 e) relative to the optimal solution. Using extensive simulations, we confirm superior convergence properties and resource utilization when compared with existing distributed slice embedding solutions, and we show how by appropriate policy design, our mechanism can be instantiated to accommodate the embedding goals of different service and infrastructure providers, resulting in an attractive and flexible resource allocation solution for network virtualization