Internet packet routing: application of a K-quickest path algorithm
DOI10.1016/J.EJOR.2006.03.013zbMATH Open1123.90009OpenAlexW2013849980MaRDI QIDQ877587FDOQ877587
José F. Craveirinha, Joao Carlos Namorado Climaco, Marta M. B. Pascoal, 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
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)
Cites Work
Cited In (29)
- 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
- Min‐Max quickest path problems
- 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
- Title not available (Why is that?)
- System reliability for quickest path problems under time threshold and budget
- 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
- 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
- Conveyor operations in distribution centers: modeling and optimization
- Time version of the shortest path problem in a stochastic-flow network
- Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- A comprehensive survey on the quickest path problem
- On transmission time through \(k\) minimal paths of a capacitated-flow network
- Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- Stochastic flow networks via multiple paths under time threshold and budget constraint
Recommendations
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)
