-
Network Resilience Assessment via QoS Degradation Metrics: An Algorithmic Approach
This paper focuses on network resilience to perturbation of edge weight....
read it
-
The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
The purpose of this work is to introduce and characterize the Bounded Ac...
read it
-
The Optimality of Satisficing Solutions
This paper addresses a prevailing assumption in single-agent heuristic s...
read it
-
Explicit optimal-length locally repairable codes of distance 5
Locally repairable codes (LRCs) have received significant recent attenti...
read it
-
Algorithms and Adaptivity Gaps for Stochastic k-TSP
Given a metric (V,d) and a root∈ V, the classic k-TSP problem is to find...
read it
-
What's (Not) Validating Network Paths: A Survey
Validating network paths taken by packets is critical for a secure Inter...
read it
-
eLIAN: Enhanced Algorithm for Angle-constrained Path Finding
Problem of finding 2D paths of special shape, e.g. paths comprised of li...
read it
Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment
Studying on networked systems, in which a communication between nodes is functional if their distance under a given metric is lower than a pre-defined threshold, has received significant attention recently. In this work, we propose a metric to measure network resilience on guaranteeing the pre-defined performance constraint. This metric is investigated under an optimization problem, namely Length-bounded Paths Interdiction in Continuous Domain (cLPI), which aims to identify a minimum set of nodes whose changes cause routing paths between nodes become undesirable for the network service. We show the problem is NP-hard and propose a framework by designing two oracles, Threshold Blocking (TB) and Critical Path Listing (CPL), which communicate back and forth to construct a feasible solution to cLPI with theoretical bicriteria approximation guarantees. Based on this framework, we propose two solutions for each oracle. Each combination of one solution to and one solution to gives us a solution to cLPI. The bicriteria guarantee of our algorithms allows us to control the solutions's trade-off between the returned size and the performance accuracy. New insights into the advantages of each solution are further discussed via experimental analysis.
READ FULL TEXT
Comments
There are no comments yet.