Proceedings of 2005 7th International Conference Transparent Optical Networks, 2005.
DOI: 10.1109/icton.2005.1505837
|View full text |Cite
|
Sign up to set email alerts
|

Optimal monitor placement scheme for single fault detection in optical network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…I have proposed a greedy algorithm which determines the optimal number of monitors from the set of monitors in such a way that failures(disruptions) can be located for all components (i.e., for a node or a link) distinctly and no component (i.e., a node or a link) remains unattended i.e., if a fault(disruption) occurs in a component it must not remain undetected. The algorithm is described below [3). We explain this algorithm using Table II. In Table II, '1' denotes that if a node fails(is attacked) the monitor with '1' triggers an alarm.…”
Section: B Fault(attack) Monitoring: Monitors Placement With Dynamicmentioning
confidence: 99%
See 2 more Smart Citations
“…I have proposed a greedy algorithm which determines the optimal number of monitors from the set of monitors in such a way that failures(disruptions) can be located for all components (i.e., for a node or a link) distinctly and no component (i.e., a node or a link) remains unattended i.e., if a fault(disruption) occurs in a component it must not remain undetected. The algorithm is described below [3). We explain this algorithm using Table II. In Table II, '1' denotes that if a node fails(is attacked) the monitor with '1' triggers an alarm.…”
Section: B Fault(attack) Monitoring: Monitors Placement With Dynamicmentioning
confidence: 99%
“…In [2] Stanic et al used approximation method to reduce the number of monitors and thus make the system cost effective. Another approximation algorithm was shown in [3] to reduce the number of monitoring elements. In [5] authors showed that the optimal monitor placement (reduction) is an NP hard problem.…”
Section: A Motivation and Contributionmentioning
confidence: 99%
See 1 more Smart Citation
“…We need to identify a network equipment set is minimum) and satisfy the formula 1. Due to leakage alarm problem is a NP problem completely, so the relative to false alarms can be much more difficult to correct [4] , and it should set the monitor alarm threshold to make the number of leakage alarm at the least, in order to reduce the interference in the process of fault location. The algorithm is as follows:…”
Section: Fault Detection and Localization Algorithm In Obs Networkmentioning
confidence: 99%
“…However, the problem of locating multiple faults is nondeterministic-polynomial-time-(NP-) complete [4], which means that the processing time of a fault management system of a large meshed optical network may become an issue. Since the early 1990s, research efforts in managing multiple failures have been focused on reducing the number of monitors [5,6], placing monitoring equipment in optimal locations [6,7], and developing fast localization algorithms [8][9][10][11][12]. Table 2 illustrates the most representative centralized and distributed approaches for fault localization in all-optical networks.…”
Section: Fault Detection and Localization In All-optical Networkmentioning
confidence: 99%