Multi-postpath-based lookahead multiconstraint QoS routing

DOI10.1016/j.jfranklin.2012.01.002zbMath1274.90009OpenAlexW2046531621MaRDI QIDQ378623

Edwin K. P. Chong, Howard Jay Siegel, Dong-won Shin

Publication date: 12 November 2013

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2012.01.002

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Uses Software

• MPLMR

Cites Work

• Unnamed Item
• On the complexity of quality of service routing
• Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure
• The shortest path problem with two objective functions
• Helping ants for adaptive network routing
• A flow and routing control policy for communication networks with multiple competitive users
• Multicast routing algorithm of multiple QoS based on widest-bandwidth
• Algorithms for finding paths with multiple constraints
• Approximation Schemes for the Restricted Shortest Path Problem