4.5 Article

Adjacent Link Failure Localization With Monitoring Trails in All-Optical Mesh Networks

Journal

IEEE-ACM TRANSACTIONS ON NETWORKING
Volume 19, Issue 3, Pages 907-920

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2010.2096429

Keywords

Adjacent link failures; failure localization; monitoring trails (m-trails); shared risk link groups (SRLGs)

Funding

  1. Discovery Grant
  2. National Science and Engineering Research Council (NSERC), Canada
  3. High Speed Network Laboratory (HSNLab)
  4. Hungarian National Research Fund
  5. National Office for Research and Technology [OTKA NK 72845, K77476, K77778, 67651]
  6. Magyary Zoltan Post-Doctoral Program

Ask authors/readers for more resources

Being reported as the most general monitoring structure for out-of-band failure localization approach, the monitoring trail (m-trail) framework has been witnessed with great efficiency and promises to serve in the future Internet backbone with all-optical mesh wavelength division multiplex (WDM) networks. Motivated by its potential and significance, this paper investigates failure localization in all-optical mesh networks using m-trails. By considering shared risk link groups (SRLGs) with up to all adjacent links of any node in the network, a novel algorithm of m-trail allocation for achieving unambiguous failure localization (UFL) of any single SRLG failure is developed. The proposed algorithm aims to minimize the number of required m-trails and can achieve superb performance with respect to the computation efficiency. We claim that among all the previously reported counterparts, this paper has considered one of the most applicable scenarios to the design of network backbone, and the proposed method can be easily extended to the case of node failure localization. Extensive simulation is conducted to verify the proposed algorithm in comparison to its existing counterparts.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Computer Science, Hardware & Architecture

Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding

Alija Pasic, Peter Babarczi, Janos Tapolcai, Erika R. Berczi-Kovacs, Zoltan Kiraly, Lajos Ronyai

IEEE-ACM TRANSACTIONS ON NETWORKING (2020)

Article Computer Science, Hardware & Architecture

The Earth is nearly flat: Precise and approximate algorithms for detecting vulnerable regions of networks in the plane and on the sphere

Balazs Vass, Laszlo Nemeth, Janos Tapolcai

NETWORKS (2020)

Article Computer Science, Information Systems

A mathematical framework for measuring network flexibility

Peter Babarczi, Markus Kluegel, Alberto Martinez Alba, Mu He, Johannes Zerwas, Patrick Kalmbach, Andreas Blenk, Wolfgang Kellerer

COMPUTER COMMUNICATIONS (2020)

Article Computer Science, Hardware & Architecture

Fast Enumeration of Regional Link Failures Caused by Disasters With Limited Size

Janos Tapolcai, Lajos Ronyai, Balazs Vass, Laszlo Gyimothi

IEEE-ACM TRANSACTIONS ON NETWORKING (2020)

Article Computer Science, Information Systems

Adaptive Protection of Scientific Backbone Networks Using Machine Learning

Ferenc Mogyorosi, Alija Pasic, Richard Cziva, Peter Revisnyei, Zsolt Kenesi, Janos Tapolcai

Summary: This article proposes a new protection scheme for backbone networks that utilizes Machine Learning to implement network intelligence and achieve a proactive approach to service availability without the need for reserved backup network resources. By reallocating unused capacity as protection bandwidth, the scheme aims to improve availability without affecting operational connections or the over-provisioning of network bandwidth.

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT (2021)

Article Engineering, Electrical & Electronic

Probabilistic Shared Risk Link Groups Modeling Correlated Resource Failures Caused by Disasters

Balazs Vass, Janos Tapolcai, Zalan Heszberger, Jozsef Biro, David Hay, Fernando A. Kuipers, Jorik Oostenbrink, Alessandro Valentini, Lajos Ronyai

Summary: The paper introduces a stochastic model for estimating hazards to an optical backbone network and understanding the complex correlation between possible link failures. It also presents standard data structures and a pre-computation process for efficient computation of cumulative failure probabilities of network elements.

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2021)

Article Computer Science, Hardware & Architecture

Enumerating Maximal Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes

Balazs Vass, Janos Tapolcai, Erika R. Berczi-Kovacs

Summary: The paper proposed a limited geographic information failure model, which allows for the design of an algorithm that can efficiently compute the set of links that are expected to be close in a network. Under realistic assumptions, the obtained list of SRLGs is short, with approximately 1.2n and 2.2n elements for k = 0 and k = 1, respectively.

IEEE-ACM TRANSACTIONS ON NETWORKING (2021)

Article Computer Science, Information Systems

Resilient Control Plane Design for Virtual Software Defined Networks

Peter Babarczi

Summary: This paper focuses on the survivability of the control plane in virtual software-defined networks (vSDN) and proposes two contributions: an approximation algorithm for hypervisor placement and a general dynamic program for calculating minimum length paths. Thorough simulations on real-world topologies demonstrate the effectiveness of the proposed approaches in different scenarios.

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT (2021)

Article Computer Science, Information Systems

Bloom Filter With a False Positive Free Zone

Sandor Z. Kiss, Eva Hosszu, Janos Tapolcai, Lajos Ronyai, Ori Rottenstreich

Summary: This article discusses the importance of Bloom filters and their variants in networking applications, and introduces a new data structure called EGH filter that guarantees false positive-free operations. The EGH filter supports Bloom filter operations and ensures real-time false positive-free operations within a limited universe and restricted number of elements stored.

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT (2021)

Article Computer Science, Information Systems

Resilient Control Plane Design for Virtualized 6G Core Networks

Ferenc Mogyorosi, Peter Babarczi, Johannes Zerwas, Andreas Blenk, Alija Pasic

Summary: This paper proposes a latency-aware dual hypervisor placement and control path design method, which protects against single-link and hypervisor failures and is ready for unknown future changes.

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT (2022)

Proceedings Paper Computer Science, Hardware & Architecture

Routing on the Shortest Pairs of Disjoint Paths

Peter Babarczi, Gabor Retvari, Lajos Ronyai, Janos Tapolcai

Summary: This paper focuses on the problem of routing along the shortest pairs of disjoint paths over the currently deployed link-state routing architecture. By proposing an efficient tag encoding scheme, it enables multi-path routing in the network without the need for extensive network overhaul.

2022 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) (2022)

Article Computer Science, Information Systems

eFRADIR: An Enhanced FRAmework for DIsaster Resilience

Alija Pasic, Rita Girao-Silva, Ferenc Mogyorosi, Balazs Vass, Teresa Gomes, Peter Babarczi, Peter Revisnyei, Janos Tapolcai, Jacek Rak

Summary: This paper introduces a new framework focusing on resilience against natural disasters, targeting network planning, failure modeling, and survivable routing. It proposes a two-stage approach to optimize availability upgrade cost by upgrading a sub-network to achieve the targeted availability threshold. The framework also includes a new integer linear program for disaster-resilient network planning and an efficient heuristic scheme to reduce running time.

IEEE ACCESS (2021)

Proceedings Paper Computer Science, Hardware & Architecture

Modeling the Cost of Flexibility in Communication Networks

Alberto Martinez Alba, Peter Babarczi, Andreas Blenk, Mu He, Patrick Kalmbach, Johannes Zerwas, Wolfgang Kellerer

Summary: The paper introduces a comprehensive cost model for a flexible network, taking into account its transient and stationary phases. This model enables network researchers and operators to qualitatively discuss new flexible network solutions and analyze their costs quantitatively for the first time.

IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021) (2021)

No Data Available