File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: M 2-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networks

TitleM 2-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networks
Authors
KeywordsAll-Optical Networks (Aons)
Cycle Cover
Fast Link Failure Detection
Monitoring-Cycle (M-Cycle)
Issue Date2011
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comnet
Citation
Computer Networks, 2011, v. 55 n. 3, p. 748-758 How to Cite?
AbstractTo 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. © 2010 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/155603
ISSN
2015 Impact Factor: 1.446
2015 SCImago Journal Rankings: 0.755
ISI Accession Number ID
Funding AgencyGrant Number
Hong Kong Research Grants Council EarmarkedHKU 7032/01E
NSERC (Natural Sciences and Engineering Research, Council of Canada)
Funding Information:

This work was supported by Hong Kong Research Grants Council Earmarked, Grant HKU 7032/01E, and NSERC (Natural Sciences and Engineering Research, Council of Canada) PDF grant.

References
Grants

 

DC FieldValueLanguage
dc.contributor.authorWu, Ben_US
dc.contributor.authorYeung, KLen_US
dc.contributor.authorHu, Ben_US
dc.contributor.authorHo, PHen_US
dc.date.accessioned2012-08-08T08:34:19Z-
dc.date.available2012-08-08T08:34:19Z-
dc.date.issued2011en_US
dc.identifier.citationComputer Networks, 2011, v. 55 n. 3, p. 748-758en_US
dc.identifier.issn1389-1286en_US
dc.identifier.urihttp://hdl.handle.net/10722/155603-
dc.description.abstractTo 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. © 2010 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/comneten_US
dc.relation.ispartofComputer Networksen_US
dc.subjectAll-Optical Networks (Aons)en_US
dc.subjectCycle Coveren_US
dc.subjectFast Link Failure Detectionen_US
dc.subjectMonitoring-Cycle (M-Cycle)en_US
dc.titleM 2-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networksen_US
dc.typeArticleen_US
dc.identifier.emailYeung, KL:kyeung@eee.hku.hken_US
dc.identifier.authorityYeung, KL=rp00204en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.comnet.2010.10.012en_US
dc.identifier.scopuseid_2-s2.0-79951517167en_US
dc.identifier.hkuros210599-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79951517167&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume55en_US
dc.identifier.issue3en_US
dc.identifier.spage748en_US
dc.identifier.epage758en_US
dc.identifier.isiWOS:000288357900017-
dc.publisher.placeNetherlandsen_US
dc.relation.projectRouting and wavelength assignment for all-optical WDM networks-
dc.identifier.scopusauthoridWu, B=35231472500en_US
dc.identifier.scopusauthoridYeung, KL=7202424908en_US
dc.identifier.scopusauthoridHu, B=36617158500en_US
dc.identifier.scopusauthoridHo, PH=7402211578en_US
dc.identifier.citeulike8071457-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats