Cost-minimizing construction of a unidirectional SHR with diverse protection

The widespread use of SONET technology makes the self-healing ring (SHR) architecture the most basic building-block in designing a large fiber-optic network which is not only survivable but also cost-effective. We address the design problem of placing a single SONET unidirectional ring with a single...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 1996-12, Vol.4 (6), p.921-928
Main Authors: CHUNG, S.-H, KIM, H.-G, YOON, Y.-S, TCHA, D.-W
Format: Article
Language:English
Subjects:
Applied sciences
Costs
Exact sciences and technology
Laboratories
Linear programming
Optical fiber cables
Optical fiber communication
Optical fiber networks
Organization and planning of networks (techniques and equipments)
Protection
SONET
Systems, networks and services of telecommunications
Telecommunication traffic
Telecommunications
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The widespread use of SONET technology makes the self-healing ring (SHR) architecture the most basic building-block in designing a large fiber-optic network which is not only survivable but also cost-effective. We address the design problem of placing a single SONET unidirectional ring with a single gateway hub in a region administered by a community of interest. Introduced for the purpose of further cost-saving in our problem setting is the flexibility that some offices, instead of being included in the ring, can be homed to the ring via two arc-disjoint paths. Given the set of offices and potential arcs, the objective is then to determine at the minimum total cost both the ring location and the homing to the ring of its nonmember nodes. We formulate the problem as a mixed integer programming model and develop an efficient solution procedure by devising six improvement heuristics. Extensive computational experiments are conducted with input data instances selected from the data ranges of the real-world environments. The practical value of the solution procedure for network planners is well evidenced by its excellent and consistent performance of quickly generated good-quality solutions over various input data instances.
ISSN:1063-6692
1558-2566
DOI:10.1109/90.556362