Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 175

The DOI matches its Crossref record.

Failure location algorithm for transparent optical networks

Mas, C., Tomkos, I., Tonguz, O.K. · 2005 · IEEE Journal on Selected Areas in Communications

Abstract

Fault and attack management has become a very important issue for network operators that are interested to offer a secure and resilient network capable to prevent and localize, as accurately as possible, any failure (fault or attack) that may occur. Hence, an efficient failure location method is needed. To locate failures in opaque optical networks, existing methods which allow monitoring of the optical signal at every regeneration site can be used. However, to the best of our knowledge, no method exists today that performs failure location for transparent optical networks. Such networks are more vulnerable to failures than opaque networks since failures propagate without being isolated due to optoelectronic conversions. In this paper, we present a failure location algorithm that aims to locate single and multiple failures in transparent optical networks. The failure location algorithm developed in this paper can cope with ideal scenarios (i.e., no false and/or lost alarms), as well as with nonideal scenarios having false and/or lost alarms.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jsac.2005.852182

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 175

Metadata

Authors
Mas, C., Tomkos, I., & Tonguz, O. K.
Venue
IEEE Journal on Selected Areas in Communications
Published
2005-08
Volume
23
Issue
8
Pages
1508-1519
ISSN
0733-8716 (ISSN-L)
OpenAlex
W2117254270
Cited by
175
References
0
FWCI
7.31
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Failure location algorithm for transparent optical networks. https://app.cochat.ai/papers/10.1109/jsac.2005.852182
The paper
Mas, C., Tomkos, I., & Tonguz, O. K. (2005). Failure location algorithm for transparent optical networks. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2005.852182

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.