版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:AT&T Bell Labs Holmdel NJ 07733 USA
出 版 物:《IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS》 (IEEE Trans Syst Man Cybern Pt A Syst Humans)
年 卷 期:1998年第28卷第6期
页 面:780-790页
核心收录:
主 题:algorithms integer programming math programming networks SONET
摘 要:Service restoration and survivability have become increasingly important in telecommunications network planning with the introduction of fiber optic, high speed networks, Recent technological advances, such as synchronous optical network (SONET) technology, promotes the use of interconnected rings in designing reliable networks. We describe a heuristic approach for designing networks comprised of interconnected rings, Our approach is particularly attractive for relatively sparse networks in which the set of all cycles (constituting the potential rings) can be determined at a reasonable computational effort. Most telecommunications networks would fall into this category. Given a set of nodes, with demand among all possible node-pairs, and a set of available links that connect the nodes (e.g., existing fiber links), the problem is to select an optimal subset of rings, utilizing only allowable links, such that each node is included in at least one ring and each ring is connected to at least one other ring at two or more nodes, Such a multiple ring network will ensure instantaneous restoration of service in case of a single link or single node failure. In our solution approach, we first generate a large set of candidate rings and approximate the cost of each ring based on the nodes that are served by the ring and based on the demands. We then apply a set covering algorithm that selects a (minimum cost) subset of the candidate rings such that each node is included on at least one ring. Finally, we select a few additional rings in order to achieve the required connectivity among the rings. me present computational results for realistic-size (e.g., 500 nodes) telecommunication networks.