Using Optimized Virtual Network Embedding for Network Dimensioning

Virtual Network Embedding will be one of the key concepts of the Future Internet. For an ISP it is important to know how many additional Virtual Networks (VNs) of a specific application (e.g. web, streaming, P2P, and VoIP) are mappable into the current resource substrate with a certain probability. In this work we calculate this probability with our embedding algorithm which enables us to consider side effects based on remapping of VNs (e.g. due to reduced link delay). Our results show that minimal extra resources can significantly increase embedding probability of additional VNs.

[1]  R. Martin,et al.  Resilience Analysis of Packet-Switched Communication Networks , 2009, IEEE/ACM Transactions on Networking.

[2]  Michael Menth,et al.  Objective functions for optimization of resilient and non-resilient IP routing , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[3]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[4]  Michael Menth,et al.  ResiLyzer: A Tool for Resilience Analysis in Packet-Switched Communication Networks , 2010, MMB/DFT.

[5]  Xavier Hesselbach,et al.  ALEVIN - A Framework to Develop, Compare, and Analyze Virtual Network Embedding Algorithms , 2011, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[6]  David Stezenbach,et al.  Parameters and challenges for Virtual Network embedding in the Future Internet , 2012, 2012 IEEE Network Operations and Management Symposium.

[7]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[9]  John Wroclawski,et al.  The Use of RSVP with IETF Integrated Services , 1997, RFC.

[10]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[11]  Günther R. Raidl,et al.  Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints , 2011, INOC.

[12]  Michael Menth,et al.  Capacity overprovisioning for networks with resilience requirements , 2006, SIGCOMM.

[13]  James Kelly,et al.  Rapid service creation using the JUNOS SDK , 2009, PRESTO '09.

[14]  Ping Pan,et al.  Internet Engineering Task Force , 1995 .

[15]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[16]  Y. Ebihara.  Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[18]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  L. Trajkovic,et al.  Mapping the Internet , 2001, Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569).