Pages that link to "Item:Q877587"

The following pages link to Internet packet routing: application of a \(K\)-quickest path algorithm (Q877587):

Displaying 28 items.

• Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network (Q506140) (← links)
• Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks (Q534935) (← links)
• A method to evaluate routing policy through \(p\) minimal paths for stochastic case (Q621591) (← links)
• System reliability for quickest path problems under time threshold and budget (Q623173) (← links)
• Stochastic flow networks via multiple paths under time threshold and budget constraint (Q660929) (← links)
• On transmission time through \(k\) minimal paths of a capacitated-flow network (Q967798) (← links)
• Time version of the shortest path problem in a stochastic-flow network (Q1019780) (← links)
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
• The energy-constrained quickest path problem (Q1676484) (← links)
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks (Q1750473) (← links)
• Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks (Q1751923) (← links)
• The continuous maximum capacity path interdiction problem (Q2083925) (← links)
• Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
• Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints (Q2178318) (← links)
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem (Q2286869) (← links)
• Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget (Q2344678) (← links)
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints (Q2379538) (← links)
• A comprehensive survey on the quickest path problem (Q2379862) (← links)
• System Reliability Assessment through<i>p</i>Minimal Paths in Stochastic Case with Backup-routing (Q2815376) (← links)
• Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints (Q2852104) (← links)
• Reliability evaluation of a multistate network subject to time constraint under routing policy (Q2872616) (← links)
• Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations (Q2876110) (← links)
• ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET (Q2911992) (← links)
• (Q4999379) (← links)
• Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks (Q5220004) (← links)
• Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability (Q5252893) (← links)
• Min‐Max quickest path problems (Q5326774) (← links)
• Conveyor operations in distribution centers: modeling and optimization (Q6043121) (← links)