期刊
COMPUTER NETWORKS
卷 55, 期 3, 页码 748-758出版社
ELSEVIER
DOI: 10.1016/j.comnet.2010.10.012
关键词
All-optical networks (AONs); Cycle cover; Fast link failure detection; Monitoring-cycle (m-cycle)
类别
资金
- Hong Kong Research Grants Council Earmarked [HKU 7032/01E]
- NSERC (Natural Sciences and Engineering Research, Council of Canada)
To achieve fast link failure detection in all-optical networks, monitoring-cycles (m-cycles) are introduced at the optical layer to reduce the number of required monitoring devices (or monitors). Each m-cycle is equipped with a monitor and a pair of optical transceivers to transmit an optical supervisory signal. A set of m-cycles can be found to form a cycle cover of the network. If a link fails, optical supervisory signals inside the m-cycles passing through this link will be disrupted, and the corresponding monitors will alarm due to Loss of Light (LoL). This gives an alarm code to localize the failed link. The accuracy of the failure localization is measured by localization degree, and the amount of monitoring resources required is measured by the number of cycles/monitors, cover length, and monitoring wavelength requirement. The best known m-cycle construction algorithm HST [11] adopts a spanning tree-based approach. In this paper, we propose a new algorithm M-2-CYCLE to construct a cycle cover consisting of a set of minimum-length m-cycles (or m(2)-cycles). We prove that M-2-CYCLE achieves the same localization degree as the spanning tree-based approach, but requires less amount of monitoring resources no matter how the spanning tree is generated. Numerical results confirm our theoretical analysis, and show that the monitoring resources required by M-2-CYCLE are dramatically cut down. (C) 2010 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据