基于成本约束的虚拟网映射策略及竞争分析

doi:10.3969/j.issn.1000-0801.2016.02.007

Abstract

Abstract:

The approximation algorithm of single virtual network mapping solution aimed to minimize the mapping cost based on convex quadratic programming relaxation was designed. Then aiming for dynamic arrival construction request of the single virtual network，the mapping scheme was achieved based on physical network resource pricing strategy by shadow price，applying above-mentioned approximation algorithm. And then completed the competitive algorithm design based on virtual network admission control strategy by mapping cost constraint and provided the competitive analysis of this algorithm. Experiment results show that the proposed algorithm increases the effective utilization of physical network resources，hence it can improve the virtual network construction request acceptance ratio and the long-term profit of physical network service provider.

Key words: virtual network mapping, mapping cost, convex quadratic programming relaxation, admission control, competitive algorithm

Jianjun YU,Chunming WU. Virtual network mapping strategy and competitive analysis based on cost constraint[J]. Telecommunications Science, 2016, 32(2): 47-54.

Figures/Tables 3

References 18

[1]	FISCHER A ， BOTERO J F ， BECK M T ， et al. Virtual network embedding：a survey[J]. IEEE Communications Surveys and Tutorials， 2013，15（4）： 1888-1906.
[2]	YU M ， YI Y ， REXFORD J ， et al. Rethinking virtual network embedding：substrate support for path splitting and migration[J]. ACM SIGCOMM on Computer Communication Review， 2008，38（2）： 17-29.
[3]	EVEN G ， MEDINA M ， SCHAFFRATH G ， et al. Competitive and deterministic embeddings of virtual networks[J]. Theoretical Computer Science， 2013（496）： 184-194.
[4]	李文，吴春明，陈健，等. 物理节点可重复映射的虚拟网映射算法[J]. 电子与信息学报， 2011，33（4）： 908-914. LI W ， WU C M ， CHEN J ， et al. Virtual network mapping algorithm with repeatable mapping over substrate nodes[J]. Journal of Electronics＆Information Technology， 2011，33（4）： 908-914.
[5]	余建军，吴春明 . 支持接入控制的虚拟网映射近似算法[J]. 电子与信息学报， 2014，36（5）： 1235-1241. YU J J ， WU C M . Virtual network mapping approximation algorithm with admission control[J]. Journal of Electronics ＆Information Technology， 2014，36（5）： 1235-1241.
[6]	CHOWDHURY M ， RAHMAN M R ， BOUTABA R ， . ViNEYard：virtual network embedding algorithms with coordinated node and link mapping[J]. IEEE/ACM Transactions on Networking， 2012，20（1）： 206-219.
[7]	李小玲，郭长国，李小勇，等. 一种基于约束优化的虚拟网络映射方法[J]. 计算机研究与发展， 2012，48（9）： 1601-1610. LI X L ， GUO C G ， LI X Y ， et al. A constraint optimization based mapping method for virtual network[J]. Journal of Computer Research and Development， 2012，48（9）： 1601-1610.
[8]	NONDE L ， EL-GORASHI T E H ， ELMIRGHANI J M H . Energy efficient virtual network embedding for cloud networks[J]. Journal of Lightwave Technology， 2014，33（9）： 1.
[9]	JENS L ， HOLGER K ， YU F R . A virtual network mapping algorithm based on subgraph isomorphism detection[C]// The 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures， August 17， 2009， Barcelona，Spain. New York： ACM Press， 2009： 81-88.
[10]	HU Q ， WANG Y ， CAO X . Resolve the virtual network embedding problem：a column generation approach[C]// The IEEE Conference on Computer Communications， April 14-19， 2013， Turin，Italy. New Jersey： IEEE Press， 2013： 410-414.
[11]	BOTERO J F ， HESSELBACH X ， DUELLI M ， et al. Energy efficient virtual network embedding[J]. IEEE Communications Letters， 2012，16（5）： 756-759.
[12]	ZHAO J Z ， SUBRAMANIAM S ， BRANDT-PEARCE M . Virtual topology mapping in elastic optical[C]// The IEEE International Conference on Communications（ICC）， June 9-13， 2013， Budapest，Hungary. New Jersey： IEEE Press， 2013： 3904-3908.
[13]	李铭夫，毕经平，李忠诚 . 资源调度等待开销感知的虚拟机整合[J]. 软件学报， 2014，25（7）： 1388-1402. LI M F ， BI J P ， LI Z C ， . Resource-scheduling-waiting-aware virtual machine consolidation[J]. Journal of Software， 2014，25（7）： 1388-1401.
[14]	余恕莲，吴革 . 企业成本理论与方法研究[M]. 北京：中国社会科学出版社， 2010： 32-44. YU S L ， WU G . A Study on Enterprise Cost Theory and Its Methods[M]. Beijing： China Social Sciences Press， 2010： 32-44.
[15]	KLEINBERG J M . Approximation Algorithms for Disjoint Paths Problems[M]. Cambridge：Massachusetts Institute of Technology， 1996： 11-12.
[16]	KUSIAK A ， FINKE G . Selection of process plans in automated manufacturing systems[J]. IEEE Journal of Robotics and Automation， 1988，4（4）： 397-402.
[17]	岑燕斌，韦煜，罗会亮 . 快速判断一类实对称矩阵正定的极大极小元方法[J]. 北京交通大学学报， 2011，35（6）： 140-143. CEN Y B ， WEI Y ， LUO H L . Max and mini-elements method：a rapid determination of one class rear symmetric positive definite matrices[J]. Journal of Beijing Jiaotong University， 2011，35（6）： 140-143.
[18]	MONTEIRO R D C ， ADLERIRO I . Interior path following primal-dual algorithms[J]. Mathematical Programming， 1989，44（1）： 43-66.

Metrics

Recommended 0

No Suggested Reading articles found!

算法	节点平均利用率	链路平均利用率	节点利用率方差	链路利用率方差
NodeRep	0.621	0.255	0.278	0.324
VNM_PDA	0.689	0.307	0.112	0.154

Virtual network mapping strategy and competitive analysis based on cost constraint

RichHTML

PDF下载

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 3

References 18

Related Articles 5

Metrics

Recommended 0

[1]	Jiang ZHU,Qingmin DU,Shaowei BA. Joint optimization of power and channel access in cognitive radio network [J]. Telecommunications Science, 2017, 33(2): 55-65.
[2]	Yongbing Fan,Tian Chen,Nan Chen,Zhilan Huang,Cui'e Lv. Research on Virtual Machine Placement in Cloud Data Center [J]. Telecommunications Science, 2015, 31(2): 140-146.
[3]	Jihong Zhao,Haifang Han,Hua Qu. Call Admission Control Based on Resource Sharing in LTE-Advanced Relay System [J]. Telecommunications Science, 2014, 30(2): 60-64.
[4]	Sheng Huang,Chuanchuan Wu,Xiaofei Yang,Hui Wang,Wei Zhang. A Virtual Network Mapping Algorithm Based on Approaching Principle [J]. Telecommunications Science, 2013, 29(12): 38-44.
[5]	Haitao Wang. Investigation on Heterogeneous Network Interconnection Issues and Implementation Schemes in Emergency Communication Network [J]. Telecommunications Science, 2011, 27(3): 65-70.