文章詳目資料

資訊電子學刊

  • 加入收藏
  • 下載文章
篇名 A Cost-effective Minimum Cycle Cover Algorithm in Optical Networks with Automatic Protection Switching
卷期 2:2
作者 I-Shyan HwangZen-Der ShyuFei-Hung Lin
頁次 007-013
關鍵字 MCC AlgorithmDCC AlgorithmAPS
出刊日期 200803

中文摘要

英文摘要

This paper proposes a cost-effective Minimum Cycle Cover (MCC) algorithm derived from Double Cycle Cover (DCC) algorithm for performing Automatic Protection Switching (APS) in optical networks. The architecture in the proposed MCC is each link between two APSs has only a pair of fibers, instead of two pairs of fibers in the DCC. The MCC is used to find the minimum number of recovery cycles (or termed Minimum recovery cycle) based on cycle architecture of the DCC to cover all the links in the planar networks. The MCC algorithm inherits many advantages of the DCC, for example fast, distributed and autonomous, and tolerates multiple failures, but with half the physical cost of the DCC. The simulation results show the MCC has slight higher than the DCC for the restoration time and non-restoration ratio, however, the MCC has better cost-efficiency than the DCC for USANET and Icosahedrons networks.

關鍵知識WIKI

相關文獻