基于拓扑感知的可重构服务承载网动态重构算法

doi:10.11959/j.issn.1000-436x.2016032

Journal on Communications ›› 2016, Vol. 37 ›› Issue (2): 73-80.doi: 10.11959/j.issn.1000-436x.2016032

• academic paper • Previous Articles Next Articles

Dynamic topology awareness-based reconfigurable service carrying network reconfiguration

Ning-ning LIANG,Ju-long LAN,Zhen ZHANG

National Digital Switching System Engineering ＆ Technological Research Center, Zhengzhou 450002,China

Online:2016-02-26 Published:2016-02-26
Supported by:
The National Basic Research Program of China (973 Program);The National Basic Research Program of China (973 Program);The National Natural Science Foundation of China;The National High Technology Research and Development Program of China

Abstract

Abstract:

Reconfigurable information communication basal network supports self-adaptive services to applications by constructing reconfigurable service carrying network(RSCN). To effectively utilize the limited substrate network resources, an algorithm of dynamic topology awareness-based RSCN reconfiguration (DTAR)was proposed. The algorithm uses the number of shortest paths as resource critical degree which across the node or link to distinguish substrate resource. And it also dynamically awares the states of critical resources, reoptimises the RSCN according to service request. Experimental results show that comparing with the existing algorithms, the sed algorithm achieves higher success ratio, gains higher revenue, cost ratio and load equilibrium for substrate network.

Key words: topology awareness, critical resource, dynamic embedding, reconfigurable service carrying network

Ning-ning LIANG,Ju-long LAN,Zhen ZHANG. Dynamic topology awareness-based reconfigurable service carrying network reconfiguration[J]. Journal on Communications, 2016, 37(2): 73-80.

Figures/Tables 6

References 15

[1]	兰巨龙, 程东年, 胡宇翔 . 可重构信息通信基础网络体系研究[J]. 通信学报, 2014, 35(1): 187-198. LAN J L , CHENG D N , HU Y X . Research on reconfigurable information communication basal network architecture[J]. Journal on Communications, 2014, 35(1): 187-198.
[2]	YU M , YI Y , REXFORD J , et al. Rethinking virtual network embedding: substrate support for path splitting and migrati[J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 17-29.
[3]	CHOWDHURY N , RAHMAN M , BOUTABA R . Virtual network embedding with coordinated node and link mapping[C]// IEEE INFOCOM. Rio de Janeiro. Rio de Janeiro, c2009: 783-791.
[4]	HOUIDI I , LOUATI W , ZEGHLACHE D . A distributed virtual network mapping algorithm[C]// IEEE ICC. c2008: 5634-5640.
[5]	ZHU Y , AMMAR M . Algorithms for assigning substrate network resources to virtual network components[C]// 25th IEEE International Conference on Computer Communications (INFOCOM). Barcelona, c2006: 1-12.
[6]	LISHKA J , KARL H . A virtual network mapping algorithm based on subgraph isomorphism detection[C]// The 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures. Barcelona, c2009: 81-88.
[7]	KOIZUMI Y , ARAKAWA S , KAMAMURA S , et al. Adaptability f virtual network topology control based on attractor se tion against multiple Node Failures[C]// OptoElectronics and Communications Conference held jointly with 2013 International Conference on Photonics in Switching (OECC/PS). Kyoto, c2013: 1-2.
[8]	BAVIER A , FEAMSTER N , HUANG M , et al. In VINI veritas: realistic and controlled network experimentation[J]. ACM SIGCOMM Computer Communication Review, 2006, 36(4): 3-14.
[9]	LU J , TURNER J . Efficient mapping of virtual networks onto a shared substrate[R]. Department of Computer Science and Engineering, Washington University, 2006.
[10]	CHENG X , SU S , ZHANG Z , et al. Virtual network embeddi g through topology-aware node ranking[J]. ACM SIGCOMM Computer Communication Review, 2011, 41(2): 39-47.
[11]	YUAN Y , WANG C , ZHU N , et al. Virtual network embedding algorithm based connective degree and comprehensive capacity[C]// 9th International Conference on ICIC 2013. Nanjing, c2013: 250-258.
[12]	ZHANG S , QIAN Z H , WU J , et al. Virtual network embedding with opportunistic resource sharing[J]. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(3): 816-827.
[13]	HU Q , WANG Y , CAO X J , et al. Virtual network embedding: an optimal decomposition approach[C]// International Conference on Computer Communication and Networks (ICCCN). Shanghai, c2014: 1-6.
[14]	DIETRICH D , PAPADIMITRIOU P . Policy-compliant virtual network embedding[C]// International Conference on IFIP. Trondheim, c2014: 1-9.
[15]	MELO M , SARGENTO S , KILLAT U , et al. Optimal virtual network embedding: node-link formulation[J]. IEEE Transactions on Network and Service Management, 2013, 10(4): 356-368.

Metrics

Recommended 0

No Suggested Reading articles found!

Dynamic topology awareness-based reconfigurable service carrying network reconfiguration

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 6

References 15

Related Articles 2

Metrics

Recommended 0

[1]	Liang ZHAO,Hong ZOU,Xiao-hui ZHANG. Survivability model for reconfigurable service carrying network based on the stochastic Petri net [J]. Journal on Communications, 2016, 37(3): 71-78.
[2]	Yan-tao SUN,Fang-nan YANG,Zhi-qiang SHI. Distributed network management system with load balancing [J]. Journal on Communications, 2009, 30(3): 34-41.