Multiconstrained QoS Routing: A Norm Approach

DOI10.1109/TC.2007.1016MaRDI QIDQ4564180zbMATH OpenFDO

Authors Guoliang Xue, S. Kami Makki

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2007.1016

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1955773
• scientific article; zbMATH DE number 2112413
• Multi-constraint quality of service routing algorithm for dynamic topology networks
• A query-based multicast routing protocol with QoS constraints

Cited in

(6)

• Finding cheapest deadline paths
• scientific article; zbMATH DE number 1717140 (Why is no real title available?)
• Multi-constraint quality of service routing algorithm for dynamic topology networks
• On the Convexity of Feasible QoS Regions
• Near linear time \((1 + \epsilon)\)-approximation for restricted shortest paths in undirected graphs
• Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure

This page was built for publication: Multiconstrained QoS Routing: A Norm Approach

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