ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
暂无分享,去创建一个
Raouf Boutaba | Muntasir Raihan Rahman | Mosharaf Chowdhury | R. Boutaba | Mosharaf Chowdhury | Mosharaf Chowdhury | Mosharaf Chowdhury
[1] Raouf Boutaba,et al. Survivable Virtual Network Embedding , 2010, 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM).
[2] Raouf Boutaba,et al. Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding , 2010, Networking.
[3] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[4] Robert Ricci,et al. A solver for the network testbed mapping problem , 2003, CCRV.
[5] Ramesh K. Sitaraman,et al. The power of two random choices: a survey of tech-niques and results , 2001 .
[6] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..
[7] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[8] K. K. Ramakrishnan,et al. Measurement based characterization and provisioning of IP VPNs , 2004, IMC '04.
[9] Jonathan S. Turner,et al. Diversifying the Internet , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..
[10] Raouf Boutaba,et al. Virtual Network Embedding with Coordinated Node and Link Mapping , 2009, IEEE INFOCOM 2009.
[11] Mostafa H. Ammar,et al. Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[12] Jean-Yves Le Boudec,et al. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .
[13] Raouf Boutaba,et al. A multi-commodity flow based approach to virtual network resource allocation , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[14] Amit Kumar,et al. Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.
[15] Raouf Boutaba,et al. PolyViNE: policy-based virtual network embedding across multiple domains , 2010, VISA '10.
[16] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[17] Yong Zhu,et al. Algorithms for Assigning Substrate Network Resources to Virtual Network Components , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[18] Chip Elliott,et al. GENI - global environment for network innovations , 2008, LCN.
[19] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[20] Holger Karl,et al. A virtual network mapping algorithm based on subgraph isomorphism detection , 2009, VISA '09.
[21] Raouf Boutaba,et al. A survey of network virtualization , 2010, Comput. Networks.
[22] Mike Hibler,et al. Large-scale Virtualization in the Emulab Network Testbed , 2008, USENIX Annual Technical Conference.
[23] Ulas C. Kozat,et al. Designing and embedding reliable virtual infrastructures , 2011, CCRV.
[24] Lixin Gao,et al. How to lease the internet in your spare time , 2007, CCRV.
[25] Albert G. Greenberg,et al. Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.
[26] Djamal Zeghlache,et al. A Distributed Virtual Network Mapping Algorithm , 2008, 2008 IEEE International Conference on Communications.
[27] Susanne Albers,et al. On the Influence of Lookahead in Competitive Paging Algorithms , 1997, Algorithmica.
[28] Ray Jain,et al. The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.
[29] Scott Shenker,et al. Overcoming the Internet impasse through virtualization , 2005, Computer.
[30] Clifford Stein,et al. Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[31] Jonathan S. Turner,et al. Efficient Mapping of Virtual Networks onto a Shared Substrate , 2006 .
[32] Nick Feamster,et al. In VINI veritas: realistic and controlled network experimentation , 2006, SIGCOMM.
[33] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[34] Edward F. Grove. Online bin packing with lookahead , 1995, SODA '95.
[35] Amit Kumar,et al. Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.
[36] David G. Andersen,et al. Theoretical Approaches to Node Assignment , 2002 .
[37] Susanne Albers,et al. A Competitive Analysis of the List Update Problem with Lookahead , 1994, Theor. Comput. Sci..
[38] Minlan Yu,et al. Rethinking virtual network embedding: substrate support for path splitting and migration , 2008, CCRV.