A virtual network mapping algorithm based on subgraph isomorphism detection

SIGCOMM 2009 - Proceedings of the 2009 SIGCOMM Conference and Co-Located Workshops, VISA 2009

Volumn , Issue , 2009, Pages 81-88

  Lischka, Jens ^a   Karl, Holger ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Network Embedding; Network Vir Tualization; Resource Allocation; Subgraph Isomorphism Detection; Virtual Network Mapping

Indexed keywords

CONFORMAL MAPPING; DISTRIBUTED COMPUTER SYSTEMS; RESOURCE ALLOCATION; SET THEORY; SIMULATED ANNEALING;

EXPERIMENTAL EVALUATION; NETWORK EMBEDDING; NODES AND LINKS; PHYSICAL NETWORK; SUBGRAPH ISOMORPHISM; TWO STAGE APPROACH; VIRTUAL NETWORK MAPPINGS; VIRTUAL NETWORKS;

MAPPING;

EID: 84987799496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1592648.1592662     Document Type: Conference Paper

References (17)

1. A. Bavier, N. Feamster, M. H., L. Peterson, and J. Rexford. In VINI Veritas: Realistic and Controlled Network Experimentation. In Proc. of SIGCOMM, pages 3-14, 2006.
2. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An Improved Algorithm for Matching Large Graphs. 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pages 149-159, 2001.
3. L.P. Cordella, P. Foggia, C. Sansone, and M. Vento. Performance Evaluation of the VF Graph Matching Algorithm. Image Analysis and Processing, International Conference on, 0:1172, 1999.
4. Emulab-Network Emulation Testbed. http://www.emulab.net/.
5. J. Fan and M. H. Ammar. Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies. In Proc. of IEEE INFOCOMaA-Z06, 2006.
6. N. Feamster, L. Gao, and J. Rexford. How to Lease the Internet in Your Spare Time. SIGCOMM Comput. Commun. Rev., 37(1):61-64, 2007.
7. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
8. GENI. http://www.geni.net.
9. J. Lu and J. Turner. Efficient Mapping of Virtual Networks onto a Shared Substrate. Technical report, Washington University in St. Louis, 2006.
10. Planetlab. https://www.planet-lab.org.
11. R. Ricci, C. Alfeld, and J. Lepreau. A Solver for the Network Testbed Mapping Problem. Computer Communications Review, 33(2), April 2003.
12. Virtual Network Embedding Simulator. http://www.cs.princeton.edu/minlanyu/embed.tar.gz.
13. W. Szeto, Y. Iraqi, and R. Boutaba. A Multi-Commodity Flow Based Approach to Virtual Network Resource Allocation. In: Proc. IEEE Global Telecommunications Conference (GLOBECOM'03). San Francisco, CA (USA)., 2003.
14. J. Turner and D. Taylor. Diversifying the Internet. In Proc. of the Global Telecommunications Conference, pages 755-760, 2004.
15. M. Yu, Y. Yi, J. Rexford, and M. Chiang. Rethinking Virtual Network Embedding: Substrate Support for Path Splitting and Migration. SIGCOMM Comput. Commun. Rev., 38(2):17-29, 2008.
16. E. W. Zegura, K. L. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In INFOCOM (2), pages 594-602, 1996.
17. Y. Zhu and M. Ammar. Algorithms for Assigning Substrate Network Resources to Virtual Network Components. In Proc. of IEEE INFOCOMM06, 2006.