A label-setting algorithm for finding a quickest path

Park, Chan-Kyoo; Lee, Sangwook; Park, Soondal

doi:10.1016/s0305-0548(03)00195-3

Cited by 65 publications

(41 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the SPP in Step 2 is solved by applying (Fredman and Tarjan 1987), the time computational complexity of the algorithm is O(rm + rn log n), which is the same as that for the algorithms in Chen and Chin (1990), Martins and Santos (1997), Moore (1976), Park et al (2004) and Rosen et al (1991). However, unlike them, it only computes one shortest path, which is a quickest path.…”

Section: Nqppa: Algorithm For Solving the Qppmentioning

confidence: 97%

“…We have considered the algorithms proposed by Chen and Chin (1990), denoted CCA, by Moore (1976) or Martins and Santos (1997), denoted MMSA and by Park et al (2004), denoted PLPA. These algorithms together with the NQPPA proposed in this paper have been applied to a set of test problems that were generated using a modified version of NETGEN (Klingman et al 1974).…”

Section: Nqppa: Algorithm For Solving the Qppmentioning

confidence: 99%

“…As a consequence, they usually compute more shortest paths than are needed to identify the quickest path. Park et al (2004) point out that it is possible to avoid the enumeration of unnecessary paths by using transmission time instead of lead time and propose a label-setting algorithm with the same computational complexity.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Algorithms for the quickest path problem and the reliable quickest path problem

2012

View full text Add to dashboard Cite

The quickest path problem consists of finding a path in a directed network to transmit a given amount of items from an origin node to a destination node with minimal transmission time, when the transmission time depends on both the traversal times of the arcs, or lead time, and the rates of flow along arcs, or capacity. In telecommunications networks, arcs often also have an associated operational probability of the transmission being fault free. The reliability of a path is defined as the product of the operational probabilities of its arcs. The reliability as well as the transmission time are of interest. In this paper, algorithms are proposed to solve the quickest path problem as well as the problem of identifying the quickest path whose reliability is not lower than a given threshold. The algorithms rely on both the properties of a network which turns the computation of a quickest path into the computation of a shortest path and the fact that the reliability of a path can be evaluated through the reliability of the ordered sequence of its arcs. Other constraints on resources consumed, on the number of arcs of the path, etc. can also be managed with the same algorithms.

show abstract

Section: Nqppa: Algorithm For Solving the Qppmentioning

confidence: 97%

Section: Nqppa: Algorithm For Solving the Qppmentioning

confidence: 99%

See 1 more Smart Citation

Algorithms for the quickest path problem and the reliable quickest path problem

2012

View full text Add to dashboard Cite

show abstract

“…They are based on solving a shortest path problem in an enlarged network [2,5], solving a sequence of shortest path problems with respect to the delay time on networks where the minimum capacity increases [10,11,16,19], using a label-setting algorithm [12] or taking into account that a quickest path is a supported efficient solution of the aforementioned bi-objective problem [20].…”

Section: Introductionmentioning

confidence: 99%

The energy-constrained quickest path problem

2016

View full text Add to dashboard Cite

This paper addresses a variant of the quickest path problem in which each arc has an additional parameter associated to it representing the energy consumed during the transmission along the arc while each node is endowed with a limited power to transmit messages. The aim of the energyconstrained quickest path problem is to obtain a quickest path whose nodes are able to support the transmission of a message of a known size. After introducing the problem and proving the main theoretical results, a polynomial algorithm is proposed to solve the problem based on computing shortest paths in a sequence of subnetworks of the original network. In the second part of the paper, the bi-objective variant of this problem is considered in which the objectives are the transmission time and the total energy used. An exact algorithm is proposed to find a complete set of efficient paths. The computational experiments carried out show the performance of both algorithms.

show abstract

“…Hence, Chen and Chin (1990) proposed a version of the shortest path problem called the quickest path (QP) problem. This problem is to find a path transmitting a specific amount of data with minimum transmission time, where each arc has two deterministic attributes; capacity and lead time (Chen and Chin 1990;Hung and Chen 1992;Martins and Santos 1997;Park et al 2004). Besides, numerous researchers have discussed the issues related to considered flow accuracy when measuring local area network traffic (Amer 1982;Chlamtac 1980;Jain and Routhier 1986).…”

Section: Introductionmentioning

confidence: 99%

Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate

Lin

Huang

2014

Ann Oper Res

View full text Add to dashboard Cite

In many real-time networks such as computer networks, each arc has stochastic capacity, lead time, and accuracy rate. Such a network is named a multi-state computer network (MSCN). Under the strict assumption that the capacity of each arc is deterministic, the quickest path (QP) problem is to find a path that sends a specific amount of data with minimum transmission time. From the viewpoint of internet quality, the transmission accuracy rate is one of critical performance indicators to assess internet network for system administrators and customers. Under both assured accuracy rate and time constraint, this paper extends the QP problem to discuss the flow assignment for a MSCN. An efficient algorithm is proposed to find the minimal capacity vector meeting such requirements. The system reliability, the probability to send d units of data through multiple minimal paths under both assured accuracy rate and time constraint, can subsequently be computed. Furthermore, two routing schemes with spare minimal paths are adopted to reinforce the system reliability. The enhanced system reliability according to the routing scheme is calculated as well. The computational complexity in both the worst case and average case are analyzed.

show abstract

A label-setting algorithm for finding a quickest path

Cited by 65 publications

References 10 publications

Algorithms for the quickest path problem and the reliable quickest path problem

Algorithms for the quickest path problem and the reliable quickest path problem

The energy-constrained quickest path problem

Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate

Contact Info

Product

Resources

About