基于SimCT的多播路由及故障恢复研究

doi:10.3969/j.issn.1000-0801.2011.12.025

电信科学 ›› 2011, Vol. 27 ›› Issue (12): 90-96.doi: 10.3969/j.issn.1000-0801.2011.12.025

基于SimCT的多播路由及故障恢复研究

孙伟^1,³,罗俊海^2,³,肖志辉³

¹ 西南交通大学信息科学与技术学院成都 610031；
² 电子科技大学电子工程学院成都 611731
³ 迈普通信技术股份有限公司成都 610041

出版日期:2011-12-15 发布日期:2011-12-15
基金资助:
国家自然科学基金资助项目

Research on SimCT-Based Multicast Routing and Fault Recovery

Wei Sun^1,³,Junhai Luo^2,³,Zhihui Xiao³

¹ School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China
² School of Electronic Engineering, University of Electronic Science and Technology, Chengdu 611731, China
³ Maipu Communication Technology Co., Ltd., Chengdu 610041, China

Online:2011-12-15 Published:2011-12-15

摘要/Abstract

摘要：

在数据交换网络中，颜色树是一种通过节点不相交的多路径路由数据报文的有效方法。这种方法中组建两棵以某一节点为根节点的颜色树，即Red 树和Blue 树，网络中各节点到根节点的路径是节点不相交的。本文在分析和研究SimCT 算法的基础上，提出了一种基于颜色树的多播树生成方法及单节点/链路故障的多播通信恢复方案。该方法根据SimCT 算法构造的颜色树来组建一棵多播转发树，在多播树中单节点或单链路故障后，故障检测节点本地执行故障恢复方案，将受影响的故障节点的下游子树重新连接到多播树。仿真实验表明，本文所提出的多播树生成方案相比现有方案可以减少网络资源的浪费，并且故障恢复后的代价与原多播通信树相当。

关键词: SimCT, 颜色树, 多播树, 故障恢复

Abstract:

In packet-switched networks, colored tree is an efficient approach to route packets along node-disjoint multipath. In this approach, two trees, namely Red and Blue tree, are built rooted at one node such that the path from other nodes in the network to the root is node-disjoint. From analysis and research of the SimCT algorithm, we propose a scheme of multicast tree construction and fault recovery in single node/link failure based on colored tree. In this scheme, colored tree is built firstly based on SimCT, then multicast forward tree can be constructed along the colored tree path, and if a single node or single link is failure, fault detected nodes execute the fault recovery scheme by local information, by which the affected nodes in the downstream of failure node/link will be reassembled on the multicast tree. Simulation experiments show that multicast tree construction of our scheme is less overhead compared to the exist methods, and after recovery, the cost of multicast tree is consistent with the former multicast communication tree.

Key words: SimCT, colored tree, multicast tree, fault-recovery

孙伟,罗俊海,肖志辉. 基于SimCT的多播路由及故障恢复研究[J]. 电信科学, 2011, 27(12): 90-96.

Wei Sun,Junhai Luo,Zhihui Xiao. Research on SimCT-Based Multicast Routing and Fault Recovery[J]. Telecommunications Science, 2011, 27(12): 90-96.

图/表 13

表1

图1

图2

图3

图4

图5

图6

图7

图8

图9

图10

图11

图12

参考文献 11

1	Hiltunen M , Schlichting R , Ugarte C . Building survivable services using redundancy and adaptation. IEEE Trans on Cormputers, 2003,52(2): 184～194
2	Wu Jian , Shin K G . SMRP: fast restoration of multicast sessions from persistent failures. In: Proc of the 2005 International Conference on Dependable Systems and Networks（DSN'05）, Yokohama, Japan,2005
3	Feather M S . A risk-centric decision process. In: Proc of Software Engineering for High Assurance Systems （SEHAS）, Portland, Oregon, USA,2003
4	Ramesh B . Survivable Networks: Algorithms for Diverse Routing. Norwell: Kluwer Academic Publishers, 1999
5	Wayne D G . Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. New Jersey: Prentice Hall Publishers, 2003
6	Ramasubramanian S , Krishnamoorthy H , Krunz M . Disjoint multipath routing using colored trees. Computer Networks: The International Journal of Computer and Telecommunications Networking, 2007,51(8)
7	Ramasubramanian S , Harkara M , Krunz M . Linear time distributed construction of colored trees for disjoint multipath routing. Computer Networks: The International Journal of Computer and Telecommunications Networking, 2007,51(10)
8	Jayavelu G , Ramasubramanian S , Younis O . Maintaining colored trees for disjoint multipath routing under node failures. IEEE/ACM Transactions on Networking, 2009,17(1): 346～359
9	Salama H F . Multicast routing for real-time communication of high-speed networks. Raleigh: Department of Electrical and Computer Engineering North Carolina State University, 1996
10	Junhai Luo , Danxia Ye , Xue Liu , et al. A survey of multicast routing protocols for mobile ad hoc networks. IEEE Communications Surveys and Tutorials, 2009,11(1)
11	Shang Wang , Chun He , Yide Zhang , et al. Construction of multicast protection tree based on single node failure. In: 2010 International Conference on Communications and Mobile Computing（cmc'10）, Shenzhen, China, 2010

Cxy	链路x-y的开销
dfs（x）	节点x的DFS序号
p（x）	节点x的DFS路径上的父节点
glpυ（x）	节点x的全局低点值
glpn（x）	节点x的全局低点邻居
glpd（x）	节点x到达低点的最短距离跳数
pot（x）	节点x的势值
l（x）	分配给节点x的层
lfn（x）	节点x的左转发节点
rfn（x）	节点x的右转发节点

[1]	侯乐,汪硕,林毅凯,姚博韬,刘江. 基于SDN的链路故障恢复[J]. 电信科学, 2015, 31(6): 18-23.
[2]	王颖,关璐. 网络虚拟化环境下的故障管理[J]. 电信科学, 2013, 29(8): 44-48.

基于SimCT的多播路由及故障恢复研究

Research on SimCT-Based Multicast Routing and Fault Recovery

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 13

参考文献 11

相关文章 2

Metrics

推荐阅读 0