一种利用理想拓扑的保护容量分配算法
doi: 10.3724/SP.J.1146.2005.00930
A Protection Capacity Assignment Algorithm Using Ideal Topology
-
摘要: 对于通常的网状网，如何设计最小的保护容量来保证快速恢复是一个富有挑战性的问题。为了解决如何分配更少的保护容量的问题，该文提出了一些理想的拓扑结构，研究了支撑树算法。在这两者的基础上针对一条链路出现故障的问题给出了利用理想拓扑的保护容量分配算法。仿真结果说明该算法能预留比支撑树算法少得多的保护容量。
-
关键词:
- 网状网络;理想拓扑;保护容量;支撑树
Abstract: Supporting fast restoration for general mesh topologies with minimal network over build is a technically challenging problem. In order to solve the problem of assigning minimum protection capacity, some ideal topologies are given and the algorithm of spanning tree construction is analyzed, and then an algorithm based on these is proposed to solve the problem of one link failure. Simulation results testify the new algorithm can reserve much smaller protection capacity compared with algorithm of spanning tree construction. -
[1] Alicherry M and Bhatia R. Pre-provisioning networks to support fast restoration with minimum over-build. IEEE INFOCOM, Hong Kong, 2004, 1: 154-164. [2] Alicherry M, Bhatia R, and Wan Yungchun. Desiging networks with existing traffic to support fast restoration, 7th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems(APPROX), Cambridge, MA, USA, 2004, 3122: 1-12. [3] Kodialam M, Lakshman T V, and Sengupta S. A simple traffic independent scheme for enabling restoration oblivious routing of resilient connections. IEEE INFOCOM, Hong Kong, 2004, 4: 2329-2340. [4] 王公仆，孙全，一种改进的基于构建支撑树的算法. 北京邮电大学学报，2005，28(9): 122-126. Wang Gong-pu and Sun Quan. An improved algorithm based on spanning tree construction. Journal of Beijing University of Posts and Telecommunications, 2005, 28(9): 122-126. [5] Waxman B M. Routing of multipoint connections[J].IEEE J. on Selected Areas in Communications.1988, 6(9):1617-1622 -
计量
- 文章访问数: 2727
- HTML全文浏览量: 50
- PDF下载量: 884
- 被引次数: 0
下载:
