Conference Paper

A New Heuristic for Monitoring Trail Allocation in All-Optical WDM Networks

Sch. of Commun. & Inf. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
DOI: 10.1109/GLOCOM.2010.5683217 Conference: Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
Source: IEEE Xplore

ABSTRACT We study the m-trail (monitoring trail) allocation problem in all-optical WDM mesh networks for achieving fast and unambiguous link failure localization. The existing ILP is not feasible for solving the problem in large-size networks. A heuristic RCA+RCS can find feasible solutions in a shorter running time, but it is a randomized algorithm. More importantly, RCA+RCS suffers from the disjoint trail problem which dramatically increases the number of required monitors in large-size networks. In this paper, we propose a new heuristic MTA (Monitoring Trail Allocation) to solve the problem. MTA avoids those issues in RCA+RCS, and achieves an efficient tradeoff between monitor cost and bandwidth cost. Compared with RCA+RCS, MTA greatly shortens the running time and achieves a much higher solution quality. We also show that MTA provides a flexible framework to enable multiple possible variations for future study.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Out-of-band monitoring has been proposed as an effective approach for link failure localization in all-optical Wavelength Division Multiplexing (WDM) mesh networks. In this paper, the recent research related to out-of-band monitoring is overviewed. We define and formulate the related optimization problems under several design constraints, summarize the analytical results and discuss the related heuristic algorithms.
    Telecommunication Systems 05/2013; 56(1):169-176. DOI:10.1007/s11235-013-9826-7 · 1.16 Impact Factor
  • Source
    10/2013, Degree: PhD, Supervisor: Pin-Han Ho
  • [Show abstract] [Hide abstract]
    ABSTRACT: Monitoring trails (m-trails) have been extensively studied as an alternative to the conventional link-based monitoring approach by using multi-hop supervisory lightpaths in all-optical networks. However, none of the previous studies have investigated the effect of length constraints upon the m-trail formation, which nonetheless correspond to the failure localization time. This paper addresses the above issue and formulates a new m-trail allocation problem, where the relationship between the number of m-trails versus the maximum hop count is explored. First, the paper investigates the theoretical bounds of allocating m-trails with at most k hops via an optimal group testing construction. Secondly, a novel meta-heuristic approach based on bacterial evolutionary algorithm for solving the length-constrained m-trail allocation problem is introduced. Through extensive simulations the performance gap of the proposed algorithm to the lower bound is presented on a wide diversity of topologies.
    Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2012 4th International Congress on; 01/2012

Preview (3 Sources)

Available from