面向SON的QoS重路由机制

doi:10.3969/j.issn.1000-436x.2012.z2.041

通信学报 ›› 2012, Vol. 33 ›› Issue (Z2): 280-289.doi: 10.3969/j.issn.1000-436x.2012.z2.041

面向SON的QoS重路由机制

王珑飞,王兴伟,黄敏

东北大学信息科学与工程学院，辽宁沈阳 110819

出版日期:2012-11-25 发布日期:2017-08-03
基金资助:
国家杰出青年科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;高等学校博士学科点专项科研基金资助项目;高等学校博士学科点专项科研基金资助项目;工信部物联网发展专项资金资助项目;中央高校基本科研业务费专项基金资助项目

QoS rerouting mechanism for SON

Long-fei WANG,Xing-wei WANG,Min HUANG

College of Information Science and Engineering,Northeastern University,Shenyang 110819,China

Online:2012-11-25 Published:2017-08-03
Supported by:
The National Science Foundation for Distinguished Young Scholars of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Specialized Research Fund for The Doctoral Program of Higher Education;The Specialized Research Fund for The Doctoral Program of Higher Education;The Specialized Development Fund for The Internet of Things from The Ministry of Industry and Information Technology of China;The Fundamental Research Funds for The Central Universities

摘要/Abstract

摘要：

随着计算机网络的发展，自组织网络因其具有灵活性、自适应性、顽健性等优点而受到广泛的关注。在OSPFv3协议的基础上，添加了QoS state交互报文，用于建立邻居信息表，进而完成链路上服务质量QoS的信息存储和重路由触发的判断，并引进了节点的休眠、苏醒等生物特性行为。为保证网络状态变化下应用的QoS，采用了混合式重路由机制，针对不同网络失效状况作出相应的处理。仿真实验表明，该路由机制具有良好的性能。

关键词: 自组织网络, OSPFv3, QoS, 重路由

Abstract:

Along with the development of computer network,SON(self-organizing network)has attracted wide attention with its flexibility,adaptability,robustness.On the basis of OSPFv3,the interactive message of QoS state was defined to establish the information table of neighbors,store the link QoS information,judge the triggering of rerouting,and then the biological behaviors,such as hibernation and awakening,were introduced to the routing nodes.A hybrid rerouting mechanism was adopted to make the corresponding treatment under various network failure situations,so that the application QoS support could be provided when the network state was changing.Simulation results show that the proposed mechanism has better performance.

Key words: self-organizing network, OSPFv3, QoS, rerouting

王珑飞,王兴伟,黄敏. 面向SON的QoS重路由机制[J]. 通信学报, 2012, 33(Z2): 280-289.

Long-fei WANG,Xing-wei WANG,Min HUANG. QoS rerouting mechanism for SON[J]. Journal on Communications, 2012, 33(Z2): 280-289.

图/表 13

图1

图2

图3

图4

图5

图6

图7

图8

图9

图10

图11

图12

图13

参考文献 22

[1]	FRIKHA A , LAHOUD S . Performance evaluation of pre-computation algorithms for inter-domain QoS routing[A]. Proceedings of the 2011 18th International Conference on Telecommunications[C]. Ayia Napa,Cyprus, 2011. 327-332.
[2]	DIXIT S , SARMA A . Advances in self-organizing networks[J]. IEEE Communications Magazine, 2005,43(7): 76-77.
[3]	PREHOFER C , BETTSTETTER C . Self-organization in communication networks:principles and design paradigms[J]. IEEE Communications Magazine, 2005,43(7): 78-84.
[4]	DRESSLER F , AKAN O B . Bio-inspired networking:from theory to practice[J]. Communications Magazine IEEE, 2010,48(11): 176-183.
[5]	TENAZINHA N , VINGA S . A survey on methods for modeling and analyzing integrated biological networks[J]. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2011,8(4): 943-958.
[6]	ALDERSON D , WILLINGER W . A contrasting look at self-organization in the Internet and next-generation communication networks[J]. IEEE Communications Magazine, 2005,43(7): 94-100.
[7]	QU Z T , HE P . Self-organization theory and surveillance of network anomalous behaviors[A]. Proceedings of the 2010 2nd International Conference on Advanced Computer Control[C]. Shenyang,China, 2010. 174-178.
[8]	LEE S S W , TSENG P K , LI K Y ,et al. Interface specific fast failure rerouting for load balanced IP networks[A]. Proceedings of the 2011 IEEE Symposium on Computers and Communications[C]. Kerkyra,Greece, 2011. 316-319.
[9]	BASHLLARI A , FUNDO A , NACE D ,et al. A note on a hybrid rerouting scheme[A]. Proceedings of the 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops[C]. Budapest,Hungary, 2011. 1-5.
[10]	LI Y , WANG J P , XU Y . Adaptive intentional connection rerouting for traffic grooming in WDM mesh networks with biological attractor selection[A]. Proceedings of the 2010 16th Asia-Pacific Communications[C]. Auckland,New Zealand, 2011. 83-88.
[11]	SANGHWAN S N , NELAKUDITI S , SANGHWAN L ,et al. Failure insensitive routing for ensuring service availability[J]. Lecture Notes in Computer Science, 2003,(2707): 153-154.
[12]	BANERJEA A . Fault recovery for guaranteed performance communications connections[J]. IEEE/ACM Transactions on Networking, 1999,11(5): 653-668.
[13]	WANG S W . Light path-level active rerouting algorithms in all-optical WDM networks with alternate routing and traffic grooming[A]. Proceedings of the International Conference on Information Networking(ICOIN)[C]. Bali,Indonesia, 2012. 42-46.
[14]	XIE C , XU F , GHANI N ,et al. Load-balancing for advance reservation connection rerouting[J]. IEEE Communications Letters, 2010,14(6): 578-580.
[15]	LAKSHMAN K M . Restorable dynamic quality of service routing[J]. IEEE Communications Magazine, 2002,40(6): 72-81.
[16]	NARVAEZ P , SIU K Y , TZENG H Y . Local restoration algorithm for link-state routing protocol[A]. Proceedings of the 1999 IEEE International Conference on Computer Communications and Networks[C]. Boston,USA, 1999. 352-357.
[17]	FRIGIONI D , MARCHETTI-SPACCAMELA A , NANNI U . Fully dynamic shortest paths in digraphs with arbitrary arc weights[J]. Journal of Algorithms, 2003,49(1): 86-113.
[18]	NARDELLI , PROIETTI , WIDMAYER . Swapping a failing edge of a single soure shortest path tree is good and fast[J]. Algorithmica, 2003,35(1): 57-74.
[19]	FERGUSON D , MOY J . OSPF for IPv6[S].1999. 1999.
[20]	LIU Y , NARASIMHA REDDY A L . A fast rerouting scheme for OSPF/IS-IS networks[A]. Proceedings of the 13th International Conference on Computer Communications and Networks[C]. Chicago,USA, 2004. 47-52.
[21]	ITO H , IWAMA K , OKABE Y ,et al. Single backup table schemes for shortest-path routing[J]. Theoretical Computer Science, 2005,333(3): 347-353.
[22]	KORKMAZ T , KRUNZ M . Multi-constrained optimal path selection[A]. Proceedings of the INFOCOM 2001[C]. Anchorage,USA, 2001. 834-843.

