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

DOI10.1016/j.ejor.2006.03.013zbMath1123.90009OpenAlexW2013849980MaRDI QIDQ877587

Marta M. B. Pascoal, José F. Craveirinha, Joao Carlos Namorado Climaco, 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

telecommunication networksquickest pathsimple paths ranking

Mathematics Subject Classification ID

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

Related Items (28)

Solving the absolute 1-center problem in the quickest path case ⋮ Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ A comprehensive survey on the quickest path problem ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Min‐Max quickest path problems ⋮ Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints ⋮ The energy-constrained quickest path problem ⋮ Conveyor operations in distribution centers: modeling and optimization ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Unnamed Item ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Dealing with residual energy when transmitting data in energy-constrained capacitated networks ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ The continuous maximum capacity path interdiction problem ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations

Cites Work

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

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