带跳数限制的抗毁性网络设计  

SURVIVABLE NETWORK DESIGN WITH HOP-CONSTRAIN

作　　者：刘啸林[1,2] 

机构地区：[1]华东师范大学计算机科学技术系 [2]上海证券通信有限责任公司上海200131

出　　处：《计算机应用与软件》2007年第7期138-139,161,共3页Computer Applications and Software

摘　　要：在网络设计中,为了保证网络服务质量,需要对网络节点间的跳数进行限制。同时网络设计还必须考虑一定的抗毁性要求。提出了使用生成树优化算法来求解某些抗毁性网络设计的难题。生成树优化算法较圆满地解决了既有连通度要求又有跳数限制的抗毁性网络设计问题。该算法不仅具有较强的实际应用价值,也对推动抗毁性网络的研究有十分重要的意义。In order to maintain the quality of service, it is necessary to add some hop-constrain between nodes in network. On the other hand, the requirement of connectivity should also be concerned. A spanning tree optimization algorithm is introduced to solve certain survivable network design problem. A better solution to this problem,which satisfies not only the requirement of connectivity, but also the requirement of hop-constrain, is achieved relatively and successfully by using this algorithm. The algorithm is valuable for practical application and research of survivable network design.

关 键 词：抗毁性网络设计 生成树 跳数限制 连通度 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]