Abstract:In recent years, following the deployment of wavelength division multiplexing networks, fault detection and localisation has become a challenging issue in networks with high reliability. Optical layer monitoring schemes based on monitoring trails (m-trail) are considered an efficient way to localise a single fault unambiguously in all-optical networks. In spite of the extensive work on the m-trail concept, the issue has not been validated from the feasibility point of view. Previous works on the m-trail monito… Show more
“…Such flexibility is desired in an intelligent failure localization framework and cannot be achieved with lengthy m-trails as in the previous studies [2], [3], [17]. Furthermore, short m-trails bear much better physical-layer impairment properties [4] than the previously proposed long m-trails. The set of m-trails is denoted by T = {T 1 , .…”
Section: A Problem Definitionmentioning
confidence: 89%
“…This approach results unnecessary monitoring resource consumption, high computation complexity, and very lengthy m-trails. Note that using lengthy m-trails not only causes various implementation issues (because of physical layer impairments [4]) but also increases monitoring latencies.…”
Abstract-Shared protection, such as failure dependent protection (FDP), is well recognized for its outstanding capacity efficiency in all-optical mesh networks, at the expense of lengthy restoration time due to multi-hop signaling mechanisms for failure localization, notification, and device configuration. This paper investigates a novel monitoring trail (m-trail) scenario, called Global Neighborhood Failure Localization (G-NFL), that aims to enable any shared protection scheme, including FDP, for achieving all-optical and ultra-fast failure restoration. We firstly define neighborhood of a node, which is a set of links whose failure states should be known to the node in restoration of the corresponding working lightpaths (W-LPs). By assuming every node can obtain the on-off status of traversing m-trails and W-LPs via lambda monitoring, the proposed G-NFL problem routes a set of m-trails such that each node can localize any failure in its neighborhood. Bound analysis is performed on the minimum bandwidth required for m-trails under the proposed G-NFL problem. Then a simple yet efficient heuristic approach is presented. Extensive simulation is conducted to verify the proposed G-NFL scenario under a number of different definitions of nodal neighborhood which concern the extent of dependency between the monitoring plane and data plane. The effect of reusing the spare capacity by FDP for supporting m-trails is examined. We conclude that the proposed G-NFL scenario enables a general shared protection scheme, toward signaling-free and ultra-fast failure restoration like p-Cycle, while achieving optimal capacity efficiency as by FDP.
“…Such flexibility is desired in an intelligent failure localization framework and cannot be achieved with lengthy m-trails as in the previous studies [2], [3], [17]. Furthermore, short m-trails bear much better physical-layer impairment properties [4] than the previously proposed long m-trails. The set of m-trails is denoted by T = {T 1 , .…”
Section: A Problem Definitionmentioning
confidence: 89%
“…This approach results unnecessary monitoring resource consumption, high computation complexity, and very lengthy m-trails. Note that using lengthy m-trails not only causes various implementation issues (because of physical layer impairments [4]) but also increases monitoring latencies.…”
Abstract-Shared protection, such as failure dependent protection (FDP), is well recognized for its outstanding capacity efficiency in all-optical mesh networks, at the expense of lengthy restoration time due to multi-hop signaling mechanisms for failure localization, notification, and device configuration. This paper investigates a novel monitoring trail (m-trail) scenario, called Global Neighborhood Failure Localization (G-NFL), that aims to enable any shared protection scheme, including FDP, for achieving all-optical and ultra-fast failure restoration. We firstly define neighborhood of a node, which is a set of links whose failure states should be known to the node in restoration of the corresponding working lightpaths (W-LPs). By assuming every node can obtain the on-off status of traversing m-trails and W-LPs via lambda monitoring, the proposed G-NFL problem routes a set of m-trails such that each node can localize any failure in its neighborhood. Bound analysis is performed on the minimum bandwidth required for m-trails under the proposed G-NFL problem. Then a simple yet efficient heuristic approach is presented. Extensive simulation is conducted to verify the proposed G-NFL scenario under a number of different definitions of nodal neighborhood which concern the extent of dependency between the monitoring plane and data plane. The effect of reusing the spare capacity by FDP for supporting m-trails is examined. We conclude that the proposed G-NFL scenario enables a general shared protection scheme, toward signaling-free and ultra-fast failure restoration like p-Cycle, while achieving optimal capacity efficiency as by FDP.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.