DBvLEA: A Demand-Based Approach to Virtual Link Mapping for Multi-Service Industrial Applications

Abstract

Network virtualization is proposed in several research work as a means to overcome the ossification of the Internet. Its application relies on embedding algorithms to instantiate virtual networks on substrate infrastructures. Notably, those considered in the scope of traffic-engineering are developed to focus on efficient resource utilization with the aim of increasing the acceptance ratio of the algorithms. In this paper, a demand-based virtual link embedding approach for multi-service mapping in programmable industrial networks is proposed. The approach aims at increasing the overall acceptance ratio of virtual link embedding algorithms by increasing the acceptance of demand critical requests. The goal is achieved by minimizing the deviation between requested demands and the resources satisfying the demand. The approach, when analyzed against state-of-the-art shortest path approaches under the same simulation conditions, shows good results in terms of utilization of the network resources, acceptance of delay-critical traffic demands and overall acceptance ratio.