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

DOI10.1016/J.EJOR.2006.03.013MaRDI QIDQ877587zbMATH OpenOpenAlexFDO

Authors Marta M. B. Pascoal, Joao Carlos Namorado Climaco, José F. Craveirinha, Maria Eugénia Captivo

Publication date 3 May 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.03.013

zbMATH Keywords

quickest pathtelecommunication networkssimple paths ranking

Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Communication networks in operations research (90B18) Analytic circuit theory (94C05) Network design and communication in computer systems (68M10)

Recommendations

• Finding the \(k\) quickest simple paths in a network
• Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
• On the quickest path problem
• An algorithm for ranking quickest simple paths
• A comprehensive survey on the quickest path problem

Cites work

• Algorithms for the quickest path problem and the enumeration of quickest paths
• An algorithm for ranking quickest simple paths
• An algorithm for the quickest path problem
• An efficient algorithm for K shortest simple paths
• Finding the \(k\) quickest simple paths in a network
• The quickest path problem

Cited in

(30)

• Packet Routing: Complexity and Algorithms
• Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget
• Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• Reliability evaluation of a multistate network subject to time constraint under routing policy
• The continuous maximum capacity path interdiction problem
• Solving the absolute 1-center problem in the quickest path case
• Estimated and accurate system reliabilities of a maintainable computer network subject to maintenance budget
• The energy-constrained quickest path problem
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• System reliability assessment through \(p\) minimal paths in stochastic case with backup-routing
• Describing and simulating internet routes
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
• System reliability for quickest path problems under time threshold and budget
• Spare reliability for capacitated computer networks under tolerable error rate and latency considerations
• Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
• Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
• Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• MIN-MAX quickest path problems
• Conveyor operations in distribution centers: modeling and optimization
• Time version of the shortest path problem in a stochastic-flow network
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case
• Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints
• A comprehensive survey on the quickest path problem
• On transmission time through \(k\) minimal paths of a capacitated-flow network
• Stochastic flow networks via multiple paths under time threshold and budget constraint
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
• Estimation of maintenance reliability for a cloud computing network

This page was built for publication: Internet packet routing: application of a \(K\)-quickest path algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877587)