Internet packet routing: Application of a K-quickest path algorithm

Clímaco, João; Pascoal, Marta; Craveirinha, José; Captivo, M. Eugénia

doi:10.1016/j.ejor.2006.03.013

Cited by 64 publications

(35 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The versions tested in their work concern the ranking of loopless path algorithms by Rosen et al, Chen (using As mentioned above, the experimental results are also presented in Clímaco et al (2003), concerning the application of Pascoal et al's algorithm to the specific problem of routing packets in the Internet.…”

Section: Applications and Empirical Experimentsmentioning

confidence: 99%

“…This includes transportation and telecommunication problems, such as the transportation of cargo between two locations, road transportation, or information to be sent via a communications network. Very recently Clímaco et al (2003) presented the application of Pascoal et al's algorithm to the Internet packet routing. Their work focuses on determining alternative routes for data packets, taking into account uncertainty and/or reliability issues, and reports the corresponding computational results.…”

Section: Applications and Empirical Experimentsmentioning

confidence: 99%

See 1 more Smart Citation

A comprehensive survey on the quickest path problem

2006

Self Cite

View full text Add to dashboard Cite

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a new variant of a known K quickest loopless paths algorithm. Finally, applications of quickest path algorithms are mentioned, as well as some comparative empirical results. Keywords Bicriteria problem . Minsum-maxmin . Quickest path . Paths rankingThe quickest path problem is a particular case of optimal path problems, whose objective function evaluates the time taken to transmit a given amount of data through each path. This function depends on two parameters, an additive function that represents the path delay, and a bottleneck function that represents the path capacity or bandwidth. Thus, the resolution of

show abstract

Section: Applications and Empirical Experimentsmentioning

confidence: 99%

Section: Applications and Empirical Experimentsmentioning

confidence: 99%

A comprehensive survey on the quickest path problem

2006

Self Cite

View full text Add to dashboard Cite

show abstract

“…The second group of instances built with the USA road networks takes the arc delay and capacity from the empirical distributions proposed in [6], which are displayed in Tables 5 and 6. For this group, 10 instances have been generated for each problem.…”

Section: The Eqpa Performance Evaluationmentioning

confidence: 99%

“…The problem of finding the first K quickest paths in nondecreasing order of transmission time has been analyzed in [4,6,13,15,19]. The QPP constrained to contain a given subpath has been studied in [3,19].…”

Section: Introductionmentioning

confidence: 99%

“…Then it was proposed by Chen and Chin [5] in the context of modeling transmission problems in communication networks where nodes represent transmitters/receivers without data memories and arcs represent communication channels. Clímaco et al [6] applied the model to the routing of data packets in Internet networks. Hamacher and Tijandra [8] proposed the QPP for a special evacuation problem where evacuees may use only a single path or tunnel from their initial position.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Min‐Max quickest path problems

Ruzika

Thiemann

2012

Networks

View full text Add to dashboard Cite

In a dynamic network, the quickest path problem asks for a path such that a given amount of flow can be sent from source to sink via this path in minimal time. In practical settings, for example in evacuation or transportation planning, the problem parameters might not be known exactly a-priori. It is therefore of interest to consider robust versions of these problems in which travel times and/or capacities of arcs depend on a certain scenario. In this article, min-max versions of robust quickest path problems are investigated and, depending on their complexity status, exact algorithms or fully polynomial-time approximation schemes are proposed.

show abstract

Internet packet routing: Application of a K-quickest path algorithm

Cited by 64 publications

References 13 publications

A comprehensive survey on the quickest path problem

A comprehensive survey on the quickest path problem

The energy-constrained quickest path problem

Min‐Max quickest path problems

Contact Info

Product

Resources

About