Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes

Network survivability has drawn certain interest in network optimization. However, the demand for full protection of a network is usually too restrictive. To overcome the limitation of geographical environments and to save network resources, we turn to establish backup networks allowing a few common nodes. It comes out the problem of finding k link-disjoint paths between a given pair of source and sink in a network such that the number of common nodes shared by at least two paths is bounded by a constant and the total link weight of all paths is minimized under the above constraints. For the case k = 2, where we have only one backup path, several fast algorithms have been developed in the literature. For the case k > 2, little results are known. In this paper, we first establish the NP-hardness of the problem with general k. Motivated by the situation that each node in a network may have a capability of multicasting, we also study a restricted version with one more requirement that each node can be shared by at most two paths. For the restricted version, we build an ILP model and design a fast algorithm by using the techniques of augmenting paths and splitting nodes. Furthermore, experimental results on synthetic and real networks show that our algorithm is effective in practice.

Download Full-text

Link-Weight Modification for Network Optimization: Is it a Tool, Philosophy, or an Art?

Recent Advances in Mathematics for Engineering ◽

10.1201/9780429200304-11 ◽

2020 ◽

pp. 221-235

Author(s):

Santosh Kumar ◽

Elias Munapo ◽

‘Maseka Lesaoana ◽

Philimon Nyamugure ◽

Phillemon Dikgale

Keyword(s):

Network Optimization ◽

Link Weight

Download Full-text

An Overview of Algorithms for Network Survivability

ISRN Communications and Networking ◽

10.5402/2012/932456 ◽

2012 ◽

Vol 2012 ◽

pp. 1-19 ◽

Cited By ~ 28

Author(s):

F. A. Kuipers

Keyword(s):

Polynomial Time ◽

Network Connectivity ◽

Network Survivability ◽

Disjoint Paths ◽

Polynomial Time Algorithms ◽

Concise Overview ◽

Main Components

Network survivability—the ability to maintain operation when one or a few network components fail—is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding disjoint paths. We present a concise overview of network survivability algorithms, where we focus on presenting a few polynomial-time algorithms that could be implemented by practitioners and give references to more involved algorithms.

Download Full-text

Reliability Measurement in A Multi-path Transmission Network using SMP-BP Algorithm

International Journal of Online and Biomedical Engineering (iJOE) ◽

10.3991/ijoe.v15i11.10627 ◽

2019 ◽

Vol 15 (11) ◽

pp. 16

Author(s):

Xiaoling Li ◽

Xinwei Zhou

Keyword(s):

Data Transmission ◽

Data Security ◽

Network Reliability ◽

Transmission Network ◽

Network Resources ◽

Minimal Path ◽

Transmission Networks ◽

Backup Path ◽

Efficient Data ◽

Reliability Measurement

Data security is very important in the multi-path transmission networks (MTN). Efficient data security measurement in MTN is crucial so as to ensure the reliability of data transmission. To this end, this paper presents an improved algorithm using single-single minimal path based back-up path (SSMP-BP), which is designed to ensure the data transmission when the second path is out of work. From the simulation study, the proposed algorithm has the better network reliability compared with existing double minimal path based backup path (DMP-BP) approach. It could be found that, the proposed algorithm uses less back-up paths compared with DMP-BP so that less network resources like nodes are achieved.

Download Full-text

Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence ◽

10.24963/ijcai.2018/196 ◽

2018 ◽

Cited By ~ 2

Author(s):

Shaowei Cai ◽

Wenying Hou ◽

Jinkun Lin ◽

Yuanjie Li

Keyword(s):

Local Search ◽

Real World ◽

Heuristic Algorithms ◽

Minimum Weight ◽

Vertex Cover ◽

Independent Set ◽

Map Labeling ◽

Massive Graphs ◽

Real World Problem ◽

Np Hardness

The minimum weight vertex cover (MWVC) problem is an important combinatorial optimization problem with various real-world applications. Due to its NP hardness, most works on solving MWVC focus on heuristic algorithms that can return a good quality solution in reasonable time. In this work, we propose two dynamic strategies that adjust the behavior of the algorithm during search, which are used to improve a state of the art local search for MWVC named FastWVC, resulting in two local search algorithms called DynWVC1 and DynWVC2. Previous MWVC algorithms are evaluated on graphs with random or hand crafted weights. In this work, we evaluate the algorithms on the vertex weighted graphs that obtained from an important real world problem, the map labeling problem. Experiments show that our algorithm obtains better results than previous algorithms for MWVC and maximum weight independent set (MWIS) on these real world instances. We also test our algorithms on massive graphs studied in previous works, and show significant improvements there.

Download Full-text

Minimum-Weight Link-Disjoint Node-“Somewhat Disjoint” Paths

IEEE/ACM Transactions on Networking ◽

10.1109/tnet.2018.2823912 ◽

2018 ◽

Vol 26 (3) ◽

pp. 1110-1122 ◽

Cited By ~ 3

Author(s):

Jose Yallouz ◽

Ori Rottenstreich ◽

Peter Babarczi ◽

Avi Mendelson ◽

Ariel Orda

Keyword(s):

Minimum Weight ◽

Disjoint Paths

Download Full-text

Interference-free Walks in Time: Temporally Disjoint Paths

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence ◽

10.24963/ijcai.2021/563 ◽

2021 ◽

Author(s):

Nina Klobas ◽

George B. Mertzios ◽

Hendrik Molter ◽

Rolf Niedermeier ◽

Philipp Zschoche

Keyword(s):

Disjoint Paths ◽

Constant Number ◽

Underlying Graph ◽

Traffic Routing ◽

Temporal Graph ◽

The One ◽

Temporal Graphs ◽

General Graphs ◽

Temporal Path ◽

Np Hardness

We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically increasing time steps. Two paths (or walks) are temporally disjoint if they never use the same vertex at the same time; otherwise, they interfere. This reflects applications in robotics, traffic routing, or finding safe pathways in dynamically changing networks. On the one extreme, we show that on general graphs the problem is computationally hard. The "walk version" is W[1]-hard when parameterized by the number of routes. However, it is polynomial-time solvable for any constant number of walks. The "path version" remains NP-hard even if we want to find only two temporally disjoint paths. On the other extreme, restricting the input temporal graph to have a path as underlying graph, quite counterintuitively, we find NP-hardness in general but also identify natural tractable cases.

Download Full-text

Optimization of HSDPA Network in Malang City Area Using Drive Test

Jurnal Jartel Jurnal Jaringan Telekomunikasi ◽

10.33795/jartel.v3i2.221 ◽

2016 ◽

Vol 3 (2) ◽

pp. 53-59

Author(s):

Agnes Estuning Tyas

Keyword(s):

Network Optimization ◽

Network Performance ◽

Path Loss ◽

Quality Service ◽

Network Operator ◽

Network Resources ◽

Test Drive ◽

City Area ◽

Best Value ◽

Measuring Network

With the influence of customer growth and environmental influences from an HSDPA network in the form of nodeB which stands in the Malang City area, it can experience integration. This causes measurements to be carried out continuously and periodically to provide the latest radio environmental information. The vendor as the network operator performs optimization in order to provide customers with the best quality service. One of them is in the form of network performance which aims to ensure that network resources are used efficiently. The method in achieving network optimization that is still used by vendors in Indonesia is by measuring network performance, then analyzing the results of measuring network performance and finally network tuning. For measuring network performance using a test drive. Of the 13 nodeB in Lowokwaru District, Malang City, it is necessary to optimize the HSDPA network with the suggestion of a downtilt antenna on the Ketawanggede nodeB sector 3, which is 2º The results of the calculation of the path loss parameters from each of the 13 nodeBs obtained the highest value of 125.31 dB at nodeB Ketawanggede and the lowest 114.29 dB at nodeB Vinolia Malang sector 3. The results of the RSCP parameter calculation at 13 nodeB obtained the best value at nodeB Vinolia Malang sector 3 with RSCP of -69.29dBm. While the worst value at nodeB Ketawanggede with RSCP is -80.31dBm.

Download Full-text