Multi-postpath-based lookahead multiconstraint QoS routing

DOI10.1016/J.JFRANKLIN.2012.01.002zbMATH Open1274.90009OpenAlexW2046531621MaRDI QIDQ378623FDOQ378623

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

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

Recommendations

• scientific article; zbMATH DE number 1955773
• Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure
• Efficient QoS routing.
• Loop-free constrained path computation for hop-by-hop QoS routing
• scientific article; zbMATH DE number 1969707

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Approximation Schemes for the Restricted Shortest Path Problem
• Algorithms for finding paths with multiple constraints
• On the complexity of quality of service routing
• 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
• Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Loop-free constrained path computation for hop-by-hop QoS routing
• To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN

Uses Software

• MPLMR

This page was built for publication: Multi-postpath-based lookahead multiconstraint QoS routing

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