A Study of Efficient Spare Capacity Planning Scheme in Mesh-Based Survivable Fiber-Optic Networks


The KIPS Transactions:PartC, Vol. 10, No. 5, pp. 635-640, Oct. 2003
10.3745/KIPSTC.2003.10.5.635,   PDF Download:

Abstract

Due to the development of information technology and widespread use of telecommunications networks, the design of mesh-survivable networks has received considerable attention in recent years. This paper deals with spare capacity planning scheme in mesh-based fiber-optic networks. In this study, a new spare capacity planning scheme is proposed utilizing path restoration with maximal sharing of share capacity that is traced by the spare capacity incremental factor (after this, we called "SCIF"). We compare it with three other spare capacity planning scheme : link capacity of IP (Integer Programming), SLPA (Spare Link Placement Algorithm) and GA (Genetic Algorithm). The approach shows better performance with heuristics algorithm for determining the spare capacity assignment and the computational time is easily controlled allowing the approach to scale to large networks. The major advantages of the new approach are reduction of spare capacity and a polynomial time complexity.


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]
B. H. Bin and K. B. Gi, "A Study of Efficient Spare Capacity Planning Scheme in Mesh-Based Survivable Fiber-Optic Networks," The KIPS Transactions:PartC, vol. 10, no. 5, pp. 635-640, 2003. DOI: 10.3745/KIPSTC.2003.10.5.635.

[ACM Style]
Bang Hyeong Bin and Kim Byeong Gi. 2003. A Study of Efficient Spare Capacity Planning Scheme in Mesh-Based Survivable Fiber-Optic Networks. The KIPS Transactions:PartC, 10, 5, (2003), 635-640. DOI: 10.3745/KIPSTC.2003.10.5.635.