摘要： 网络生存性与网络拓扑结构密切相关。该文从拓扑信息与通信传输网络的区别和联系出发，分析拓扑图论与网络生存性的关系，介绍拓扑图论算法在网络修复中的实际应用，对基于网络分割的故障修复算法、基于拓扑结构的修复路径选择算法、用于链路故障保护的P-Cycle算法等进行比较，研究和探讨了目前网络修复中亟待解决的问题。

关键词: 网络修复, 网络分割, 路径修复

Abstract: Network failures may result in an immediate feedback to the network topology. There’s a close relationship between network restoration and the network topology. This paper analyzes the relationship between topo-information and the network survivability. Some existing classifications for network restoration are discussed. The arithmetic on topological graph theory applied in network restoration is proposed. This paper introduces and analyzes three types of arithmetic based on network topology: network partition arithmetic; restore path selecting arithmetic; P-Cycle arithmetic. The problems urgently to be solved in nowadays’ network restoration are analyzed.

Key words: network restoration, network partition, path restoration

中图分类号: 

• TP393