Monitoring Trail: A New Paradigm for Fast Link Failure Localization in WDM Mesh Networks

Wu, Bin; Ho, Pin–Han; Yeung, Kwan L.

doi:10.1109/glocom.2008.ecp.519

Cited by 25 publications

(54 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In transparent optical networks, failure localization is a very complicated issue that has been extensively investigated [2]- [12]. Due to the lack of optoelectronic regenerators, the impact of a failure propagates without electronic boundary, and a single failure can trigger a large number of redundant alarms [12], [13].…”

Section: Introductionmentioning

confidence: 99%

“…Due to the lack of optoelectronic regenerators, the impact of a failure propagates without electronic boundary, and a single failure can trigger a large number of redundant alarms [12], [13]. With failure recovery protocols at different network layers, various failure management mechanisms with specific built-in failure management functionality could be adopted.…”

Section: Introductionmentioning

confidence: 99%

“…To ease the limitation on the monitoring structure, [12] introduced the concept of Monitoring-Trail (m-trail), where the model is based on an enumeration-free Integer Linear Program (ILP) approach. M-trail is proved to yield much better performance by employing monitoring resources in the shape of trails -a monitoring structure that generalizes all the previously reported counterparts.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Novel Approach for Failure Localization in All-Optical Mesh Networks

Tapolcai

et al. 2011

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

Abstract-Achieving fast and precise failure localization has long been a highly desired feature in all-optical mesh networks. M-trail (monitoring trail) has been proposed as the most general monitoring structure for achieving unambiguous failure localization (UFL) of any single link failure while effectively reducing the amount of alarm signals flooding the networks. However, it is critical to come up with a fast and intelligent m-trail design approach for minimizing the number of m-trails and the total bandwidth consumed, which ubiquitously determines the length of the alarm code and bandwidth overhead for the mtrail deployment, respectively. In this paper, the m-trail design problem is investigated. To gain a deeper understanding of the problem, we first conduct a bound analysis on the minimum length of alarm code of each link required for UFL on the most sparse (i.e., ring) and dense (i.e., fully meshed) topologies. Then, a novel algorithm based on random code assignment (RCA) and random code swapping (RCS) is developed for solving the m-trail design problem. The prototype of the algorithm can be found in [1]. The algorithm is verified by comparing to an Integer Linear Program (ILP) approach, and the results demonstrate its superiority in minimizing the fault management cost and bandwidth consumption while achieving significant reduction in computation time. To investigate the impact of topology diversity, extensive simulation is conducted on thousands of random network topologies with systematically increased network density.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Novel Approach for Failure Localization in All-Optical Mesh Networks

Tapolcai

et al. 2011

IEEE/ACM Trans. Networking

Self Cite

View full text Add to dashboard Cite

show abstract

“…Due to the transparency in the data plane, a single failure may trigger a large number of redundant alarms [13], [14], which not only increases the management complexity but also makes the failure localization more difficult. With a fast fault localization/diagnosis plane, the network operators can real-time monitor the network performance behaviour via very efficient redundancy placement strategies (e.g., failure dependent protection), and dynamically recover any unexpected failure event in a time scale of tens of milliseconds.…”

Section: Introductionmentioning

confidence: 99%

“…In the literature, a number of different structures for the S-LPs are reported, and each structure brings about a specific restriction in the formation of the corresponding S-LPs. For example, a simple monitoring cycle (m-cycle) [4]- [7] is a connected graph where each node has a nodal degree 2; a non-simple m-cycle [15] is a connected subgraph where all nodes have even nodal degrees; and undirected monitoring trails (um-trails) [1], [13], [16] are connected graphs with no more than two odd-degree nodes. The most general structure is bi-directional monitoring trail (bm-trail), where each S-LP is simply a connected subgraph of the topology subject to no further restrictions.…”

Section: Introductionmentioning

confidence: 99%

Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks

Tapolcai¹,

Rónyai

2013

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-The paper considers the problem of single-link failure localization in all-optical mesh networks. Our study follows a generic monitoring approach using supervisory lightpaths (SLPs), in which a set of bi-directional monitoring trails (bmtrails) are defined and closely monitored, such that the network controller can achieve unambiguous failure localization (UFL) for any single link by collecting the flooded alarms from the affected bm-trails. With a target of minimizing the number of bm-trails (or the length of alarm codes) required for singlelink UFL, the paper provides optimal (or essentially optimal) solutions to the bm-trail allocation problem on a number of well known topologies. First we demonstrate that the theoretical lower bound of log 2 (|E| + 1) bm-trails can be achieved in any 2 · log 2 (|E| + 1) connected graph, where |E| is the number of links. Next, we prove an essentially optimal solution for 1-by-N grid topologies (also known as chocolate bar graphs), where 0.42 + log 2 (|E| + 2) bm-trails can be achieved. Based on the solution for chocolate bars, we further investigate bm-trail solutions to general 2-dimensional (2D) grid topologies, and the developed solution requires no more than 3 + log 2 (|E| + 1) bm-trails for UFL. Such an optimal (or essentially optimal) logarithmic behavior, although has been well observed in general topologies in our previous studies [1], [2], is formalized for the first time in this paper via a suite of polynomial-time deterministic constructions that consume less than a few seconds of running time in topologies of thousands of nodes.

show abstract

Efficient and costless monitoring mechanism in metro-access network

Cheng¹,

Xiao

2017

Optical Switching and Networking

View full text Add to dashboard Cite

Monitoring Trail: A New Paradigm for Fast Link Failure Localization in WDM Mesh Networks

Cited by 25 publications

References 7 publications

A Novel Approach for Failure Localization in All-Optical Mesh Networks

A Novel Approach for Failure Localization in All-Optical Mesh Networks

Link Fault Localization Using Bi-Directional M-Trails in All-Optical Mesh Networks

Efficient and costless monitoring mechanism in metro-access network

Contact Info

Product

Resources

About