Dynamic topology awareness-based reconfigurable service carrying network reconfiguration

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

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

您当前的位置：

首页 >

文章列表页 >

Dynamic topology awareness-based reconfigurable service carrying network reconfiguration

academic paper | 更新时间：2024-06-05

- Dynamic topology awareness-based reconfigurable service carrying network reconfiguration
- Journal on Communications Vol. 37, Issue 2, Pages: 73-80(2016)
- 作者机构：
  
  国家数字交换系统工程技术研究中心，河南郑州，450002
- 作者简介：
- 基金信息：
  
  The National Basic Research Program of China (973 Program)(2012CB315901);The National Basic Research Program of China (973 Program)(2013CB329104);The National Natural Science Foundation of China(61372121);The National High Technology Research and Development Program of China (863 Program)(2013AA013505)
- DOI：10.11959/j.issn.1000-436x.2016032
  CLC： TP393
- Online First：2016-02，
  
  Published：15 February 2016
- 稿件说明：
移动端阅览
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.
DOI：

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. DOI： 10.11959/j.issn.1000-436x.2016032.

摘要

可重构信息通信基础网络通过构建服务承载网的方式为业务提供自适应的承载服务。针对高效利用有限底层资源的问题，提出一种基于资源关键度进行动态映射的服务承载网构建算法。算法将通过节点或链路的最短路径数作为资源关键度的衡量指标，区别对待底层资源；并实时动态感知关键资源的使用状况，依据不同业务需求对服务承载网进行自适应调整。仿真结果表明，算法在构建成功率、收益花费比和资源均衡度等方面均具有良好性能。

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.

关键词

Keywords

references

兰巨龙 , 程东年 , 胡宇翔 . 可重构信息通信基础网络体系研究 [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 .

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 .

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 .

HOUIDI I , LOUATI W , ZEGHLACHE D . A distributed virtual network mapping algorithm [C ] // IEEE ICC . c2008 : 5634 - 5640 .

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 .

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 .

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 .

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 .

LU J , TURNER J . Efficient mapping of virtual networks onto a shared substrate [R ] . Department of Computer Science and Engineering, Washington University , 2006 .

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 .

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 .

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 .

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 .

DIETRICH D , PAPADIMITRIOU P . Policy-compliant virtual network embedding [C ] // International Conference on IFIP . Trondheim , c2014 : 1 - 9 .

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 .

Views

1177

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Survivability model for reconfigurable service carrying network based on the stochastic Petri net

Distributed network management system with load balancing

Related Author

Liang ZHAO

Hong ZOU

Xiao-hui ZHANG

SUN Yan-tao1

YANG Fang-nan1

SHI Zhi-qiang3

Related Institution

National Digital Switching System Engineering and Tech logy Research Center

National CyberspaceSecurity Development InnovationCenter

The School of Computer and Information Technology, Beijing Jiaotong University

Engineering Research Center of High-speed Railway Network Management, Ministry of Education

Multimedia Communication ＆ Network Engineering Research Center, Institute of Software, Chinese Academy of Sciences

AI问答

⁰