A Study of Efficient Algorithm for Survivable Network Design with Conduit


The KIPS Transactions:PartC, Vol. 8, No. 5, pp. 629-636, Oct. 2001
10.3745/KIPSTC.2001.8.5.629,   PDF Download:

Abstract

Network is changed from voice-based network into multimedia-based network by development of communication technology and multimedia service. We need a large bandwidth for multimedia service. The optical fiber is a more suitable medium than existing copper-based cable for large bandwidth. But, it is so expensive than copper-based cable. So, Minimizing total cost becomes a more important concept. In order to construct a minimum cost network, we have to consider existing conduits in network. On the other hand, optical fiber network allows that larger amount of traffic can be transmitted than copper-based network does. However, a failure of a node or link can make a serious damage to the network service. Thus, we have to get multiple paths to support continuous service even if a loss of failure occurs in some point of the network. The network survivability problem is to design the network that can provide reliable service to customers anytime with minimum total cost. In an existing solution of the network survivability problem with conduits, a conduit is considered only one time. But, the conduit is reusable if the network satisfies the required survivability. Proposed algorithm can more effectively considered already existed conduit. Network survivability and edge cost is predetermined. The proposed algorithm finds the best solution by conduit sharing within the limits of network survivability. According to the simulation result, the proposed method can decrease 7% of total cost than an existing method by effective conduits adaption.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. K. Kang and C. G. Han, "A Study of Efficient Algorithm for Survivable Network Design with Conduit," The KIPS Transactions:PartC, vol. 8, no. 5, pp. 629-636, 2001. DOI: 10.3745/KIPSTC.2001.8.5.629.

[ACM Style]
Hyo Kwan Kang and Chi Geun Han. 2001. A Study of Efficient Algorithm for Survivable Network Design with Conduit. The KIPS Transactions:PartC, 8, 5, (2001), 629-636. DOI: 10.3745/KIPSTC.2001.8.5.629.