Conference Paper
A New Heuristic for Monitoring Trail Allocation in AllOptical WDM Networks
Sch. of Commun. & Inf. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
DOI: 10.1109/GLOCOM.2010.5683217 In proceeding of: Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE Source: IEEE Xplore

Conference Paper: Fast failure localization in alloptical networks with lengthconstrained monitoring trails
[Show abstract] [Hide abstract]
ABSTRACT: Monitoring trails (mtrails) have been extensively studied as an alternative to the conventional linkbased monitoring approach by using multihop supervisory lightpaths in alloptical networks. However, none of the previous studies have investigated the effect of length constraints upon the mtrail formation, which nonetheless correspond to the failure localization time. This paper addresses the above issue and formulates a new mtrail allocation problem, where the relationship between the number of mtrails versus the maximum hop count is explored. First, the paper investigates the theoretical bounds of allocating mtrails with at most k hops via an optimal group testing construction. Secondly, a novel metaheuristic approach based on bacterial evolutionary algorithm for solving the lengthconstrained mtrail 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  [Show abstract] [Hide abstract]
ABSTRACT: Monitoring trail (mtrail) has been proposed as an effective approach for link failure localization in alloptical wavelength division multiplexing (WDM) mesh networks. Previous studies in failure localization rely on alarm dissemination via control plane signaling such that the network controller can collect the flooded alarms to form an alarm code for failure identification. Such crosslayer signaling effort obviously leads to additional control complexity. This paper investigates a novel mtrail failure localization scenario, called networkwide local unambiguous failure localization (NWLUFL), where each node can perform UFL based on locally available on–off state of traversing mtrails, such that alarm dissemination in the control plane can be completely avoided. The paper first defines and formulates the mtrail allocation problem under NWLUFL and conducts a series of bound analysis on the cover length required for localizing any singlelink failure. This is the first study on monitoring trail allocation problem that aims to gain understanding on the consumed cover length via analytical approaches due to the special feature of the NWLUFL scenario. A novel heuristic algorithm based on random spanning tree assignment (RSTA) and greedy link swapping (GLS) is developed for solving the formulated problem. Extensive simulation on thousands of randomly generated network topologies is conducted to verify the proposed scheme by comparing it to a naive counterpart and with the derived lower bounds. We also demonstrate the impact of topology diversity on the performance of the proposed scheme as well as its scalability regarding network sizes.IEEE/ACM Transactions on Networking 01/2012; 20(6). · 2.01 Impact Factor 
Conference Paper: Monitoring Trail Allocation in alloptical networks with the Random Next Hop Policy
[Show abstract] [Hide abstract]
ABSTRACT: The concept of monitoring trail (mtrail) provides a striking mechanism for fast and unambiguous link failure localization in alloptical networks. To achieve fast mtrail design in largesize networks, two efficient heuristics RCA+RCS and MTA are proposed against the optimal ILP (Integer Linear Program) model. However, RCA+RCS suffers from the disjoint trail problem which increases the required number of mtrails, and MTA always finds a deterministic solution which may not be good enough due to the limited solution space. In this paper, we propose a new heuristic RNHMTA (Monitoring Trail Allocation with the Random Next Hop policy) to solve those issues. Similar to MTA, RNHMTA ensures a valid optical structure of each mtrail and sequentially adds necessary mtrails to the solution, and thus is free of the disjoint trail problem. By replacing the deterministic searching in MTA using the Random Next Hop policy, RNHMTA sets up a probabilistic model in extending each mtrail. This not only enlarges the solution space and increases the solution diversity, but also enables a controllable tradeoff between the solution quality and the running time of the algorithm. Our numerical results show the advantages of RNHMTA over both RCA+RCS and MTA.High Performance Switching and Routing (HPSR), 2012 IEEE 13th International Conference on; 01/2012
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.