Virtual Network Mapping based on Subgraph Isomorphism Detection. Jens Lischka, Holger Karl Paderborn University

Transcription

1 Virtual Network Mapping based on Subgraph Isomorphism Detection Jens Lischka, Holger Karl Paderborn University Jens Lischka 1

2 VNM Problem 2 VNR 1(t 0, 10) PN 6 2 G B C 1 0 α γ 0 0 αa D γe αf 2 VNR 2(t,) VNR (t 6,) 1 α α Jens Lischka 2

3 Overview 2stage VNM algorithm Subgraph Isomorphism Detection based VNM Experimental results Jens Lischka

4 2stage Algorithm 1. First stage: find suitable mapping nodes 2. Second stage: find a link mapping (k shortest paths, multi commodity flow). No paths for virtual links >γ!. Problem: first stage does not take connectivity of VNs into account 6 VN 6 G PN 0 Bγ 0 C 1 10 α γ 0 0 Aα D E 1 0 F Jens Lischka

5 2stage vs. vnmflib 2stage vnmflib Map nodes Map single node n No Map ninks No Map links connected to n valid Done! Yes complete Yes Done! Yes valid No Track back to last valid mapping Jens Lischka

6 Example: vnmflib 1. Compute set of candidates C. 2. Compute a set of mapping candidates M.. Add α to the subgraph and map it onto A.. Map all links connecting α with the subgraph onto the PN. Check validity. Subgraph Mapping C={α,γ,} 6 M={A} 6 G B C 1 γ F α Aα D E Jens Lischka 6

7 Example: vnmflib 1. Compute C and M. 2. Add γ to the subgraph and map it onto B.. Map all links connecting γ with the subgraph onto the PN.. Check validity. Subgraph Mapping C={γ,} 6 M={B,E,F} 6 0 G γb C 1 α γ 0 Aα 2 D E F Jens Lischka

8 Example: vnmflib 1. Compute C and M. 2. Add to the subgraph and map it onto G.. Map all links connecting with the subgraph onto the PN.. Check validity. Subgraph Mapping C={} M={G,E,F} G γb C 1 cγ 2 2 F aα 0 Aα D E Jens Lischka

9 Example: vnmflib 1. Choose next node E of M. 2. Map onto E.. Map all links connecting with the subgraph onto the PN.. Check validity. Subgraph Mapping C={b} M={G,E,F} G γb C 1 cγ 2 0 F aα 0 Aα D E Jens Lischka 9

10 Example: vnmflib 1. Track back to the last valid mapping solution. 2. Choose next node E.. Map γ onto E.. Map all links connecting γ with the subgraph onto the PN.. Check validity. Subgraph Mapping C={γ,} M={B,E} 6 6 G B C 1 cγ F aα 0 Aα D Eγ Jens Lischka 10

11 Example: vnmflib 1. Compute C and M. 2. Add to the subgraph and map it onto B.. Map all links connecting with the subgraph onto the PN.. Check validity. Subgraph Mapping C={} M={B,F,G} G B C 1 cγ 0 0 F aα 0 Aα D Eγ Jens Lischka 11

12 Path Splitting Split up path into multiple paths α VNR 6 G B C 1 A D E αf Jens Lischka 12

13 Experimental Results Network setup similar to previous work[1] with GT ITM tool: PN: 100 nodes and 00 links CPU at the nodes, Bandwidth at the links follow uniform distribution from units VNs: 20 0 nodes, each pair of nodes connected with probability 0. CPU and Bandwidth follow a uniform distribution from 0 to beta units. Compared our algorithm with the two stage VN Mapper of [1]. [1]Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration. SIGCOMM Comput. Commun. Rev., (2):1 29, 200. Source code available: Jens Lischka 1

14 Experimental results Jens Lischka 1

15 Experimental Results Jens Lischka 1

16 Summary Introduced new VNM method based on SID SID based VNM performs better than the 2stage approach Especially for higher beta values and bigger networks Currently we are implementing the mapper on the PlanetLabTestbed infrastructure as part of the OneLab2 project Jens Lischka 16

17 Thank You Questions? Jens Lischka 1

18 VNM Algorithms 2stage: Rethinking Virtual Network Embedding: Support for Path Splitting and Migration. SIGCOMM, 200. Algorithms for Assigning Substrate Network Resources to Virtual Network Components, INFOCOMM, A Multi Commodity Flow Based Approach to Virtual Network Resource Allocation. GLOBECOMM, 200. Simulated Annealing: A Solver for the Network Testbed Mapping Problem. Computer Communications Review (2), 200. Mixed Integer Quadratic Program Efficient Mapping of Virtual Networks onto a shared Substrate. Technical Report, Washington University Jens Lischka 1

19 VNM Algorithms Virtual Network Embedding with Coordinated Node and Link Mapping. In Proceedings of the 2 th Conference on Computer Communications (IEEE INFOCOMM), April Jens Lischka 19

20 SID based VNM Idea: Map Nodes and Links alternately based on vflibsubgraph Isomorphism Detection algorithm. Build a subgraph S of VN by successively adding nodes of VN to S and map S onto PN until S fully covers VN. Difference to vflib: Allow mapping of virtual links onto paths Check capacity constraints Jens Lischka 20