面向SON的QoS重路由机制

QoS rerouting mechanism for SON

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 13

参考文献 22

相关文章 15

Metrics

推荐阅读 0

[1]	刘辉, 刘鑫衍, 许艳, 仲红, 王梦. 隐私保护的VANET警告消息发布协议[J]. 通信学报, 2021, 42(8): 120-129.
[2]	谢晓兰, 曾兰英, 翟青海. 制造云服务组合中支持服务关联的QoS感知评估模型[J]. 通信学报, 2021, 42(1): 118-129.
[3]	赵海涛,高士顺,王海军,雍婷,魏急波. 无人机自主通信和组网能力评估方法[J]. 通信学报, 2020, 41(8): 87-98.
[4]	谷志茹,李敏,龙永红,舒小华,荣青. 基于GPCR的车辆自组织网络路由优化方法[J]. 通信学报, 2020, 41(7): 152-164.
[5]	董芳,胡宇翔,李鸥. 基于SDN的自组织网络路由框架及构建方法[J]. 通信学报, 2019, 40(9): 33-44.
[6]	秦丹阳,贾爽,杨松祥,马静雅,张岩,丁群. 基于信任感知的无线传感器网络安全路由机制研究[J]. 通信学报, 2017, 38(10): 60-70.
[7]	宋彩霞,谭国真,丁男,步俊凌,张福新,刘明剑. 面向应用的车载自组织网络跨层多信道MAC协议[J]. 通信学报, 2016, 37(5): 95-105.
[8]	黄家玮,钟少华,刘联海,王建新. 车载自组网中基于车辆密度的多跳广播协议[J]. 通信学报, 2016, 37(12): 32-41.
[9]	杨力,孙晶,潘成胜,邹启杰. 基于多目标决策的LEO卫星网络多业务路由算法[J]. 通信学报, 2016, 37(10): 25-32.
[10]	陈蕾,杨庚,陈正宇,肖甫,许建. 基于结构化噪声矩阵补全的Web服务QoS预测[J]. 通信学报, 2015, 36(6): 49-59.
[11]	郭显，冯涛，曹来成，王晶，鲁晔. 基于Yaksha密钥托管机制的命名数据网络内容发布/订阅系统[J]. 通信学报, 2015, 36(11): 127-135.
[12]	梁根,俞鹤伟,孙立民,秦勇. 支持QoS的多链路最少变换动态带宽分配算法[J]. 通信学报, 2015, 36(1): 48-56.
[13]	石峻岭,王兴伟,黄敏. 多粒度传送网绿色单播路由保护机制[J]. 通信学报, 2014, 35(Z1): 113-117.
[14]	张金宏,王兴伟,黄敏. 面向绿色互联网的低功耗多播路由算法[J]. 通信学报, 2014, 35(Z1): 134-140.
[15]	石峻岭，王兴伟，黄敏. 多粒度传送网绿色单播路由保护机制[J]. 通信学报, 2014, 35(Z1): 22-117.