Optimization of Two-stage Coordinated Virtual Network Mapping Algorithm

doi:10.3969/j.issn.1006-2475.2014.02.035

Abstract

Abstract: Virtual network mapping problem is the key problem of virtual network, most of the previous studies focused primarily on link mapping after preselecting the node mapping based on heuristic algorithm. In order to reduce the resource cost and improve the acceptance rate of mapping with substrate resource utilization, this paper proposed an optimized two-stage coordinated algorithm by combing the link splitting and migration. Simulation results show that, this algorithm is of better acceptance ratio and benefit-cost ratio.

Key words: virtual network mapping, node mapping, link mapping, coordinated mapping, link splitting, path migration

CLC Number:

TP393.1

ZHENG Yong-wei, AI Zhong-liang.

Optimization of Two-stage Coordinated Virtual Network Mapping Algorithm

[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2014.02.035.

References 17

[1]	Thomas Anderson, Larry Peterson, Scott Shenker, et a1. Overcoming the Internet impasse through virtualization[J]. Computer, 2005,38(4):34-41.
[2]	Turner J, Taylor D. Diversifying the Internet[C]// Proceedings of the 2005 IEEE GLOBECOM. 2005,2:755-760.
[3]	Bavier A, Feamster N, Huang M, et al. In VINI veritas: Realistic and controlled network experimentation[C]// Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. 2006:3-14.
[4]	Feamster N, Gao L, Rexford J. How to lease the Internet in your spare time[J]. ACM SIGCOMM Computer Communication Review, 2007,37(1):61-64.
[5]	GENI.net. Global Environment for Network Innovations[EB/OL]. http://www.geni.net, 2010-12-22.
[6]	Jay Lepreau. Emulab: Network Emulation Testbed[EB/OL]. http://www.emulab.net, 2006-12-22.
[7]	The DETER Project. The DETER Testbed: Overview[DB/OL]. http://www.isi.edu/deter/docs/testbed.overview.pdf, 2004-08-25.
[8]	Andersen D G. Theoretical Approaches to Node Assignment[DB/OL]. http://www.cs.cmu.edu/~dga/papers/andersen-assign-abstract.html, 2002-12-01.
[9]	Duffield N G, Goyal P, Greenberg A, et al. Resource management with hoses: Point-to-cloud services for virtual private networks[J]. IEEE/ACM Transactions on Networking, 2002,10(5):679-692.
[10]	Ricci R, Alfeld C, Lepreau J. A solver for the network testbed mapping problem[J]. ACM SIGCOMM Computer Communication Review, 2003,33(2):65-81.
[11]	Lu J, Turner J. Efficient Mapping of Virtual Networks onto a Shared Substrate[R]. Washington University, 2006.
[12]	Zhu Y, Ammar M. Algorithms for assigning substrate network resources to virtual network components[C]// Proceedings of the 25th IEEE International Conference on Computer Communications. 2006,6:2812-2823.
[13]	Fan J, Ammar M. Dynamic topology configuration in service overlay networks: A study of reconfiguration policies[C]// Proceedings of the 25th IEEE International Conference on Computer Communications. 2006,2:641-652.
[14]	Chowdhury M, Samuel F, Boutaba R. PolyViNe: Policy-based virtual network embedding across multiple domains[C]// Proceedings of the 2nd ACM SIGCOMM Workshop on Virtualized Infrastructure Systems and Architectures. 2010:49-56.
[15]	Yu M, Yi Y, Rexford J, et al. Rethinking virtual network embedding: Substrate support for path splitting and migration[J]. ACM SIGCOMM Computer Communication Review, 2008,38(2):17-29.
[16]	Butt N F, Chowdhury M, Boutaba R. Topology-awareness and reoptimization mechanism for virtual network embedding[C]// Proceedings of the 9th IFIP TC 6 International Conference on Networking. 2010:27-39.
[17]	Chowdhury M, Rahman M R, Boutaba R. Virtual network embedding with coordinated node and link mapping[C]// Proceedings of the 28th IEEE International Conference on Computer Communications. 2009:783-791.