Bi-directional self-healing ring network planning

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we study the network planning problem of bi-directional self-healing ring (BSHR), which is a network structure providing higher survivability when there is a failure on link or node. Given a network with nodes, links, and demand pairs, our target is to design an optimal network comprising rings, which use only the existing links to satisfy all demands. The objective is to minimize the total amount of equipment (add/drop multiplexer) on nodes, thus reducing the major cost of SHR structure. We propose two integer programming models. For larger networks, we have developed an efficient solution procedure based on its hierarchical network structure. Computational results are given to show that the solution procedure is effective in obtaining an optimal or near-optimal solution. The merging of information networking and telecommunication services has created an increasing demand for telecommunication networks of high bandwidth, aiming to exchange ever larger volumes of data in a very short time interval. The self-healing ring (SHR) is a ring network that provides redundant bandwidth in which disrupted services can be automatically restored following network failures. In this paper, we study the network planning problem of bi-directional SHR aiming to minimize the amount of equipment. © 2002 Elsevier Science Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Wen, U. P., Wu, T. L., & Shyur, C. C. (2002). Bi-directional self-healing ring network planning. Computers and Operations Research, 29(12), 1719–1737. https://doi.org/10.1016/S0305-0548(01)00052-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free