Skip to Main Content
In this paper, our focus is on the embedding problem which consists on the mapping of VN resources onto physical infrastructure network. More specifically, we consider the problem of optimizing the Physical Infrastructure Provider's (PIP) profit while minimizing the dissatisfaction of VN customers. We propose to dynamically partition the PIP resources over VN requests belonging to different Quality of Service (QoS) classes using periodical auction mechanism. We formulate the dynamic embedding problem as an Integer Linear Program (ILP) that allows us to: (i) maximize the PIP profit, and (ii) calculate the optimal embedding scheme of VN requests without disruption of those previously accepted in order to uphold QoS guarantees.