Improving distributed virtual network embedding with offline optimization

To cope with the complexity of the ever changing internet architecture, network virtualization services are vowed to play an important role in the future. To provide such solutions effectively, internet providers face the problem of optimizing the allocation of virtual networks on their physical resources. Since this problem is known to be NP-hard, heuristicbased online solutions tend to provide better response time, however they lead to non-optimal solutions. This paper shows how a periodic live migration of virtual networks, using a state provided by offline optimization, can help an internet provider increase its virtual network load by up to 20%. Due to better packing of virtual load, some physical resources can also be shut down to save energy.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[4]  Ellen W. Zegura,et al.  Design and analysis of schedules for virtual network migration , 2013, 2013 IFIP Networking Conference.

[5]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[6]  Yi Wang,et al.  Virtual routers on the move: live router migration as a network-management primitive , 2008, SIGCOMM '08.

[7]  Ibrahim Matta,et al.  A general distributed approach to slice embedding with guarantees , 2013, 2013 IFIP Networking Conference.

[8]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .