An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

Gomes, Teresa; Craveirinha, José; Jorge, Luísa

doi:10.1016/j.cor.2008.04.002

Cited by 20 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such a network is called a multicost network. Some centralized algorithms are given in [24–26] to find k disjoint s~t paths in multicost networks with the minimum total cost. The works in [27] consider the problem of reliable data transmission in underwater sensor networks.…”

Section: Related Workmentioning

confidence: 99%

DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

Zhang

Yin

Han

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In wireless sensor networks, routing messages through multiple (node) disjoint paths between two sensor nodes is a promising way to increase robustness, throughput, and load balance. This paper proposes an efficient distributed algorithm named distributedly finding disjoint paths (DFDP) to find k disjoint paths connecting two given nodes s and t. A set of paths connecting s and t are disjoint if any two of them do not have any common nodes except s and t. Unlike the existing distributed algorithms, DFDP guarantees correctness; that is, it will output k disjoint paths if there exist k disjoint paths in the network or the maximum number of disjoint paths otherwise. Compared with the centralized algorithms which also guarantee correctness, DFDP is shown to have much better efficiency and load balance by theory analysis and simulation results.

show abstract

Section: Related Workmentioning

confidence: 99%

DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

Zhang

Yin

Han

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…However the min-sum problem in a dual-cost network, that is a network where every link has associated two costs with an arbitrary relation, is NP-Complete [2]. In [3] an exact algorithm for solving this problem was proposed, and in [4] a new approach for finding -disjoint paths with differentiated path cost is proposed. If sharing bandwidth among BPs is desired, the problem of calculating a path pair which minimises the used bandwidth is difficult, and can be approximated considering asymmetrical costs, resulting in a network with ordered costs.…”

Section: Introductionmentioning

confidence: 99%

Protected bicriteria paths in transport networks

Gomes

Martins

Silva

et al. 2012

2012 IV International Congress on Ultra Modern Telecommunications and Control Systems

Self Cite

View full text Add to dashboard Cite

Resilient routing in transport networks requires the calculation of active paths (APs) and backup paths (BPs) to be used in the event of failures in the corresponding APs. Often it is not possible to ensure full end-to-end protection. Hence an AP is only an admissible solution if a BP can be calculated such that it shares a minimal number of common nodes with the AP. In the absence of node disjoint path pairs, the existence of parallel edges has to be taken into consideration, because parallel edges could ensure link protection between two adjacent nodes. The potential advantages of using multicriteria models in various routing contexts has been pointed out by several authors. In this paper we present a bicriteria optimization model for calculating APs with maximally disjoint BPs. A network performance study using a real transport network, enabling a comparison of the model results with those of the associated single criterion models, is carried out. The two considered metrics are hop count and load cost. Having calculated an AP, the best BP was subsequently obtained (using the same metric). The network was represented using a directed multi-graph, because the existence of parallel arcs between end nodes had to be explicitly addressed and connection requests for services with asymmetrical bandwidth requirements were also considered. A major objective of this work was the improvement of protected path selection, from a network management point of view, where an answer to clients requests for new connections, in transport networks, has to be answered in less than a second.

show abstract

“…We can see it either as node-disjoint or as arc-disjoint, because both give the same result. k node/arc-disjoint path problems have been widely researched ( [9,7,13,3,4,6]) and they have been applied in many fields, as for example routing ( [10,12]) and social networks ( [5,11]). The problem studied in this paper is not a mere case of the previous problems.…”

Section: Introductionmentioning

confidence: 99%

Redundancy system design for an aircraft door management system

Schäfer

García

Mitschke

et al. 2018

Computers & Operations Research

View full text Add to dashboard Cite

The door management system (DMS) is a safety system in an aircraft which checks if all doors are properly closed and the cabin is correctly pressurized. As for every critical system in an aircraft, it has to meet some safety regulations and it should be designed optimally in terms of weight, cost, or power consumption. This paper studies the problem of designing a DMS optimally as per the previous objectives while guaranteeing that there is redundancy, that is, the DMS is functional even if one of its components is not working. We call this new problem the DMS problem with redundancy. First, we propose a new MILP model for the DMS problem which includes redundancy, but the model turns out to be too difficult to be solved efficiently. In order to improve computational performance, a specialized branching rule and a heuristic are proposed. Computational tests are run for example instances of the DMS problem by implementing these new rules in CPLEX. It could be seen that the solving time through the new branching rule and heuristic can be significantly reduced.

show abstract

An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs

Cited by 20 publications

References 10 publications

DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

DFDP: A Distributed Algorithm for Finding Disjoint Paths in Wireless Sensor Networks with Correctness Guarantee

Protected bicriteria paths in transport networks

Redundancy system design for an aircraft door management system

Contact Info

Product

Resources

About