面向SON的QoS重路由机制

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

Abstract

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

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

Figures/Tables 13

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

QoS rerouting mechanism for SON

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 13

References 22

Related Articles 15

Metrics

Recommended 0

[1]	Jun’e LI, Qiuyu LU, Jian LIU, Kai YUAN, Wei TIAN, Bijun PENG. Communication service priority in smart substation and its queue scheduling method [J]. Journal on Communications, 2021, 42(7): 25-40.
[2]	Shuo WANG, Yudong HUANG, Tao HUANG, Ru HUO, Yunjie LIU. Software-defined cross-domain scheduling mechanism for time-sensitive networking [J]. Journal on Communications, 2021, 42(10): 1-9.
[3]	Xiaolan XIE, Lanying ZENG, Qinghai ZHAI. QoS aware evaluation model supporting service correlation in manufacturing cloud service composition [J]. Journal on Communications, 2021, 42(1): 118-129.
[4]	Haitao ZHAO,Shishun GAO,Haijun WANG,Ting YONG,Jibo WEI. Evaluation method for autonomous communication and networking capability of UAV [J]. Journal on Communications, 2020, 41(8): 87-98.
[5]	Yi LU,Mengying XU,Jie ZHOU. Multi-constraints QoS routing optimization based on improved immune clonal shuffled frog leaping algorithm [J]. Journal on Communications, 2020, 41(5): 141-149.
[6]	Liang CHEN,Jun WANG,Rong CHEN,Xiang GU,Jin WANG,Jie WAN. Research on video streaming media cooperative downloading in vehicular ad hoc network [J]. Journal on Communications, 2019, 40(1): 51-63.
[7]	Zhi-yuan ZHAO,Xiang-ru MENG,Yu-ze SU,Zhen-tao LI. Virtual SDN embedding with differentiated QoS under multiple controller [J]. Journal on Communications, 2017, 38(8): 101-110.
[8]	Zhi SUN,Ming CHEN. PriQoS:priority-differentiated flow control mechanism based on SDN [J]. Journal on Communications, 2017, 38(2): 115-124.
[9]	Dan-yang QIN,Shuang JIA,Song-xiang YANG,Jing-ya MA,Yan ZHANG,Qun DING. Research on trust sensing based secure routing mechanism for wireless sensor network [J]. Journal on Communications, 2017, 38(10): 60-70.
[10]	Li YANG,Jing SUN,Cheng-sheng PAN,Qi-jie ZOU. LEO multi-service routing algorithm based on multi-objective decision making [J]. Journal on Communications, 2016, 37(10): 25-32.
[11]	Lei CHEN,Geng YANG,Zheng-yu CHEN,Fu XIAO,Jian XU. Web services QoS prediction via matrix completion with structural noise [J]. Journal on Communications, 2015, 36(6): 49-59.
[12]	IANGGen L,UHe-wei Y,UNLi-min S,INYong Q. Multi-link minimum change dynamic bandwidth allocation algorithm with QoS support [J]. Journal on Communications, 2015, 36(1): 48-56.
[13]	. Mechanism for green unicast routing protection in multi-granularity transport networks [J]. Journal on Communications, 2014, 35(Z1): 22-117.
[14]	. Low-power multicast routing algorithm in green Internet [J]. Journal on Communications, 2014, 35(Z1): 26-140.
[15]	Jun-ling SHI,Xing-wei WANG,Min HUANG. Mechanism for green unicast routing protection in multi-granularity transport networks [J]. Journal on Communications, 2014, 35(Z1): 113-117.